6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2026-04-21 08:17:40 +00:00
Code Issues Projects Releases Wiki Activity

remove some DOUTs

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@79821 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner
2009-08-23 04:44:11 +00:00
parent 05e9d99767
commit 569f121f4e
7 changed files with 55 additions and 54 deletions
Download Patch File Download Diff File Expand all files Collapse all files
utils/TableGen/CodeGenDAGPatterns.cpp
+15 -15
View File
@@ -135,14 +135,14 @@ void FindDepVars(TreePatternNode *N, MultipleUseVarSet &DepVars) {
//! Dump the dependent variable set:
void DumpDepVars(MultipleUseVarSet &DepVars) {
if (DepVars.empty()) {
DOUT << "<empty set>";
DEBUG(errs() << "<empty set>");
} else {
DOUT << "[ ";
DEBUG(errs() << "[ ");
for (MultipleUseVarSet::const_iterator i = DepVars.begin(), e = DepVars.end();
i != e; ++i) {
DOUT << (*i) << " ";
DEBUG(errs() << (*i) << " ");
}
DOUT << "]";
DEBUG(errs() << "]");
}
}
}
@@ -2381,7 +2381,7 @@ static void GenerateVariantsOf(TreePatternNode *N,
// GenerateVariants - Generate variants. For example, commutative patterns can
// match multiple ways. Add them to PatternsToMatch as well.
void CodeGenDAGPatterns::GenerateVariants() {
DOUT << "Generating instruction variants.\n";
DEBUG(errs() << "Generating instruction variants.\n");
// Loop over all of the patterns we've collected, checking to see if we can
// generate variants of the instruction, through the exploitation of
@@ -2396,9 +2396,9 @@ void CodeGenDAGPatterns::GenerateVariants() {
MultipleUseVarSet DepVars;
std::vector<TreePatternNode*> Variants;
FindDepVars(PatternsToMatch[i].getSrcPattern(), DepVars);
DOUT << "Dependent/multiply used variables: ";
DEBUG(errs() << "Dependent/multiply used variables: ");
DEBUG(DumpDepVars(DepVars));
DOUT << "\n";
DEBUG(errs() << "\n");
GenerateVariantsOf(PatternsToMatch[i].getSrcPattern(), Variants, *this, DepVars);
assert(!Variants.empty() && "Must create at least original variant!");
@@ -2407,16 +2407,16 @@ void CodeGenDAGPatterns::GenerateVariants() {
if (Variants.empty()) // No variants for this pattern.
continue;
DOUT << "FOUND VARIANTS OF: ";
DEBUG(PatternsToMatch[i].getSrcPattern()->dump());
DOUT << "\n";
DEBUG(errs() << "FOUND VARIANTS OF: ";
PatternsToMatch[i].getSrcPattern()->dump();
errs() << "\n");
for (unsigned v = 0, e = Variants.size(); v != e; ++v) {
TreePatternNode *Variant = Variants[v];
DOUT << " VAR#" << v << ": ";
DEBUG(Variant->dump());
DOUT << "\n";
DEBUG(errs() << " VAR#" << v << ": ";
Variant->dump();
errs() << "\n");
// Scan to see if an instruction or explicit pattern already matches this.
bool AlreadyExists = false;
@@ -2427,7 +2427,7 @@ void CodeGenDAGPatterns::GenerateVariants() {
continue;
// Check to see if this variant already exists.
if (Variant->isIsomorphicTo(PatternsToMatch[p].getSrcPattern(), DepVars)) {
DOUT << " *** ALREADY EXISTS, ignoring variant.\n";
DEBUG(errs() << " *** ALREADY EXISTS, ignoring variant.\n");
AlreadyExists = true;
break;
}
@@ -2443,7 +2443,7 @@ void CodeGenDAGPatterns::GenerateVariants() {
PatternsToMatch[i].getAddedComplexity()));
}
DOUT << "\n";
DEBUG(errs() << "\n");
}
}