Removed extraneous prints

Author: nirvikbaruah

src/index_notation/index_notation.cpp

@@ -2366,7 +2366,6 @@ bool isConcreteNotation(IndexStmt stmt, std::string* reason) {
       for (auto& var : op->indexVars) {
         // non underived variables may appear in temporaries, but we don't check these
         if (!boundVars.contains(var) && provGraph.isUnderived(var) && (provGraph.isFullyDerived(var) || !provGraph.isRecoverable(var, definedVars))) {
-          // cout << "Variable: " << var << " Statement: " << stmt << endl;
           *reason = "all variables in concrete notation must be bound by a "
                     "forall statement";
           isConcrete = false;

src/index_notation/provenance_graph.cpp

@@ -1121,7 +1121,7 @@ bool ProvenanceGraph::isAvailable(IndexVar indexVar, std::set<IndexVar> defined)
 bool ProvenanceGraph::isRecoverable(taco::IndexVar indexVar, std::set<taco::IndexVar> defined) const {
   // all children are either defined or recoverable from their children
   // precompute relations are always recoverable since their children never appear in the same loop
-  if (!(childRelMap.at(indexVar).getRelType() == IndexVarRelType::PRECOMPUTE)) {
+  if (!(childRelMap.count(indexVar) && childRelMap.at(indexVar).getRelType() == IndexVarRelType::PRECOMPUTE)) {
     for (const IndexVar& child : getChildren(indexVar)) {
       if (!defined.count(child) && (isFullyDerived(child) || !isRecoverable(child, defined))) {
         return false;

src/lower/iterator.cpp

@@ -521,15 +521,12 @@ Iterators::Iterators(IndexStmt stmt, const map<TensorVar, Expr>& tensorVars)
 {
   ProvenanceGraph provGraph = ProvenanceGraph(stmt);
   set<IndexVar> underivedAdded;
-
   // Create dimension iterators
   match(stmt,
     function<void(const ForallNode*, Matcher*)>([&](auto n, auto m) {
       content->modeIterators.insert({n->indexVar, Iterator(n->indexVar, !provGraph.hasCoordBounds(n->indexVar) && provGraph.isCoordVariable(n->indexVar))});
-      cout << "Adding following index var to iterators: " << n->indexVar << " for statement (" << n->stmt << ")" << endl;
       for (const IndexVar& underived : provGraph.getUnderivedAncestors(n->indexVar)) {
         if (!underivedAdded.count(underived)) {
-          cout << "Adding following underived ancestor to iterators: " << underived << endl;
           content->modeIterators.insert({underived, underived});
           underivedAdded.insert(underived);
         }
@@ -565,8 +562,6 @@ Iterators::Iterators(IndexStmt stmt, const map<TensorVar, Expr>& tensorVars)
   for (auto& iterator : content->levelIterators) {
     content->modeAccesses.insert({iterator.second, iterator.first});
   }
-
-  // cout << "FINISHED ITERATORS BUILDING" << endl;
 }
 
 
@@ -676,8 +671,6 @@ ModeAccess Iterators::modeAccess(Iterator iterator) const
 Iterator Iterators::modeIterator(IndexVar indexVar) const
 {
   taco_iassert(content != nullptr);
-  cout << "Searching for " << indexVar << " in "
-      << util::join(content->modeIterators) << endl;
   taco_iassert(util::contains(content->modeIterators, indexVar));
   return content->modeIterators.at(indexVar);
 }

src/lower/merge_lattice.cpp

@@ -613,9 +613,7 @@ MergeLattice MergeLattice::make(Forall forall, Iterators iterators, ProvenanceGr
 
   vector<IndexVar> underivedAncestors = provGraph.getUnderivedAncestors(indexVar);
   for (auto ancestor : underivedAncestors) {
-    // cout << "Is recoverable from merge lattice: " << ancestor << endl;
     if(!provGraph.isRecoverable(ancestor, definedIndexVars)) {
-      // cout << "Is not recoverable for ancestor " << ancestor << endl;
       return MergeLattice({MergePoint({iterators.modeIterator(indexVar)}, {}, {})});
     }
   }

test/tests-scheduling.cpp

@@ -276,7 +276,7 @@ TEST(scheduling, lowerSparseMulSparse) {
   //  codegen->compile(compute, true);
 }
 
-TEST(scheduling, NIRVIK_TEST) {
+TEST(scheduling, precomputeIndependentIndexVars) {
   Tensor<double> A("A", {16}, Format{Dense});
   Tensor<double> B("B", {16}, Format{Dense});
   Tensor<double> C("C", {16}, Format{Dense});
@@ -312,7 +312,7 @@ TEST(scheduling, NIRVIK_TEST) {
   ASSERT_TENSOR_EQ(A, expected);
 }
 
-TEST(scheduling, FAILED_TEST) {
+TEST(scheduling, precomputeIndependentIndexVarsSplit) {
   Tensor<double> A("A", {16}, Format{Dense});
   Tensor<double> B("B", {16}, Format{Dense});
   Tensor<double> C("C", {16}, Format{Dense});
@@ -347,11 +347,6 @@ TEST(scheduling, FAILED_TEST) {
   expected.assemble();
   expected.compute();
 
-  ir::IRPrinter irp = ir::IRPrinter(cout);
-  ir::Stmt compute = lower(stmt, "compute", false, true);
-  cout << "Imperative IR" << endl;
-  irp.print(compute);
-
   ASSERT_TENSOR_EQ(A, expected);
 }