/* * Copyright (c) 2020, Oracle and/or its affiliates. All rights reserved. * Copyright (c) 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. * * This code is distributed in the hope that it will be useful, but WITHOUT * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License * version 2 for more details (a copy is included in the LICENSE file that * accompanied this code). * * You should have received a copy of the GNU General Public License version * 2 along with this work; if not, write to the Free Software Foundation, * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. * * 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. * */ #ifndef SHARE_MEMORY_METASPACE_MSCHUNKHEADERPOOL_HPP #define SHARE_MEMORY_METASPACE_MSCHUNKHEADERPOOL_HPP #include "memory/allocation.hpp" #include "memory/metaspace/msCounter.hpp" #include "memory/metaspace/msMetachunk.hpp" #include "memory/metaspace/msMetachunkList.hpp" #include "utilities/debug.hpp" #include "utilities/globalDefinitions.hpp" namespace metaspace { // Chunk headers (Metachunk objects) are separate entities from their payload. // Since they are allocated and released frequently in the course of buddy allocation // (splitting, merging chunks happens often) we want allocation of them fast. Therefore // we keep them in a simple pool (somewhat like a primitive slab allocator). class ChunkHeaderPool : public CHeapObj { static const int SlabCapacity = 128; struct Slab : public CHeapObj { Slab* _next; int _top; Metachunk _elems [SlabCapacity]; Slab() : _next(NULL), _top(0) { for (int i = 0; i < SlabCapacity; i++) { _elems[i].clear(); } } }; IntCounter _num_slabs; Slab* _first_slab; Slab* _current_slab; IntCounter _num_handed_out; MetachunkList _freelist; void allocate_new_slab(); static ChunkHeaderPool* _chunkHeaderPool; public: ChunkHeaderPool(); ~ChunkHeaderPool(); // Allocates a Metachunk structure. The structure is uninitialized. Metachunk* allocate_chunk_header() { Metachunk* c = NULL; DEBUG_ONLY(verify()); c = _freelist.remove_first(); assert(c == NULL || c->is_dead(), "Not a freelist chunk header?"); if (c == NULL) { if (_current_slab == NULL || _current_slab->_top == SlabCapacity) { allocate_new_slab(); assert(_current_slab->_top < SlabCapacity, "Sanity"); } c = _current_slab->_elems + _current_slab->_top; _current_slab->_top++; } _num_handed_out.increment(); // By contract, the returned structure is uninitialized. // Zap to make this clear. DEBUG_ONLY(c->zap_header(0xBB);) return c; } void return_chunk_header(Metachunk* c) { // We only ever should return free chunks, since returning chunks // happens only on merging and merging only works with free chunks. assert(c != NULL && c->is_free(), "Sanity"); #ifdef ASSERT // In debug, fill dead header with pattern. c->zap_header(0xCC); c->set_next(NULL); c->set_prev(NULL); #endif c->set_dead(); _freelist.add(c); _num_handed_out.decrement(); } // Returns number of allocated elements. int used() const { return _num_handed_out.get(); } // Returns number of elements in free list. int freelist_size() const { return _freelist.count(); } // Returns size of memory used. size_t memory_footprint_words() const; DEBUG_ONLY(void verify() const;) static void initialize(); // Returns reference to the one global chunk header pool. static ChunkHeaderPool* pool() { return _chunkHeaderPool; } }; } // namespace metaspace #endif // SHARE_MEMORY_METASPACE_MSCHUNKHEADERPOOL_HPP