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

  /external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 43 const Vector &XCosts = G.getNodeCosts(NId);
49 PBQPNum Min = ECosts[0][j] + XCosts[0];
50 for (unsigned i = 1; i < XCosts.getLength(); ++i) {
51 PBQPNum C = ECosts[i][j] + XCosts[i];
59 PBQPNum Min = ECosts[i][0] + XCosts[0];
60 for (unsigned j = 1; j < XCosts.getLength(); ++j) {
61 PBQPNum C = ECosts[i][j] + XCosts[j];
83 const Vector &XCosts = G.getNodeCosts(NId);
103 unsigned XLen = XCosts.getLength(),
111 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 45 const Vector &XCosts = G.getNodeCosts(NId);
51 PBQPNum Min = ECosts[0][j] + XCosts[0];
52 for (unsigned i = 1; i < XCosts.getLength(); ++i) {
53 PBQPNum C = ECosts[i][j] + XCosts[i];
61 PBQPNum Min = ECosts[i][0] + XCosts[0];
62 for (unsigned j = 1; j < XCosts.getLength(); ++j) {
63 PBQPNum C = ECosts[i][j] + XCosts[j];
85 const Vector &XCosts = G.getNodeCosts(NId);
105 unsigned XLen = XCosts.getLength(),
113 PBQPNum Min = (*YXECosts)[i][0] + (*ZXECosts)[j][0] + XCosts[0]
    [all...]

Completed in 143 milliseconds