Eliminate class UseVal.

runtime/vm/intermediate_language.h

 // Copyright (c) 2012, the Dart project authors.  Please see the AUTHORS file
 // for details. All rights reserved. Use of this source code is governed by a
 // BSD-style license that can be found in the LICENSE file.
 
 #ifndef VM_INTERMEDIATE_LANGUAGE_H_
 #define VM_INTERMEDIATE_LANGUAGE_H_
 
 #include "vm/allocation.h"
 #include "vm/ast.h"
 #include "vm/growable_array.h"
@@ skipping 31 matching lines @@
 };
 
 
 class BitVector;
 class FlowGraphAllocator;
 class FlowGraphCompiler;
 class FlowGraphVisitor;
 class Function;
 class LocalVariable;
 
-// M is a two argument macro.  It is applied to each concrete value's
-// typename and classname.
-#define FOR_EACH_VALUE(M)                                                      \
-  M(Use, UseVal)                                                               \
-
-
 // M is a two argument macro.  It is applied to each concrete instruction's
 // (including the values) typename and classname.
 #define FOR_EACH_COMPUTATION(M)                                                \
   M(AssertAssignable, AssertAssignableComp)                                    \
   M(AssertBoolean, AssertBooleanComp)                                          \
   M(CurrentContext, CurrentContextComp)                                        \
   M(StoreContext, StoreContextComp)                                            \
   M(ClosureCall, ClosureCallComp)                                              \
   M(InstanceCall, InstanceCallComp)                                            \
   M(PolymorphicInstanceCall, PolymorphicInstanceCallComp)                      \
@@ skipping 38 matching lines @@
   M(Constant, ConstantComp)                                                    \
   M(CheckEitherNonSmi, CheckEitherNonSmiComp)                                  \
   M(UnboxedDoubleBinaryOp, UnboxedDoubleBinaryOpComp)                          \
   M(UnboxDouble, UnboxDoubleComp)                                              \
   M(BoxDouble, BoxDoubleComp)                                                  \
   M(CheckArrayBound, CheckArrayBoundComp)
 
 
 #define FORWARD_DECLARATION(ShortName, ClassName) class ClassName;
 FOR_EACH_COMPUTATION(FORWARD_DECLARATION)
-FOR_EACH_VALUE(FORWARD_DECLARATION)
 #undef FORWARD_DECLARATION
 
 // Forward declarations.
 class BindInstr;
 class BranchInstr;
 class BufferFormatter;
 class ComparisonComp;
 class Definition;
+class Definition;

[srdjan, 2012/08/29 19:45:53]

One Definition too much.

 class Instruction;
