Cleanup llvm

Author: wsmoses

llvm/lib/Analysis/ScalarEvolution.cpp

@@ -7019,11 +7019,6 @@ ScalarEvolution::computeBackedgeTakenCount(const Loop *L,
   for (unsigned i = 0, e = ExitingBlocks.size(); i != e; ++i) {
     BasicBlock *ExitBB = ExitingBlocks[i];
     ExitLimit EL = computeExitLimit(L, ExitBB, AllowPredicates);
-    llvm::errs() << "exit limit for " << ExitBB->getName() << " is ";
-    if (EL.ExactNotTaken) llvm::errs() << *EL.ExactNotTaken;
-    llvm::errs() << " max";
-    if (EL.MaxNotTaken) llvm::errs() << *EL.MaxNotTaken;
-    llvm::errs() << "\n";
 
     assert((AllowPredicates || EL.Predicates.empty()) &&
            "Predicated exit limit when predicates are not allowed!");
@@ -7298,7 +7293,6 @@ ScalarEvolution::computeExitLimitFromICmp(const Loop *L,
                                           bool ExitIfTrue,
                                           bool ControlsExit,
                                           bool AllowPredicates) {
-    llvm::errs() << " exit limit form icmp\n";
   // If the condition was exit on true, convert the condition to exit on false
   ICmpInst::Predicate Pred;
   if (!ExitIfTrue)
@@ -7350,22 +7344,19 @@ ScalarEvolution::computeExitLimitFromICmp(const Loop *L,
   switch (Pred) {
   case ICmpInst::ICMP_NE: {                     // while (X != Y)
     // Convert to: while (X-Y != 0)
-    llvm::errs() << " considering ne than\n";
     ExitLimit EL = howFarToZero(getMinusSCEV(LHS, RHS), L, ControlsExit,
                                 AllowPredicates);
     if (EL.hasAnyInfo()) return EL;
     break;
   }
   case ICmpInst::ICMP_EQ: {                     // while (X == Y)
-    llvm::errs() << " considering eq than\n";
     // Convert to: while (X-Y == 0)
     ExitLimit EL = howFarToNonZero(getMinusSCEV(LHS, RHS), L);
     if (EL.hasAnyInfo()) return EL;
     break;
   }
   case ICmpInst::ICMP_SLT:
   case ICmpInst::ICMP_ULT: {                    // while (X < Y)
-    llvm::errs() << " considering greater less than\n";
     bool IsSigned = Pred == ICmpInst::ICMP_SLT;
     ExitLimit EL = howManyLessThans(LHS, RHS, L, IsSigned, ControlsExit,
                                     AllowPredicates);
@@ -7374,24 +7365,14 @@ ScalarEvolution::computeExitLimitFromICmp(const Loop *L,
   }
   case ICmpInst::ICMP_SGT:
   case ICmpInst::ICMP_UGT: {                    // while (X > Y)
-    llvm::errs() << " considering greater than\n";
     bool IsSigned = Pred == ICmpInst::ICMP_SGT;
     ExitLimit EL =
         howManyGreaterThans(LHS, RHS, L, IsSigned, ControlsExit,
                             AllowPredicates);
     if (EL.hasAnyInfo()) return EL;
     break;
   }
-  case ICmpInst::ICMP_SGE:
-  case ICmpInst::ICMP_UGE:
-    llvm::errs() << " considering greater equal than\n";
-    break;
-  case ICmpInst::ICMP_SLE:
-  case ICmpInst::ICMP_ULE:
-    llvm::errs() << " considering less equal than\n";
-    break;
   default:
-    llvm::errs() << " considering other than\n";
     break;
   }
 

llvm/lib/Transforms/Scalar/IndVarSimplify.cpp

@@ -2436,8 +2436,6 @@ bool IndVarSimplify::run(Loop *L) {
     return false;
   }
 
-  llvm::errs() << "running on loop " << *L << "\n";
-
   // If there are any floating-point recurrences, attempt to
   // transform them to use integer recurrences.
   rewriteNonIntegerIVs(L);
@@ -2581,7 +2579,6 @@ struct IndVarSimplifyLegacyPass : public LoopPass {
     const DataLayout &DL = L->getHeader()->getModule()->getDataLayout();
 
     IndVarSimplify IVS(LI, SE, DT, DL, TLI, TTI);
-    llvm::errs() << " casual run on " << *L << "\n";
     return IVS.run(L);
   }