src/share/vm/opto/subnode.hpp

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

*** 37,67 ****
  // -float, and -double are all inherited from this class.  The compare
  // functions behave like subtract functions, except that all negative answers
  // are compressed into -1, and all positive answers compressed to 1.
  class SubNode : public Node {
  public:
!   SubNode( Node *in1, Node *in2 ) : Node(0,in1,in2) {
      init_class_id(Class_Sub);
    }
  
    // 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.
    virtual Node* Identity(PhaseGVN* phase);
  
    // 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;
!   const Type* Value_common( PhaseTransform *phase ) const;
  
    // Supplied function returns the subtractend 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 *sub( const Type *, const Type * ) const = 0;
  
    // Supplied function to return the additive identity type.
    // This is returned whenever the subtracts inputs are the same.
    virtual const Type *add_id() const = 0;
  };
  
  
  // NOTE: SubINode should be taken away and replaced by add and negate
  //------------------------------SubINode---------------------------------------
--- 37,69 ----
  // -float, and -double are all inherited from this class.  The compare
  // functions behave like subtract functions, except that all negative answers
  // are compressed into -1, and all positive answers compressed to 1.
  class SubNode : public Node {
  public:
!   SubNode(Node *in1, Node *in2) : Node(0,in1,in2) {
      init_class_id(Class_Sub);
    }
  
    // 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.
    virtual Node* Identity(PhaseGVN* phase);
  
    // 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;
!   const Type* Value_common(PhaseTransform *phase) const;
  
    // Supplied function returns the subtractend 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 *sub(const Type*, const Type*) const = 0;
  
    // Supplied function to return the additive identity type.
    // This is returned whenever the subtracts inputs are the same.
    virtual const Type *add_id() const = 0;
+ 
+   static SubNode* make(BasicType bt, Node *in1, Node *in2);
  };
  
  
  // NOTE: SubINode should be taken away and replaced by add and negate
  //------------------------------SubINode---------------------------------------