Home
last modified time | relevance | path

Searched refs:edgeCosts (Results 1 – 3 of 3) sorted by relevance

/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
DHeuristicSolver.h507 Matrix &edgeCosts = g.getEdgeCosts(eItr); in tryNormaliseEdgeMatrix() local
511 for (unsigned r = 0; r < edgeCosts.getRows(); ++r) { in tryNormaliseEdgeMatrix()
514 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()
515 if (vCosts[c] != infinity && edgeCosts[r][c] < rowMin) in tryNormaliseEdgeMatrix()
516 rowMin = edgeCosts[r][c]; in tryNormaliseEdgeMatrix()
522 edgeCosts.subFromRow(r, rowMin); in tryNormaliseEdgeMatrix()
525 edgeCosts.setRow(r, 0); in tryNormaliseEdgeMatrix()
529 for (unsigned c = 0; c < edgeCosts.getCols(); ++c) { in tryNormaliseEdgeMatrix()
532 for (unsigned r = 0; r < edgeCosts.getRows(); ++r) { in tryNormaliseEdgeMatrix()
533 if (uCosts[r] != infinity && edgeCosts[r][c] < colMin) in tryNormaliseEdgeMatrix()
[all …]
DGraph.h376 const Matrix &edgeCosts = getEdgeCosts(edgeItr); in printDot() local
378 for (unsigned i = 0; i < edgeCosts.getRows(); ++i) { in printDot()
379 os << edgeCosts.getRowAsVector(i) << "\\n"; in printDot()
/external/llvm/include/llvm/CodeGen/PBQP/
DReductionRules.h202 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
205 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
208 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()