RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-12-14 23:29:51 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix debug output to include a newline after printing a Value, now

Browse Source 
that Value's operator<< doesn't include one.

llvm-svn: 79240
This commit is contained in:
Dan Gohman 2009-08-17 15:25:05 +00:00
parent d0eda03882
commit e8847ebe10
3 changed files with 18 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
lib/Transforms/Scalar/IndVarSimplify.cpp
View File

@ -183,7 +183,7 @@ ICmpInst *IndVarSimplify::LinearFunctionTestReplace(Loop *L,
Opcode = ICmpInst::ICMP_EQ;
DOUT << "INDVARS: Rewriting loop exit condition to:\n"
<< " LHS:" << *CmpIndVar // includes a newline
<< " LHS:" << *CmpIndVar << '\n'
<< " op:\t"
<< (Opcode == ICmpInst::ICMP_NE ? "!=" : "==") << "\n"
<< " RHS:\t" << *RHS << "\n";
@ -273,7 +273,7 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L,
Value *ExitVal = Rewriter.expandCodeFor(ExitValue, PN->getType(), Inst);
DOUT << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal
DOUT << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal << '\n'
<< " LoopVal = " << *Inst << "\n";
PN->setIncomingValue(i, ExitVal);
@ -401,7 +401,7 @@ bool IndVarSimplify::runOnLoop(Loop *L, LPPassManager &LPM) {
++NumInserted;
Changed = true;
DOUT << "INDVARS: New CanIV: " << *IndVar;
DOUT << "INDVARS: New CanIV: " << *IndVar << '\n';
// Now that the official induction variable is established, reinsert
// the old canonical-looking variable after it so that the IR remains
@ -506,7 +506,7 @@ void IndVarSimplify::RewriteIVExpressions(Loop *L, const Type *LargestType,
NewVal->takeName(Op);
User->replaceUsesOfWith(Op, NewVal);
UI->setOperandValToReplace(NewVal);
DOUT << "INDVARS: Rewrote IV '" << *AR << "' " << *Op
DOUT << "INDVARS: Rewrote IV '" << *AR << "' " << *Op << '\n'
<< " into = " << *NewVal << "\n";
++NumRemoved;
Changed = true;

14
lib/Transforms/Scalar/Reassociate.cpp
View File

@ -222,7 +222,7 @@ void Reassociate::LinearizeExpr(BinaryOperator *I) {
isReassociableOp(RHS, I->getOpcode()) &&
"Not an expression that needs linearization?");
DOUT << "Linear" << *LHS << *RHS << *I;
DOUT << "Linear" << *LHS << '\n' << *RHS << '\n' << *I << '\n';
// Move the RHS instruction to live immediately before I, avoiding breaking
// dominator properties.
@ -235,7 +235,7 @@ void Reassociate::LinearizeExpr(BinaryOperator *I) {
++NumLinear;
MadeChange = true;
DOUT << "Linearized: " << *I;
DOUT << "Linearized: " << *I << '\n';
// If D is part of this expression tree, tail recurse.
if (isReassociableOp(I->getOperand(1), I->getOpcode()))
@ -334,10 +334,10 @@ void Reassociate::RewriteExprTree(BinaryOperator *I,
if (I->getOperand(0) != Ops[i].Op ||
I->getOperand(1) != Ops[i+1].Op) {
Value *OldLHS = I->getOperand(0);
DOUT << "RA: " << *I;
DOUT << "RA: " << *I << '\n';
I->setOperand(0, Ops[i].Op);
I->setOperand(1, Ops[i+1].Op);
DOUT << "TO: " << *I;
DOUT << "TO: " << *I << '\n';
MadeChange = true;
++NumChanged;
@ -350,9 +350,9 @@ void Reassociate::RewriteExprTree(BinaryOperator *I,
assert(i+2 < Ops.size() && "Ops index out of range!");
if (I->getOperand(1) != Ops[i].Op) {
DOUT << "RA: " << *I;
DOUT << "RA: " << *I << '\n';
I->setOperand(1, Ops[i].Op);
DOUT << "TO: " << *I;
DOUT << "TO: " << *I << '\n';
MadeChange = true;
++NumChanged;
}
@ -450,7 +450,7 @@ static Instruction *BreakUpSubtract(LLVMContext &Context, Instruction *Sub,
Sub->replaceAllUsesWith(New);
Sub->eraseFromParent();
DOUT << "Negated: " << *New;
DOUT << "Negated: " << *New << '\n';
return New;
}

14
lib/Transforms/Scalar/SCCP.cpp
View File

@ -262,14 +262,14 @@ private:
//
inline void markConstant(LatticeVal &IV, Value *V, Constant *C) {
if (IV.markConstant(C)) {
DEBUG(errs() << "markConstant: " << *C << ": " << *V);
DEBUG(errs() << "markConstant: " << *C << ": " << *V << '\n');
InstWorkList.push_back(V);
}
}
inline void markForcedConstant(LatticeVal &IV, Value *V, Constant *C) {
IV.markForcedConstant(C);
DEBUG(errs() << "markForcedConstant: " << *C << ": " << *V);
DEBUG(errs() << "markForcedConstant: " << *C << ": " << *V << '\n');
InstWorkList.push_back(V);
}
@ -286,7 +286,7 @@ private:
if (Function *F = dyn_cast<Function>(V))
errs() << "Function '" << F->getName() << "'\n";
else
errs() << *V);
errs() << *V << '\n');
// Only instructions go on the work list
OverdefinedInstWorkList.push_back(V);
}
@ -516,7 +516,7 @@ bool SCCPSolver::isEdgeFeasible(BasicBlock *From, BasicBlock *To) {
return false;
} else {
#ifndef NDEBUG
cerr << "Unknown terminator instruction: " << *TI;
cerr << "Unknown terminator instruction: " << *TI << '\n';
#endif
llvm_unreachable(0);
}
@ -1278,7 +1278,7 @@ void SCCPSolver::Solve() {
Value *I = OverdefinedInstWorkList.back();
OverdefinedInstWorkList.pop_back();
DEBUG(errs() << "\nPopped off OI-WL: " << *I);
DEBUG(errs() << "\nPopped off OI-WL: " << *I << '\n');
// "I" got into the work list because it either made the transition from
// bottom to constant
@ -1296,7 +1296,7 @@ void SCCPSolver::Solve() {
Value *I = InstWorkList.back();
InstWorkList.pop_back();
DEBUG(errs() << "\nPopped off I-WL: " << *I);
DEBUG(errs() << "\nPopped off I-WL: " << *I << '\n');
// "I" got into the work list because it either made the transition from
// bottom to constant
@ -1316,7 +1316,7 @@ void SCCPSolver::Solve() {
BasicBlock *BB = BBWorkList.back();
BBWorkList.pop_back();
DEBUG(errs() << "\nPopped off BBWL: " << *BB);
DEBUG(errs() << "\nPopped off BBWL: " << *BB << '\n');
// Notify all instructions in this basic block that they are newly
// executable.