Home
last modified time | relevance | path

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

/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h245 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR1()
250 Vector &yCosts = g.getNodeCosts(ynItr); in applyR1()
263 Vector &yCosts = g.getNodeCosts(ynItr); in applyR1()
291 const Vector &xCosts = g.getNodeCosts(xnItr); in applyR2()
444 if (g.getNodeCosts(nItr).getLength() == 1) { in disconnectTrivialNodes()
456 g.getNodeCosts(otherNodeItr) += in disconnectTrivialNodes()
461 g.getNodeCosts(otherNodeItr) += in disconnectTrivialNodes()
508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr)), in tryNormaliseEdgeMatrix()
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr)); in tryNormaliseEdgeMatrix()
561 Vector v(g.getNodeCosts(nItr)); in computeSolution()
DGraph.h178 assert(getNodeCosts(n1Itr).getLength() == costs.getRows() && in addEdge()
179 getNodeCosts(n2Itr).getLength() == costs.getCols() && in addEdge()
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); } in getNodeCosts() function
200 const Vector& getNodeCosts(ConstNodeItr nItr) const { in getNodeCosts() function
364 << nodeItr << ": " << getNodeCosts(nodeItr) << "\" ]\n"; in printDot()
417 nodeMap[nItr] = addNode(other.getNodeCosts(nItr)); in copyFrom()
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/
DBriggs.h65 const PBQP::Vector &cv1 = g->getNodeCosts(n1Itr); in operator()
66 const PBQP::Vector &cv2 = g->getNodeCosts(n2Itr); in operator()
362 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in addEdgeContributions()
389 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in subtractEdgeContributions()
408 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in updateAllocability()
418 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1; in initializeNode()
/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.h417 assert(getNodeCosts(N1Id).getLength() == Costs.getRows() && in addEdge()
418 getNodeCosts(N2Id).getLength() == Costs.getCols() && in addEdge()
443 assert(getNodeCosts(N1Id).getLength() == Costs->getRows() && in addEdgeBypassingCostAllocator()
444 getNodeCosts(N2Id).getLength() == Costs->getCols() && in addEdgeBypassingCostAllocator()
495 const Vector& getNodeCosts(NodeId NId) const { in getNodeCosts() function
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h360 assert(G.getNodeCosts(NId).getLength() > 1 && in handleAddNode()
362 G.getNodeMetadata(NId).setup(G.getNodeCosts(NId)); in handleAddNode()
548 PBQPNum N1SC = G.getNodeCosts(N1Id)[0]; in operator()
549 PBQPNum N2SC = G.getNodeCosts(N2Id)[0]; in operator()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp177 PBQPRAGraph::RawVector NodeCosts(G.getNodeCosts(NId)); in apply()
446 PBQPRAGraph::RawVector NewCosts(G.getNodeCosts(NId)); in apply()
842 const Vector &Costs = getNodeCosts(NId); in dump()
868 << getNodeCosts(NId) << "\" ]\n"; in printDot()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
DRegAllocPBQP.cpp282 addSpillCosts(g.getNodeCosts(node), spillCost); in build()
392 addPhysRegCoalesce(g.getNodeCosts(node), pregOpt, cBenefit); in build()