6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-12-13 04:30:23 +00:00
Code Issues Projects Releases Wiki Activity

Change errs() to dbgs().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92578 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Greene 2010-01-05 01:25:00 +00:00
parent 4b69d9909d
commit f10902981c
1 changed files with 21 additions and 21 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
lib/CodeGen/SelectionDAG/DAGCombiner.cpp
View File

@ -541,11 +541,11 @@ SDValue DAGCombiner::CombineTo(SDNode *N, const SDValue *To, unsigned NumTo,
bool AddTo) { bool AddTo) {
assert(N->getNumValues() == NumTo && "Broken CombineTo call!"); assert(N->getNumValues() == NumTo && "Broken CombineTo call!");
++NodesCombined; ++NodesCombined;
DEBUG(errs() << "\nReplacing.1 "; DEBUG(dbgs() << "\nReplacing.1 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
To[0].getNode()->dump(&DAG); To[0].getNode()->dump(&DAG);
errs() << " and " << NumTo-1 << " other values\n"; dbgs() << " and " << NumTo-1 << " other values\n";
for (unsigned i = 0, e = NumTo; i != e; ++i) for (unsigned i = 0, e = NumTo; i != e; ++i)
assert((!To[i].getNode() || assert((!To[i].getNode() ||
N->getValueType(i) == To[i].getValueType()) && N->getValueType(i) == To[i].getValueType()) &&
@ -619,11 +619,11 @@ bool DAGCombiner::SimplifyDemandedBits(SDValue Op, const APInt &Demanded) {
// Replace the old value with the new one. // Replace the old value with the new one.
++NodesCombined; ++NodesCombined;
DEBUG(errs() << "\nReplacing.2 "; DEBUG(dbgs() << "\nReplacing.2 ";
TLO.Old.getNode()->dump(&DAG); TLO.Old.getNode()->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
TLO.New.getNode()->dump(&DAG); TLO.New.getNode()->dump(&DAG);
errs() << '\n'); dbgs() << '\n');
CommitTargetLoweringOpt(TLO); CommitTargetLoweringOpt(TLO);
return true; return true;
@ -689,11 +689,11 @@ void DAGCombiner::Run(CombineLevel AtLevel) {
RV.getNode()->getOpcode() != ISD::DELETED_NODE && RV.getNode()->getOpcode() != ISD::DELETED_NODE &&
"Node was deleted but visit returned new node!"); "Node was deleted but visit returned new node!");
DEBUG(errs() << "\nReplacing.3 "; DEBUG(dbgs() << "\nReplacing.3 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
RV.getNode()->dump(&DAG); RV.getNode()->dump(&DAG);
errs() << '\n'); dbgs() << '\n');
WorkListRemover DeadNodes(*this); WorkListRemover DeadNodes(*this);
if (N->getNumValues() == RV.getNode()->getNumValues()) if (N->getNumValues() == RV.getNode()->getNumValues())
DAG.ReplaceAllUsesWith(N, RV.getNode(), &DeadNodes); DAG.ReplaceAllUsesWith(N, RV.getNode(), &DeadNodes);
@ -4692,11 +4692,11 @@ bool DAGCombiner::CombineToPreIndexedLoadStore(SDNode *N) {
BasePtr, Offset, AM); BasePtr, Offset, AM);
++PreIndexedNodes; ++PreIndexedNodes;
++NodesCombined; ++NodesCombined;
DEBUG(errs() << "\nReplacing.4 "; DEBUG(dbgs() << "\nReplacing.4 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
Result.getNode()->dump(&DAG); Result.getNode()->dump(&DAG);
errs() << '\n'); dbgs() << '\n');
WorkListRemover DeadNodes(*this); WorkListRemover DeadNodes(*this);
if (isLoad) { if (isLoad) {
DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0), DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0),
@ -4826,11 +4826,11 @@ bool DAGCombiner::CombineToPostIndexedLoadStore(SDNode *N) {
BasePtr, Offset, AM); BasePtr, Offset, AM);
++PostIndexedNodes; ++PostIndexedNodes;
++NodesCombined; ++NodesCombined;
DEBUG(errs() << "\nReplacing.5 "; DEBUG(dbgs() << "\nReplacing.5 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
Result.getNode()->dump(&DAG); Result.getNode()->dump(&DAG);
errs() << '\n'); dbgs() << '\n');
WorkListRemover DeadNodes(*this); WorkListRemover DeadNodes(*this);
if (isLoad) { if (isLoad) {
DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0), DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Result.getValue(0),
@ -4889,11 +4889,11 @@ SDValue DAGCombiner::visitLOAD(SDNode *N) {
// v3 = add v2, c // v3 = add v2, c
// Now we replace use of chain2 with chain1. This makes the second load // Now we replace use of chain2 with chain1. This makes the second load
// isomorphic to the one we are deleting, and thus makes this load live. // isomorphic to the one we are deleting, and thus makes this load live.
DEBUG(errs() << "\nReplacing.6 "; DEBUG(dbgs() << "\nReplacing.6 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith chain: "; dbgs() << "\nWith chain: ";
Chain.getNode()->dump(&DAG); Chain.getNode()->dump(&DAG);
errs() << "\n"); dbgs() << "\n");
WorkListRemover DeadNodes(*this); WorkListRemover DeadNodes(*this);
DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain, &DeadNodes); DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), Chain, &DeadNodes);
@ -4909,11 +4909,11 @@ SDValue DAGCombiner::visitLOAD(SDNode *N) {
assert(N->getValueType(2) == MVT::Other && "Malformed indexed loads?"); assert(N->getValueType(2) == MVT::Other && "Malformed indexed loads?");
if (N->hasNUsesOfValue(0, 0) && N->hasNUsesOfValue(0, 1)) { if (N->hasNUsesOfValue(0, 0) && N->hasNUsesOfValue(0, 1)) {
SDValue Undef = DAG.getUNDEF(N->getValueType(0)); SDValue Undef = DAG.getUNDEF(N->getValueType(0));
DEBUG(errs() << "\nReplacing.6 "; DEBUG(dbgs() << "\nReplacing.6 ";
N->dump(&DAG); N->dump(&DAG);
errs() << "\nWith: "; dbgs() << "\nWith: ";
Undef.getNode()->dump(&DAG); Undef.getNode()->dump(&DAG);
errs() << " and 2 other values\n"); dbgs() << " and 2 other values\n");
WorkListRemover DeadNodes(*this); WorkListRemover DeadNodes(*this);
DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Undef, &DeadNodes); DAG.ReplaceAllUsesOfValueWith(SDValue(N, 0), Undef, &DeadNodes);
DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1), DAG.ReplaceAllUsesOfValueWith(SDValue(N, 1),