*** old/src/share/vm/opto/loopnode.cpp	Mon Nov  7 13:52:43 2011
--- new/src/share/vm/opto/loopnode.cpp	Mon Nov  7 13:52:43 2011

*** 1881,1891 ****
--- 1881,1891 ----
  
  //=============================================================================
  //----------------------------build_and_optimize-------------------------------
  // Create a PhaseLoop.  Build the ideal Loop tree.  Map each Ideal Node to
  // its corresponding LoopNode.  If 'optimize' is true, do some loop cleanups.
! void PhaseIdealLoop::build_and_optimize(bool do_split_ifs, bool skip_loop_opts) {
    ResourceMark rm;
  
    int old_progress = C->major_progress();
    uint orig_worklist_size = _igvn._worklist.size();
  

*** 2070,2079 ****
--- 2070,2089 ----
    if(TraceLoopOpts && C->has_loops()) {
      _ltree_root->dump();
    }
  #endif
  
+   if (skip_loop_opts) {
+     // Cleanup any modified bits
+     _igvn.optimize();
+ 
+     if (C->log() != NULL) {
+       log_loop_tree(_ltree_root, _ltree_root, C->log());
+     }
+     return;
+   }
+ 
    if (ReassociateInvariants) {
      // Reassociate invariants and prep for split_thru_phi
      for (LoopTreeIterator iter(_ltree_root); !iter.done(); iter.next()) {
        IdealLoopTree* lpt = iter.current();
        if (!lpt->is_counted() || !lpt->is_inner()) continue;