1 /*
2 * Copyright (c) 2016, 2018, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 *
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 #include "precompiled.hpp"
25 #include "memory/allocation.hpp"
26 #include "memory/metaspace/metachunk.hpp"
27 #include "unittest.hpp"
28 #include "utilities/align.hpp"
29 #include "utilities/copy.hpp"
30 #include "utilities/debug.hpp"
31
32 using namespace metaspace;
33
34 class MetachunkTest {
35 public:
initial_top(Metachunk * metachunk)36 static MetaWord* initial_top(Metachunk* metachunk) {
37 return metachunk->initial_top();
38 }
top(Metachunk * metachunk)39 static MetaWord* top(Metachunk* metachunk) {
40 return metachunk->top();
41 }
42
43 };
44
TEST(Metachunk,basic)45 TEST(Metachunk, basic) {
46 const ChunkIndex chunk_type = MediumIndex;
47 const bool is_class = false;
48 const size_t word_size = get_size_for_nonhumongous_chunktype(chunk_type, is_class);
49 // Allocate the chunk with correct alignment.
50 void* memory = malloc(word_size * BytesPerWord * 2);
51 ASSERT_TRUE(NULL != memory) << "Failed to malloc 2MB";
52
53 void* p_placement = align_up(memory, word_size * BytesPerWord);
54
55 Metachunk* metachunk = ::new (p_placement) Metachunk(chunk_type, is_class, word_size, NULL);
56
57 EXPECT_EQ((MetaWord*) metachunk, metachunk->bottom());
58 EXPECT_EQ((uintptr_t*) metachunk + metachunk->size(), metachunk->end());
59
60 // Check sizes
61 EXPECT_EQ(metachunk->size(), metachunk->word_size());
62 EXPECT_EQ(pointer_delta(metachunk->end(), metachunk->bottom(),
63 sizeof (MetaWord)),
64 metachunk->word_size());
65
66 // Check usage
67 EXPECT_EQ(metachunk->used_word_size(), metachunk->overhead());
68 EXPECT_EQ(metachunk->word_size() - metachunk->used_word_size(),
69 metachunk->free_word_size());
70 EXPECT_EQ(MetachunkTest::top(metachunk), MetachunkTest::initial_top(metachunk));
71 EXPECT_TRUE(metachunk->is_empty());
72
73 // Allocate
74 size_t alloc_size = 64; // Words
75 EXPECT_TRUE(is_aligned(alloc_size, Metachunk::object_alignment()));
76
77 MetaWord* mem = metachunk->allocate(alloc_size);
78
79 // Check post alloc
80 EXPECT_EQ(MetachunkTest::initial_top(metachunk), mem);
81 EXPECT_EQ(MetachunkTest::top(metachunk), mem + alloc_size);
82 EXPECT_EQ(metachunk->overhead() + alloc_size, metachunk->used_word_size());
83 EXPECT_EQ(metachunk->word_size() - metachunk->used_word_size(),
84 metachunk->free_word_size());
85 EXPECT_FALSE(metachunk->is_empty());
86
87 // Clear chunk
88 metachunk->reset_empty();
89
90 // Check post clear
91 EXPECT_EQ(metachunk->used_word_size(), metachunk->overhead());
92 EXPECT_EQ(metachunk->word_size() - metachunk->used_word_size(),
93 metachunk->free_word_size());
94 EXPECT_EQ(MetachunkTest::top(metachunk), MetachunkTest::initial_top(metachunk));
95 EXPECT_TRUE(metachunk->is_empty());
96
97 free(memory);
98 }
99