*** old/src/share/vm/opto/loopnode.cpp	Mon Mar 25 15:47:04 2013
--- new/src/share/vm/opto/loopnode.cpp	Mon Mar 25 15:47:04 2013

*** 2249,2285 ****
--- 2249,2283 ----
      assert(C->unique() == unique, "verification mode made Nodes? ? ?");
      assert(_igvn._worklist.size() == orig_worklist_size, "shouldn't push anything");
      return;
    }
  
+   // clear out the dead code after build_loop_late
+   while (_deadlist.size()) {
+     _igvn.remove_globally_dead_node(_deadlist.pop());
+   }
+ 
    if (stop_early) {
      assert(do_expensive_nodes, "why are we here?");
      if (process_expensive_nodes()) {
        // If we made some progress when processing expensive nodes then
        // the IGVN may modify the graph in a way that will allow us to
        // make some more progress: we need to try processing expensive
        // nodes again.
        C->set_major_progress();
      }
  
      _igvn.optimize();
  
      return;
    }
  
    // Some parser-inserted loop predicates could never be used by loop
    // predication or they were moved away from loop during some optimizations.
    // For example, peeling. Eliminate them before next loop optimizations.
    if (UseLoopPredicate || LoopLimitCheck) {
      eliminate_useless_predicates();
    }
  
    // clear out the dead code
    while(_deadlist.size()) {
      _igvn.remove_globally_dead_node(_deadlist.pop());
    }
  
  #ifndef PRODUCT
    C->verify_graph_edges();
    if (_verify_me) {             // Nested verify pass?
      // Check to see if the verify mode is broken
      assert(C->unique() == unique, "non-optimize mode made Nodes? ? ?");