+class PhiInstr;
 class PushArgumentInstr;
 class Value;
 
 
 enum Representation {
   kTagged, kUnboxedDouble
 };
 
 
 class Computation : public ZoneAllocated {
@@ skipping 194 matching lines @@
     inputs_[i] = value;
   }
 
  protected:
   EmbeddedArray<Value*, N> inputs_;
 };
 
 
 class Value : public ZoneAllocated {
  public:
-  Value() { }
+  explicit Value(Definition* definition)
+      : definition_(definition),
+        next_use_(NULL),
+        instruction_(NULL),
+        use_index_(-1) { }
 
-  // Declare an enum value used to define kind-test predicates.
-  enum ValueKind {
-#define DECLARE_VALUE_KIND(ShortName, ClassName) k##ShortName,
-  FOR_EACH_VALUE(DECLARE_VALUE_KIND)
-#undef DECLARE_VALUE_KIND
-  };
+  Definition* definition() const { return definition_; }
+  void set_definition(Definition* definition) { definition_ = definition; }
 
-  // Declare predicate for each value.
-#define DECLARE_PREDICATE(ShortName, ClassName)                                \
-  inline bool Is##ShortName() const;                                           \
-  inline const ClassName* As##ShortName() const;                               \
-  inline ClassName* As##ShortName();
-FOR_EACH_VALUE(DECLARE_PREDICATE)
-#undef DECLARE_PREDICATE
+  Value* next_use() const { return next_use_; }
+  void set_next_use(Value* next) { next_use_ = next; }
 
-  virtual ValueKind value_kind() const = 0;
+  Instruction* instruction() const { return instruction_; }
+  void set_instruction(Instruction* instruction) { instruction_ = instruction; }
 
-  virtual RawAbstractType* CompileType() const = 0;
-  virtual intptr_t ResultCid() const = 0;
+  intptr_t use_index() const { return use_index_; }
+  void set_use_index(intptr_t index) { use_index_ = index; }
 
-  virtual void PrintTo(BufferFormatter* f) const = 0;
+  void AddToInputUseList();
+  void AddToEnvUseList();
+
+  Value* Copy() { return new Value(definition_); }
+
+  RawAbstractType* CompileType() const;
+  intptr_t ResultCid() const;
+
+  void PrintTo(BufferFormatter* f) const;
+
+  const char* DebugName() const { return "Value"; }
 
   // Returns true if the value represents a constant.
-  virtual bool BindsToConstant() const = 0;
+  bool BindsToConstant() const;
 
-  // Returns true if the value represents constant null.
-  virtual bool BindsToConstantNull() const = 0;
+  // Returns true if the value represents the constant null.
+  bool BindsToConstantNull() const;
 
-  // Assert if BindsToConstant() is false, otherwise returns constant.
-  virtual const Object& BoundConstant() const = 0;
+  // Assert if BindsToConstant() is false, otherwise returns the constant value.
+  const Object& BoundConstant() const;
 
   // Reminder: The type of the constant null is the bottom type, which is more
   // specific than any type.
   bool CompileTypeIsMoreSpecificThan(const AbstractType& dst_type) const;
 
   // Compile time constants, Bool, Smi and Nulls do not need to update
   // the store buffer.
   bool NeedsStoreBuffer() const;
 
-  virtual bool Equals(Value* other) const = 0;
-
-  virtual Value* CopyValue() = 0;
+  bool Equals(Value* other) const;
 
  private:
+  Definition* definition_;
+  Value* next_use_;
+  Instruction* instruction_;
+  intptr_t use_index_;
+
   DISALLOW_COPY_AND_ASSIGN(Value);
 };
 
 
 // Functions defined in all concrete computation classes.
 #define DECLARE_COMPUTATION(ShortName)                                         \
   virtual void Accept(FlowGraphVisitor* visitor, BindInstr* instr);            \
   virtual ComputationKind computation_kind() const {                           \
     return Computation::k##ShortName;                                          \
   }                                                                            \
   virtual intptr_t ArgumentCount() const { return 0; }                         \
   virtual const char* DebugName() const { return #ShortName; }                 \
   virtual RawAbstractType* CompileType() const;                                \
   virtual LocationSummary* MakeLocationSummary() const;                        \
   virtual void EmitNativeCode(FlowGraphCompiler* compiler);
 
-// Functions defined in all concrete value classes.
-#define DECLARE_VALUE(ShortName)                                               \
-  virtual ValueKind value_kind() const {                                       \
-    return Value::k##ShortName;                                                \
-  }                                                                            \
-  virtual const char* DebugName() const { return #ShortName; }                 \
-  virtual RawAbstractType* CompileType() const;                                \
-  virtual bool Equals(Value* other) const;                                     \
-  virtual void PrintTo(BufferFormatter* f) const;
-
 
 // Function defined in all call computation classes.
 #define DECLARE_CALL_COMPUTATION(ShortName)                                    \
   virtual void Accept(FlowGraphVisitor* visitor, BindInstr* instr);            \
   virtual ComputationKind computation_kind() const {                           \
     return Computation::k##ShortName;                                          \
   }                                                                            \
   virtual const char* DebugName() const { return #ShortName; }                 \
   virtual RawAbstractType* CompileType() const;                                \
   virtual LocationSummary* MakeLocationSummary() const;                        \
   virtual void EmitNativeCode(FlowGraphCompiler* compiler);
 
 
-class Definition;
-class PhiInstr;
-
-class UseVal : public Value {
- public:
-  explicit UseVal(Definition* definition)
-      : definition_(definition),
-        next_use_(NULL),
-        instruction_(NULL),
-        use_index_(-1) { }
-
-  DECLARE_VALUE(Use)
-
-  inline Definition* definition() const { return definition_; }
-  void set_definition(Definition* definition) { definition_ = definition; }
-
-  // Returns true if the value represents a constant.
-  virtual bool BindsToConstant() const;
-  virtual const Object& BoundConstant() const;
-
-  // Returns true if the value represents constant null.
-  virtual bool BindsToConstantNull() const;
-
-  virtual bool CanDeoptimize() const { return false; }
-
-  UseVal* next_use() const { return next_use_; }
-  void set_next_use(UseVal* next) { next_use_ = next; }
-
-  Instruction* instruction() const { return instruction_; }
-  void set_instruction(Instruction* instruction) { instruction_ = instruction; }
-
-  intptr_t use_index() const { return use_index_; }
-  void set_use_index(intptr_t index) { use_index_ = index; }
-
-  void AddToInputUseList();
-  void AddToEnvUseList();
-
-  virtual intptr_t ResultCid() const;
-
-  virtual Value* CopyValue() { return new UseVal(definition_); }
-
- private:
-  Definition* definition_;
-  UseVal* next_use_;
-  Instruction* instruction_;
-  intptr_t use_index_;
-
-  DISALLOW_COPY_AND_ASSIGN(UseVal);
-};
-
-
-#undef DECLARE_VALUE
-
-
 class ConstantComp : public TemplateComputation<0> {
  public:
   explicit ConstantComp(const Object& value) : value_(value) { }
 
   DECLARE_COMPUTATION(Constant)
 
   const Object& value() const { return value_; }
 
   virtual void PrintOperandsTo(BufferFormatter* f) const;
 
@@ skipping 1662 matching lines @@
   if (!Is##ShortName()) return NULL;                                           \
   return static_cast<const ClassName*>(this);                                  \
 }                                                                              \
 ClassName* Computation::As##ShortName() {                                      \
   if (!Is##ShortName()) return NULL;                                           \
   return static_cast<ClassName*>(this);                                        \
 }
 FOR_EACH_COMPUTATION(DEFINE_COMPUTATION_PREDICATE)
 #undef DEFINE_COMPUTATION_PREDICATE
 
-#define DEFINE_VALUE_PREDICATE(ShortName, ClassName)                           \
-bool Value::Is##ShortName() const {                                            \
-  return value_kind() == k##ShortName;                                         \
-}                                                                              \
-const ClassName* Value::As##ShortName() const {                                \
-  if (!Is##ShortName()) return NULL;                                           \
-  return static_cast<const ClassName*>(this);                                  \
-}                                                                              \
-ClassName* Value::As##ShortName() {                                            \
-  if (!Is##ShortName()) return NULL;                                           \
-  return static_cast<ClassName*>(this);                                        \
-}
-FOR_EACH_VALUE(DEFINE_VALUE_PREDICATE)
-#undef DEFINE_VALUE_PREDICATE
-
 // Instructions.
 
 // M is a single argument macro.  It is applied to each concrete instruction
 // type name.  The concrete instruction classes are the name with Instr
 // concatenated.
 #define FOR_EACH_INSTRUCTION(M)                                                \
   M(GraphEntry)                                                                \
   M(JoinEntry)                                                                 \
   M(TargetEntry)                                                               \
   M(Phi)                                                                       \
@@ skipping 623 matching lines @@
   }
 
   bool has_propagated_cid() const { return propagated_cid_ != kIllegalCid; }
   intptr_t propagated_cid() const { return propagated_cid_; }
   // May compute and set propagated cid.
   virtual intptr_t GetPropagatedCid() = 0;
 
   // Returns true if the propagated cid has changed.
   bool SetPropagatedCid(intptr_t cid);
 
-  UseVal* input_use_list() { return input_use_list_; }
-  void set_input_use_list(UseVal* head) { input_use_list_ = head; }
+  Value* input_use_list() { return input_use_list_; }
+  void set_input_use_list(Value* head) { input_use_list_ = head; }
 
-  UseVal* env_use_list() { return env_use_list_; }
-  void set_env_use_list(UseVal* head) { env_use_list_ = head; }
+  Value* env_use_list() { return env_use_list_; }
+  void set_env_use_list(Value* head) { env_use_list_ = head; }
 
   // Replace uses of this definition with uses of other definition or value.
   // Precondition: use lists must be properly calculated.
   // Postcondition: use lists and use values are still valid.
   void ReplaceUsesWith(Definition* other);
 
  private:
   intptr_t temp_index_;
   intptr_t ssa_temp_index_;
   // TODO(regis): GrowableArray<const AbstractType*> propagated_types_;
   // For now:
   AbstractType& propagated_type_;
   intptr_t propagated_cid_;
-  UseVal* input_use_list_;
-  UseVal* env_use_list_;
+  Value* input_use_list_;
+  Value* env_use_list_;
 
   DISALLOW_COPY_AND_ASSIGN(Definition);
 };
 
 
 class BindInstr : public Definition {
  public:
   enum UseKind { kUnused, kUsed };
 
   BindInstr(UseKind used, Computation* computation)
@@ skipping 481 matching lines @@
   ForwardInstructionIterator* current_iterator_;
 
  private:
   DISALLOW_COPY_AND_ASSIGN(FlowGraphVisitor);
 };
 
 
 }  // namespace dart
 
 #endif  // VM_INTERMEDIATE_LANGUAGE_H_