src/share/vm/opto/node.hpp

*** 408,418 ****
    // Find first occurrence of n among my edges:
    int find_edge(Node* n);
    int replace_edge(Node* old, Node* neww);
    // NULL out all inputs to eliminate incoming Def-Use edges.
    // Return the number of edges between 'n' and 'this'
!   int  disconnect_inputs(Node *n);
  
    // Quickly, return true if and only if I am Compile::current()->top().
    bool is_top() const {
      assert((this == (Node*) Compile::current()->top()) == (_out == NULL), "");
      return (_out == NULL);
--- 408,418 ----
    // Find first occurrence of n among my edges:
    int find_edge(Node* n);
    int replace_edge(Node* old, Node* neww);
    // NULL out all inputs to eliminate incoming Def-Use edges.
    // Return the number of edges between 'n' and 'this'
!   int  disconnect_inputs(Node *n, Compile *c);
  
    // Quickly, return true if and only if I am Compile::current()->top().
    bool is_top() const {
      assert((this == (Node*) Compile::current()->top()) == (_out == NULL), "");
      return (_out == NULL);
*** 456,468 ****
  public:
    // Globally replace this node by a given new node, updating all uses.
    void replace_by(Node* new_node);
    // Globally replace this node by a given new node, updating all uses
    // and cutting input edges of old node.
!   void subsume_by(Node* new_node) {
      replace_by(new_node);
!     disconnect_inputs(NULL);
    }
    void set_req_X( uint i, Node *n, PhaseIterGVN *igvn );
    // Find the one non-null required input.  RegionNode only
    Node *nonnull_req() const;
    // Add or remove precedence edges
--- 456,468 ----
  public:
    // Globally replace this node by a given new node, updating all uses.
    void replace_by(Node* new_node);
    // Globally replace this node by a given new node, updating all uses
    // and cutting input edges of old node.
!   void subsume_by(Node* new_node, Compile* c) {
      replace_by(new_node);
!     disconnect_inputs(NULL, c);
    }
    void set_req_X( uint i, Node *n, PhaseIterGVN *igvn );
    // Find the one non-null required input.  RegionNode only
    Node *nonnull_req() const;
    // Add or remove precedence edges