src/share/vm/gc_implementation/concurrentMarkSweep/compactibleFreeListSpace.cpp

*** 1702,1713 ****
    // adjust _unallocated_block downward, as necessary
    _bt.freed((HeapWord*)chunk, size);
    _dictionary->return_chunk(chunk);
  #ifndef PRODUCT
    if (CMSCollector::abstract_state() != CMSCollector::Sweeping) {
!     TreeChunk<FreeChunk, AdaptiveFreeList>* tc = TreeChunk<FreeChunk, AdaptiveFreeList>::as_TreeChunk(chunk);
!     TreeList<FreeChunk, AdaptiveFreeList>* tl = tc->list();
      tl->verify_stats();
    }
  #endif // PRODUCT
  }
  
--- 1702,1713 ----
    // adjust _unallocated_block downward, as necessary
    _bt.freed((HeapWord*)chunk, size);
    _dictionary->return_chunk(chunk);
  #ifndef PRODUCT
    if (CMSCollector::abstract_state() != CMSCollector::Sweeping) {
!     TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >* tc = TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::as_TreeChunk(chunk);
!     TreeList<FreeChunk, AdaptiveFreeList<FreeChunk> >* tl = tc->list();
      tl->verify_stats();
    }
  #endif // PRODUCT
  }
  
*** 2513,2526 ****
    guarantee(n == num, "Incorrect count");
  }
  
  #ifndef PRODUCT
  void CompactibleFreeListSpace::check_free_list_consistency() const {
!   assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size() <= IndexSetSize),
      "Some sizes can't be allocated without recourse to"
      " linear allocation buffers");
!   assert((TreeChunk<FreeChunk, AdaptiveFreeList>::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList>)),
      "else MIN_TREE_CHUNK_SIZE is wrong");
    assert(IndexSetStart != 0, "IndexSetStart not initialized");
    assert(IndexSetStride != 0, "IndexSetStride not initialized");
  }
  #endif
--- 2513,2526 ----
    guarantee(n == num, "Incorrect count");
  }
  
  #ifndef PRODUCT
  void CompactibleFreeListSpace::check_free_list_consistency() const {
!   assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size() <= IndexSetSize),
      "Some sizes can't be allocated without recourse to"
      " linear allocation buffers");
!   assert((TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >::min_size()*HeapWordSize == sizeof(TreeChunk<FreeChunk, AdaptiveFreeList<FreeChunk> >)),
      "else MIN_TREE_CHUNK_SIZE is wrong");
    assert(IndexSetStart != 0, "IndexSetStart not initialized");
    assert(IndexSetStride != 0, "IndexSetStride not initialized");
  }
  #endif