*** old/src/share/vm/opto/node.cpp	Thu Aug 22 18:38:56 2013
--- new/src/share/vm/opto/node.cpp	Thu Aug 22 18:38:56 2013

*** 771,780 ****
--- 771,795 ----
    if (n != NULL) n->del_out((Node *)this);
    _in[idx] = in(--_cnt);  // Compact the array
    _in[_cnt] = NULL;       // NULL out emptied slot
  }
  
+ //------------------------------del_req_ordered--------------------------------
+ // Delete the required edge and compact the edge array with preserved order
+ void Node::del_req_ordered( uint idx ) {
+   assert( idx < _cnt, "oob");
+   assert( !VerifyHashTableKeys || _hash_lock == 0,
+           "remove node from hash table before modifying it");
+   // First remove corresponding def-use edge
+   Node *n = in(idx);
+   if (n != NULL) n->del_out((Node *)this);
+   if (idx < _cnt - 1) { // Not last edge ?
+     Copy::conjoint_words_to_lower((HeapWord*)&_in[idx+1], (HeapWord*)&_in[idx], ((_cnt-idx-1)*sizeof(Node*)));
+   }
+   _in[--_cnt] = NULL;   // NULL out emptied slot
+ }
+ 
  //------------------------------ins_req----------------------------------------
  // Insert a new required input at the end
  void Node::ins_req( uint idx, Node *n ) {
    assert( is_not_dead(n), "can not use dead node");
    add_req(NULL);                // Make space