src/share/vm/opto/node.hpp

rev 8979 : [mq]: vmerr_static

*** 351,361 ****
    }
    Node*    last_out(DUIterator_Last i) const  { return *i; }
  #endif
  
    // Reference to the i'th input Node.  Error if out of bounds.
!   Node* in(uint i) const { assert(i < _max, err_msg_res("oob: i=%d, _max=%d", i, _max)); return _in[i]; }
    // Reference to the i'th input Node.  NULL if out of bounds.
    Node* lookup(uint i) const { return ((i < _max) ? _in[i] : NULL); }
    // Reference to the i'th output Node.  Error if out of bounds.
    // Use this accessor sparingly.  We are going trying to use iterators instead.
    Node* raw_out(uint i) const { assert(i < _outcnt,"oob"); return _out[i]; }
--- 351,361 ----
    }
    Node*    last_out(DUIterator_Last i) const  { return *i; }
  #endif
  
    // Reference to the i'th input Node.  Error if out of bounds.
!   Node* in(uint i) const { assert(i < _max, "oob: i=%d, _max=%d", i, _max); return _in[i]; }
    // Reference to the i'th input Node.  NULL if out of bounds.
    Node* lookup(uint i) const { return ((i < _max) ? _in[i] : NULL); }
    // Reference to the i'th output Node.  Error if out of bounds.
    // Use this accessor sparingly.  We are going trying to use iterators instead.
    Node* raw_out(uint i) const { assert(i < _outcnt,"oob"); return _out[i]; }
*** 391,401 ****
    void del_req( uint idx ); // Delete required edge & compact
    void del_req_ordered( uint idx ); // Delete required edge & compact with preserved order
    void ins_req( uint i, Node *n ); // Insert a NEW required input
    void set_req( uint i, Node *n ) {
      assert( is_not_dead(n), "can not use dead node");
!     assert( i < _cnt, err_msg_res("oob: i=%d, _cnt=%d", i, _cnt));
      assert( !VerifyHashTableKeys || _hash_lock == 0,
              "remove node from hash table before modifying it");
      Node** p = &_in[i];    // cache this._in, across the del_out call
      if (*p != NULL)  (*p)->del_out((Node *)this);
      (*p) = n;
--- 391,401 ----
    void del_req( uint idx ); // Delete required edge & compact
    void del_req_ordered( uint idx ); // Delete required edge & compact with preserved order
    void ins_req( uint i, Node *n ); // Insert a NEW required input
    void set_req( uint i, Node *n ) {
      assert( is_not_dead(n), "can not use dead node");
!     assert( i < _cnt, "oob: i=%d, _cnt=%d", i, _cnt);
      assert( !VerifyHashTableKeys || _hash_lock == 0,
              "remove node from hash table before modifying it");
      Node** p = &_in[i];    // cache this._in, across the del_out call
      if (*p != NULL)  (*p)->del_out((Node *)this);
      (*p) = n;