< prev index next >

src/hotspot/share/memory/metaspace/chunkManager.cpp

Print this page
rev 60538 : imported patch jep387-core.patch

*** 1,7 **** /* ! * Copyright (c) 2018, 2019, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,8 ---- /* ! * Copyright (c) 2018, 2020, Oracle and/or its affiliates. All rights reserved. ! * Copyright (c) 2018, 2020 SAP SE. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 19,642 **** * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ #include "precompiled.hpp" #include "logging/log.hpp" #include "logging/logStream.hpp" ! #include "memory/binaryTreeDictionary.inline.hpp" ! #include "memory/freeList.inline.hpp" #include "memory/metaspace/chunkManager.hpp" #include "memory/metaspace/metachunk.hpp" - #include "memory/metaspace/metaDebug.hpp" #include "memory/metaspace/metaspaceCommon.hpp" #include "memory/metaspace/metaspaceStatistics.hpp" ! #include "memory/metaspace/occupancyMap.hpp" #include "memory/metaspace/virtualSpaceNode.hpp" #include "runtime/mutexLocker.hpp" #include "utilities/debug.hpp" #include "utilities/globalDefinitions.hpp" - #include "utilities/ostream.hpp" namespace metaspace { ! ChunkManager::ChunkManager(bool is_class) ! : _is_class(is_class), _free_chunks_total(0), _free_chunks_count(0) { ! _free_chunks[SpecializedIndex].set_size(get_size_for_nonhumongous_chunktype(SpecializedIndex, is_class)); ! _free_chunks[SmallIndex].set_size(get_size_for_nonhumongous_chunktype(SmallIndex, is_class)); ! _free_chunks[MediumIndex].set_size(get_size_for_nonhumongous_chunktype(MediumIndex, is_class)); ! } ! void ChunkManager::remove_chunk(Metachunk* chunk) { ! size_t word_size = chunk->word_size(); ! ChunkIndex index = list_index(word_size); ! if (index != HumongousIndex) { ! free_chunks(index)->remove_chunk(chunk); ! } else { ! humongous_dictionary()->remove_chunk(chunk); ! } - // Chunk has been removed from the chunks free list, update counters. - account_for_removed_chunk(chunk); } ! bool ChunkManager::attempt_to_coalesce_around_chunk(Metachunk* chunk, ChunkIndex target_chunk_type) { assert_lock_strong(MetaspaceExpand_lock); - assert(chunk != NULL, "invalid chunk pointer"); - // Check for valid merge combinations. - assert((chunk->get_chunk_type() == SpecializedIndex && - (target_chunk_type == SmallIndex || target_chunk_type == MediumIndex)) || - (chunk->get_chunk_type() == SmallIndex && target_chunk_type == MediumIndex), - "Invalid chunk merge combination."); - - const size_t target_chunk_word_size = - get_size_for_nonhumongous_chunktype(target_chunk_type, this->is_class()); - - // [ prospective merge region ) - MetaWord* const p_merge_region_start = - (MetaWord*) align_down(chunk, target_chunk_word_size * sizeof(MetaWord)); - MetaWord* const p_merge_region_end = - p_merge_region_start + target_chunk_word_size; - - // We need the VirtualSpaceNode containing this chunk and its occupancy map. - VirtualSpaceNode* const vsn = chunk->container(); - OccupancyMap* const ocmap = vsn->occupancy_map(); - - // The prospective chunk merge range must be completely contained by the - // committed range of the virtual space node. - if (p_merge_region_start < vsn->bottom() || p_merge_region_end > vsn->top()) { - return false; - } - - // Only attempt to merge this range if at its start a chunk starts and at its end - // a chunk ends. If a chunk (can only be humongous) straddles either start or end - // of that range, we cannot merge. - if (!ocmap->chunk_starts_at_address(p_merge_region_start)) { - return false; - } - if (p_merge_region_end < vsn->top() && - !ocmap->chunk_starts_at_address(p_merge_region_end)) { - return false; - } - - // Now check if the prospective merge area contains live chunks. If it does we cannot merge. - if (ocmap->is_region_in_use(p_merge_region_start, target_chunk_word_size)) { - return false; - } - - // Success! Remove all chunks in this region... - log_trace(gc, metaspace, freelist)("%s: coalescing chunks in area [%p-%p)...", - (is_class() ? "class space" : "metaspace"), - p_merge_region_start, p_merge_region_end); - - const int num_chunks_removed = - remove_chunks_in_area(p_merge_region_start, target_chunk_word_size); - - // ... and create a single new bigger chunk. - Metachunk* const p_new_chunk = - ::new (p_merge_region_start) Metachunk(target_chunk_type, is_class(), target_chunk_word_size, vsn); - assert(p_new_chunk == (Metachunk*)p_merge_region_start, "Sanity"); - p_new_chunk->set_origin(origin_merge); - - log_trace(gc, metaspace, freelist)("%s: created coalesced chunk at %p, size " SIZE_FORMAT_HEX ".", - (is_class() ? "class space" : "metaspace"), - p_new_chunk, p_new_chunk->word_size() * sizeof(MetaWord)); - - // Fix occupancy map: remove old start bits of the small chunks and set new start bit. - ocmap->wipe_chunk_start_bits_in_region(p_merge_region_start, target_chunk_word_size); - ocmap->set_chunk_starts_at_address(p_merge_region_start, true); - - // Mark chunk as free. Note: it is not necessary to update the occupancy - // map in-use map, because the old chunks were also free, so nothing - // should have changed. - p_new_chunk->set_is_tagged_free(true); - - // Add new chunk to its freelist. - ChunkList* const list = free_chunks(target_chunk_type); - list->return_chunk_at_head(p_new_chunk); - - // And adjust ChunkManager:: _free_chunks_count (_free_chunks_total - // should not have changed, because the size of the space should be the same) - _free_chunks_count -= num_chunks_removed; - _free_chunks_count ++; - - // VirtualSpaceNode::chunk_count does not have to be modified: - // it means "number of active (non-free) chunks", so merging free chunks - // should not affect that count. ! // At the end of a chunk merge, run verification tests. ! #ifdef ASSERT ! EVERY_NTH(VerifyMetaspaceInterval) ! locked_verify(true); ! vsn->verify(true); ! END_EVERY_NTH ! g_internal_statistics.num_chunk_merges ++; ! #endif ! return true; ! } ! // Remove all chunks in the given area - the chunks are supposed to be free - ! // from their corresponding freelists. Mark them as invalid. ! // - This does not correct the occupancy map. ! // - This does not adjust the counters in ChunkManager. ! // - Does not adjust container count counter in containing VirtualSpaceNode ! // Returns number of chunks removed. ! int ChunkManager::remove_chunks_in_area(MetaWord* p, size_t word_size) { ! assert(p != NULL && word_size > 0, "Invalid range."); ! const size_t smallest_chunk_size = get_size_for_nonhumongous_chunktype(SpecializedIndex, is_class()); ! assert_is_aligned(word_size, smallest_chunk_size); ! ! Metachunk* const start = (Metachunk*) p; ! const Metachunk* const end = (Metachunk*)(p + word_size); ! Metachunk* cur = start; ! int num_removed = 0; ! while (cur < end) { ! Metachunk* next = (Metachunk*)(((MetaWord*)cur) + cur->word_size()); ! DEBUG_ONLY(do_verify_chunk(cur)); ! assert(cur->get_chunk_type() != HumongousIndex, "Unexpected humongous chunk found at %p.", cur); ! assert(cur->is_tagged_free(), "Chunk expected to be free (%p)", cur); ! log_trace(gc, metaspace, freelist)("%s: removing chunk %p, size " SIZE_FORMAT_HEX ".", ! (is_class() ? "class space" : "metaspace"), ! cur, cur->word_size() * sizeof(MetaWord)); ! cur->remove_sentinel(); ! // Note: cannot call ChunkManager::remove_chunk, because that ! // modifies the counters in ChunkManager, which we do not want. So ! // we call remove_chunk on the freelist directly (see also the ! // splitting function which does the same). ! ChunkList* const list = free_chunks(list_index(cur->word_size())); ! list->remove_chunk(cur); ! num_removed ++; ! cur = next; } ! return num_removed; ! } ! // Update internal accounting after a chunk was added ! void ChunkManager::account_for_added_chunk(const Metachunk* c) { ! assert_lock_strong(MetaspaceExpand_lock); ! _free_chunks_count ++; ! _free_chunks_total += c->word_size(); ! } ! // Update internal accounting after a chunk was removed ! void ChunkManager::account_for_removed_chunk(const Metachunk* c) { ! assert_lock_strong(MetaspaceExpand_lock); ! assert(_free_chunks_count >= 1, ! "ChunkManager::_free_chunks_count: about to go negative (" SIZE_FORMAT ").", _free_chunks_count); ! assert(_free_chunks_total >= c->word_size(), ! "ChunkManager::_free_chunks_total: about to go negative" ! "(now: " SIZE_FORMAT ", decrement value: " SIZE_FORMAT ").", _free_chunks_total, c->word_size()); ! _free_chunks_count --; ! _free_chunks_total -= c->word_size(); ! } ! ! ChunkIndex ChunkManager::list_index(size_t size) { ! return get_chunk_type_by_size(size, is_class()); ! } ! ! size_t ChunkManager::size_by_index(ChunkIndex index) const { ! index_bounds_check(index); ! assert(index != HumongousIndex, "Do not call for humongous chunks."); ! return get_size_for_nonhumongous_chunktype(index, is_class()); ! } - #ifdef ASSERT - void ChunkManager::verify(bool slow) const { - MutexLocker cl(MetaspaceExpand_lock, - Mutex::_no_safepoint_check_flag); - locked_verify(slow); } ! void ChunkManager::locked_verify(bool slow) const { ! log_trace(gc, metaspace, freelist)("verifying %s chunkmanager (%s).", ! (is_class() ? "class space" : "metaspace"), (slow ? "slow" : "quick")); ! assert_lock_strong(MetaspaceExpand_lock); ! size_t chunks_counted = 0; ! size_t wordsize_chunks_counted = 0; ! for (ChunkIndex i = ZeroIndex; i < NumberOfFreeLists; i = next_chunk_index(i)) { ! const ChunkList* list = _free_chunks + i; ! if (list != NULL) { ! Metachunk* chunk = list->head(); ! while (chunk) { ! if (slow) { ! do_verify_chunk(chunk); ! } ! assert(chunk->is_tagged_free(), "Chunk should be tagged as free."); ! chunks_counted ++; ! wordsize_chunks_counted += chunk->size(); ! chunk = chunk->next(); } } } ! chunks_counted += humongous_dictionary()->total_free_blocks(); ! wordsize_chunks_counted += humongous_dictionary()->total_size(); ! ! assert(chunks_counted == _free_chunks_count && wordsize_chunks_counted == _free_chunks_total, ! "freelist accounting mismatch: " ! "we think: " SIZE_FORMAT " chunks, total " SIZE_FORMAT " words, " ! "reality: " SIZE_FORMAT " chunks, total " SIZE_FORMAT " words.", ! _free_chunks_count, _free_chunks_total, ! chunks_counted, wordsize_chunks_counted); ! } ! #endif // ASSERT ! void ChunkManager::locked_print_free_chunks(outputStream* st) { ! assert_lock_strong(MetaspaceExpand_lock); ! st->print_cr("Free chunk total " SIZE_FORMAT " count " SIZE_FORMAT, ! _free_chunks_total, _free_chunks_count); ! } ! ChunkList* ChunkManager::free_chunks(ChunkIndex index) { ! assert(index == SpecializedIndex || index == SmallIndex || index == MediumIndex, ! "Bad index: %d", (int)index); ! return &_free_chunks[index]; ! } ! ! ChunkList* ChunkManager::find_free_chunks_list(size_t word_size) { ! ChunkIndex index = list_index(word_size); ! assert(index < HumongousIndex, "No humongous list"); ! return free_chunks(index); ! } ! ! // Helper for chunk splitting: given a target chunk size and a larger free chunk, ! // split up the larger chunk into n smaller chunks, at least one of which should be ! // the target chunk of target chunk size. The smaller chunks, including the target ! // chunk, are returned to the freelist. The pointer to the target chunk is returned. ! // Note that this chunk is supposed to be removed from the freelist right away. ! Metachunk* ChunkManager::split_chunk(size_t target_chunk_word_size, Metachunk* larger_chunk) { ! assert(larger_chunk->word_size() > target_chunk_word_size, "Sanity"); ! ! const ChunkIndex larger_chunk_index = larger_chunk->get_chunk_type(); ! const ChunkIndex target_chunk_index = get_chunk_type_by_size(target_chunk_word_size, is_class()); ! ! MetaWord* const region_start = (MetaWord*)larger_chunk; ! const size_t region_word_len = larger_chunk->word_size(); ! MetaWord* const region_end = region_start + region_word_len; ! VirtualSpaceNode* const vsn = larger_chunk->container(); ! OccupancyMap* const ocmap = vsn->occupancy_map(); ! ! // Any larger non-humongous chunk size is a multiple of any smaller chunk size. ! // Since non-humongous chunks are aligned to their chunk size, the larger chunk should start ! // at an address suitable to place the smaller target chunk. ! assert_is_aligned(region_start, target_chunk_word_size); ! ! // Remove old chunk. ! free_chunks(larger_chunk_index)->remove_chunk(larger_chunk); ! larger_chunk->remove_sentinel(); ! ! // Prevent access to the old chunk from here on. ! larger_chunk = NULL; ! // ... and wipe it. ! DEBUG_ONLY(memset(region_start, 0xfe, region_word_len * BytesPerWord)); ! ! // In its place create first the target chunk... ! MetaWord* p = region_start; ! Metachunk* target_chunk = ::new (p) Metachunk(target_chunk_index, is_class(), target_chunk_word_size, vsn); ! assert(target_chunk == (Metachunk*)p, "Sanity"); ! target_chunk->set_origin(origin_split); ! ! // Note: we do not need to mark its start in the occupancy map ! // because it coincides with the old chunk start. ! ! // Mark chunk as free and return to the freelist. ! do_update_in_use_info_for_chunk(target_chunk, false); ! free_chunks(target_chunk_index)->return_chunk_at_head(target_chunk); ! ! // This chunk should now be valid and can be verified. ! DEBUG_ONLY(do_verify_chunk(target_chunk)); ! ! // In the remaining space create the remainder chunks. ! p += target_chunk->word_size(); ! assert(p < region_end, "Sanity"); ! ! while (p < region_end) { ! ! // Find the largest chunk size which fits the alignment requirements at address p. ! ChunkIndex this_chunk_index = prev_chunk_index(larger_chunk_index); ! size_t this_chunk_word_size = 0; ! for(;;) { ! this_chunk_word_size = get_size_for_nonhumongous_chunktype(this_chunk_index, is_class()); ! if (is_aligned(p, this_chunk_word_size * BytesPerWord)) { ! break; } else { ! this_chunk_index = prev_chunk_index(this_chunk_index); ! assert(this_chunk_index >= target_chunk_index, "Sanity"); } } ! assert(this_chunk_word_size >= target_chunk_word_size, "Sanity"); ! assert(is_aligned(p, this_chunk_word_size * BytesPerWord), "Sanity"); ! assert(p + this_chunk_word_size <= region_end, "Sanity"); ! // Create splitting chunk. ! Metachunk* this_chunk = ::new (p) Metachunk(this_chunk_index, is_class(), this_chunk_word_size, vsn); ! assert(this_chunk == (Metachunk*)p, "Sanity"); ! this_chunk->set_origin(origin_split); ! ocmap->set_chunk_starts_at_address(p, true); ! do_update_in_use_info_for_chunk(this_chunk, false); ! // This chunk should be valid and can be verified. ! DEBUG_ONLY(do_verify_chunk(this_chunk)); ! // Return this chunk to freelist and correct counter. ! free_chunks(this_chunk_index)->return_chunk_at_head(this_chunk); ! _free_chunks_count ++; ! log_trace(gc, metaspace, freelist)("Created chunk at " PTR_FORMAT ", word size " ! SIZE_FORMAT_HEX " (%s), in split region [" PTR_FORMAT "..." PTR_FORMAT ").", ! p2i(this_chunk), this_chunk->word_size(), chunk_size_name(this_chunk_index), ! p2i(region_start), p2i(region_end)); ! p += this_chunk_word_size; ! } ! // Note: at this point, the VirtualSpaceNode is invalid since we split a chunk and ! // did not yet hand out part of that split; so, vsn->verify_free_chunks_are_ideally_merged() ! // would assert. Instead, do all verifications in the caller. ! DEBUG_ONLY(g_internal_statistics.num_chunk_splits ++); ! return target_chunk; ! } ! Metachunk* ChunkManager::free_chunks_get(size_t word_size) { ! assert_lock_strong(MetaspaceExpand_lock); ! Metachunk* chunk = NULL; ! bool we_did_split_a_chunk = false; ! if (list_index(word_size) != HumongousIndex) { ! ChunkList* free_list = find_free_chunks_list(word_size); ! assert(free_list != NULL, "Sanity check"); ! chunk = free_list->head(); - if (chunk == NULL) { - // Split large chunks into smaller chunks if there are no smaller chunks, just large chunks. - // This is the counterpart of the coalescing-upon-chunk-return. ! ChunkIndex target_chunk_index = get_chunk_type_by_size(word_size, is_class()); ! // Is there a larger chunk we could split? ! Metachunk* larger_chunk = NULL; ! ChunkIndex larger_chunk_index = next_chunk_index(target_chunk_index); ! while (larger_chunk == NULL && larger_chunk_index < NumberOfFreeLists) { ! larger_chunk = free_chunks(larger_chunk_index)->head(); ! if (larger_chunk == NULL) { ! larger_chunk_index = next_chunk_index(larger_chunk_index); ! } ! } ! if (larger_chunk != NULL) { ! assert(larger_chunk->word_size() > word_size, "Sanity"); ! assert(larger_chunk->get_chunk_type() == larger_chunk_index, "Sanity"); ! // We found a larger chunk. Lets split it up: ! // - remove old chunk ! // - in its place, create new smaller chunks, with at least one chunk ! // being of target size, the others sized as large as possible. This ! // is to make sure the resulting chunks are "as coalesced as possible" ! // (similar to VirtualSpaceNode::retire()). ! // Note: during this operation both ChunkManager and VirtualSpaceNode ! // are temporarily invalid, so be careful with asserts. ! log_trace(gc, metaspace, freelist)("%s: splitting chunk " PTR_FORMAT ! ", word size " SIZE_FORMAT_HEX " (%s), to get a chunk of word size " SIZE_FORMAT_HEX " (%s)...", ! (is_class() ? "class space" : "metaspace"), p2i(larger_chunk), larger_chunk->word_size(), ! chunk_size_name(larger_chunk_index), word_size, chunk_size_name(target_chunk_index)); ! chunk = split_chunk(word_size, larger_chunk); ! // This should have worked. ! assert(chunk != NULL, "Sanity"); ! assert(chunk->word_size() == word_size, "Sanity"); ! assert(chunk->is_tagged_free(), "Sanity"); ! we_did_split_a_chunk = true; ! } } ! if (chunk == NULL) { ! return NULL; ! } ! // Remove the chunk as the head of the list. ! free_list->remove_chunk(chunk); ! log_trace(gc, metaspace, freelist)("ChunkManager::free_chunks_get: free_list: " PTR_FORMAT " chunks left: " SSIZE_FORMAT ".", ! p2i(free_list), free_list->count()); ! } else { ! chunk = humongous_dictionary()->get_chunk(word_size); - if (chunk == NULL) { - return NULL; } ! log_trace(gc, metaspace, alloc)("Free list allocate humongous chunk size " SIZE_FORMAT " for requested size " SIZE_FORMAT " waste " SIZE_FORMAT, ! chunk->word_size(), word_size, chunk->word_size() - word_size); } ! // Chunk has been removed from the chunk manager; update counters. ! account_for_removed_chunk(chunk); ! do_update_in_use_info_for_chunk(chunk, true); ! chunk->container()->inc_container_count(); ! chunk->inc_use_count(); ! // Remove it from the links to this freelist ! chunk->set_next(NULL); ! chunk->set_prev(NULL); ! // Run some verifications (some more if we did a chunk split) ! #ifdef ASSERT ! EVERY_NTH(VerifyMetaspaceInterval) ! // Be extra verify-y when chunk split happened. ! locked_verify(true); ! VirtualSpaceNode* const vsn = chunk->container(); ! vsn->verify(true); ! if (we_did_split_a_chunk) { ! vsn->verify_free_chunks_are_ideally_merged(); } ! END_EVERY_NTH ! g_internal_statistics.num_chunks_removed_from_freelist ++; ! #endif ! return chunk; ! } ! Metachunk* ChunkManager::chunk_freelist_allocate(size_t word_size) { ! assert_lock_strong(MetaspaceExpand_lock); ! // Take from the beginning of the list ! Metachunk* chunk = free_chunks_get(word_size); ! if (chunk == NULL) { ! return NULL; } ! assert((word_size <= chunk->word_size()) || ! (list_index(chunk->word_size()) == HumongousIndex), ! "Non-humongous variable sized chunk"); ! LogTarget(Trace, gc, metaspace, freelist) lt; ! if (lt.is_enabled()) { ! size_t list_count; ! if (list_index(word_size) < HumongousIndex) { ! ChunkList* list = find_free_chunks_list(word_size); ! list_count = list->count(); } else { ! list_count = humongous_dictionary()->total_count(); ! } LogStream ls(lt); ! ls.print("ChunkManager::chunk_freelist_allocate: " PTR_FORMAT " chunk " PTR_FORMAT " size " SIZE_FORMAT " count " SIZE_FORMAT " ", ! p2i(this), p2i(chunk), chunk->word_size(), list_count); ! ResourceMark rm; ! locked_print_free_chunks(&ls); } - return chunk; } ! void ChunkManager::return_single_chunk(Metachunk* chunk) { ! #ifdef ASSERT ! EVERY_NTH(VerifyMetaspaceInterval) ! this->locked_verify(false); ! do_verify_chunk(chunk); ! END_EVERY_NTH ! #endif ! const ChunkIndex index = chunk->get_chunk_type(); ! assert_lock_strong(MetaspaceExpand_lock); ! DEBUG_ONLY(g_internal_statistics.num_chunks_added_to_freelist ++;) ! assert(chunk != NULL, "Expected chunk."); ! assert(chunk->container() != NULL, "Container should have been set."); ! assert(chunk->is_tagged_free() == false, "Chunk should be in use."); ! index_bounds_check(index); ! ! // Note: mangle *before* returning the chunk to the freelist or dictionary. It does not ! // matter for the freelist (non-humongous chunks), but the humongous chunk dictionary ! // keeps tree node pointers in the chunk payload area which mangle will overwrite. ! DEBUG_ONLY(chunk->mangle(badMetaWordVal);) ! ! // may need node for verification later after chunk may have been merged away. ! DEBUG_ONLY(VirtualSpaceNode* vsn = chunk->container(); ) ! ! if (index != HumongousIndex) { ! // Return non-humongous chunk to freelist. ! ChunkList* list = free_chunks(index); ! assert(list->size() == chunk->word_size(), "Wrong chunk type."); ! list->return_chunk_at_head(chunk); ! log_trace(gc, metaspace, freelist)("returned one %s chunk at " PTR_FORMAT " to freelist.", ! chunk_size_name(index), p2i(chunk)); ! } else { ! // Return humongous chunk to dictionary. ! assert(chunk->word_size() > free_chunks(MediumIndex)->size(), "Wrong chunk type."); ! assert(chunk->word_size() % free_chunks(SpecializedIndex)->size() == 0, ! "Humongous chunk has wrong alignment."); ! _humongous_dictionary.return_chunk(chunk); ! log_trace(gc, metaspace, freelist)("returned one %s chunk at " PTR_FORMAT " (word size " SIZE_FORMAT ") to freelist.", ! chunk_size_name(index), p2i(chunk), chunk->word_size()); ! } ! chunk->container()->dec_container_count(); ! do_update_in_use_info_for_chunk(chunk, false); ! // Chunk has been added; update counters. ! account_for_added_chunk(chunk); ! // Attempt coalesce returned chunks with its neighboring chunks: ! // if this chunk is small or special, attempt to coalesce to a medium chunk. ! if (index == SmallIndex || index == SpecializedIndex) { ! if (!attempt_to_coalesce_around_chunk(chunk, MediumIndex)) { ! // This did not work. But if this chunk is special, we still may form a small chunk? ! if (index == SpecializedIndex) { ! if (!attempt_to_coalesce_around_chunk(chunk, SmallIndex)) { ! // give up. ! } ! } ! } } ! // From here on do not access chunk anymore, it may have been merged with another chunk. #ifdef ASSERT - EVERY_NTH(VerifyMetaspaceInterval) - this->locked_verify(true); - vsn->verify(true); - vsn->verify_free_chunks_are_ideally_merged(); - END_EVERY_NTH - #endif } ! void ChunkManager::return_chunk_list(Metachunk* chunks) { ! if (chunks == NULL) { ! return; ! } ! LogTarget(Trace, gc, metaspace, freelist) log; ! if (log.is_enabled()) { // tracing ! log.print("returning list of chunks..."); ! } ! unsigned num_chunks_returned = 0; ! size_t size_chunks_returned = 0; ! Metachunk* cur = chunks; ! while (cur != NULL) { ! // Capture the next link before it is changed ! // by the call to return_chunk_at_head(); ! Metachunk* next = cur->next(); ! if (log.is_enabled()) { // tracing ! num_chunks_returned ++; ! size_chunks_returned += cur->word_size(); ! } ! return_single_chunk(cur); ! cur = next; ! } ! if (log.is_enabled()) { // tracing ! log.print("returned %u chunks to freelist, total word size " SIZE_FORMAT ".", ! num_chunks_returned, size_chunks_returned); ! } } ! void ChunkManager::collect_statistics(ChunkManagerStatistics* out) const { ! MutexLocker cl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! for (ChunkIndex i = ZeroIndex; i < NumberOfInUseLists; i = next_chunk_index(i)) { ! out->chunk_stats(i).add(num_free_chunks(i), size_free_chunks_in_bytes(i) / sizeof(MetaWord)); ! } } ! } // namespace metaspace --- 20,479 ---- * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA * or visit www.oracle.com if you need additional information or have any * questions. * */ + #include "precompiled.hpp" + #include "logging/log.hpp" #include "logging/logStream.hpp" ! #include "memory/metaspace/arenaGrowthPolicy.hpp" ! #include "memory/metaspace/chunkLevel.hpp" #include "memory/metaspace/chunkManager.hpp" + #include "memory/metaspace/internStat.hpp" #include "memory/metaspace/metachunk.hpp" #include "memory/metaspace/metaspaceCommon.hpp" + #include "memory/metaspace/metaspaceContext.hpp" #include "memory/metaspace/metaspaceStatistics.hpp" ! #include "memory/metaspace/settings.hpp" #include "memory/metaspace/virtualSpaceNode.hpp" + #include "memory/metaspace/virtualSpaceList.hpp" #include "runtime/mutexLocker.hpp" #include "utilities/debug.hpp" #include "utilities/globalDefinitions.hpp" namespace metaspace { ! #define LOGFMT "ChkMgr @" PTR_FORMAT " (%s)" ! #define LOGFMT_ARGS p2i(this), this->_name ! // Return a single chunk to the freelist and adjust accounting. No merge is attempted. ! void ChunkManager::return_chunk_simple_locked(Metachunk* c) { ! ! assert_lock_strong(MetaspaceExpand_lock); ! ! DEBUG_ONLY(c->verify(false)); ! ! const chunklevel_t lvl = c->level(); ! _chunks.add(c); ! c->reset_used_words(); ! ! // Tracing ! log_debug(metaspace)("ChunkManager %s: returned chunk " METACHUNK_FORMAT ".", ! _name, METACHUNK_FORMAT_ARGS(c)); } ! // Creates a chunk manager with a given name (which is for debug purposes only) ! // and an associated space list which will be used to request new chunks from ! // (see get_chunk()) ! ChunkManager::ChunkManager(const char* name, VirtualSpaceList* space_list) ! : _vslist(space_list), ! _name(name), ! _chunks() ! { ! } ! ! // Given a chunk, split it into a target chunk of a smaller size (higher target level) ! // and at least one, possible several splinter chunks. ! // The original chunk must be outside of the freelist and its state must be free. ! // The splinter chunks are added to the freelist. ! // The resulting target chunk will be located at the same address as the original ! // chunk, but it will of course be smaller (of a higher level). ! // The committed areas within the original chunk carry over to the resulting ! // chunks. ! void ChunkManager::split_chunk_and_add_splinters(Metachunk* c, chunklevel_t target_level) { ! assert_lock_strong(MetaspaceExpand_lock); ! assert(c->is_free(), "chunk to be split must be free."); ! assert(c->level() < target_level, "Target level must be higher than current level."); ! assert(c->prev() == NULL && c->next() == NULL, "Chunk must be outside of any list."); ! DEBUG_ONLY(chunklevel::check_valid_level(target_level);) ! DEBUG_ONLY(c->verify(true);) ! UL2(debug, "splitting chunk " METACHUNK_FORMAT " to " CHKLVL_FORMAT ".", ! METACHUNK_FORMAT_ARGS(c), target_level); ! DEBUG_ONLY(size_t committed_words_before = c->committed_words();) ! const chunklevel_t orig_level = c->level(); ! c->vsnode()->split(target_level, c, &_chunks); ! ! // Splitting should never fail. ! assert(c->level() == target_level, "Sanity"); ! // The size of the committed portion should not change (subject to the reduced chunk size of course) ! #ifdef ASSERT ! if (committed_words_before > c->word_size()) { ! assert(c->is_fully_committed(), "Sanity"); ! } else { ! assert(c->committed_words() == committed_words_before, "Sanity"); } ! #endif ! DEBUG_ONLY(c->verify(false)); ! DEBUG_ONLY(verify_locked(true);) ! ! SOMETIMES(c->vsnode()->verify_locked(true);) ! ! InternalStats::inc_num_chunk_splits(); } ! // On success, returns a chunk of level of <preferred_level>, but at most <max_level>. ! // The first first <min_committed_words> of the chunk are guaranteed to be committed. ! // On error, will return NULL. ! // ! // This function may fail for two reasons: ! // - Either we are unable to reserve space for a new chunk (if the underlying VirtualSpaceList ! // is non-expandable but needs expanding - aka out of compressed class space). ! // - Or, if the necessary space cannot be committed because we hit a commit limit. ! // This may be either the GC threshold or MaxMetaspaceSize. ! Metachunk* ChunkManager::get_chunk(chunklevel_t preferred_level, chunklevel_t max_level, size_t min_committed_words) { ! assert(preferred_level <= max_level, "Sanity"); ! assert(chunklevel::level_fitting_word_size(min_committed_words) >= max_level, "Sanity"); ! ! MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! DEBUG_ONLY(verify_locked(false);) ! ! DEBUG_ONLY(chunklevel::check_valid_level(max_level);) ! DEBUG_ONLY(chunklevel::check_valid_level(preferred_level);) ! assert(max_level >= preferred_level, "invalid level."); ! ! UL2(debug, "requested chunk: pref_level: " CHKLVL_FORMAT ! ", max_level: " CHKLVL_FORMAT ", min committed size: " SIZE_FORMAT ".", ! preferred_level, max_level, min_committed_words); ! ! // First, optimistically look for a chunk which is already committed far enough to hold min_word_size. ! ! // 1) Search best or smaller committed chunks (first attempt): ! // Start at the preferred chunk size and work your way down (level up). ! // But for now, only consider chunks larger than a certain threshold - ! // this is to prevent large loaders (eg boot) from unnecessarily gobbling up ! // all the tiny splinter chunks lambdas leave around. ! Metachunk* c = NULL; ! c = _chunks.search_chunk_ascending(preferred_level, MIN2((chunklevel_t)(preferred_level + 2), max_level), min_committed_words); ! ! // 2) Search larger committed chunks: ! // If that did not yield anything, look at larger chunks, which may be committed. We would have to split ! // them first, of course. ! if (c == NULL) { ! c = _chunks.search_chunk_descending(preferred_level, min_committed_words); } + + // 3) Search best or smaller committed chunks (second attempt): + // Repeat (1) but now consider even the tiniest chunks as long as they are large enough to hold the + // committed min size. + if (c == NULL) { + c = _chunks.search_chunk_ascending(preferred_level, max_level, min_committed_words); } + + // if we did not get anything yet, there are no free chunks commmitted enough. Repeat search but look for uncommitted chunks too: + + // 4) Search best or smaller chunks, can be uncommitted: + if (c == NULL) { + c = _chunks.search_chunk_ascending(preferred_level, max_level, 0); } ! // 5) Search a larger uncommitted chunk: ! if (c == NULL) { ! c = _chunks.search_chunk_descending(preferred_level, 0); ! } ! if (c != NULL) { ! UL(trace, "taken from freelist."); ! } ! // Failing all that, allocate a new root chunk from the connected virtual space. ! // This may fail if the underlying vslist cannot be expanded (e.g. compressed class space) ! if (c == NULL) { ! c = _vslist->allocate_root_chunk(); ! if (c == NULL) { ! UL(info, "failed to get new root chunk."); } else { ! assert(c->level() == chunklevel::ROOT_CHUNK_LEVEL, "root chunk expected"); ! UL(debug, "allocated new root chunk."); } } ! if (c == NULL) { ! // If we end up here, we found no match in the freelists and were unable to get a new ! // root chunk (so we used up all address space, e.g. out of CompressedClassSpace). ! UL2(info, "failed to get chunk (preferred level: " CHKLVL_FORMAT ! ", max level " CHKLVL_FORMAT ".", preferred_level, max_level); ! c = NULL; ! } ! if (c != NULL) { ! // Now we have a chunk. ! // It may be larger than what the caller wanted, so we may want to split it. This should ! // always work. ! if (c->level() < preferred_level) { ! split_chunk_and_add_splinters(c, preferred_level); ! assert(c->level() == preferred_level, "split failed?"); ! } ! // Attempt to commit the chunk (depending on settings, we either fully commit it or just ! // commit enough to get the caller going). That may fail if we hit a commit limit. In ! // that case put the chunk back to the freelist (re-merging it with its neighbors if we ! // did split it) and return NULL. ! const size_t to_commit = Settings::new_chunks_are_fully_committed() ? c->word_size() : min_committed_words; ! if (c->committed_words() < to_commit) { ! if (c->ensure_committed_locked(to_commit) == false) { ! UL2(info, "failed to commit " SIZE_FORMAT " words on chunk " METACHUNK_FORMAT ".", ! to_commit, METACHUNK_FORMAT_ARGS(c)); ! c->set_in_use(); // gets asserted in return_chunk(). ! return_chunk_locked(c); ! c = NULL; ! } ! } ! if (c != NULL) { ! // Still here? We have now a good chunk, all is well. ! assert(c->committed_words() >= min_committed_words, "Sanity"); ! // Any chunk returned from ChunkManager shall be marked as in use. ! c->set_in_use(); ! UL2(debug, "handing out chunk " METACHUNK_FORMAT ".", METACHUNK_FORMAT_ARGS(c)); ! InternalStats::inc_num_chunks_taken_from_freelist(); ! SOMETIMES(c->vsnode()->verify_locked(true);) ! } ! } ! DEBUG_ONLY(verify_locked(false);) ! return c; ! } ! // Return a single chunk to the ChunkManager and adjust accounting. May merge chunk ! // with neighbors. ! // As a side effect this removes the chunk from whatever list it has been in previously. ! // Happens after a Classloader was unloaded and releases its metaspace chunks. ! // !! Note: this may invalidate the chunk. Do not access the chunk after ! // this function returns !! ! void ChunkManager::return_chunk(Metachunk* c) { ! MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! return_chunk_locked(c); ! } ! // See return_chunk(). ! void ChunkManager::return_chunk_locked(Metachunk* c) { ! assert_lock_strong(MetaspaceExpand_lock); ! UL2(debug, ": returning chunk " METACHUNK_FORMAT ".", METACHUNK_FORMAT_ARGS(c)); ! DEBUG_ONLY(c->verify(true);) ! assert(contains_chunk(c) == false, "A chunk to be added to the freelist must not be in the freelist already."); ! assert(c->is_in_use(), "Unexpected chunk state"); ! assert(!c->in_list(), "Remove from list first"); ! c->set_free(); ! c->reset_used_words(); ! const chunklevel_t orig_lvl = c->level(); ! Metachunk* merged = NULL; ! if (!c->is_root_chunk()) { ! // Only attempt merging if we are not of the lowest level already. ! merged = c->vsnode()->merge(c, &_chunks); } ! if (merged != NULL) { ! InternalStats::inc_num_chunk_merges(); ! DEBUG_ONLY(merged->verify(false)); ! // We did merge our chunk into a different chunk. ! ! // We did merge chunks and now have a bigger chunk. ! assert(merged->level() < orig_lvl, "Sanity"); ! ! UL2(debug, "merged into chunk " METACHUNK_FORMAT ".", METACHUNK_FORMAT_ARGS(merged)); ! ! c = merged; } ! if (Settings::uncommit_free_chunks() && ! c->word_size() >= Settings::commit_granule_words()) ! { ! UL2(debug, "uncommitting free chunk " METACHUNK_FORMAT ".", METACHUNK_FORMAT_ARGS(c)); ! c->uncommit_locked(); } ! return_chunk_simple_locked(c); ! DEBUG_ONLY(verify_locked(false);) ! SOMETIMES(c->vsnode()->verify_locked(true);) ! InternalStats::inc_num_chunks_returned_to_freelist(); ! ! } ! // Given a chunk c, whose state must be "in-use" and must not be a root chunk, attempt to ! // enlarge it in place by claiming its trailing buddy. ! // ! // This will only work if c is the leader of the buddy pair and the trailing buddy is free. ! // ! // If successful, the follower chunk will be removed from the freelists, the leader chunk c will ! // double in size (level decreased by one). ! // ! // On success, true is returned, false otherwise. ! bool ChunkManager::attempt_enlarge_chunk(Metachunk* c) { ! MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! return c->vsnode()->attempt_enlarge_chunk(c, &_chunks); ! } ! ! static void print_word_size_delta(outputStream* st, size_t word_size_1, size_t word_size_2) { ! if (word_size_1 == word_size_2) { ! print_scaled_words(st, word_size_1); ! st->print (" (no change)"); ! } else { ! print_scaled_words(st, word_size_1); ! st->print("->"); ! print_scaled_words(st, word_size_2); ! st->print(" ("); ! if (word_size_2 <= word_size_1) { ! st->print("-"); ! print_scaled_words(st, word_size_1 - word_size_2); ! } else { ! st->print("+"); ! print_scaled_words(st, word_size_2 - word_size_1); } ! st->print(")"); ! } ! } ! void ChunkManager::purge() { ! MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! UL(info, ": reclaiming memory..."); ! const size_t reserved_before = _vslist->reserved_words(); ! const size_t committed_before = _vslist->committed_words(); ! int num_nodes_purged = 0; ! ! // 1) purge virtual space list ! num_nodes_purged = _vslist->purge(&_chunks); ! InternalStats::inc_num_purges(); ! // 2) uncommit free chunks ! if (Settings::uncommit_free_chunks()) { ! const chunklevel_t max_level = ! chunklevel::level_fitting_word_size(Settings::commit_granule_words()); ! for (chunklevel_t l = chunklevel::LOWEST_CHUNK_LEVEL; ! l <= max_level; ! l ++) ! { ! // Since we uncommit all chunks at this level, we do not break the "committed chunks are ! // at the front of the list" condition. ! for (Metachunk* c = _chunks.first_at_level(l); c != NULL; c = c->next()) { ! c->uncommit_locked(); ! } ! } } ! const size_t reserved_after = _vslist->reserved_words(); ! const size_t committed_after = _vslist->committed_words(); ! ! // Print a nice report. ! if (reserved_after == reserved_before && committed_after == committed_before) { ! UL(info, "nothing reclaimed."); } else { ! LogTarget(Info, metaspace) lt; ! if (lt.is_enabled()) { LogStream ls(lt); ! ls.print_cr(LOGFMT ": finished reclaiming memory: ", LOGFMT_ARGS); ! ! ls.print("reserved: "); ! print_word_size_delta(&ls, reserved_before, reserved_after); ! ls.cr(); ! ! ls.print("committed: "); ! print_word_size_delta(&ls, committed_before, committed_after); ! ls.cr(); ! ! ls.print_cr("full nodes purged: %d", num_nodes_purged); } + } + + DEBUG_ONLY(_vslist->verify_locked(true)); + DEBUG_ONLY(verify_locked(true)); } ! // Convenience methods to return the global class-space chunkmanager ! // and non-class chunkmanager, respectively. ! ChunkManager* ChunkManager::chunkmanager_class() { ! return MetaspaceContext::context_class() == NULL ? NULL : MetaspaceContext::context_class()->cm(); ! } ! ChunkManager* ChunkManager::chunkmanager_nonclass() { ! return MetaspaceContext::context_nonclass() == NULL ? NULL : MetaspaceContext::context_nonclass()->cm(); ! } ! // Update statistics. ! void ChunkManager::add_to_statistics(cm_stats_t* out) const { ! MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); ! for (chunklevel_t l = chunklevel::ROOT_CHUNK_LEVEL; l <= chunklevel::HIGHEST_CHUNK_LEVEL; l ++) { ! out->num_chunks[l] += _chunks.num_chunks_at_level(l); ! out->committed_word_size[l] += _chunks.committed_word_size_at_level(l); } ! DEBUG_ONLY(out->verify();) ! ! } #ifdef ASSERT + void ChunkManager::verify(bool slow) const { + MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); + verify_locked(slow); } ! void ChunkManager::verify_locked(bool slow) const { ! assert_lock_strong(MetaspaceExpand_lock); ! assert(_vslist != NULL, "No vslist"); ! _chunks.verify(); } ! bool ChunkManager::contains_chunk(Metachunk* c) const { ! return _chunks.contains(c); } ! #endif // ASSERT + void ChunkManager::print_on(outputStream* st) const { + MutexLocker fcl(MetaspaceExpand_lock, Mutex::_no_safepoint_check_flag); + print_on_locked(st); + } + void ChunkManager::print_on_locked(outputStream* st) const { + assert_lock_strong(MetaspaceExpand_lock); + st->print_cr("cm %s: %d chunks, total word size: " SIZE_FORMAT ", committed word size: " SIZE_FORMAT, _name, + total_num_chunks(), total_word_size(), _chunks.committed_word_size()); + _chunks.print_on(st); + } + } // namespace metaspace
< prev index next >