Home
last modified time | relevance | path

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

/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h43 const Vector &XCosts = G.getNodeCosts(NId); in applyR1()
44 RawVector YCosts = G.getNodeCosts(MId); in applyR1()
83 const Vector &XCosts = G.getNodeCosts(NId); in applyR2()
190 RawVector v = G.getNodeCosts(NId); in backpropagate()
DGraph.h416 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
417 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
442 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
443 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
494 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h359 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
361 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
547 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; in operator()
548 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp169 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
438 PBQPRAGraph::RawVector NewCosts(G.getNodeCosts(NId)); in apply()
838 const Vector &Costs = getNodeCosts(NId); in dump()
864 << getNodeCosts(NId) << "\" ]\n"; in printDot()