RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-20 19:42:54 +02:00
Code Issues Projects Releases Wiki Activity

Comment out debugging printouts

Browse Source 
llvm-svn: 12623
This commit is contained in:
Chris Lattner 2004-04-02 20:26:46 +00:00
parent aee1b0ba23
commit 0a34ab8221
1 changed files with 5 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
lib/Analysis/ScalarEvolution.cpp
View File

@ -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 =