Searched refs:getEdgeCosts (Results 1 - 4 of 4) sorted by relevance

/external/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h244 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(eIt
[all...]
H A DGraph.h219 Matrix& getEdgeCosts(EdgeItr eItr) { return getEdge(eItr).getCosts(); } function in class:PBQP::Graph
224 const Matrix& getEdgeCosts(ConstEdgeItr eItr) const { function in class:PBQP::Graph
375 const Matrix& m = getEdgeCosts(edgeItr);
413 const Matrix &edgeCosts = getEdgeCosts(edgeItr);
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp283 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
391 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,
/external/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h314 Matrix &eCosts = getGraph().getEdgeCosts(eItr);

Completed in 722 milliseconds