src/share/vm/memory/metaspace.cpp

rev 5732 : [mq]: comments2

*** 2392,2402 ****
    return result;
  }
  
  void SpaceManager::verify() {
    // If there are blocks in the dictionary, then
!   // verfication of chunks does not work since
    // being in the dictionary alters a chunk.
    if (block_freelists()->total_size() == 0) {
      for (ChunkIndex i = ZeroIndex; i < NumberOfInUseLists; i = next_chunk_index(i)) {
        Metachunk* curr = chunks_in_use(i);
        while (curr != NULL) {
--- 2392,2402 ----
    return result;
  }
  
  void SpaceManager::verify() {
    // If there are blocks in the dictionary, then
!   // verification of chunks does not work since
    // being in the dictionary alters a chunk.
    if (block_freelists()->total_size() == 0) {
      for (ChunkIndex i = ZeroIndex; i < NumberOfInUseLists; i = next_chunk_index(i)) {
        Metachunk* curr = chunks_in_use(i);
        while (curr != NULL) {
*** 2861,2871 ****
      lower_base = metaspace_base;
  
      uint64_t klass_encoding_max = UnscaledClassSpaceMax << LogKlassAlignmentInBytes;
      // If compressed class space fits in lower 32G, we don't need a base.
      if (higher_address <= (address)klass_encoding_max) {
!       lower_base = 0; // effectively lower base is zero.
      }
    }
  
    Universe::set_narrow_klass_base(lower_base);
  
--- 2861,2871 ----
      lower_base = metaspace_base;
  
      uint64_t klass_encoding_max = UnscaledClassSpaceMax << LogKlassAlignmentInBytes;
      // If compressed class space fits in lower 32G, we don't need a base.
      if (higher_address <= (address)klass_encoding_max) {
!       lower_base = 0; // Effectively lower base is zero.
      }
    }
  
    Universe::set_narrow_klass_base(lower_base);