mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-13 04:30:23 +00:00
Change errs() to dbgs().
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92577 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
e492ae13ed
commit
4b69d9909d
@ -1745,7 +1745,7 @@ bool SelectionDAGBuilder::handleJTSwitchCase(CaseRec& CR,
|
|||||||
if (Density < 0.4)
|
if (Density < 0.4)
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
DEBUG(errs() << "Lowering jump table\n"
|
DEBUG(dbgs() << "Lowering jump table\n"
|
||||||
<< "First entry: " << First << ". Last entry: " << Last << '\n'
|
<< "First entry: " << First << ". Last entry: " << Last << '\n'
|
||||||
<< "Range: " << Range
|
<< "Range: " << Range
|
||||||
<< "Size: " << TSize << ". Density: " << Density << "\n\n");
|
<< "Size: " << TSize << ". Density: " << Density << "\n\n");
|
||||||
@ -1849,7 +1849,7 @@ bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
|
|||||||
|
|
||||||
APInt LSize = FrontCase.size();
|
APInt LSize = FrontCase.size();
|
||||||
APInt RSize = TSize-LSize;
|
APInt RSize = TSize-LSize;
|
||||||
DEBUG(errs() << "Selecting best pivot: \n"
|
DEBUG(dbgs() << "Selecting best pivot: \n"
|
||||||
<< "First: " << First << ", Last: " << Last <<'\n'
|
<< "First: " << First << ", Last: " << Last <<'\n'
|
||||||
<< "LSize: " << LSize << ", RSize: " << RSize << '\n');
|
<< "LSize: " << LSize << ", RSize: " << RSize << '\n');
|
||||||
for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
|
for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second;
|
||||||
@ -1865,7 +1865,7 @@ bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
|
|||||||
(Last - RBegin + 1ULL).roundToDouble();
|
(Last - RBegin + 1ULL).roundToDouble();
|
||||||
double Metric = Range.logBase2()*(LDensity+RDensity);
|
double Metric = Range.logBase2()*(LDensity+RDensity);
|
||||||
// Should always split in some non-trivial place
|
// Should always split in some non-trivial place
|
||||||
DEBUG(errs() <<"=>Step\n"
|
DEBUG(dbgs() <<"=>Step\n"
|
||||||
<< "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
|
<< "LEnd: " << LEnd << ", RBegin: " << RBegin << '\n'
|
||||||
<< "LDensity: " << LDensity
|
<< "LDensity: " << LDensity
|
||||||
<< ", RDensity: " << RDensity << '\n'
|
<< ", RDensity: " << RDensity << '\n'
|
||||||
@ -1873,7 +1873,7 @@ bool SelectionDAGBuilder::handleBTSplitSwitchCase(CaseRec& CR,
|
|||||||
if (FMetric < Metric) {
|
if (FMetric < Metric) {
|
||||||
Pivot = J;
|
Pivot = J;
|
||||||
FMetric = Metric;
|
FMetric = Metric;
|
||||||
DEBUG(errs() << "Current metric set to: " << FMetric << '\n');
|
DEBUG(dbgs() << "Current metric set to: " << FMetric << '\n');
|
||||||
}
|
}
|
||||||
|
|
||||||
LSize += J->size();
|
LSize += J->size();
|
||||||
@ -1977,7 +1977,7 @@ bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
|
|||||||
// Don't bother the code below, if there are too much unique destinations
|
// Don't bother the code below, if there are too much unique destinations
|
||||||
return false;
|
return false;
|
||||||
}
|
}
|
||||||
DEBUG(errs() << "Total number of unique destinations: "
|
DEBUG(dbgs() << "Total number of unique destinations: "
|
||||||
<< Dests.size() << '\n'
|
<< Dests.size() << '\n'
|
||||||
<< "Total number of comparisons: " << numCmps << '\n');
|
<< "Total number of comparisons: " << numCmps << '\n');
|
||||||
|
|
||||||
@ -1986,7 +1986,7 @@ bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
|
|||||||
const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
|
const APInt& maxValue = cast<ConstantInt>(BackCase.High)->getValue();
|
||||||
APInt cmpRange = maxValue - minValue;
|
APInt cmpRange = maxValue - minValue;
|
||||||
|
|
||||||
DEBUG(errs() << "Compare range: " << cmpRange << '\n'
|
DEBUG(dbgs() << "Compare range: " << cmpRange << '\n'
|
||||||
<< "Low bound: " << minValue << '\n'
|
<< "Low bound: " << minValue << '\n'
|
||||||
<< "High bound: " << maxValue << '\n');
|
<< "High bound: " << maxValue << '\n');
|
||||||
|
|
||||||
@ -1996,7 +1996,7 @@ bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
|
|||||||
!(Dests.size() >= 3 && numCmps >= 6)))
|
!(Dests.size() >= 3 && numCmps >= 6)))
|
||||||
return false;
|
return false;
|
||||||
|
|
||||||
DEBUG(errs() << "Emitting bit tests\n");
|
DEBUG(dbgs() << "Emitting bit tests\n");
|
||||||
APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
|
APInt lowBound = APInt::getNullValue(cmpRange.getBitWidth());
|
||||||
|
|
||||||
// Optimize the case where all the case values fit in a
|
// Optimize the case where all the case values fit in a
|
||||||
@ -2046,9 +2046,9 @@ bool SelectionDAGBuilder::handleBitTestsSwitchCase(CaseRec& CR,
|
|||||||
|
|
||||||
const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
|
const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock();
|
||||||
|
|
||||||
DEBUG(errs() << "Cases:\n");
|
DEBUG(dbgs() << "Cases:\n");
|
||||||
for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
|
for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) {
|
||||||
DEBUG(errs() << "Mask: " << CasesBits[i].Mask
|
DEBUG(dbgs() << "Mask: " << CasesBits[i].Mask
|
||||||
<< ", Bits: " << CasesBits[i].Bits
|
<< ", Bits: " << CasesBits[i].Bits
|
||||||
<< ", BB: " << CasesBits[i].BB << '\n');
|
<< ", BB: " << CasesBits[i].BB << '\n');
|
||||||
|
|
||||||
@ -2147,7 +2147,7 @@ void SelectionDAGBuilder::visitSwitch(SwitchInst &SI) {
|
|||||||
// create a binary search tree from them.
|
// create a binary search tree from them.
|
||||||
CaseVector Cases;
|
CaseVector Cases;
|
||||||
size_t numCmps = Clusterify(Cases, SI);
|
size_t numCmps = Clusterify(Cases, SI);
|
||||||
DEBUG(errs() << "Clusterify finished. Total clusters: " << Cases.size()
|
DEBUG(dbgs() << "Clusterify finished. Total clusters: " << Cases.size()
|
||||||
<< ". Total compares: " << numCmps << '\n');
|
<< ". Total compares: " << numCmps << '\n');
|
||||||
numCmps = 0;
|
numCmps = 0;
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user