author | stefank |
Mon, 25 Nov 2019 12:30:24 +0100 | |
changeset 59248 | e92153ed8bdc |
parent 58980 | 47c20fc6a517 |
permissions | -rw-r--r-- |
1374 | 1 |
/* |
53244
9807daeb47c4
8216167: Update include guards to reflect correct directories
coleenp
parents:
47216
diff
changeset
|
2 |
* Copyright (c) 2001, 2019, Oracle and/or its affiliates. All rights reserved. |
1374 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3262
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3262
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3262
diff
changeset
|
21 |
* questions. |
1374 | 22 |
* |
23 |
*/ |
|
24 |
||
53244
9807daeb47c4
8216167: Update include guards to reflect correct directories
coleenp
parents:
47216
diff
changeset
|
25 |
#ifndef SHARE_GC_G1_G1BLOCKOFFSETTABLE_INLINE_HPP |
9807daeb47c4
8216167: Update include guards to reflect correct directories
coleenp
parents:
47216
diff
changeset
|
26 |
#define SHARE_GC_G1_G1BLOCKOFFSETTABLE_INLINE_HPP |
7397 | 27 |
|
30764 | 28 |
#include "gc/g1/g1BlockOffsetTable.hpp" |
32389
626f27450e12
8067336: Allow that PLAB allocations at the end of regions are flexible
tschatzl
parents:
30764
diff
changeset
|
29 |
#include "gc/g1/heapRegion.hpp" |
32598
70b490faa49f
8131330: G1CollectedHeap::verify_dirty_young_list fails with assert
kbarrett
parents:
32389
diff
changeset
|
30 |
#include "gc/shared/memset_with_concurrent_readers.hpp" |
55429
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
31 |
#include "runtime/atomic.hpp" |
7397 | 32 |
|
35461 | 33 |
inline HeapWord* G1BlockOffsetTablePart::block_start(const void* addr) { |
58980 | 34 |
if (addr >= _hr->bottom() && addr < _hr->end()) { |
35461 | 35 |
HeapWord* q = block_at_or_preceding(addr, true, _next_offset_index-1); |
36 |
return forward_to_block_containing_addr(q, addr); |
|
1374 | 37 |
} else { |
38 |
return NULL; |
|
39 |
} |
|
40 |
} |
|
41 |
||
35461 | 42 |
inline HeapWord* G1BlockOffsetTablePart::block_start_const(const void* addr) const { |
58980 | 43 |
if (addr >= _hr->bottom() && addr < _hr->end()) { |
35461 | 44 |
HeapWord* q = block_at_or_preceding(addr, true, _next_offset_index-1); |
45 |
HeapWord* n = q + block_size(q); |
|
46 |
return forward_to_block_containing_addr_const(q, n, addr); |
|
1374 | 47 |
} else { |
48 |
return NULL; |
|
49 |
} |
|
50 |
} |
|
51 |
||
35461 | 52 |
u_char G1BlockOffsetTable::offset_array(size_t index) const { |
26160 | 53 |
check_index(index, "index out of range"); |
55429
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
54 |
return Atomic::load(&_offset_array[index]); |
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
55 |
} |
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
56 |
|
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
57 |
void G1BlockOffsetTable::set_offset_array_raw(size_t index, u_char offset) { |
59248
e92153ed8bdc
8234736: Harmonize parameter order in Atomic - store
stefank
parents:
58980
diff
changeset
|
58 |
Atomic::store(&_offset_array[index], offset); |
26160 | 59 |
} |
60 |
||
35461 | 61 |
void G1BlockOffsetTable::set_offset_array(size_t index, u_char offset) { |
26160 | 62 |
check_index(index, "index out of range"); |
63 |
set_offset_array_raw(index, offset); |
|
64 |
} |
|
65 |
||
35461 | 66 |
void G1BlockOffsetTable::set_offset_array(size_t index, HeapWord* high, HeapWord* low) { |
26160 | 67 |
check_index(index, "index out of range"); |
68 |
assert(high >= low, "addresses out of order"); |
|
69 |
size_t offset = pointer_delta(high, low); |
|
70 |
check_offset(offset, "offset too large"); |
|
71 |
set_offset_array(index, (u_char)offset); |
|
72 |
} |
|
73 |
||
35461 | 74 |
void G1BlockOffsetTable::set_offset_array(size_t left, size_t right, u_char offset) { |
26160 | 75 |
check_index(right, "right index out of range"); |
76 |
assert(left <= right, "indexes out of order"); |
|
77 |
size_t num_cards = right - left + 1; |
|
55429
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
78 |
memset_with_concurrent_readers |
d7da94e6c169
8225716: G1 GC: Undefined behaviour in G1BlockOffsetTablePart::block_at_or_preceding
aph
parents:
53244
diff
changeset
|
79 |
(const_cast<u_char*> (&_offset_array[left]), offset, num_cards); |
26160 | 80 |
} |
81 |
||
82 |
// Variant of index_for that does not check the index for validity. |
|
35461 | 83 |
inline size_t G1BlockOffsetTable::index_for_raw(const void* p) const { |
35469
17ea1b453dd5
8146694: Break out shared constants and static BOT functions.
david
parents:
35461
diff
changeset
|
84 |
return pointer_delta((char*)p, _reserved.start(), sizeof(char)) >> BOTConstants::LogN; |
26160 | 85 |
} |
86 |
||
35461 | 87 |
inline size_t G1BlockOffsetTable::index_for(const void* p) const { |
1374 | 88 |
char* pc = (char*)p; |
89 |
assert(pc >= (char*)_reserved.start() && |
|
90 |
pc < (char*)_reserved.end(), |
|
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32598
diff
changeset
|
91 |
"p (" PTR_FORMAT ") not in reserved [" PTR_FORMAT ", " PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32598
diff
changeset
|
92 |
p2i(p), p2i(_reserved.start()), p2i(_reserved.end())); |
26160 | 93 |
size_t result = index_for_raw(p); |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
94 |
check_index(result, "bad index from address"); |
1374 | 95 |
return result; |
96 |
} |
|
97 |
||
35461 | 98 |
inline HeapWord* G1BlockOffsetTable::address_for_index(size_t index) const { |
14584
bd4290e6d0a5
7194633: G1: Assertion and guarantee failures in block offset table
johnc
parents:
13728
diff
changeset
|
99 |
check_index(index, "index out of range"); |
26160 | 100 |
HeapWord* result = address_for_index_raw(index); |
1374 | 101 |
assert(result >= _reserved.start() && result < _reserved.end(), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32598
diff
changeset
|
102 |
"bad address from index result " PTR_FORMAT |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32598
diff
changeset
|
103 |
" _reserved.start() " PTR_FORMAT " _reserved.end() " PTR_FORMAT, |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32598
diff
changeset
|
104 |
p2i(result), p2i(_reserved.start()), p2i(_reserved.end())); |
1374 | 105 |
return result; |
106 |
} |
|
107 |
||
35461 | 108 |
inline size_t G1BlockOffsetTablePart::block_size(const HeapWord* p) const { |
58980 | 109 |
return _hr->block_size(p); |
25361
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
110 |
} |
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
111 |
|
35461 | 112 |
inline HeapWord* G1BlockOffsetTablePart::block_at_or_preceding(const void* addr, |
113 |
bool has_max_index, |
|
114 |
size_t max_index) const { |
|
58980 | 115 |
assert(_object_can_span || _bot->offset_array(_bot->index_for(_hr->bottom())) == 0, |
46286
c112671e114e
8173764: G1 BOT wrongly assumes that objects must always begin at the start of G1BlockOffsetTablePart
sjohanss
parents:
42588
diff
changeset
|
116 |
"Object crossed region boundary, found offset %u instead of 0", |
58980 | 117 |
(uint) _bot->offset_array(_bot->index_for(_hr->bottom()))); |
35461 | 118 |
size_t index = _bot->index_for(addr); |
1374 | 119 |
// We must make sure that the offset table entry we use is valid. If |
120 |
// "addr" is past the end, start at the last known one and go forward. |
|
121 |
if (has_max_index) { |
|
122 |
index = MIN2(index, max_index); |
|
123 |
} |
|
35461 | 124 |
HeapWord* q = _bot->address_for_index(index); |
1374 | 125 |
|
35461 | 126 |
uint offset = _bot->offset_array(index); // Extend u_char to uint. |
35469
17ea1b453dd5
8146694: Break out shared constants and static BOT functions.
david
parents:
35461
diff
changeset
|
127 |
while (offset >= BOTConstants::N_words) { |
1374 | 128 |
// The excess of the offset from N_words indicates a power of Base |
129 |
// to go back by. |
|
35469
17ea1b453dd5
8146694: Break out shared constants and static BOT functions.
david
parents:
35461
diff
changeset
|
130 |
size_t n_cards_back = BOTConstants::entry_to_cards_back(offset); |
17ea1b453dd5
8146694: Break out shared constants and static BOT functions.
david
parents:
35461
diff
changeset
|
131 |
q -= (BOTConstants::N_words * n_cards_back); |
1374 | 132 |
index -= n_cards_back; |
35461 | 133 |
offset = _bot->offset_array(index); |
1374 | 134 |
} |
35469
17ea1b453dd5
8146694: Break out shared constants and static BOT functions.
david
parents:
35461
diff
changeset
|
135 |
assert(offset < BOTConstants::N_words, "offset too large"); |
1374 | 136 |
q -= offset; |
137 |
return q; |
|
138 |
} |
|
139 |
||
35461 | 140 |
inline HeapWord* G1BlockOffsetTablePart::forward_to_block_containing_addr_const(HeapWord* q, HeapWord* n, |
141 |
const void* addr) const { |
|
58980 | 142 |
if (addr >= _hr->top()) return _hr->top(); |
25361
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
143 |
while (n <= addr) { |
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
144 |
q = n; |
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
145 |
oop obj = oop(q); |
42588 | 146 |
if (obj->klass_or_null_acquire() == NULL) { |
35461 | 147 |
return q; |
148 |
} |
|
25492
d27050bdfb04
8049421: G1 Class Unloading after completing a concurrent mark cycle
stefank
parents:
25491
diff
changeset
|
149 |
n += block_size(q); |
1374 | 150 |
} |
151 |
assert(q <= n, "wrong order for q and addr"); |
|
152 |
assert(addr < n, "wrong order for addr and n"); |
|
153 |
return q; |
|
154 |
} |
|
155 |
||
35461 | 156 |
inline HeapWord* G1BlockOffsetTablePart::forward_to_block_containing_addr(HeapWord* q, |
157 |
const void* addr) { |
|
42588 | 158 |
if (oop(q)->klass_or_null_acquire() == NULL) { |
35461 | 159 |
return q; |
160 |
} |
|
25361
5146d1e12a2f
8047820: G1 Block offset table does not need to support generic Space classes
mgerdin
parents:
24424
diff
changeset
|
161 |
HeapWord* n = q + block_size(q); |
1374 | 162 |
// In the normal case, where the query "addr" is a card boundary, and the |
163 |
// offset table chunks are the same size as cards, the block starting at |
|
164 |
// "q" will contain addr, so the test below will fail, and we'll fall |
|
165 |
// through quickly. |
|
166 |
if (n <= addr) { |
|
167 |
q = forward_to_block_containing_addr_slow(q, n, addr); |
|
168 |
} |
|
169 |
assert(q <= addr, "wrong order for current and arg"); |
|
170 |
return q; |
|
171 |
} |
|
172 |
||
53244
9807daeb47c4
8216167: Update include guards to reflect correct directories
coleenp
parents:
47216
diff
changeset
|
173 |
#endif // SHARE_GC_G1_G1BLOCKOFFSETTABLE_INLINE_HPP |