src/share/vm/opto/addnode.hpp

rev 10222 : 8149745: C2 should optimize long accumulations in a counted loop
summary: Look for parallel iv for long adds
Reviewed-by:

*** 39,49 ****
  // all inherited from this class.  The various identity values are supplied
  // by virtual functions.
  class AddNode : public Node {
    virtual uint hash() const;
  public:
!   AddNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {
      init_class_id(Class_Add);
    }
  
    // Handle algebraic identities here.  If we have an identity, return the Node
    // we are equivalent to.  We look for "add of zero" as an identity.
--- 39,49 ----
  // all inherited from this class.  The various identity values are supplied
  // by virtual functions.
  class AddNode : public Node {
    virtual uint hash() const;
  public:
!   AddNode(Node *in1, Node *in2) : Node(0,in1,in2) {
      init_class_id(Class_Add);
    }
  
    // Handle algebraic identities here.  If we have an identity, return the Node
    // we are equivalent to.  We look for "add of zero" as an identity.
*** 56,75 ****
    // Compute a new Type for this node.  Basically we just do the pre-check,
    // then call the virtual add() to set the type.
    virtual const Type* Value(PhaseGVN* phase) const;
  
    // Check if this addition involves the additive identity
!   virtual const Type *add_of_identity( const Type *t1, const Type *t2 ) const;
  
    // Supplied function returns the sum of the inputs.
    // This also type-checks the inputs for sanity.  Guaranteed never to
    // be passed a TOP or BOTTOM type, these are filtered out by a pre-check.
!   virtual const Type *add_ring( const Type *, const Type * ) const = 0;
  
    // Supplied function to return the additive identity type
    virtual const Type *add_id() const = 0;
  
  };
  
  //------------------------------AddINode---------------------------------------
  // Add 2 integers
  class AddINode : public AddNode {
--- 56,76 ----
    // Compute a new Type for this node.  Basically we just do the pre-check,
    // then call the virtual add() to set the type.
    virtual const Type* Value(PhaseGVN* phase) const;
  
    // Check if this addition involves the additive identity
!   virtual const Type *add_of_identity(const Type *t1, const Type *t2) const;
  
    // Supplied function returns the sum of the inputs.
    // This also type-checks the inputs for sanity.  Guaranteed never to
    // be passed a TOP or BOTTOM type, these are filtered out by a pre-check.
!   virtual const Type *add_ring(const Type*, const Type*) const = 0;
  
    // Supplied function to return the additive identity type
    virtual const Type *add_id() const = 0;
  
+   static AddNode* make(BasicType bt, Node *in1, Node *in2);
  };
  
  //------------------------------AddINode---------------------------------------
  // Add 2 integers
  class AddINode : public AddNode {