HomeSort by relevance Sort by last modified time
    Searched refs:getNodeCosts (Results 1 - 4 of 4) sorted by null

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 178 assert(getNodeCosts(n1Itr).getLength() == costs.getRows() &&
179 getNodeCosts(n2Itr).getLength() == costs.getCols() &&
195 Vector& getNodeCosts(NodeItr nItr) { return getNode(nItr).getCosts(); }
200 const Vector& getNodeCosts(ConstNodeItr nItr) const {
364 << nodeItr << ": " << getNodeCosts(nodeItr) << "\" ]\n";
417 nodeMap[nItr] = addNode(other.getNodeCosts(nItr));
HeuristicSolver.h 245 const Vector &xCosts = g.getNodeCosts(xnItr);
250 Vector &yCosts = g.getNodeCosts(ynItr);
263 Vector &yCosts = g.getNodeCosts(ynItr);
291 const Vector &xCosts = g.getNodeCosts(xnItr);
444 if (g.getNodeCosts(nItr).getLength() == 1) {
456 g.getNodeCosts(otherNodeItr) +=
461 g.getNodeCosts(otherNodeItr) +=
508 Vector &uCosts = g.getNodeCosts(g.getEdgeNode1(eItr)),
509 &vCosts = g.getNodeCosts(g.getEdgeNode2(eItr));
561 Vector v(g.getNodeCosts(nItr))
    [all...]
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 65 const PBQP::Vector &cv1 = g->getNodeCosts(n1Itr);
66 const PBQP::Vector &cv2 = g->getNodeCosts(n2Itr);
362 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
389 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
408 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
418 unsigned numRegs = getGraph().getNodeCosts(nItr).getLength() - 1;
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 282 addSpillCosts(g.getNodeCosts(node), spillCost);
392 addPhysRegCoalesce(g.getNodeCosts(node), pregOpt, cBenefit);

Completed in 527 milliseconds