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

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

Completed in 339 milliseconds