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 "gc/g1/g1BiasedArray.hpp"
27 #include "memory/padded.inline.hpp"
28
29 // Allocate a new array, generic version.
30 address G1BiasedMappedArrayBase::create_new_base_array(size_t length, size_t elem_size) {
31 assert(length > 0, "just checking");
32 assert(elem_size > 0, "just checking");
33 return PaddedPrimitiveArray<u_char, mtGC>::create_unfreeable(length * elem_size);
34 }
35
36 #ifndef PRODUCT
37 void G1BiasedMappedArrayBase::verify_index(idx_t index) const {
38 guarantee(_base != NULL, "Array not initialized");
39 guarantee(index < length(), err_msg("Index out of bounds index: " SIZE_FORMAT " length: " SIZE_FORMAT, index, length()));
40 }
41
42 void G1BiasedMappedArrayBase::verify_biased_index(idx_t biased_index) const {
43 guarantee(_biased_base != NULL, "Array not initialized");
44 guarantee(biased_index >= bias() && biased_index < (bias() + length()),
45 err_msg("Biased index out of bounds, index: " SIZE_FORMAT " bias: " SIZE_FORMAT " length: " SIZE_FORMAT, biased_index, bias(), length()));
46 }
47
48 void G1BiasedMappedArrayBase::verify_biased_index_inclusive_end(idx_t biased_index) const {
49 guarantee(_biased_base != NULL, "Array not initialized");
50 guarantee(biased_index >= bias() && biased_index <= (bias() + length()),
51 err_msg("Biased index out of inclusive bounds, index: " SIZE_FORMAT " bias: " SIZE_FORMAT " length: " SIZE_FORMAT, biased_index, bias(), length()));
52 }
53
54 class TestMappedArray : public G1BiasedMappedArray<int> {
55 protected:
56 virtual int default_value() const { return 0xBAADBABE; }
57 public:
58 static void test_biasedarray() {
59 const size_t REGION_SIZE_IN_WORDS = 512;
60 const size_t NUM_REGIONS = 20;
61 HeapWord* fake_heap = (HeapWord*)LP64_ONLY(0xBAAA00000) NOT_LP64(0xBA000000); // Any value that is non-zero
62
63 TestMappedArray array;
64 array.initialize(fake_heap, fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS,
65 REGION_SIZE_IN_WORDS * HeapWordSize);
66 // Check address calculation (bounds)
67 assert(array.bottom_address_mapped() == fake_heap,
68 err_msg("bottom mapped address should be " PTR_FORMAT ", but is " PTR_FORMAT, p2i(fake_heap), p2i(array.bottom_address_mapped())));
69 assert(array.end_address_mapped() == (fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS), "must be");
70
71 int* bottom = array.address_mapped_to(fake_heap);
72 assert((void*)bottom == (void*) array.base(), "must be");
73 int* end = array.address_mapped_to(fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS);
74 assert((void*)end == (void*)(array.base() + array.length()), "must be");
75 // The entire array should contain default value elements
76 for (int* current = bottom; current < end; current++) {
77 assert(*current == array.default_value(), "must be");
78 }
79
80 // Test setting values in the table
81
82 HeapWord* region_start_address = fake_heap + REGION_SIZE_IN_WORDS * (NUM_REGIONS / 2);
83 HeapWord* region_end_address = fake_heap + (REGION_SIZE_IN_WORDS * (NUM_REGIONS / 2) + REGION_SIZE_IN_WORDS - 1);
84
85 // Set/get by address tests: invert some value; first retrieve one
86 int actual_value = array.get_by_index(NUM_REGIONS / 2);
87 array.set_by_index(NUM_REGIONS / 2, ~actual_value);
88 // Get the same value by address, should correspond to the start of the "region"
|
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 "gc/g1/g1BiasedArray.hpp"
27 #include "memory/padded.inline.hpp"
28
29 // Allocate a new array, generic version.
30 address G1BiasedMappedArrayBase::create_new_base_array(size_t length, size_t elem_size) {
31 assert(length > 0, "just checking");
32 assert(elem_size > 0, "just checking");
33 return PaddedPrimitiveArray<u_char, mtGC>::create_unfreeable(length * elem_size);
34 }
35
36 #ifndef PRODUCT
37 void G1BiasedMappedArrayBase::verify_index(idx_t index) const {
38 guarantee(_base != NULL, "Array not initialized");
39 guarantee(index < length(), "Index out of bounds index: " SIZE_FORMAT " length: " SIZE_FORMAT, index, length());
40 }
41
42 void G1BiasedMappedArrayBase::verify_biased_index(idx_t biased_index) const {
43 guarantee(_biased_base != NULL, "Array not initialized");
44 guarantee(biased_index >= bias() && biased_index < (bias() + length()),
45 "Biased index out of bounds, index: " SIZE_FORMAT " bias: " SIZE_FORMAT " length: " SIZE_FORMAT, biased_index, bias(), length());
46 }
47
48 void G1BiasedMappedArrayBase::verify_biased_index_inclusive_end(idx_t biased_index) const {
49 guarantee(_biased_base != NULL, "Array not initialized");
50 guarantee(biased_index >= bias() && biased_index <= (bias() + length()),
51 "Biased index out of inclusive bounds, index: " SIZE_FORMAT " bias: " SIZE_FORMAT " length: " SIZE_FORMAT, biased_index, bias(), length());
52 }
53
54 class TestMappedArray : public G1BiasedMappedArray<int> {
55 protected:
56 virtual int default_value() const { return 0xBAADBABE; }
57 public:
58 static void test_biasedarray() {
59 const size_t REGION_SIZE_IN_WORDS = 512;
60 const size_t NUM_REGIONS = 20;
61 HeapWord* fake_heap = (HeapWord*)LP64_ONLY(0xBAAA00000) NOT_LP64(0xBA000000); // Any value that is non-zero
62
63 TestMappedArray array;
64 array.initialize(fake_heap, fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS,
65 REGION_SIZE_IN_WORDS * HeapWordSize);
66 // Check address calculation (bounds)
67 assert(array.bottom_address_mapped() == fake_heap,
68 "bottom mapped address should be " PTR_FORMAT ", but is " PTR_FORMAT, p2i(fake_heap), p2i(array.bottom_address_mapped()));
69 assert(array.end_address_mapped() == (fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS), "must be");
70
71 int* bottom = array.address_mapped_to(fake_heap);
72 assert((void*)bottom == (void*) array.base(), "must be");
73 int* end = array.address_mapped_to(fake_heap + REGION_SIZE_IN_WORDS * NUM_REGIONS);
74 assert((void*)end == (void*)(array.base() + array.length()), "must be");
75 // The entire array should contain default value elements
76 for (int* current = bottom; current < end; current++) {
77 assert(*current == array.default_value(), "must be");
78 }
79
80 // Test setting values in the table
81
82 HeapWord* region_start_address = fake_heap + REGION_SIZE_IN_WORDS * (NUM_REGIONS / 2);
83 HeapWord* region_end_address = fake_heap + (REGION_SIZE_IN_WORDS * (NUM_REGIONS / 2) + REGION_SIZE_IN_WORDS - 1);
84
85 // Set/get by address tests: invert some value; first retrieve one
86 int actual_value = array.get_by_index(NUM_REGIONS / 2);
87 array.set_by_index(NUM_REGIONS / 2, ~actual_value);
88 // Get the same value by address, should correspond to the start of the "region"
|