< prev index next >

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

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


   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 #ifndef SHARE_MEMORY_METASPACE_METACHUNK_HPP
  25 #define SHARE_MEMORY_METASPACE_METACHUNK_HPP
  26 
  27 #include "memory/metaspace/metabase.hpp"
  28 #include "memory/metaspace/metaspaceCommon.hpp"

  29 #include "utilities/debug.hpp"
  30 #include "utilities/globalDefinitions.hpp"
  31 
  32 class MetachunkTest;
  33 
  34 namespace metaspace {
  35 

  36 class VirtualSpaceNode;
  37 
  38 //  Metachunk - Quantum of allocation from a Virtualspace
  39 //    Metachunks are reused (when freed are put on a global freelist) and
  40 //    have no permanent association to a SpaceManager.
  41 
  42 //            +--------------+ <- end    --+       --+
  43 //            |              |             |         |
  44 //            |              |             | free    |


  45 //            |              |             |         |
  46 //            |              |             |         | size | capacity
  47 //            |              |             |         |
  48 //            |              | <- top   -- +         |
  49 //            |              |             |         |
  50 //            |              |             | used    |
  51 //            |              |             |         |
  52 //            |              |             |         |
  53 //            +--------------+ <- bottom --+       --+
  54 
  55 enum ChunkOrigin {
  56   // Chunk normally born (via take_from_committed)
  57   origin_normal = 1,
  58   // Chunk was born as padding chunk
  59   origin_pad = 2,
  60   // Chunk was born as leftover chunk in VirtualSpaceNode::retire
  61   origin_leftover = 3,
  62   // Chunk was born as result of a merge of smaller chunks
  63   origin_merge = 4,
  64   // Chunk was born as result of a split of a larger chunk
  65   origin_split = 5,
  66 
  67   origin_minimum = origin_normal,
  68   origin_maximum = origin_split,
  69   origins_count = origin_maximum + 1
  70 };
  71 
  72 inline bool is_valid_chunkorigin(ChunkOrigin origin) {
  73   return origin == origin_normal ||
  74     origin == origin_pad ||
  75     origin == origin_leftover ||
  76     origin == origin_merge ||
  77     origin == origin_split;
  78 }
  79 
  80 class Metachunk : public Metabase<Metachunk> {
  81 
  82   friend class ::MetachunkTest;
  83 
  84   // The VirtualSpaceNode containing this chunk.
  85   VirtualSpaceNode* const _container;
  86 
  87   // Current allocation top.
  88   MetaWord* _top;
  89 
  90   // A 32bit sentinel for debugging purposes.
  91   enum { CHUNK_SENTINEL = 0x4d4554EF,  // "MET"
  92          CHUNK_SENTINEL_INVALID = 0xFEEEEEEF
  93   };
  94 
  95   uint32_t _sentinel;
  96 
  97   const ChunkIndex _chunk_type;
  98   const bool _is_class;
  99   // Whether the chunk is free (in freelist) or in use by some class loader.
 100   bool _is_tagged_free;
 101 
 102   ChunkOrigin _origin;
 103   int _use_count;































































































 104 
 105   MetaWord* initial_top() const { return (MetaWord*)this + overhead(); }
 106   MetaWord* top() const         { return _top; }
 107 
 108  public:
 109   // Metachunks are allocated out of a MetadataVirtualSpace and
 110   // and use some of its space to describe itself (plus alignment
 111   // considerations).  Metadata is allocated in the rest of the chunk.
 112   // This size is the overhead of maintaining the Metachunk within
 113   // the space.
 114 
 115   // Alignment of each allocation in the chunks.
 116   static size_t object_alignment();
 117 
 118   // Size of the Metachunk header, in words, including alignment.
 119   static size_t overhead();
 120 
 121   Metachunk(ChunkIndex chunktype, bool is_class, size_t word_size, VirtualSpaceNode* container);
 122 
 123   MetaWord* allocate(size_t word_size);
 124 
 125   VirtualSpaceNode* container() const { return _container; }
 126 
 127   MetaWord* bottom() const { return (MetaWord*) this; }
 128 
 129   // Reset top to bottom so chunk can be reused.
 130   void reset_empty() { _top = initial_top(); clear_next(); clear_prev(); }
 131   bool is_empty() { return _top == initial_top(); }
 132 
 133   // used (has been allocated)
 134   // free (available for future allocations)
 135   size_t word_size() const { return size(); }
 136   size_t used_word_size() const;
 137   size_t free_word_size() const;
 138 
 139   bool is_tagged_free() { return _is_tagged_free; }
 140   void set_is_tagged_free(bool v) { _is_tagged_free = v; }
 141 
 142   bool contains(const void* ptr) { return bottom() <= ptr && ptr < _top; }
 143 
 144   void print_on(outputStream* st) const;
 145 
 146   bool is_valid_sentinel() const        { return _sentinel == CHUNK_SENTINEL; }
 147   void remove_sentinel()                { _sentinel = CHUNK_SENTINEL_INVALID; }
 148 
 149   int get_use_count() const             { return _use_count; }
 150   void inc_use_count()                  { _use_count ++; }
 151 
 152   ChunkOrigin get_origin() const        { return _origin; }
 153   void set_origin(ChunkOrigin orig)     { _origin = orig; }
 154 
 155   ChunkIndex get_chunk_type() const     { return _chunk_type; }
 156   bool is_class() const                 { return _is_class; }
 157 
 158   DEBUG_ONLY(void mangle(juint word_value);)
 159   DEBUG_ONLY(void verify() const;)














 160 
 161 };
 162 
 163 
 164 // Helper function that does a bunch of checks for a chunk.
 165 DEBUG_ONLY(void do_verify_chunk(Metachunk* chunk);)
 166 
 167 // Given a Metachunk, update its in-use information (both in the
 168 // chunk and the occupancy map).
 169 void do_update_in_use_info_for_chunk(Metachunk* chunk, bool inuse);
 170 
 171 } // namespace metaspace
 172 
 173 #endif // SHARE_MEMORY_METASPACE_METACHUNK_HPP


   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 #ifndef SHARE_MEMORY_METASPACE_METACHUNK_HPP
  25 #define SHARE_MEMORY_METASPACE_METACHUNK_HPP
  26 
  27 
  28 #include "memory/metaspace/abstractPool.hpp"
  29 #include "memory/metaspace/chunkLevel.hpp"
  30 #include "utilities/debug.hpp"
  31 #include "utilities/globalDefinitions.hpp"
  32 
  33 
  34 
  35 namespace metaspace {
  36 
  37 struct qtnode_t;
  38 class VirtualSpaceNode;
  39 
  40 //  Metachunk - Quantum of allocation from a Virtualspace
  41 //    Metachunks are reused (when freed are put on a global freelist) and
  42 //    have no permanent association to a SpaceManager.
  43 
  44 //            +--------------+ <- end    ----+         --+
  45 //            |              |               |           |
  46 //            |              |               | free      |
  47 //            |              |               |
  48 //            |              |               |           | size (aka capacity)
  49 //            |              |               |           |
  50 //            | -----------  | <- top     -- +           |


  51 //            |              |               |           |
  52 //            |              |               | used      |
  53 //            +--------------+ <- start   -- +        -- +

















































  54 
  55 // Note: this is a chunk **descriptor**. The real Payload area lives in metaspace,
  56 // this class lives somewhere else.
  57 class Metachunk {
  58 
  59   // A chunk header is kept in a list:
  60   // - in the list of used chunks inside a SpaceManager, if it is in use
  61   // - in the list of free chunks inside a ChunkManager, if it is free
  62   // - in the freelist of dead headers inside the MetaChunkHeaderPool,
  63   //   if it is dead (e.g. result of chunk merging).
  64   Metachunk* _prev;
  65   Metachunk* _next;
  66 
  67   chklvl_t _level; // aka size.
  68 
  69   // true: free, owned by ChunkManager
  70   // false: in-use, owned by SpaceManager
  71   // if dead, meaningless
  72   bool _is_free;
  73 
  74   // start of chunk memory; NULL if dead.
  75   MetaWord* _base;
  76 
  77   // Used words.
  78   size_t _used_words;
  79 
  80   // the chunk tree node this header is hanging under; NULL if dead.
  81   qtnode_t* _tree_node;
  82 
  83   // We need unfortunately a back link to the virtual space node
  84   // for splitting and merging nodes.
  85   VirtualSpaceNode* _vsnode;
  86 
  87   MetaWord* top() const           { return base() + _used_words; }
  88 
  89   Metachunk()
  90     : _prev(NULL), _next(NULL),
  91       _level(chklvl::ROOT_CHUNK_LEVEL),
  92       _is_free(true),
  93       _base(NULL),
  94       _used_words(0),
  95       _tree_node(NULL),
  96       _vsnode(NULL)
  97   {}
  98 
  99   size_t word_size() const        { return chklvl::word_size_for_level(_level); }
 100 
 101   MetaWord* base() const          { return _base; }
 102   void set_base(MetaWord* p)      { _base = p; }
 103   MetaWord* end() const           { return base() + word_size(); }
 104 
 105   void set_prev(Metachunk* c)     { _prev = c; }
 106   Metachunk* prev() const         { return _prev; }
 107   void set_next(Metachunk* c)     { _next = c; }
 108   Metachunk* next() const         { return _next; }
 109   // Remove chunk from whatever list it lives in by wiring next with previous.
 110   void remove_from_list();
 111 
 112   bool is_free() const            { return _is_free; }
 113   bool is_in_use() const          { return !_is_free; }
 114   void set_free(bool v)           { _is_free = v; }
 115 
 116 
 117   void inc_level()                { _level ++; DEBUG_ONLY(chklvl::is_valid_level(_level);) }
 118   void dec_level()                { _level --; DEBUG_ONLY(chklvl::is_valid_level(_level);) }
 119   void set_level(chklvl_t v)      { _level = v; DEBUG_ONLY(chklvl::is_valid_level(_level);) }
 120   chklvl_t level() const          { return _level; }
 121 
 122   void set_tree_node(qtnode_t* n) { _tree_node = n; }
 123   qtnode_t* tree_node() const     { return _tree_node; }
 124 
 125   VirtualSpaceNode* vsnode() const        { return _vsnode; }
 126   void set_vsnode(VirtualSpaceNode* n)    { _vsnode = n; }
 127 
 128   size_t used_words() const       { return _used_words; }
 129   size_t free_words() const       { return word_size() - used_words(); }
 130   void reset_used_words()         { _used_words = 0; }
 131 
 132   // Allocation from a chunk
 133 
 134   // Allocate word_size words from this chunk.
 135   //
 136   // May cause memory to be committed. That may fail if we hit a commit limit. In that case,
 137   //  NULL is returned and p_did_hit_commit_limit will be set to true.
 138   // If the remainder portion of the chunk was too small to hold the allocation,
 139   //  NULL is returned and p_did_hit_commit_limit will be set to false.
 140   MetaWord* allocate(size_t word_size, bool* p_did_hit_commit_limit);
 141 
 142   // Wipe this object to look as if it were default constructed.
 143   void wipe() {
 144     _prev = NULL; _next = NULL;
 145     _level = chklvl::ROOT_CHUNK_LEVEL;
 146     _is_free(true);
 147     _base(NULL);
 148     _used_words(0);
 149     _tree_node(NULL);
 150     _vsnode(NULL);
 151   }
 152 
 153   //// Debug stuff ////
 154   DEBUG_ONLY(void verify(bool slow) const;)
 155 
 156 };










































 157 


 158 
 159 class MetachunkPool : private AbstractPool<Metachunk, uint32_t> {
 160 public:
 161 
 162   static bool is_metachunk_pointer(void* p) {
 163     return is_valid_elem((Metachunk*)p);
 164   }
 165 
 166   // Allocate new Metachunk header. Header will be default constructed.
 167   static Metachunk* alloc_header() {
 168     Metachunk* c = allocate_element();
 169     c->wipe();
 170     return c;
 171   }
 172 
 173   // Mark a header as dead and return to the pool for later reuse.
 174   static void release_header(Metachunk* c) {
 175     DEBUG_ONLY(c->set_base(NULL);)
 176     return_element(c);
 177   }
 178 
 179 };
 180 
 181 






 182 
 183 } // namespace metaspace
 184 
 185 #endif // SHARE_MEMORY_METASPACE_METACHUNK_HPP
< prev index next >