author | stefank |
Tue, 03 May 2016 22:45:27 +0200 | |
changeset 38177 | b0c9cb06506b |
parent 38102 | 839593075df1 |
child 40639 | 83c879c8db57 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
37264
d9b0f2b53b73
8152188: Allow CMSBitMapYieldQuantum for BitMap::clear_range and clear_large_range
sangheki
parents:
37059
diff
changeset
|
2 |
* Copyright (c) 1997, 2016, 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:
3261
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
3261
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:
3261
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
26 |
#include "memory/allocation.inline.hpp" |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
27 |
#include "memory/resourceArea.hpp" |
25351
7c198a690050
8044775: Improve usage of umbrella header atomic.inline.hpp.
goetz
parents:
24424
diff
changeset
|
28 |
#include "runtime/atomic.inline.hpp" |
7397 | 29 |
#include "utilities/bitMap.inline.hpp" |
30 |
#include "utilities/copy.hpp" |
|
38177 | 31 |
#include "utilities/debug.hpp" |
1 | 32 |
|
37058 | 33 |
STATIC_ASSERT(sizeof(BitMap::bm_word_t) == BytesPerWord); // "Implementation assumption." |
1 | 34 |
|
38177 | 35 |
typedef BitMap::bm_word_t bm_word_t; |
36 |
typedef BitMap::idx_t idx_t; |
|
37 |
||
38 |
class ResourceBitMapAllocator : StackObj { |
|
39 |
public: |
|
40 |
bm_word_t* allocate(idx_t size_in_words) const { |
|
41 |
return NEW_RESOURCE_ARRAY(bm_word_t, size_in_words); |
|
42 |
} |
|
43 |
void free(bm_word_t* map, idx_t size_in_words) const { |
|
44 |
// Don't free resource allocated arrays. |
|
45 |
} |
|
46 |
}; |
|
47 |
||
48 |
class CHeapBitMapAllocator : StackObj { |
|
49 |
public: |
|
50 |
bm_word_t* allocate(size_t size_in_words) const { |
|
51 |
return ArrayAllocator<bm_word_t, mtInternal>::allocate(size_in_words); |
|
52 |
} |
|
53 |
void free(bm_word_t* map, idx_t size_in_words) const { |
|
54 |
ArrayAllocator<bm_word_t, mtInternal>::free(map, size_in_words); |
|
55 |
} |
|
56 |
}; |
|
57 |
||
58 |
class ArenaBitMapAllocator : StackObj { |
|
59 |
Arena* _arena; |
|
60 |
||
61 |
public: |
|
62 |
ArenaBitMapAllocator(Arena* arena) : _arena(arena) {} |
|
63 |
bm_word_t* allocate(idx_t size_in_words) const { |
|
64 |
return (bm_word_t*)_arena->Amalloc(size_in_words * BytesPerWord); |
|
65 |
} |
|
66 |
void free(bm_word_t* map, idx_t size_in_words) const { |
|
67 |
// ArenaBitMaps currently don't free memory. |
|
68 |
} |
|
69 |
}; |
|
70 |
||
71 |
template <class Allocator> |
|
72 |
BitMap::bm_word_t* BitMap::reallocate(const Allocator& allocator, bm_word_t* old_map, idx_t old_size_in_bits, idx_t new_size_in_bits) { |
|
73 |
size_t old_size_in_words = calc_size_in_words(old_size_in_bits); |
|
74 |
size_t new_size_in_words = calc_size_in_words(new_size_in_bits); |
|
75 |
||
76 |
bm_word_t* map = NULL; |
|
77 |
||
78 |
if (new_size_in_words > 0) { |
|
79 |
map = allocator.allocate(new_size_in_words); |
|
80 |
||
81 |
Copy::disjoint_words((HeapWord*)old_map, (HeapWord*) map, |
|
82 |
MIN2(old_size_in_words, new_size_in_words)); |
|
83 |
||
84 |
if (new_size_in_words > old_size_in_words) { |
|
85 |
clear_range_of_words(map, old_size_in_words, new_size_in_words); |
|
86 |
} |
|
87 |
} |
|
88 |
||
89 |
if (old_map != NULL) { |
|
90 |
allocator.free(old_map, old_size_in_words); |
|
91 |
} |
|
92 |
||
93 |
return map; |
|
94 |
} |
|
95 |
||
96 |
template <class Allocator> |
|
97 |
bm_word_t* BitMap::allocate(const Allocator& allocator, idx_t size_in_bits) { |
|
98 |
// Reuse reallocate to ensure that the new memory is cleared. |
|
99 |
return reallocate(allocator, NULL, 0, size_in_bits); |
|
100 |
} |
|
101 |
||
102 |
template <class Allocator> |
|
103 |
void BitMap::free(const Allocator& allocator, bm_word_t* map, idx_t size_in_bits) { |
|
104 |
bm_word_t* ret = reallocate(allocator, map, size_in_bits, 0); |
|
105 |
assert(ret == NULL, "Reallocate shouldn't have allocated"); |
|
106 |
} |
|
107 |
||
108 |
template <class Allocator> |
|
109 |
void BitMap::resize(const Allocator& allocator, idx_t new_size_in_bits) { |
|
110 |
bm_word_t* new_map = reallocate(allocator, map(), size(), new_size_in_bits); |
|
111 |
||
112 |
update(new_map, new_size_in_bits); |
|
113 |
} |
|
114 |
||
115 |
template <class Allocator> |
|
116 |
void BitMap::initialize(const Allocator& allocator, idx_t size_in_bits) { |
|
117 |
assert(map() == NULL, "precondition"); |
|
118 |
assert(size() == 0, "precondition"); |
|
119 |
||
120 |
resize(allocator, size_in_bits); |
|
121 |
} |
|
122 |
||
123 |
template <class Allocator> |
|
124 |
void BitMap::reinitialize(const Allocator& allocator, idx_t new_size_in_bits) { |
|
125 |
// Remove previous bits. |
|
126 |
resize(allocator, 0); |
|
127 |
||
128 |
initialize(allocator, new_size_in_bits); |
|
129 |
} |
|
130 |
||
131 |
ResourceBitMap::ResourceBitMap(idx_t size_in_bits) |
|
132 |
: BitMap(allocate(ResourceBitMapAllocator(), size_in_bits), size_in_bits) { |
|
133 |
} |
|
134 |
||
135 |
void ResourceBitMap::resize(idx_t new_size_in_bits) { |
|
136 |
BitMap::resize(ResourceBitMapAllocator(), new_size_in_bits); |
|
137 |
} |
|
138 |
||
139 |
void ResourceBitMap::initialize(idx_t size_in_bits) { |
|
140 |
BitMap::initialize(ResourceBitMapAllocator(), size_in_bits); |
|
141 |
} |
|
142 |
||
143 |
void ResourceBitMap::reinitialize(idx_t size_in_bits) { |
|
144 |
BitMap::reinitialize(ResourceBitMapAllocator(), size_in_bits); |
|
145 |
} |
|
146 |
||
147 |
ArenaBitMap::ArenaBitMap(Arena* arena, idx_t size_in_bits) |
|
148 |
: BitMap(allocate(ArenaBitMapAllocator(arena), size_in_bits), size_in_bits) { |
|
149 |
} |
|
150 |
||
151 |
CHeapBitMap::CHeapBitMap(idx_t size_in_bits) |
|
152 |
: BitMap(allocate(CHeapBitMapAllocator(), size_in_bits), size_in_bits) { |
|
153 |
} |
|
154 |
||
155 |
CHeapBitMap::~CHeapBitMap() { |
|
156 |
free(CHeapBitMapAllocator(), map(), size()); |
|
157 |
} |
|
158 |
||
159 |
void CHeapBitMap::resize(idx_t new_size_in_bits) { |
|
160 |
BitMap::resize(CHeapBitMapAllocator(), new_size_in_bits); |
|
161 |
} |
|
162 |
||
163 |
void CHeapBitMap::initialize(idx_t size_in_bits) { |
|
164 |
BitMap::initialize(CHeapBitMapAllocator(), size_in_bits); |
|
165 |
} |
|
166 |
||
167 |
void CHeapBitMap::reinitialize(idx_t size_in_bits) { |
|
168 |
BitMap::reinitialize(CHeapBitMapAllocator(), size_in_bits); |
|
1 | 169 |
} |
170 |
||
37059
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
171 |
#ifdef ASSERT |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
172 |
void BitMap::verify_index(idx_t index) const { |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
173 |
assert(index < _size, "BitMap index out of bounds"); |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
174 |
} |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
175 |
|
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
176 |
void BitMap::verify_range(idx_t beg_index, idx_t end_index) const { |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
177 |
assert(beg_index <= end_index, "BitMap range error"); |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
178 |
// Note that [0,0) and [size,size) are both valid ranges. |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
179 |
if (end_index != _size) verify_index(end_index); |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
180 |
} |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
181 |
#endif // #ifdef ASSERT |
c482915a21aa
8151440: Move BitMap verfication inline functions out from bitMap.hpp
stefank
parents:
37058
diff
changeset
|
182 |
|
37413
2f71679d06dd
8077144: Concurrent mark initialization takes too long
tschatzl
parents:
37264
diff
changeset
|
183 |
void BitMap::pretouch() { |
37414
2672ba9af0dc
8151386: Extract card live data out of G1ConcurrentMark
tschatzl
parents:
37413
diff
changeset
|
184 |
os::pretouch_memory(word_addr(0), word_addr(size())); |
37413
2f71679d06dd
8077144: Concurrent mark initialization takes too long
tschatzl
parents:
37264
diff
changeset
|
185 |
} |
2f71679d06dd
8077144: Concurrent mark initialization takes too long
tschatzl
parents:
37264
diff
changeset
|
186 |
|
1 | 187 |
void BitMap::set_range_within_word(idx_t beg, idx_t end) { |
188 |
// With a valid range (beg <= end), this test ensures that end != 0, as |
|
189 |
// required by inverted_bit_mask_for_range. Also avoids an unnecessary write. |
|
190 |
if (beg != end) { |
|
1374 | 191 |
bm_word_t mask = inverted_bit_mask_for_range(beg, end); |
1 | 192 |
*word_addr(beg) |= ~mask; |
193 |
} |
|
194 |
} |
|
195 |
||
196 |
void BitMap::clear_range_within_word(idx_t beg, idx_t end) { |
|
197 |
// With a valid range (beg <= end), this test ensures that end != 0, as |
|
198 |
// required by inverted_bit_mask_for_range. Also avoids an unnecessary write. |
|
199 |
if (beg != end) { |
|
1374 | 200 |
bm_word_t mask = inverted_bit_mask_for_range(beg, end); |
1 | 201 |
*word_addr(beg) &= mask; |
202 |
} |
|
203 |
} |
|
204 |
||
205 |
void BitMap::par_put_range_within_word(idx_t beg, idx_t end, bool value) { |
|
206 |
assert(value == 0 || value == 1, "0 for clear, 1 for set"); |
|
207 |
// With a valid range (beg <= end), this test ensures that end != 0, as |
|
208 |
// required by inverted_bit_mask_for_range. Also avoids an unnecessary write. |
|
209 |
if (beg != end) { |
|
210 |
intptr_t* pw = (intptr_t*)word_addr(beg); |
|
211 |
intptr_t w = *pw; |
|
212 |
intptr_t mr = (intptr_t)inverted_bit_mask_for_range(beg, end); |
|
213 |
intptr_t nw = value ? (w | ~mr) : (w & mr); |
|
214 |
while (true) { |
|
215 |
intptr_t res = Atomic::cmpxchg_ptr(nw, pw, w); |
|
216 |
if (res == w) break; |
|
22769
516e9b159656
8033545: Missing volatile specifier in Bitmap::par_put_range_within_word
tschatzl
parents:
22234
diff
changeset
|
217 |
w = res; |
1 | 218 |
nw = value ? (w | ~mr) : (w & mr); |
219 |
} |
|
220 |
} |
|
221 |
} |
|
222 |
||
223 |
void BitMap::set_range(idx_t beg, idx_t end) { |
|
224 |
verify_range(beg, end); |
|
225 |
||
226 |
idx_t beg_full_word = word_index_round_up(beg); |
|
227 |
idx_t end_full_word = word_index(end); |
|
228 |
||
229 |
if (beg_full_word < end_full_word) { |
|
230 |
// The range includes at least one full word. |
|
231 |
set_range_within_word(beg, bit_index(beg_full_word)); |
|
232 |
set_range_of_words(beg_full_word, end_full_word); |
|
233 |
set_range_within_word(bit_index(end_full_word), end); |
|
234 |
} else { |
|
235 |
// The range spans at most 2 partial words. |
|
236 |
idx_t boundary = MIN2(bit_index(beg_full_word), end); |
|
237 |
set_range_within_word(beg, boundary); |
|
238 |
set_range_within_word(boundary, end); |
|
239 |
} |
|
240 |
} |
|
241 |
||
242 |
void BitMap::clear_range(idx_t beg, idx_t end) { |
|
243 |
verify_range(beg, end); |
|
244 |
||
245 |
idx_t beg_full_word = word_index_round_up(beg); |
|
246 |
idx_t end_full_word = word_index(end); |
|
247 |
||
248 |
if (beg_full_word < end_full_word) { |
|
249 |
// The range includes at least one full word. |
|
250 |
clear_range_within_word(beg, bit_index(beg_full_word)); |
|
251 |
clear_range_of_words(beg_full_word, end_full_word); |
|
252 |
clear_range_within_word(bit_index(end_full_word), end); |
|
253 |
} else { |
|
254 |
// The range spans at most 2 partial words. |
|
255 |
idx_t boundary = MIN2(bit_index(beg_full_word), end); |
|
256 |
clear_range_within_word(beg, boundary); |
|
257 |
clear_range_within_word(boundary, end); |
|
258 |
} |
|
259 |
} |
|
260 |
||
261 |
void BitMap::set_large_range(idx_t beg, idx_t end) { |
|
262 |
verify_range(beg, end); |
|
263 |
||
264 |
idx_t beg_full_word = word_index_round_up(beg); |
|
265 |
idx_t end_full_word = word_index(end); |
|
266 |
||
267 |
assert(end_full_word - beg_full_word >= 32, |
|
268 |
"the range must include at least 32 bytes"); |
|
269 |
||
270 |
// The range includes at least one full word. |
|
271 |
set_range_within_word(beg, bit_index(beg_full_word)); |
|
272 |
set_large_range_of_words(beg_full_word, end_full_word); |
|
273 |
set_range_within_word(bit_index(end_full_word), end); |
|
274 |
} |
|
275 |
||
276 |
void BitMap::clear_large_range(idx_t beg, idx_t end) { |
|
277 |
verify_range(beg, end); |
|
278 |
||
279 |
idx_t beg_full_word = word_index_round_up(beg); |
|
280 |
idx_t end_full_word = word_index(end); |
|
281 |
||
37264
d9b0f2b53b73
8152188: Allow CMSBitMapYieldQuantum for BitMap::clear_range and clear_large_range
sangheki
parents:
37059
diff
changeset
|
282 |
if (end_full_word - beg_full_word < 32) { |
d9b0f2b53b73
8152188: Allow CMSBitMapYieldQuantum for BitMap::clear_range and clear_large_range
sangheki
parents:
37059
diff
changeset
|
283 |
clear_range(beg, end); |
d9b0f2b53b73
8152188: Allow CMSBitMapYieldQuantum for BitMap::clear_range and clear_large_range
sangheki
parents:
37059
diff
changeset
|
284 |
return; |
d9b0f2b53b73
8152188: Allow CMSBitMapYieldQuantum for BitMap::clear_range and clear_large_range
sangheki
parents:
37059
diff
changeset
|
285 |
} |
1 | 286 |
|
287 |
// The range includes at least one full word. |
|
288 |
clear_range_within_word(beg, bit_index(beg_full_word)); |
|
289 |
clear_large_range_of_words(beg_full_word, end_full_word); |
|
290 |
clear_range_within_word(bit_index(end_full_word), end); |
|
291 |
} |
|
292 |
||
293 |
void BitMap::at_put(idx_t offset, bool value) { |
|
294 |
if (value) { |
|
295 |
set_bit(offset); |
|
296 |
} else { |
|
297 |
clear_bit(offset); |
|
298 |
} |
|
299 |
} |
|
300 |
||
301 |
// Return true to indicate that this thread changed |
|
302 |
// the bit, false to indicate that someone else did. |
|
303 |
// In either case, the requested bit is in the |
|
304 |
// requested state some time during the period that |
|
305 |
// this thread is executing this call. More importantly, |
|
306 |
// if no other thread is executing an action to |
|
307 |
// change the requested bit to a state other than |
|
308 |
// the one that this thread is trying to set it to, |
|
309 |
// then the the bit is in the expected state |
|
310 |
// at exit from this method. However, rather than |
|
311 |
// make such a strong assertion here, based on |
|
312 |
// assuming such constrained use (which though true |
|
313 |
// today, could change in the future to service some |
|
314 |
// funky parallel algorithm), we encourage callers |
|
315 |
// to do such verification, as and when appropriate. |
|
316 |
bool BitMap::par_at_put(idx_t bit, bool value) { |
|
317 |
return value ? par_set_bit(bit) : par_clear_bit(bit); |
|
318 |
} |
|
319 |
||
320 |
void BitMap::at_put_range(idx_t start_offset, idx_t end_offset, bool value) { |
|
321 |
if (value) { |
|
322 |
set_range(start_offset, end_offset); |
|
323 |
} else { |
|
324 |
clear_range(start_offset, end_offset); |
|
325 |
} |
|
326 |
} |
|
327 |
||
328 |
void BitMap::par_at_put_range(idx_t beg, idx_t end, bool value) { |
|
329 |
verify_range(beg, end); |
|
330 |
||
331 |
idx_t beg_full_word = word_index_round_up(beg); |
|
332 |
idx_t end_full_word = word_index(end); |
|
333 |
||
334 |
if (beg_full_word < end_full_word) { |
|
335 |
// The range includes at least one full word. |
|
336 |
par_put_range_within_word(beg, bit_index(beg_full_word), value); |
|
337 |
if (value) { |
|
338 |
set_range_of_words(beg_full_word, end_full_word); |
|
339 |
} else { |
|
340 |
clear_range_of_words(beg_full_word, end_full_word); |
|
341 |
} |
|
342 |
par_put_range_within_word(bit_index(end_full_word), end, value); |
|
343 |
} else { |
|
344 |
// The range spans at most 2 partial words. |
|
345 |
idx_t boundary = MIN2(bit_index(beg_full_word), end); |
|
346 |
par_put_range_within_word(beg, boundary, value); |
|
347 |
par_put_range_within_word(boundary, end, value); |
|
348 |
} |
|
349 |
||
350 |
} |
|
351 |
||
352 |
void BitMap::at_put_large_range(idx_t beg, idx_t end, bool value) { |
|
353 |
if (value) { |
|
354 |
set_large_range(beg, end); |
|
355 |
} else { |
|
356 |
clear_large_range(beg, end); |
|
357 |
} |
|
358 |
} |
|
359 |
||
360 |
void BitMap::par_at_put_large_range(idx_t beg, idx_t end, bool value) { |
|
361 |
verify_range(beg, end); |
|
362 |
||
363 |
idx_t beg_full_word = word_index_round_up(beg); |
|
364 |
idx_t end_full_word = word_index(end); |
|
365 |
||
366 |
assert(end_full_word - beg_full_word >= 32, |
|
367 |
"the range must include at least 32 bytes"); |
|
368 |
||
369 |
// The range includes at least one full word. |
|
370 |
par_put_range_within_word(beg, bit_index(beg_full_word), value); |
|
371 |
if (value) { |
|
372 |
set_large_range_of_words(beg_full_word, end_full_word); |
|
373 |
} else { |
|
374 |
clear_large_range_of_words(beg_full_word, end_full_word); |
|
375 |
} |
|
376 |
par_put_range_within_word(bit_index(end_full_word), end, value); |
|
377 |
} |
|
378 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
379 |
bool BitMap::contains(const BitMap& other) const { |
1 | 380 |
assert(size() == other.size(), "must have same size"); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
381 |
const bm_word_t* dest_map = map(); |
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
382 |
const bm_word_t* other_map = other.map(); |
1 | 383 |
idx_t size = size_in_words(); |
384 |
for (idx_t index = 0; index < size_in_words(); index++) { |
|
1374 | 385 |
bm_word_t word_union = dest_map[index] | other_map[index]; |
1 | 386 |
// If this has more bits set than dest_map[index], then other is not a |
387 |
// subset. |
|
388 |
if (word_union != dest_map[index]) return false; |
|
389 |
} |
|
390 |
return true; |
|
391 |
} |
|
392 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
393 |
bool BitMap::intersects(const BitMap& other) const { |
1 | 394 |
assert(size() == other.size(), "must have same size"); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
395 |
const bm_word_t* dest_map = map(); |
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
396 |
const bm_word_t* other_map = other.map(); |
1 | 397 |
idx_t size = size_in_words(); |
398 |
for (idx_t index = 0; index < size_in_words(); index++) { |
|
399 |
if ((dest_map[index] & other_map[index]) != 0) return true; |
|
400 |
} |
|
401 |
// Otherwise, no intersection. |
|
402 |
return false; |
|
403 |
} |
|
404 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
405 |
void BitMap::set_union(const BitMap& other) { |
1 | 406 |
assert(size() == other.size(), "must have same size"); |
1374 | 407 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
408 |
const bm_word_t* other_map = other.map(); |
1 | 409 |
idx_t size = size_in_words(); |
410 |
for (idx_t index = 0; index < size_in_words(); index++) { |
|
411 |
dest_map[index] = dest_map[index] | other_map[index]; |
|
412 |
} |
|
413 |
} |
|
414 |
||
415 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
416 |
void BitMap::set_difference(const BitMap& other) { |
1 | 417 |
assert(size() == other.size(), "must have same size"); |
1374 | 418 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
419 |
const bm_word_t* other_map = other.map(); |
1 | 420 |
idx_t size = size_in_words(); |
421 |
for (idx_t index = 0; index < size_in_words(); index++) { |
|
422 |
dest_map[index] = dest_map[index] & ~(other_map[index]); |
|
423 |
} |
|
424 |
} |
|
425 |
||
426 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
427 |
void BitMap::set_intersection(const BitMap& other) { |
1 | 428 |
assert(size() == other.size(), "must have same size"); |
1374 | 429 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
430 |
const bm_word_t* other_map = other.map(); |
1 | 431 |
idx_t size = size_in_words(); |
432 |
for (idx_t index = 0; index < size; index++) { |
|
433 |
dest_map[index] = dest_map[index] & other_map[index]; |
|
434 |
} |
|
435 |
} |
|
436 |
||
437 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
438 |
void BitMap::set_intersection_at_offset(const BitMap& other, idx_t offset) { |
1374 | 439 |
assert(other.size() >= offset, "offset not in range"); |
440 |
assert(other.size() - offset >= size(), "other not large enough"); |
|
441 |
// XXX Ideally, we would remove this restriction. |
|
442 |
guarantee((offset % (sizeof(bm_word_t) * BitsPerByte)) == 0, |
|
443 |
"Only handle aligned cases so far."); |
|
444 |
bm_word_t* dest_map = map(); |
|
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
445 |
const bm_word_t* other_map = other.map(); |
1374 | 446 |
idx_t offset_word_ind = word_index(offset); |
447 |
idx_t size = size_in_words(); |
|
448 |
for (idx_t index = 0; index < size; index++) { |
|
449 |
dest_map[index] = dest_map[index] & other_map[offset_word_ind + index]; |
|
450 |
} |
|
451 |
} |
|
452 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
453 |
bool BitMap::set_union_with_result(const BitMap& other) { |
1 | 454 |
assert(size() == other.size(), "must have same size"); |
455 |
bool changed = false; |
|
1374 | 456 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
457 |
const bm_word_t* other_map = other.map(); |
1 | 458 |
idx_t size = size_in_words(); |
459 |
for (idx_t index = 0; index < size; index++) { |
|
26937 | 460 |
idx_t temp = dest_map[index] | other_map[index]; |
461 |
changed = changed || (temp != dest_map[index]); |
|
462 |
dest_map[index] = temp; |
|
1 | 463 |
} |
464 |
return changed; |
|
465 |
} |
|
466 |
||
467 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
468 |
bool BitMap::set_difference_with_result(const BitMap& other) { |
1 | 469 |
assert(size() == other.size(), "must have same size"); |
470 |
bool changed = false; |
|
1374 | 471 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
472 |
const bm_word_t* other_map = other.map(); |
1 | 473 |
idx_t size = size_in_words(); |
474 |
for (idx_t index = 0; index < size; index++) { |
|
1374 | 475 |
bm_word_t temp = dest_map[index] & ~(other_map[index]); |
1 | 476 |
changed = changed || (temp != dest_map[index]); |
477 |
dest_map[index] = temp; |
|
478 |
} |
|
479 |
return changed; |
|
480 |
} |
|
481 |
||
482 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
483 |
bool BitMap::set_intersection_with_result(const BitMap& other) { |
1 | 484 |
assert(size() == other.size(), "must have same size"); |
485 |
bool changed = false; |
|
1374 | 486 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
487 |
const bm_word_t* other_map = other.map(); |
1 | 488 |
idx_t size = size_in_words(); |
489 |
for (idx_t index = 0; index < size; index++) { |
|
1374 | 490 |
bm_word_t orig = dest_map[index]; |
491 |
bm_word_t temp = orig & other_map[index]; |
|
1 | 492 |
changed = changed || (temp != orig); |
493 |
dest_map[index] = temp; |
|
494 |
} |
|
495 |
return changed; |
|
496 |
} |
|
497 |
||
498 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
499 |
void BitMap::set_from(const BitMap& other) { |
1 | 500 |
assert(size() == other.size(), "must have same size"); |
1374 | 501 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
502 |
const bm_word_t* other_map = other.map(); |
1 | 503 |
idx_t size = size_in_words(); |
504 |
for (idx_t index = 0; index < size; index++) { |
|
505 |
dest_map[index] = other_map[index]; |
|
506 |
} |
|
507 |
} |
|
508 |
||
509 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
510 |
bool BitMap::is_same(const BitMap& other) { |
1 | 511 |
assert(size() == other.size(), "must have same size"); |
1374 | 512 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
513 |
const bm_word_t* other_map = other.map(); |
1 | 514 |
idx_t size = size_in_words(); |
515 |
for (idx_t index = 0; index < size; index++) { |
|
516 |
if (dest_map[index] != other_map[index]) return false; |
|
517 |
} |
|
518 |
return true; |
|
519 |
} |
|
520 |
||
521 |
bool BitMap::is_full() const { |
|
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
522 |
const bm_word_t* word = map(); |
1 | 523 |
idx_t rest = size(); |
524 |
for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) { |
|
26937 | 525 |
if (*word != ~(bm_word_t)0) return false; |
1 | 526 |
word++; |
527 |
} |
|
26937 | 528 |
return rest == 0 || (*word | ~right_n_bits((int)rest)) == ~(bm_word_t)0; |
1 | 529 |
} |
530 |
||
531 |
||
532 |
bool BitMap::is_empty() const { |
|
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
533 |
const bm_word_t* word = map(); |
1 | 534 |
idx_t rest = size(); |
535 |
for (; rest >= (idx_t) BitsPerWord; rest -= BitsPerWord) { |
|
26937 | 536 |
if (*word != 0) return false; |
1 | 537 |
word++; |
538 |
} |
|
26937 | 539 |
return rest == 0 || (*word & right_n_bits((int)rest)) == 0; |
1 | 540 |
} |
541 |
||
542 |
void BitMap::clear_large() { |
|
543 |
clear_large_range_of_words(0, size_in_words()); |
|
544 |
} |
|
545 |
||
546 |
// Note that if the closure itself modifies the bitmap |
|
547 |
// then modifications in and to the left of the _bit_ being |
|
548 |
// currently sampled will not be seen. Note also that the |
|
549 |
// interval [leftOffset, rightOffset) is right open. |
|
1374 | 550 |
bool BitMap::iterate(BitMapClosure* blk, idx_t leftOffset, idx_t rightOffset) { |
1 | 551 |
verify_range(leftOffset, rightOffset); |
552 |
||
553 |
idx_t startIndex = word_index(leftOffset); |
|
554 |
idx_t endIndex = MIN2(word_index(rightOffset) + 1, size_in_words()); |
|
555 |
for (idx_t index = startIndex, offset = leftOffset; |
|
556 |
offset < rightOffset && index < endIndex; |
|
557 |
offset = (++index) << LogBitsPerWord) { |
|
558 |
idx_t rest = map(index) >> (offset & (BitsPerWord - 1)); |
|
26937 | 559 |
for (; offset < rightOffset && rest != 0; offset++) { |
1 | 560 |
if (rest & 1) { |
1374 | 561 |
if (!blk->do_bit(offset)) return false; |
1 | 562 |
// resample at each closure application |
563 |
// (see, for instance, CMS bug 4525989) |
|
564 |
rest = map(index) >> (offset & (BitsPerWord -1)); |
|
565 |
} |
|
566 |
rest = rest >> 1; |
|
567 |
} |
|
568 |
} |
|
1374 | 569 |
return true; |
570 |
} |
|
571 |
||
572 |
BitMap::idx_t* BitMap::_pop_count_table = NULL; |
|
573 |
||
574 |
void BitMap::init_pop_count_table() { |
|
575 |
if (_pop_count_table == NULL) { |
|
13195 | 576 |
BitMap::idx_t *table = NEW_C_HEAP_ARRAY(idx_t, 256, mtInternal); |
1374 | 577 |
for (uint i = 0; i < 256; i++) { |
578 |
table[i] = num_set_bits(i); |
|
579 |
} |
|
580 |
||
581 |
intptr_t res = Atomic::cmpxchg_ptr((intptr_t) table, |
|
582 |
(intptr_t*) &_pop_count_table, |
|
583 |
(intptr_t) NULL_WORD); |
|
584 |
if (res != NULL_WORD) { |
|
585 |
guarantee( _pop_count_table == (void*) res, "invariant" ); |
|
27880
afb974a04396
8060074: os::free() takes MemoryTrackingLevel but doesn't need it
coleenp
parents:
26937
diff
changeset
|
586 |
FREE_C_HEAP_ARRAY(idx_t, table); |
1374 | 587 |
} |
588 |
} |
|
1 | 589 |
} |
590 |
||
1374 | 591 |
BitMap::idx_t BitMap::num_set_bits(bm_word_t w) { |
592 |
idx_t bits = 0; |
|
1 | 593 |
|
1374 | 594 |
while (w != 0) { |
595 |
while ((w & 1) == 0) { |
|
596 |
w >>= 1; |
|
1 | 597 |
} |
1374 | 598 |
bits++; |
599 |
w >>= 1; |
|
1 | 600 |
} |
1374 | 601 |
return bits; |
1 | 602 |
} |
603 |
||
1374 | 604 |
BitMap::idx_t BitMap::num_set_bits_from_table(unsigned char c) { |
605 |
assert(_pop_count_table != NULL, "precondition"); |
|
606 |
return _pop_count_table[c]; |
|
607 |
} |
|
1 | 608 |
|
1374 | 609 |
BitMap::idx_t BitMap::count_one_bits() const { |
610 |
init_pop_count_table(); // If necessary. |
|
611 |
idx_t sum = 0; |
|
612 |
typedef unsigned char uchar; |
|
613 |
for (idx_t i = 0; i < size_in_words(); i++) { |
|
614 |
bm_word_t w = map()[i]; |
|
615 |
for (size_t j = 0; j < sizeof(bm_word_t); j++) { |
|
616 |
sum += num_set_bits_from_table(uchar(w & 255)); |
|
617 |
w >>= 8; |
|
1 | 618 |
} |
619 |
} |
|
1374 | 620 |
return sum; |
1 | 621 |
} |
622 |
||
16685
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
13195
diff
changeset
|
623 |
void BitMap::print_on_error(outputStream* st, const char* prefix) const { |
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
13195
diff
changeset
|
624 |
st->print_cr("%s[" PTR_FORMAT ", " PTR_FORMAT ")", |
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
23545
diff
changeset
|
625 |
prefix, p2i(map()), p2i((char*)map() + (size() >> LogBitsPerByte))); |
16685
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
13195
diff
changeset
|
626 |
} |
1374 | 627 |
|
1 | 628 |
#ifndef PRODUCT |
629 |
||
630 |
void BitMap::print_on(outputStream* st) const { |
|
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
23545
diff
changeset
|
631 |
tty->print("Bitmap(" SIZE_FORMAT "):", size()); |
1 | 632 |
for (idx_t index = 0; index < size(); index++) { |
633 |
tty->print("%c", at(index) ? '1' : '0'); |
|
634 |
} |
|
635 |
tty->cr(); |
|
636 |
} |
|
637 |
||
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
638 |
class TestBitMap : public AllStatic { |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
639 |
const static BitMap::idx_t BITMAP_SIZE = 1024; |
38177 | 640 |
|
641 |
template <class ResizableBitMapClass> |
|
642 |
static void fillBitMap(ResizableBitMapClass& map) { |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
643 |
map.set_bit(1); |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
644 |
map.set_bit(3); |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
645 |
map.set_bit(17); |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
646 |
map.set_bit(512); |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
647 |
} |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
648 |
|
38177 | 649 |
template <class ResizableBitMapClass> |
650 |
static void testResize(BitMap::idx_t start_size) { |
|
651 |
ResourceMark rm; |
|
652 |
||
653 |
ResizableBitMapClass map(start_size); |
|
654 |
map.resize(BITMAP_SIZE); |
|
655 |
fillBitMap(map); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
656 |
|
38177 | 657 |
ResizableBitMapClass map2(BITMAP_SIZE); |
658 |
fillBitMap(map2); |
|
659 |
assert(map.is_same(map2), "could be"); |
|
660 |
} |
|
661 |
||
662 |
template <class ResizableBitMapClass> |
|
663 |
static void testResizeGrow() { |
|
664 |
testResize<ResizableBitMapClass>(0); |
|
665 |
testResize<ResizableBitMapClass>(128); |
|
666 |
} |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
667 |
|
38177 | 668 |
template <class ResizableBitMapClass> |
669 |
static void testResizeSame() { |
|
670 |
testResize<ResizableBitMapClass>(BITMAP_SIZE); |
|
671 |
} |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
672 |
|
38177 | 673 |
template <class ResizableBitMapClass> |
674 |
static void testResizeShrink() { |
|
675 |
testResize<ResizableBitMapClass>(BITMAP_SIZE * 2); |
|
676 |
} |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
677 |
|
38177 | 678 |
static void testResizeGrow() { |
679 |
testResizeGrow<ResourceBitMap>(); |
|
680 |
testResizeGrow<CHeapBitMap>(); |
|
681 |
} |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
682 |
|
38177 | 683 |
static void testResizeSame() { |
684 |
testResizeSame<ResourceBitMap>(); |
|
685 |
testResizeSame<CHeapBitMap>(); |
|
686 |
} |
|
687 |
||
688 |
static void testResizeShrink() { |
|
689 |
testResizeShrink<ResourceBitMap>(); |
|
690 |
testResizeShrink<CHeapBitMap>(); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
691 |
} |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
692 |
|
38177 | 693 |
static void testResize() { |
694 |
testResizeGrow(); |
|
695 |
testResizeSame(); |
|
696 |
testResizeShrink(); |
|
697 |
} |
|
698 |
||
699 |
template <class InitializableBitMapClass> |
|
700 |
static void testInitialize() { |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
701 |
ResourceMark rm; |
38177 | 702 |
|
703 |
InitializableBitMapClass map; |
|
704 |
map.initialize(BITMAP_SIZE); |
|
705 |
fillBitMap(map); |
|
706 |
||
707 |
InitializableBitMapClass map2(BITMAP_SIZE); |
|
708 |
fillBitMap(map2); |
|
709 |
assert(map.is_same(map2), "could be"); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
710 |
} |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
711 |
|
38177 | 712 |
static void testInitialize() { |
713 |
testInitialize<ResourceBitMap>(); |
|
714 |
testInitialize<CHeapBitMap>(); |
|
715 |
} |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
716 |
|
38177 | 717 |
template <class ReinitializableBitMapClass> |
718 |
static void testReinitialize(BitMap::idx_t init_size) { |
|
719 |
ResourceMark rm; |
|
720 |
||
721 |
ReinitializableBitMapClass map(init_size); |
|
722 |
map.reinitialize(BITMAP_SIZE); |
|
723 |
fillBitMap(map); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
724 |
|
38177 | 725 |
ReinitializableBitMapClass map2(BITMAP_SIZE); |
726 |
fillBitMap(map2); |
|
727 |
assert(map.is_same(map2), "could be"); |
|
728 |
} |
|
729 |
||
730 |
template <class ReinitializableBitMapClass> |
|
731 |
static void testReinitialize() { |
|
732 |
testReinitialize<ReinitializableBitMapClass>(0); |
|
733 |
testReinitialize<ReinitializableBitMapClass>(128); |
|
734 |
testReinitialize<ReinitializableBitMapClass>(BITMAP_SIZE); |
|
735 |
} |
|
736 |
||
737 |
static void testReinitialize() { |
|
738 |
testReinitialize<ResourceBitMap>(); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
739 |
} |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
740 |
|
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
741 |
public: |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
742 |
static void test() { |
38177 | 743 |
testResize(); |
744 |
testInitialize(); |
|
745 |
testReinitialize(); |
|
23545
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
746 |
} |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
747 |
}; |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
748 |
|
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
749 |
void TestBitMap_test() { |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
750 |
TestBitMap::test(); |
2c14fb03a06d
8037959: BitMap::resize frees old map before copying memory if !in_resource_area
mgerdin
parents:
22876
diff
changeset
|
751 |
} |
1 | 752 |
#endif |