1 /*
2 * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2020, Red Hat, Inc. and/or its affiliates.
4 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
5 *
6 * This code is free software; you can redistribute it and/or modify it
7 * under the terms of the GNU General Public License version 2 only, as
8 * published by the Free Software Foundation.
9 *
10 * This code is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
13 * version 2 for more details (a copy is included in the LICENSE file that
14 * accompanied this code).
15 *
16 * You should have received a copy of the GNU General Public License version
17 * 2 along with this work; if not, write to the Free Software Foundation,
18 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
19 *
20 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
21 * or visit www.oracle.com if you need additional information or have any
22 * questions.
23 *
26 #include "precompiled.hpp"
27 #include "gc/shenandoah/shenandoahMarkBitMap.inline.hpp"
28 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
29 #include "utilities/globalDefinitions.hpp"
30
31 ShenandoahMarkBitMap::ShenandoahMarkBitMap(MemRegion heap, MemRegion storage) :
32 _shift(LogMinObjAlignment),
33 _covered(heap),
34 _map((BitMap::bm_word_t*) storage.start()),
35 _size((heap.word_size() * 2) >> _shift) {
36 }
37
38 size_t ShenandoahMarkBitMap::compute_size(size_t heap_size) {
39 return ReservedSpace::allocation_align_size_up(heap_size / mark_distance());
40 }
41
42 size_t ShenandoahMarkBitMap::mark_distance() {
43 return MinObjAlignmentInBytes * BitsPerByte / 2;
44 }
45
46 HeapWord* ShenandoahMarkBitMap::get_next_marked_addr(const HeapWord* addr,
47 const HeapWord* limit) const {
48 assert(limit != nullptr, "limit must not be null");
49 // Round addr up to a possible object boundary to be safe.
50 size_t const addr_offset = address_to_index(align_up(addr, HeapWordSize << LogMinObjAlignment));
51 size_t const limit_offset = address_to_index(limit);
52 size_t const nextOffset = get_next_one_offset(addr_offset, limit_offset);
53 return index_to_address(nextOffset);
54 }
55
56 void ShenandoahMarkBitMap::clear_range_within_word(idx_t beg, idx_t end) {
57 // With a valid range (beg <= end), this test ensures that end != 0, as
58 // required by inverted_bit_mask_for_range. Also avoids an unnecessary write.
59 if (beg != end) {
60 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
61 *word_addr(beg) &= mask;
62 }
63 }
64
65 void ShenandoahMarkBitMap::clear_range(idx_t beg, idx_t end) {
66 verify_range(beg, end);
67
68 idx_t beg_full_word = to_words_align_up(beg);
|
1 /*
2 * Copyright (c) 2018, 2023, Oracle and/or its affiliates. All rights reserved.
3 * Copyright (c) 2020, Red Hat, Inc. and/or its affiliates.
4 * Copyright Amazon.com Inc. or its affiliates. All Rights Reserved.
5 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
6 *
7 * This code is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License version 2 only, as
9 * published by the Free Software Foundation.
10 *
11 * This code is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 * version 2 for more details (a copy is included in the LICENSE file that
15 * accompanied this code).
16 *
17 * You should have received a copy of the GNU General Public License version
18 * 2 along with this work; if not, write to the Free Software Foundation,
19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
20 *
21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
22 * or visit www.oracle.com if you need additional information or have any
23 * questions.
24 *
27 #include "precompiled.hpp"
28 #include "gc/shenandoah/shenandoahMarkBitMap.inline.hpp"
29 #include "gc/shenandoah/shenandoahHeap.inline.hpp"
30 #include "utilities/globalDefinitions.hpp"
31
32 ShenandoahMarkBitMap::ShenandoahMarkBitMap(MemRegion heap, MemRegion storage) :
33 _shift(LogMinObjAlignment),
34 _covered(heap),
35 _map((BitMap::bm_word_t*) storage.start()),
36 _size((heap.word_size() * 2) >> _shift) {
37 }
38
39 size_t ShenandoahMarkBitMap::compute_size(size_t heap_size) {
40 return ReservedSpace::allocation_align_size_up(heap_size / mark_distance());
41 }
42
43 size_t ShenandoahMarkBitMap::mark_distance() {
44 return MinObjAlignmentInBytes * BitsPerByte / 2;
45 }
46
47 bool ShenandoahMarkBitMap::is_bitmap_clear_range(const HeapWord* start, const HeapWord* end) const {
48 // Similar to get_next_marked_addr(), without assertion.
49 // Round addr up to a possible object boundary to be safe.
50 if (start == end) {
51 return true;
52 }
53 size_t const addr_offset = address_to_index(align_up(start, HeapWordSize << LogMinObjAlignment));
54 size_t const limit_offset = address_to_index(end);
55 size_t const next_offset = get_next_one_offset(addr_offset, limit_offset);
56 HeapWord* result = index_to_address(next_offset);
57 return (result == end);
58 }
59
60
61 HeapWord* ShenandoahMarkBitMap::get_next_marked_addr(const HeapWord* addr,
62 const HeapWord* limit) const {
63 #ifdef ASSERT
64 ShenandoahHeap* heap = ShenandoahHeap::heap();
65 ShenandoahHeapRegion* r = heap->heap_region_containing(addr);
66 ShenandoahMarkingContext* ctx = heap->marking_context();
67 HeapWord* tams = ctx->top_at_mark_start(r);
68 assert(limit != nullptr, "limit must not be null");
69 assert(limit <= r->top(), "limit must be less than top");
70 assert(addr <= tams, "addr must be less than TAMS");
71 #endif
72
73 // Round addr up to a possible object boundary to be safe.
74 size_t const addr_offset = address_to_index(align_up(addr, HeapWordSize << LogMinObjAlignment));
75 size_t const limit_offset = address_to_index(limit);
76 size_t const nextOffset = get_next_one_offset(addr_offset, limit_offset);
77 return index_to_address(nextOffset);
78 }
79
80 void ShenandoahMarkBitMap::clear_range_within_word(idx_t beg, idx_t end) {
81 // With a valid range (beg <= end), this test ensures that end != 0, as
82 // required by inverted_bit_mask_for_range. Also avoids an unnecessary write.
83 if (beg != end) {
84 bm_word_t mask = inverted_bit_mask_for_range(beg, end);
85 *word_addr(beg) &= mask;
86 }
87 }
88
89 void ShenandoahMarkBitMap::clear_range(idx_t beg, idx_t end) {
90 verify_range(beg, end);
91
92 idx_t beg_full_word = to_words_align_up(beg);
|