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 "utilities/macros.hpp"
27 #include "gc_implementation/shared/allocationStats.hpp"
28 #include "memory/binaryTreeDictionary.hpp"
29 #include "memory/freeList.hpp"
30 #include "memory/freeBlockDictionary.hpp"
31 #include "memory/metablock.hpp"
32 #include "memory/metachunk.hpp"
33 #include "runtime/globals.hpp"
34 #include "utilities/ostream.hpp"
35 #include "utilities/macros.hpp"
36 #if INCLUDE_ALL_GCS
37 #include "gc_implementation/concurrentMarkSweep/adaptiveFreeList.hpp"
38 #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
39 #include "gc_implementation/shared/spaceDecorator.hpp"
40 #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
41 #endif // INCLUDE_ALL_GCS
42
43 ////////////////////////////////////////////////////////////////////////////////
44 // A binary tree based search structure for free blocks.
45 // This is currently used in the Concurrent Mark&Sweep implementation.
46 ////////////////////////////////////////////////////////////////////////////////
47
48 template <class Chunk_t, template <class> class FreeList_t>
49 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>)/HeapWordSize;
50
51 template <class Chunk_t, template <class> class FreeList_t>
52 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) {
53 // Do some assertion checking here.
54 return (TreeChunk<Chunk_t, FreeList_t>*) fc;
55 }
56
57 template <class Chunk_t, template <class> class FreeList_t>
58 void TreeChunk<Chunk_t, FreeList_t>::verify_tree_chunk_list() const {
59 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next();
|
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 "utilities/macros.hpp"
27 #include "gc_implementation/shared/allocationStats.hpp"
28 #include "memory/binaryTreeDictionary.hpp"
29 #include "memory/freeList.hpp"
30 #include "memory/freeBlockDictionary.hpp"
31 #include "memory/metablock.hpp"
32 #include "memory/metachunk.hpp"
33 #include "runtime/globals.hpp"
34 #include "utilities/ostream.hpp"
35 #include "utilities/macros.hpp"
36 #include "gc_implementation/shared/spaceDecorator.hpp"
37 #if INCLUDE_ALL_GCS
38 #include "gc_implementation/concurrentMarkSweep/adaptiveFreeList.hpp"
39 #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
40 #include "gc_implementation/concurrentMarkSweep/freeChunk.hpp"
41 #endif // INCLUDE_ALL_GCS
42
43 ////////////////////////////////////////////////////////////////////////////////
44 // A binary tree based search structure for free blocks.
45 // This is currently used in the Concurrent Mark&Sweep implementation.
46 ////////////////////////////////////////////////////////////////////////////////
47
48 template <class Chunk_t, template <class> class FreeList_t>
49 size_t TreeChunk<Chunk_t, FreeList_t>::_min_tree_chunk_size = sizeof(TreeChunk<Chunk_t, FreeList_t>)/HeapWordSize;
50
51 template <class Chunk_t, template <class> class FreeList_t>
52 TreeChunk<Chunk_t, FreeList_t>* TreeChunk<Chunk_t, FreeList_t>::as_TreeChunk(Chunk_t* fc) {
53 // Do some assertion checking here.
54 return (TreeChunk<Chunk_t, FreeList_t>*) fc;
55 }
56
57 template <class Chunk_t, template <class> class FreeList_t>
58 void TreeChunk<Chunk_t, FreeList_t>::verify_tree_chunk_list() const {
59 TreeChunk<Chunk_t, FreeList_t>* nextTC = (TreeChunk<Chunk_t, FreeList_t>*)next();
|