diff options
Diffstat (limited to 'src/transformations/loop.cc')
| -rw-r--r-- | src/transformations/loop.cc | 15 |
1 files changed, 1 insertions, 14 deletions
diff --git a/src/transformations/loop.cc b/src/transformations/loop.cc index 409ece9..802cc98 100644 --- a/src/transformations/loop.cc +++ b/src/transformations/loop.cc @@ -1706,8 +1706,6 @@ std::vector<std::set<int> > Loop::typed_fusion(Graph<std::set<int>, bool> g, void Loop::setLexicalOrder(int dim, const std::set<int> &active, int starting_order, std::vector<std::vector<std::string> > idxNames) { - fprintf(stderr, "Loop::setLexicalOrder() %d idxNames active size %d starting_order %d\n", idxNames.size(), - active.size(), starting_order); if (active.size() == 0) return; @@ -1871,7 +1869,6 @@ void Loop::setLexicalOrder(int dim, const std::set<int> &active, assign_const(stmt[cur_stmt].xform, j, 0); order++; } else { // recurse ! - fprintf(stderr, "Loop:setLexicalOrder() recursing\n"); setLexicalOrder(dim, cur_scc, order, idxNames); order += sz; } @@ -1957,11 +1954,8 @@ void Loop::setLexicalOrder(int dim, const std::set<int> &active, stmt[*it].xform.simplify(); } - if ((dim + 2) <= (stmt[ref_stmt_num].xform.n_out() - 1)) { // recurse ! - fprintf(stderr, "Loop:setLexicalOrder() recursing\n"); + if ((dim + 2) <= (stmt[ref_stmt_num].xform.n_out() - 1)) setLexicalOrder(dim + 2, s[i], order, idxNames); - } - order++; } //} @@ -2090,13 +2084,6 @@ void Loop::setLexicalOrder(int dim, const std::set<int> &active, */ } - fprintf(stderr, "LEAVING Loop::setLexicalOrder() %d idxNames\n", idxNames.size()); - for (int i = 0; i < idxNames.size(); i++) { - std::vector<std::string> what = idxNames[i]; - for (int j = 0; j < what.size(); j++) { - fprintf(stderr, "%2d %2d %s\n", i, j, what[j].c_str()); - } - } } |