author | tschatzl |
Tue, 29 May 2018 09:26:00 +0200 | |
changeset 50605 | 7f63c74f0974 |
parent 49488 | 1f9dd2360b17 |
child 53244 | 9807daeb47c4 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
48961
120b61d50f85
8195103: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
47998
diff
changeset
|
2 |
* Copyright (c) 2000, 2018, Oracle and/or its affiliates. All rights reserved. |
1 | 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:
4902
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
4902
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:
4902
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
25 |
#ifndef SHARE_VM_GC_SHARED_CARDTABLE_HPP |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
26 |
#define SHARE_VM_GC_SHARED_CARDTABLE_HPP |
7397 | 27 |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
28 |
#include "memory/allocation.hpp" |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
29 |
#include "memory/memRegion.hpp" |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
30 |
#include "oops/oopsHierarchy.hpp" |
46625 | 31 |
#include "utilities/align.hpp" |
7397 | 32 |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
33 |
class CardTable: public CHeapObj<mtGC> { |
1 | 34 |
friend class VMStructs; |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
35 |
protected: |
1 | 36 |
// The declaration order of these const fields is important; see the |
37 |
// constructor before changing. |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
38 |
const bool _scanned_concurrently; |
1 | 39 |
const MemRegion _whole_heap; // the region covered by the card table |
26160 | 40 |
size_t _guard_index; // index of very last element in the card |
1 | 41 |
// table; it is set to a guard value |
42 |
// (last_card) and should never be modified |
|
26160 | 43 |
size_t _last_valid_index; // index of the last valid element |
1 | 44 |
const size_t _page_size; // page size used when mapping _byte_map |
26160 | 45 |
size_t _byte_map_size; // in bytes |
1 | 46 |
jbyte* _byte_map; // the card marking array |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
47 |
jbyte* _byte_map_base; |
47658
c2b7fb8e5144
8189355: Cleanup of BarrierSet barrier functions
eosterlund
parents:
47216
diff
changeset
|
48 |
|
1 | 49 |
int _cur_covered_regions; |
47658
c2b7fb8e5144
8189355: Cleanup of BarrierSet barrier functions
eosterlund
parents:
47216
diff
changeset
|
50 |
|
1 | 51 |
// The covered regions should be in address order. |
52 |
MemRegion* _covered; |
|
53 |
// The committed regions correspond one-to-one to the covered regions. |
|
54 |
// They represent the card-table memory that has been committed to service |
|
55 |
// the corresponding covered region. It may be that committed region for |
|
56 |
// one covered region corresponds to a larger region because of page-size |
|
57 |
// roundings. Thus, a committed region for one covered region may |
|
58 |
// actually extend onto the card-table space for the next covered region. |
|
59 |
MemRegion* _committed; |
|
60 |
||
61 |
// The last card is a guard card, and we commit the page for it so |
|
62 |
// we can use the card for verification purposes. We make sure we never |
|
63 |
// uncommit the MemRegion for that page. |
|
64 |
MemRegion _guard_region; |
|
65 |
||
66 |
inline size_t compute_byte_map_size(); |
|
67 |
||
68 |
// Finds and return the index of the region, if any, to which the given |
|
69 |
// region would be contiguous. If none exists, assign a new region and |
|
70 |
// returns its index. Requires that no more than the maximum number of |
|
71 |
// covered regions defined in the constructor are ever in use. |
|
72 |
int find_covering_region_by_base(HeapWord* base); |
|
73 |
||
74 |
// Same as above, but finds the region containing the given address |
|
75 |
// instead of starting at a given base address. |
|
76 |
int find_covering_region_containing(HeapWord* addr); |
|
77 |
||
78 |
// Returns the leftmost end of a committed region corresponding to a |
|
79 |
// covered region before covered region "ind", or else "NULL" if "ind" is |
|
80 |
// the first covered region. |
|
81 |
HeapWord* largest_prev_committed_end(int ind) const; |
|
82 |
||
83 |
// Returns the part of the region mr that doesn't intersect with |
|
84 |
// any committed region other than self. Used to prevent uncommitting |
|
85 |
// regions that are also committed by other regions. Also protects |
|
86 |
// against uncommitting the guard region. |
|
87 |
MemRegion committed_unique_to_self(int self, MemRegion mr) const; |
|
88 |
||
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
89 |
// Some barrier sets create tables whose elements correspond to parts of |
49455
848864ed9b17
8199604: Rename CardTableModRefBS to CardTableBarrierSet
eosterlund
parents:
49164
diff
changeset
|
90 |
// the heap; the CardTableBarrierSet is an example. Such barrier sets will |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
91 |
// normally reserve space for such tables, and commit parts of the table |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
92 |
// "covering" parts of the heap that are committed. At most one covered |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
93 |
// region per generation is needed. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
94 |
static const int _max_covered_regions = 2; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
95 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
96 |
enum CardValues { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
97 |
clean_card = -1, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
98 |
// The mask contains zeros in places for all other values. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
99 |
clean_card_mask = clean_card - 31, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
100 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
101 |
dirty_card = 0, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
102 |
precleaned_card = 1, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
103 |
claimed_card = 2, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
104 |
deferred_card = 4, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
105 |
last_card = 8, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
106 |
CT_MR_BS_last_reserved = 16 |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
107 |
}; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
108 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
109 |
// a word's worth (row) of clean card values |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
110 |
static const intptr_t clean_card_row = (intptr_t)(-1); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
111 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
112 |
public: |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
113 |
CardTable(MemRegion whole_heap, bool conc_scan); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
114 |
virtual ~CardTable(); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
115 |
virtual void initialize(); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
116 |
|
49455
848864ed9b17
8199604: Rename CardTableModRefBS to CardTableBarrierSet
eosterlund
parents:
49164
diff
changeset
|
117 |
// The kinds of precision a CardTable may offer. |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
118 |
enum PrecisionStyle { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
119 |
Precise, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
120 |
ObjHeadPreciseArray |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
121 |
}; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
122 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
123 |
// Tells what style of precision this card table offers. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
124 |
PrecisionStyle precision() { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
125 |
return ObjHeadPreciseArray; // Only one supported for now. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
126 |
} |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
127 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
128 |
// *** Barrier set functions. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
129 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
130 |
// Initialization utilities; covered_words is the size of the covered region |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
131 |
// in, um, words. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
132 |
inline size_t cards_required(size_t covered_words) { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
133 |
// Add one for a guard card, used to detect errors. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
134 |
const size_t words = align_up(covered_words, card_size_in_words); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
135 |
return words / card_size_in_words + 1; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
136 |
} |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
137 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
138 |
// Dirty the bytes corresponding to "mr" (not all of which must be |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
139 |
// covered.) |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
140 |
void dirty_MemRegion(MemRegion mr); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
141 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
142 |
// Clear (to clean_card) the bytes entirely contained within "mr" (not |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
143 |
// all of which must be covered.) |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
144 |
void clear_MemRegion(MemRegion mr); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
145 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
146 |
// Return true if "p" is at the start of a card. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
147 |
bool is_card_aligned(HeapWord* p) { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
148 |
jbyte* pcard = byte_for(p); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
149 |
return (addr_for(pcard) == p); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
150 |
} |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
151 |
|
1 | 152 |
// Mapping from address to card marking array entry |
153 |
jbyte* byte_for(const void* p) const { |
|
154 |
assert(_whole_heap.contains(p), |
|
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
155 |
"Attempt to access p = " PTR_FORMAT " out of bounds of " |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
156 |
" card marking array's _whole_heap = [" PTR_FORMAT "," PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
157 |
p2i(p), p2i(_whole_heap.start()), p2i(_whole_heap.end())); |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
158 |
jbyte* result = &_byte_map_base[uintptr_t(p) >> card_shift]; |
1 | 159 |
assert(result >= _byte_map && result < _byte_map + _byte_map_size, |
160 |
"out of bounds accessor for card marking array"); |
|
161 |
return result; |
|
162 |
} |
|
163 |
||
164 |
// The card table byte one after the card marking array |
|
165 |
// entry for argument address. Typically used for higher bounds |
|
166 |
// for loops iterating through the card table. |
|
167 |
jbyte* byte_after(const void* p) const { |
|
168 |
return byte_for(p) + 1; |
|
169 |
} |
|
170 |
||
42598
45562c0473fb
8166898: G1SATBCardTableLoggingModRefBS::invalidate() incorrect with whole_heap == true
lmesnik
parents:
37233
diff
changeset
|
171 |
virtual void invalidate(MemRegion mr); |
1 | 172 |
void clear(MemRegion mr); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
173 |
void dirty(MemRegion mr); |
1 | 174 |
|
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
175 |
// Provide read-only access to the card table array. |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
176 |
const jbyte* byte_for_const(const void* p) const { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
177 |
return byte_for(p); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
178 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
179 |
const jbyte* byte_after_const(const void* p) const { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
180 |
return byte_after(p); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
181 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
182 |
|
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
183 |
// Mapping from card marking array entry to address of first word |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
184 |
HeapWord* addr_for(const jbyte* p) const { |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
185 |
assert(p >= _byte_map && p < _byte_map + _byte_map_size, |
46618
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
42598
diff
changeset
|
186 |
"out of bounds access to card marking array. p: " PTR_FORMAT |
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
42598
diff
changeset
|
187 |
" _byte_map: " PTR_FORMAT " _byte_map + _byte_map_size: " PTR_FORMAT, |
d503911aa948
8178489: Make align functions more type safe and consistent
stefank
parents:
42598
diff
changeset
|
188 |
p2i(p), p2i(_byte_map), p2i(_byte_map + _byte_map_size)); |
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
189 |
size_t delta = pointer_delta(p, _byte_map_base, sizeof(jbyte)); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
190 |
HeapWord* result = (HeapWord*) (delta << card_shift); |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
191 |
assert(_whole_heap.contains(result), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
192 |
"Returning result = " PTR_FORMAT " out of bounds of " |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
193 |
" card marking array's _whole_heap = [" PTR_FORMAT "," PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
194 |
p2i(result), p2i(_whole_heap.start()), p2i(_whole_heap.end())); |
1374
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
195 |
return result; |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
196 |
} |
4c24294029a9
6711316: Open source the Garbage-First garbage collector
ysr
parents:
360
diff
changeset
|
197 |
|
1 | 198 |
// Mapping from address to card marking array index. |
1676
d80e69372634
6653214: MemoryPoolMXBean.setUsageThreshold() does not support large heap sizes.
swamyv
parents:
1388
diff
changeset
|
199 |
size_t index_for(void* p) { |
1 | 200 |
assert(_whole_heap.contains(p), |
33105
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
201 |
"Attempt to access p = " PTR_FORMAT " out of bounds of " |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
202 |
" card marking array's _whole_heap = [" PTR_FORMAT "," PTR_FORMAT ")", |
294e48b4f704
8080775: Better argument formatting for assert() and friends
david
parents:
32612
diff
changeset
|
203 |
p2i(p), p2i(_whole_heap.start()), p2i(_whole_heap.end())); |
1 | 204 |
return byte_for(p) - _byte_map; |
205 |
} |
|
206 |
||
2142
032f4652700c
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
1676
diff
changeset
|
207 |
const jbyte* byte_for_index(const size_t card_index) const { |
032f4652700c
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
1676
diff
changeset
|
208 |
return _byte_map + card_index; |
032f4652700c
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
1676
diff
changeset
|
209 |
} |
032f4652700c
6720309: G1: don't synchronously update RSet during evacuation pauses
iveresov
parents:
1676
diff
changeset
|
210 |
|
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
211 |
// Resize one of the regions covered by the remembered set. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
212 |
virtual void resize_covered_region(MemRegion new_region); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
213 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
214 |
// *** Card-table-RemSet-specific things. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
215 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
216 |
static uintx ct_max_alignment_constraint(); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
217 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
218 |
// Apply closure "cl" to the dirty cards containing some part of |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
219 |
// MemRegion "mr". |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
220 |
void dirty_card_iterate(MemRegion mr, MemRegionClosure* cl); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
221 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
222 |
// Return the MemRegion corresponding to the first maximal run |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
223 |
// of dirty cards lying completely within MemRegion mr. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
224 |
// If reset is "true", then sets those card table entries to the given |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
225 |
// value. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
226 |
MemRegion dirty_card_range_after_reset(MemRegion mr, bool reset, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
227 |
int reset_val); |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
228 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
229 |
// Constants |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
230 |
enum SomePublicConstants { |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
231 |
card_shift = 9, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
232 |
card_size = 1 << card_shift, |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
233 |
card_size_in_words = card_size / sizeof(HeapWord) |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
234 |
}; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
235 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
236 |
static jbyte clean_card_val() { return clean_card; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
237 |
static jbyte clean_card_mask_val() { return clean_card_mask; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
238 |
static jbyte dirty_card_val() { return dirty_card; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
239 |
static jbyte claimed_card_val() { return claimed_card; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
240 |
static jbyte precleaned_card_val() { return precleaned_card; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
241 |
static jbyte deferred_card_val() { return deferred_card; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
242 |
static intptr_t clean_card_row_val() { return clean_card_row; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
243 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
244 |
// Card marking array base (adjusted for heap low boundary) |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
245 |
// This would be the 0th element of _byte_map, if the heap started at 0x0. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
246 |
// But since the heap starts at some higher address, this points to somewhere |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
247 |
// before the beginning of the actual _byte_map. |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
248 |
jbyte* byte_map_base() const { return _byte_map_base; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
249 |
bool scanned_concurrently() const { return _scanned_concurrently; } |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
250 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
251 |
virtual bool is_in_young(oop obj) const = 0; |
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
252 |
|
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
253 |
// Print a description of the memory for the card table |
12268 | 254 |
virtual void print_on(outputStream* st) const; |
255 |
||
1 | 256 |
void verify(); |
257 |
void verify_guard(); |
|
258 |
||
9418
32a87dd6b746
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
9336
diff
changeset
|
259 |
// val_equals -> it will check that all cards covered by mr equal val |
32a87dd6b746
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
9336
diff
changeset
|
260 |
// !val_equals -> it will check that all cards covered by mr do not equal val |
32a87dd6b746
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
9336
diff
changeset
|
261 |
void verify_region(MemRegion mr, jbyte val, bool val_equals) PRODUCT_RETURN; |
32a87dd6b746
7035144: G1: nightly failure: Non-dirty cards in region that should be dirty (failures still exist...)
tonyp
parents:
9336
diff
changeset
|
262 |
void verify_not_dirty_region(MemRegion mr) PRODUCT_RETURN; |
3695
421cfcc8843c
6841313: G1: dirty cards of survivor regions in parallel
apetrusenko
parents:
3262
diff
changeset
|
263 |
void verify_dirty_region(MemRegion mr) PRODUCT_RETURN; |
1 | 264 |
}; |
265 |
||
49164
7e958a8ebcd3
8195142: Refactor out card table from CardTableModRefBS to flatten the BarrierSet hierarchy
eosterlund
parents:
49007
diff
changeset
|
266 |
#endif // SHARE_VM_GC_SHARED_CARDTABLE_HPP |