RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2024-11-26 21:20:29 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Stop special-casing annul and predict bits (which are Sparc-specific anyway)

Browse Source 
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
This commit is contained in:
Misha Brukman 2003-08-05 14:35:35 +00:00
parent c3cd8afe96
commit d88ba5a861
2 changed files with 2 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
support/tools/TableGen/CodeEmitterGen.cpp
View File

@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) {
std::map<std::string, unsigned> OpOrder;
std::map<std::string, bool> 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";
}
}
}

9
utils/TableGen/CodeEmitterGen.cpp
View File

@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) {
std::map<std::string, unsigned> OpOrder;
std::map<std::string, bool> 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";
}
}
}