6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-28 06:32:09 +00:00
Code Issues Projects Releases Wiki Activity

No functional changes, comment the fix I just put in

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@7590 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-08-05 03:59:01 +00:00
parent d7efef9d14
commit ffaee37556
2 changed files with 10 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -54,9 +54,8 @@ void CodeEmitterGen::run(std::ostream &o) {
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 */ // ignore annul and predict bits since no one sets them yet
Vals[i].getName() != "annul" && Vals[i].getName() != "predict") 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;
@ -112,6 +111,8 @@ void CodeEmitterGen::run(std::ostream &o) {
} }
} }
// If we have found no bit in "Inst" which comes from this field, then
// this is not an operand!!
if (beginBitInInst != -1) { if (beginBitInInst != -1) {
o << " // op" << op << ": " << Vals[i].getName() << "\n" o << " // op" << op << ": " << Vals[i].getName() << "\n"
<< " int64_t op" << op << " int64_t op" << op

7
utils/TableGen/CodeEmitterGen.cpp
View File

@ -54,9 +54,8 @@ void CodeEmitterGen::run(std::ostream &o) {
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 */ // ignore annul and predict bits since no one sets them yet
Vals[i].getName() != "annul" && Vals[i].getName() != "predict") 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;
@ -112,6 +111,8 @@ void CodeEmitterGen::run(std::ostream &o) {
} }
} }
// If we have found no bit in "Inst" which comes from this field, then
// this is not an operand!!
if (beginBitInInst != -1) { if (beginBitInInst != -1) {
o << " // op" << op << ": " << Vals[i].getName() << "\n" o << " // op" << op << ": " << Vals[i].getName() << "\n"
<< " int64_t op" << op << " int64_t op" << op