< prev index next > src/hotspot/share/memory/metaspace/blockTree.hpp
Print this page
// Given a word_size, search and return the smallest block that is equal or
// larger than that size. Upon return, *p_real_word_size contains the actual
// block size.
MetaWord* remove_block(size_t word_size, size_t* p_real_word_size) {
! assert(word_size >= MinWordSize, "invalid block size " SIZE_FORMAT, word_size);
Node* n = find_closest_fit(word_size);
if (n != nullptr) {
DEBUG_ONLY(check_node(n);)
// Given a word_size, search and return the smallest block that is equal or
// larger than that size. Upon return, *p_real_word_size contains the actual
// block size.
MetaWord* remove_block(size_t word_size, size_t* p_real_word_size) {
! assert(word_size > 0, "invalid block size " SIZE_FORMAT, word_size);
Node* n = find_closest_fit(word_size);
if (n != nullptr) {
DEBUG_ONLY(check_node(n);)
< prev index next >