mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-09-01 04:29:57 +00:00
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
This commit is contained in:
parent
c3cd8afe96
commit
d88ba5a861
@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) {
|
|||||||
std::map<std::string, unsigned> OpOrder;
|
std::map<std::string, unsigned> OpOrder;
|
||||||
std::map<std::string, bool> OpContinuous;
|
std::map<std::string, bool> OpContinuous;
|
||||||
for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
|
for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
|
||||||
if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete() &&
|
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") {
|
|
||||||
// Is the operand continuous? If so, we can just mask and OR it in
|
// 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.
|
// instead of doing it bit-by-bit, saving a lot in runtime cost.
|
||||||
const BitsInit *InstInit = BI;
|
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";
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -53,9 +53,7 @@ void CodeEmitterGen::run(std::ostream &o) {
|
|||||||
std::map<std::string, unsigned> OpOrder;
|
std::map<std::string, unsigned> OpOrder;
|
||||||
std::map<std::string, bool> OpContinuous;
|
std::map<std::string, bool> OpContinuous;
|
||||||
for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
|
for (unsigned i = 0, e = Vals.size(); i != e; ++i) {
|
||||||
if (!Vals[i].getPrefix() && !Vals[i].getValue()->isComplete() &&
|
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") {
|
|
||||||
// Is the operand continuous? If so, we can just mask and OR it in
|
// 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.
|
// instead of doing it bit-by-bit, saving a lot in runtime cost.
|
||||||
const BitsInit *InstInit = BI;
|
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";
|
|
||||||
}
|
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user