src/share/vm/opto/lcm.cpp

*** 462,474 ****
      if( n->is_Proj() ||         // Projections always win
          n->Opcode()== Op_Con || // So does constant 'Top'
          iop == Op_CreateEx ||   // Create-exception must start block
          iop == Op_CheckCastPP
          ) {
!       // select the node n
!       // remove n from worklist and retain the order of remaining nodes
!       worklist.remove((uint)i);
        return n;
      }
  
      // Final call in a block must be adjacent to 'catch'
      Node *e = block->end();
--- 462,472 ----
      if( n->is_Proj() ||         // Projections always win
          n->Opcode()== Op_Con || // So does constant 'Top'
          iop == Op_CreateEx ||   // Create-exception must start block
          iop == Op_CheckCastPP
          ) {
!       worklist.map(i,worklist.pop());
        return n;
      }
  
      // Final call in a block must be adjacent to 'catch'
      Node *e = block->end();
*** 550,562 ****
    } // End of for all ready nodes in worklist
  
    assert(idx >= 0, "index should be set");
    Node *n = worklist[(uint)idx];      // Get the winner
  
!   // select the node n
!   // remove n from worklist and retain the order of remaining nodes
!   worklist.remove((uint)idx);
    return n;
  }
  
  
  //------------------------------set_next_call----------------------------------
--- 548,558 ----
    } // End of for all ready nodes in worklist
  
    assert(idx >= 0, "index should be set");
    Node *n = worklist[(uint)idx];      // Get the winner
  
!   worklist.map((uint)idx, worklist.pop());     // Compress worklist
    return n;
  }
  
  
  //------------------------------set_next_call----------------------------------