src/share/vm/gc/g1/collectionSetChooser.cpp

*** 24,34 ****
  
  #include "precompiled.hpp"
  #include "gc/g1/collectionSetChooser.hpp"
  #include "gc/g1/g1CollectedHeap.inline.hpp"
  #include "gc/g1/g1CollectorPolicy.hpp"
- #include "gc/g1/g1ErgoVerbose.hpp"
  #include "gc/shared/space.inline.hpp"
  #include "runtime/atomic.inline.hpp"
  
  // Even though we don't use the GC efficiency in our heuristics as
  // much as we used to, we still order according to GC efficiency. This
--- 24,33 ----
*** 134,145 ****
  #ifdef ASSERT
    for (uint i = 0; i < _end; i++) {
      assert(regions_at(i) != NULL, "Should be true by sorting!");
    }
  #endif // ASSERT
!   if (G1PrintRegionLivenessInfo) {
!     G1PrintRegionLivenessInfoClosure cl(gclog_or_tty, "Post-Sorting");
      for (uint i = 0; i < _end; ++i) {
        HeapRegion* r = regions_at(i);
        cl.doHeapRegion(r);
      }
    }
--- 133,144 ----
  #ifdef ASSERT
    for (uint i = 0; i < _end; i++) {
      assert(regions_at(i) != NULL, "Should be true by sorting!");
    }
  #endif // ASSERT
!   if (Log<LOG_TAGS(gc, liveness)>::is_trace()) {
!     G1PrintRegionLivenessInfoClosure cl("Post-Sorting");
      for (uint i = 0; i < _end; ++i) {
        HeapRegion* r = regions_at(i);
        cl.doHeapRegion(r);
      }
    }