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

/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/PBQP/
H A DHeuristicSolver.h244 const Matrix &eCosts = g.getEdgeCosts(eId);
304 new Matrix(g.getEdgeCosts(yxeId).transpose()) :
305 &g.getEdgeCosts(yxeId);
308 new Matrix(g.getEdgeCosts(zxeId).transpose()) :
309 &g.getEdgeCosts(zxeId);
343 Matrix &yzeCosts = g.getEdgeCosts(yzeId);
459 g.getEdgeCosts(eId).getRowAsVector(0);
464 g.getEdgeCosts(eId).getColAsVector(0);
509 Matrix &edgeCosts = g.getEdgeCosts(eId);
571 Matrix &edgeCosts = g.getEdgeCosts(eI
[all...]
H A DGraph.h263 Matrix& getEdgeCosts(EdgeId eId) { return getEdge(eId).getCosts(); } function in class:PBQP::Graph
268 const Matrix& getEdgeCosts(EdgeId eId) const { function in class:PBQP::Graph
415 const Matrix& m = getEdgeCosts(*edgeItr);
453 const Matrix &edgeCosts = getEdgeCosts(*edgeItr);
/freebsd-10.1-release/contrib/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp279 addInterferenceCosts(g.getEdgeCosts(edge), vr1Allowed, vr2Allowed, tri);
386 addVirtRegCoalesce(g.getEdgeCosts(edge), *allowed1, *allowed2,
/freebsd-10.1-release/contrib/llvm/include/llvm/CodeGen/PBQP/Heuristics/
H A DBriggs.h313 Matrix &eCosts = getGraph().getEdgeCosts(eId);

Completed in 162 milliseconds