diff options
author | Chris Lattner <sabre@nondot.org> | 2004-04-02 20:26:46 +0000 |
---|---|---|
committer | Chris Lattner <sabre@nondot.org> | 2004-04-02 20:26:46 +0000 |
commit | d18d9dcd2866ef91ee42daf68e32b638e7825211 (patch) | |
tree | 1663dd510995a640fe9126357fb5c572248786c3 /lib/Analysis | |
parent | 788aed91464c774fdc822520190be3b7761761f0 (diff) | |
download | external_llvm-d18d9dcd2866ef91ee42daf68e32b638e7825211.zip external_llvm-d18d9dcd2866ef91ee42daf68e32b638e7825211.tar.gz external_llvm-d18d9dcd2866ef91ee42daf68e32b638e7825211.tar.bz2 |
Comment out debugging printouts
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@12623 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Analysis')
-rw-r--r-- | lib/Analysis/ScalarEvolution.cpp | 6 |
1 files changed, 5 insertions, 1 deletions
diff --git a/lib/Analysis/ScalarEvolution.cpp b/lib/Analysis/ScalarEvolution.cpp index ab0ed4b..b35e2c4 100644 --- a/lib/Analysis/ScalarEvolution.cpp +++ b/lib/Analysis/ScalarEvolution.cpp @@ -1493,7 +1493,7 @@ Value *SCEVAddRecExpr::expandCodeFor(ScalarEvolutionRewriter &SER, SCEVHandle IH = SCEVUnknown::get(I); // Get I as a "symbolic" SCEV. SCEVHandle V = evaluateAtIteration(IH); - std::cerr << "Evaluated: " << *this << "\n to: " << *V << "\n"; + //std::cerr << "Evaluated: " << *this << "\n to: " << *V << "\n"; return SER.ExpandCodeFor(V, InsertPt, Ty); } @@ -1916,11 +1916,13 @@ SCEVHandle ScalarEvolutionsImpl::ComputeIterationCount(const Loop *L) { return HowFarToNonZero(getMinusSCEV(LHS, RHS), L); break; default: +#if 0 std::cerr << "ComputeIterationCount "; if (ExitCond->getOperand(0)->getType()->isUnsigned()) std::cerr << "[unsigned] "; std::cerr << *LHS << " " << Instruction::getOpcodeName(Cond) << " " << *RHS << "\n"; +#endif } return UnknownValue; } @@ -2118,8 +2120,10 @@ SCEVHandle ScalarEvolutionsImpl::HowFarToZero(SCEV *V, const Loop *L) { SCEVConstant *R1 = dyn_cast<SCEVConstant>(Roots.first); SCEVConstant *R2 = dyn_cast<SCEVConstant>(Roots.second); if (R1) { +#if 0 std::cerr << "HFTZ: " << *V << " - sol#1: " << *R1 << " sol#2: " << *R2 << "\n"; +#endif // Pick the smallest positive root value. assert(R1->getType()->isUnsigned()&&"Didn't canonicalize to unsigned?"); if (ConstantBool *CB = |