< prev index next >

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

Print this page
rev 57380 : [mq]: metaspace-improvement


   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 

  25 #include "precompiled.hpp"
  26 #include "memory/allocation.hpp"



  27 #include "memory/metaspace/metachunk.hpp"
  28 #include "memory/metaspace/occupancyMap.hpp"
  29 #include "memory/metaspace/virtualSpaceNode.hpp"

  30 #include "utilities/align.hpp"
  31 #include "utilities/copy.hpp"
  32 #include "utilities/debug.hpp"
  33 
  34 namespace metaspace {
  35 
  36 size_t Metachunk::object_alignment() {
  37   // Must align pointers and sizes to 8,
  38   // so that 64 bit types get correctly aligned.
  39   const size_t alignment = 8;
  40 
  41   // Make sure that the Klass alignment also agree.
  42   STATIC_ASSERT(alignment == (size_t)KlassAlignmentInBytes);
  43 
  44   return alignment;
  45 }
  46 
  47 size_t Metachunk::overhead() {
  48   return align_up(sizeof(Metachunk), object_alignment()) / BytesPerWord;



  49 }
  50 
  51 // Metachunk methods














  52 
  53 Metachunk::Metachunk(ChunkIndex chunktype, bool is_class, size_t word_size,
  54                      VirtualSpaceNode* container)
  55     : Metabase<Metachunk>(word_size),
  56     _container(container),
  57     _top(NULL),
  58     _sentinel(CHUNK_SENTINEL),
  59     _chunk_type(chunktype),
  60     _is_class(is_class),
  61     _origin(origin_normal),
  62     _use_count(0)
  63 {
  64   _top = initial_top();
  65   set_is_tagged_free(false);
  66 #ifdef ASSERT
  67   mangle(uninitMetaWordVal);
  68   verify();
  69 #endif
  70 }

  71 
  72 MetaWord* Metachunk::allocate(size_t word_size) {
  73   MetaWord* result = NULL;
  74   // If available, bump the pointer to allocate.
  75   if (free_word_size() >= word_size) {
  76     result = _top;
  77     _top = _top + word_size;
  78   }
  79   return result;
  80 }
  81 
  82 // _bottom points to the start of the chunk including the overhead.
  83 size_t Metachunk::used_word_size() const {
  84   return pointer_delta(_top, bottom(), sizeof(MetaWord));
  85 }
  86 
  87 size_t Metachunk::free_word_size() const {
  88   return pointer_delta(end(), _top, sizeof(MetaWord));
  89 }
  90 
  91 void Metachunk::print_on(outputStream* st) const {
  92   st->print_cr("Metachunk:"
  93                " bottom " PTR_FORMAT " top " PTR_FORMAT
  94                " end " PTR_FORMAT " size " SIZE_FORMAT " (%s)",
  95                p2i(bottom()), p2i(_top), p2i(end()), word_size(),
  96                chunk_size_name(get_chunk_type()));
  97   if (Verbose) {
  98     st->print_cr("    used " SIZE_FORMAT " free " SIZE_FORMAT,
  99                  used_word_size(), free_word_size());
 100   }
 101 }
 102 
 103 #ifdef ASSERT
 104 void Metachunk::mangle(juint word_value) {
 105   // Overwrite the payload of the chunk and not the links that
 106   // maintain list of chunks.
 107   HeapWord* start = (HeapWord*)initial_top();
 108   size_t size = word_size() - overhead();
 109   Copy::fill_to_words(start, size, word_value);
 110 }
 111 
 112 void Metachunk::verify() const {
 113   assert(is_valid_sentinel(), "Chunk " PTR_FORMAT ": sentinel invalid", p2i(this));
 114   const ChunkIndex chunk_type = get_chunk_type();
 115   assert(is_valid_chunktype(chunk_type), "Chunk " PTR_FORMAT ": Invalid chunk type.", p2i(this));
 116   if (chunk_type != HumongousIndex) {
 117     assert(word_size() == get_size_for_nonhumongous_chunktype(chunk_type, is_class()),
 118            "Chunk " PTR_FORMAT ": wordsize " SIZE_FORMAT " does not fit chunk type %s.",
 119            p2i(this), word_size(), chunk_size_name(chunk_type));
 120   }
 121   assert(is_valid_chunkorigin(get_origin()), "Chunk " PTR_FORMAT ": Invalid chunk origin.", p2i(this));
 122   assert(bottom() <= _top && _top <= (MetaWord*)end(),
 123          "Chunk " PTR_FORMAT ": Chunk top out of chunk bounds.", p2i(this));
 124 
 125   // For non-humongous chunks, starting address shall be aligned
 126   // to its chunk size. Humongous chunks start address is
 127   // aligned to specialized chunk size.
 128   const size_t required_alignment =
 129     (chunk_type != HumongousIndex ? word_size() : get_size_for_nonhumongous_chunktype(SpecializedIndex, is_class())) * sizeof(MetaWord);
 130   assert(is_aligned((address)this, required_alignment),
 131          "Chunk " PTR_FORMAT ": (size " SIZE_FORMAT ") not aligned to " SIZE_FORMAT ".",
 132          p2i(this), word_size() * sizeof(MetaWord), required_alignment);
 133 }
 134 
 135 #endif // ASSERT

 136 
 137 // Helper, returns a descriptive name for the given index.
 138 const char* chunk_size_name(ChunkIndex index) {
 139   switch (index) {
 140     case SpecializedIndex:
 141       return "specialized";
 142     case SmallIndex:
 143       return "small";
 144     case MediumIndex:
 145       return "medium";
 146     case HumongousIndex:
 147       return "humongous";
 148     default:
 149       return "Invalid index";
 150   }
 151 }
 152 
 153 #ifdef ASSERT
 154 void do_verify_chunk(Metachunk* chunk) {
 155   guarantee(chunk != NULL, "Sanity");
 156   // Verify chunk itself; then verify that it is consistent with the
 157   // occupany map of its containing node.
 158   chunk->verify();
 159   VirtualSpaceNode* const vsn = chunk->container();
 160   OccupancyMap* const ocmap = vsn->occupancy_map();
 161   ocmap->verify_for_chunk(chunk);
 162 }
 163 #endif
 164 
 165 void do_update_in_use_info_for_chunk(Metachunk* chunk, bool inuse) {
 166   chunk->set_is_tagged_free(!inuse);
 167   OccupancyMap* const ocmap = chunk->container()->occupancy_map();
 168   ocmap->set_region_in_use((MetaWord*)chunk, chunk->word_size(), inuse);
 169 }

 170 
 171 } // namespace metaspace
 172 


   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 
  26 #include "precompiled.hpp"
  27 
  28 #include "memory/metaspace/chunkLevel.hpp"
  29 #include "memory/metaspace/chunkTree.hpp"
  30 #include "memory/metaspace/constants.hpp"
  31 #include "memory/metaspace/metachunk.hpp"

  32 #include "memory/metaspace/virtualSpaceNode.hpp"
  33 
  34 #include "utilities/align.hpp"
  35 #include "utilities/copy.hpp"
  36 #include "utilities/debug.hpp"
  37 
  38 namespace metaspace {
  39 
  40 // Must align pointers and sizes to 8 so that 64 bit types get correctly aligned.
  41 static const size_t allocation_alignment = 8;


  42 
  43 // Make sure that the Klass alignment also agree.
  44 STATIC_ASSERT(allocation_alignment == (size_t)KlassAlignmentInBytes);
  45 
  46 void Metachunk::remove_from_list() {
  47   if (_prev != NULL) {
  48     _prev->set_next(_next);
  49   }
  50   if (_next != NULL) {
  51     _next->set_prev(_prev);
  52   }
  53   _prev = _next = NULL;
  54 }
  55 
  56 // Allocate word_size words from this chunk.
  57 //
  58 // May cause memory to be committed. That may fail if we hit a commit limit. In that case,
  59 //  NULL is returned and p_did_hit_commit_limit will be set to true.
  60 // If the remainder portion of the chunk was too small to hold the allocation,
  61 //  NULL is returned and p_did_hit_commit_limit will be set to false.
  62 MetaWord* Metachunk::allocate(size_t word_size, bool* p_did_hit_commit_limit) {
  63 
  64   size_t request_word_size = align_up(word_size, allocation_alignment);
  65 
  66   // Space enough left?
  67   if (free_words() < request_word_size) {
  68     *p_did_hit_commit_limit = false;
  69     return NULL;
  70   }
  71 
  72   // Will bring this allocation us over the border of the next commit granule?
  73   MetaWord* const top = top();
  74   MetaWord* const next_top = top() + request_word_size;
  75 
  76   MetaWord* const commit_granule_border = align_up(top, constants::commit_granule_words);
  77 
  78   if (next_top > commit_granule_border) {
  79     // We may need to commit.
  80 
  81     // Calc the extend of the area we may need to commit.
  82     MetaWord* const commit_granule_border_2 = align_up(next_top, constants::commit_granule_words);
  83 
  84     // and attempt to commit.
  85     const size_t word_size_to_commit = commit_granule_border_2 - commit_granule_border;
  86     if (_vsnode->ensure_range_is_committed(commit_granule_border, word_size_to_commit) == false) {
  87       // ... which failed because we hit a limit.
  88       *p_did_hit_commit_limit = true;
  89       return NULL;
  90     }
  91 






  92   }


  93 
  94   // All is well.
  95   _used_words += request_word_size;


  96 
  97   return top;


  98 










  99 }
 100 
 101 #ifdef ASSERT







 102 
 103 void Metachunk::verify(bool slow) const {
 104 
 105   // Note: only call this on a life Metachunk.
 106 
 107   chklvl::check_valid_level(level());
 108 
 109   // Test base pointer
 110   assert(vsnode() != NULL, "No space");
 111   vsnode()->check_pointer(base());
 112   assert(base() != NULL, "Base pointer NULL");
 113 
 114   // Starting address shall be aligned to chunk size.
 115   const size_t required_alignment = word_size() * sizeof(MetaWord);
 116   assert(is_aligned(base(), required_alignment),
 117          "Chunk " PTR_FORMAT ": (size " SIZE_FORMAT ") not aligned correctly to " SIZE_FORMAT ".",





 118          p2i(this), word_size() * sizeof(MetaWord), required_alignment);

 119 
 120   // Used words
 121   assert(used_words() < word_size(), "oob");
 122 
 123   // We shall have a reference to a tree node and that node shall refer back to us
 124   assert(tree_node() != NULL &&
 125          tree_node()->check_is_child(this), "Invalid tree node relationship");












 126 











 127 




 128 }
 129 #endif // ASSERT
 130 
 131 } // namespace metaspace
 132 
< prev index next >