[llvm-commits] CVS: llvm/utils/TableGen/CodeEmitterGen.cpp

[Misha Brukman]

Changes in directory llvm/utils/TableGen:

CodeEmitterGen.cpp updated: 1.23 -> 1.24

---
Log message:

Stop special-casing annul and predict bits (which are Sparc-specific anyway)
since those bits are now hard-coded in Sparc*.td files.


---
Diffs of the changes:

Index: llvm/utils/TableGen/CodeEmitterGen.cpp
diff -u llvm/utils/TableGen/CodeEmitterGen.cpp:1.23 llvm/utils/TableGen/CodeEmitterGen.cpp:1.24
--- llvm/utils/TableGen/CodeEmitterGen.cpp:1.23	Mon Aug  4 22:59:01 2003
+++ llvm/utils/TableGen/CodeEmitterGen.cpp	Tue Aug  5 09:35:35 2003
@@ -53,9 +53,7 @@
     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;
@@ -198,11 +196,6 @@
               o << "Error: UNIMPLEMENTED\n";
             }
           }
-        }
-      } 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";
         }
       }
     }