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

  /external/llvm/include/llvm/CodeGen/PBQP/
HeuristicSolver.h 244 const Matrix &eCosts = g.getEdgeCosts(eItr);
304 new Matrix(g.getEdgeCosts(yxeItr).transpose()) :
305 &g.getEdgeCosts(yxeItr);
308 new Matrix(g.getEdgeCosts(zxeItr).transpose()) :
309 &g.getEdgeCosts(zxeItr);
343 Matrix &yzeCosts = g.getEdgeCosts(yzeItr);
457 g.getEdgeCosts(eItr).getRowAsVector(0);
462 g.getEdgeCosts(eItr).getColAsVector(0);
507 Matrix &edgeCosts = g.getEdgeCosts(eItr);
569 Matrix &edgeCosts = g.getEdgeCosts(eItr)
    [all...]
Graph.h 219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); }
224 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const {
375 const Matrix& m = getEdgeCosts(edgeItr);
413 const Matrix &edgeCosts = getEdgeCosts(edgeItr);
  /external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
Briggs.h 314 Matrix &eCosts = getGraph().getEdgeCosts(eItr);
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 338 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
446 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,

Completed in 221 milliseconds