Remove unnecessary IGNORE policy from Lithium operands.

src/lithium.h

 // Copyright 2012 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 41 matching lines @@
 
   Kind kind() const { return KindField::decode(value_); }
   int index() const { return static_cast<int>(value_) >> kKindFieldWidth; }
   bool IsConstantOperand() const { return kind() == CONSTANT_OPERAND; }
   bool IsStackSlot() const { return kind() == STACK_SLOT; }
   bool IsDoubleStackSlot() const { return kind() == DOUBLE_STACK_SLOT; }
   bool IsRegister() const { return kind() == REGISTER; }
   bool IsDoubleRegister() const { return kind() == DOUBLE_REGISTER; }
   bool IsArgument() const { return kind() == ARGUMENT; }
   bool IsUnallocated() const { return kind() == UNALLOCATED; }
+  bool IsIgnored() const { return kind() == INVALID; }
   bool Equals(LOperand* other) const { return value_ == other->value_; }
   int VirtualRegister();
 
   void PrintTo(StringStream* stream);
   void ConvertTo(Kind kind, int index) {
     value_ = KindField::encode(kind);
     value_ |= index << kKindFieldWidth;
     ASSERT(this->index() == index);
   }
 
@@ skipping 10 matching lines @@
 class LUnallocated: public LOperand {
  public:
   enum Policy {
     NONE,
     ANY,
     FIXED_REGISTER,
     FIXED_DOUBLE_REGISTER,
     FIXED_SLOT,
     MUST_HAVE_REGISTER,
     WRITABLE_REGISTER,
-    SAME_AS_FIRST_INPUT,
-    IGNORE
+    SAME_AS_FIRST_INPUT
   };
 
   // Lifetime of operand inside the instruction.
   enum Lifetime {
     // USED_AT_START operand is guaranteed to be live only at
     // instruction start. Register allocator is free to assign the same register
     // to some other operand used inside instruction (i.e. temporary or
     // output).
     USED_AT_START,
 
@@ skipping 10 matching lines @@
   LUnallocated(Policy policy, int fixed_index) : LOperand(UNALLOCATED, 0) {
     Initialize(policy, fixed_index, USED_AT_END);
   }
 
   LUnallocated(Policy policy, Lifetime lifetime) : LOperand(UNALLOCATED, 0) {
     Initialize(policy, 0, lifetime);
   }
 
   // The superclass has a KindField.  Some policies have a signed fixed
   // index in the upper bits.
-  static const int kPolicyWidth = 4;
+  static const int kPolicyWidth = 3;
   static const int kLifetimeWidth = 1;
-  static const int kVirtualRegisterWidth = 17;
+  static const int kVirtualRegisterWidth = 18;
 
   static const int kPolicyShift = kKindFieldWidth;
   static const int kLifetimeShift = kPolicyShift + kPolicyWidth;
   static const int kVirtualRegisterShift = kLifetimeShift + kLifetimeWidth;
   static const int kFixedIndexShift =
       kVirtualRegisterShift + kVirtualRegisterWidth;
 
   class PolicyField : public BitField<Policy, kPolicyShift, kPolicyWidth> { };
 
   class LifetimeField
       : public BitField<Lifetime, kLifetimeShift, kLifetimeWidth> {
   };
 
   class VirtualRegisterField
       : public BitField<unsigned,
                         kVirtualRegisterShift,
                         kVirtualRegisterWidth> {
   };
 
-  static const int kMaxVirtualRegisters = 1 << (kVirtualRegisterWidth + 1);
+  static const int kMaxVirtualRegisters = 1 << kVirtualRegisterWidth;
   static const int kMaxFixedIndex = 63;
   static const int kMinFixedIndex = -64;
 
-  bool HasIgnorePolicy() const { return policy() == IGNORE; }
-  bool HasNoPolicy() const { return policy() == NONE; }
   bool HasAnyPolicy() const {
     return policy() == ANY;
   }
   bool HasFixedPolicy() const {
     return policy() == FIXED_REGISTER ||
         policy() == FIXED_DOUBLE_REGISTER ||
         policy() == FIXED_SLOT;
   }
   bool HasRegisterPolicy() const {
     return policy() == WRITABLE_REGISTER || policy() == MUST_HAVE_REGISTER;
@@ skipping 65 matching lines @@
     return !IsEliminated() && source()->Equals(operand);
   }
 
   // A move is redundant if it's been eliminated, if its source and
   // destination are the same, or if its destination is unneeded.
   bool IsRedundant() const {
     return IsEliminated() || source_->Equals(destination_) || IsIgnored();
   }
 
   bool IsIgnored() const {
-    return destination_ != NULL &&
-        destination_->IsUnallocated() &&
-        LUnallocated::cast(destination_)->HasIgnorePolicy();
+    return destination_ != NULL && destination_->IsIgnored();
   }
 
   // We clear both operands to indicate move that's been eliminated.
   void Eliminate() { source_ = destination_ = NULL; }
   bool IsEliminated() const {
     ASSERT(source_ != NULL || destination_ == NULL);
     return source_ == NULL;
   }
 
  private:
@@ skipping 349 matching lines @@
   ShallowIterator current_iterator_;
 };
 
 
 int ElementsKindToShiftSize(ElementsKind elements_kind);
 
 
 } }  // namespace v8::internal
 
 #endif  // V8_LITHIUM_H_