From d88ba5a861f400116ec4343a0542e0c58ba0e6a5 Mon Sep 17 00:00:00 2001 From: Misha Brukman Date: Tue, 5 Aug 2003 14:35:35 +0000 Subject: [PATCH] Stop special-casing annul and predict bits (which are Sparc-specific anyway) since those bits are now hard-coded in Sparc*.td files. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7593 91177308-0d34-0410-b5e6-96231b3b80d8 --- support/tools/TableGen/CodeEmitterGen.cpp | 9 +-------- utils/TableGen/CodeEmitterGen.cpp | 9 +-------- 2 files changed, 2 insertions(+), 16 deletions(-) diff --git a/support/tools/TableGen/CodeEmitterGen.cpp b/support/tools/TableGen/CodeEmitterGen.cpp index b98e71216d4..b3928b8c36e 100644 --- a/support/tools/TableGen/CodeEmitterGen.cpp +++ b/support/tools/TableGen/CodeEmitterGen.cpp @@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) { std::map OpOrder; std::map OpContinuous; for (unsigned i = 0, e = Vals.size(); i != e; ++i) { - if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete() && - // ignore annul and predict bits since no one sets them yet - Vals[i].getName() != "annul" && Vals[i].getName() != "predict") { + if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete()) { // Is the operand continuous? If so, we can just mask and OR it in // instead of doing it bit-by-bit, saving a lot in runtime cost. const BitsInit *InstInit = BI; @@ -199,11 +197,6 @@ void CodeEmitterGen::run(std::ostream &o) { } } } - } else { - // ignore annul and predict bits since no one sets them yet - if (Vals[f].getName() == "annul" || Vals[f].getName() == "predict") { - o << " // found " << Vals[f].getName() << "\n"; - } } } diff --git a/utils/TableGen/CodeEmitterGen.cpp b/utils/TableGen/CodeEmitterGen.cpp index b98e71216d4..b3928b8c36e 100644 --- a/utils/TableGen/CodeEmitterGen.cpp +++ b/utils/TableGen/CodeEmitterGen.cpp @@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) { std::map OpOrder; std::map OpContinuous; for (unsigned i = 0, e = Vals.size(); i != e; ++i) { - if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete() && - // ignore annul and predict bits since no one sets them yet - Vals[i].getName() != "annul" && Vals[i].getName() != "predict") { + if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete()) { // Is the operand continuous? If so, we can just mask and OR it in // instead of doing it bit-by-bit, saving a lot in runtime cost. const BitsInit *InstInit = BI; @@ -199,11 +197,6 @@ void CodeEmitterGen::run(std::ostream &o) { } } } - } else { - // ignore annul and predict bits since no one sets them yet - if (Vals[f].getName() == "annul" || Vals[f].getName() == "predict") { - o << " // found " << Vals[f].getName() << "\n"; - } } }