author | tschatzl |
Mon, 15 May 2017 12:20:15 +0200 | |
changeset 45114 | 45644c5f6b8e |
parent 42591 | 821346dfd80d |
child 46704 | 211b3f6b75ef |
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" |
40655
9f644073d3a0
8157907: Incorrect inclusion of atomic.hpp instead of atomic.inline.hpp
dholmes
parents:
40639
diff
changeset
|
28 |
#include "runtime/atomic.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 |
||
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
379 |
inline bm_word_t tail_mask(idx_t tail_bits) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
380 |
assert(tail_bits != 0, "precondition"); // Works, but shouldn't be called. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
381 |
assert(tail_bits < (idx_t)BitsPerWord, "precondition"); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
382 |
return (bm_word_t(1) << tail_bits) - 1; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
383 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
384 |
|
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
385 |
// Get the low tail_bits of value, which is the last partial word of a map. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
386 |
inline bm_word_t tail_of_map(bm_word_t value, idx_t tail_bits) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
387 |
return value & tail_mask(tail_bits); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
388 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
389 |
|
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
390 |
// Compute the new last word of a map with a non-aligned length. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
391 |
// new_value has the new trailing bits of the map in the low tail_bits. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
392 |
// old_value is the last word of the map, including bits beyond the end. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
393 |
// Returns old_value with the low tail_bits replaced by the corresponding |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
394 |
// bits in new_value. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
395 |
inline bm_word_t merge_tail_of_map(bm_word_t new_value, |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
396 |
bm_word_t old_value, |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
397 |
idx_t tail_bits) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
398 |
bm_word_t mask = tail_mask(tail_bits); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
399 |
return (new_value & mask) | (old_value & ~mask); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
400 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
401 |
|
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
402 |
bool BitMap::contains(const BitMap& other) const { |
1 | 403 |
assert(size() == other.size(), "must have same size"); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
404 |
const bm_word_t* dest_map = map(); |
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
405 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
406 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
407 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
408 |
// false if other bitmap has bits set which are clear in this bitmap. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
409 |
if ((~dest_map[index] & other_map[index]) != 0) return false; |
1 | 410 |
} |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
411 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
412 |
// true unless there is a partial-word tail in which the other |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
413 |
// bitmap has bits set which are clear in this bitmap. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
414 |
return (rest == 0) || tail_of_map(~dest_map[limit] & other_map[limit], rest) == 0; |
1 | 415 |
} |
416 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
417 |
bool BitMap::intersects(const BitMap& other) const { |
1 | 418 |
assert(size() == other.size(), "must have same size"); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
419 |
const bm_word_t* dest_map = map(); |
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
420 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
421 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
422 |
for (idx_t index = 0; index < limit; ++index) { |
1 | 423 |
if ((dest_map[index] & other_map[index]) != 0) return true; |
424 |
} |
|
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
425 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
426 |
// false unless there is a partial-word tail with non-empty intersection. |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
427 |
return (rest > 0) && tail_of_map(dest_map[limit] & other_map[limit], rest) != 0; |
1 | 428 |
} |
429 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
430 |
void BitMap::set_union(const BitMap& other) { |
1 | 431 |
assert(size() == other.size(), "must have same size"); |
1374 | 432 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
433 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
434 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
435 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
436 |
dest_map[index] |= other_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
437 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
438 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
439 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
440 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
441 |
dest_map[limit] = merge_tail_of_map(orig | other_map[limit], orig, rest); |
1 | 442 |
} |
443 |
} |
|
444 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
445 |
void BitMap::set_difference(const BitMap& other) { |
1 | 446 |
assert(size() == other.size(), "must have same size"); |
1374 | 447 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
448 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
449 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
450 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
451 |
dest_map[index] &= ~other_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
452 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
453 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
454 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
455 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
456 |
dest_map[limit] = merge_tail_of_map(orig & ~other_map[limit], orig, rest); |
1 | 457 |
} |
458 |
} |
|
459 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
460 |
void BitMap::set_intersection(const BitMap& other) { |
1 | 461 |
assert(size() == other.size(), "must have same size"); |
1374 | 462 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
463 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
464 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
465 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
466 |
dest_map[index] &= other_map[index]; |
1 | 467 |
} |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
468 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
469 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
470 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
471 |
dest_map[limit] = merge_tail_of_map(orig & other_map[limit], orig, rest); |
1374 | 472 |
} |
473 |
} |
|
474 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
475 |
bool BitMap::set_union_with_result(const BitMap& other) { |
1 | 476 |
assert(size() == other.size(), "must have same size"); |
477 |
bool changed = false; |
|
1374 | 478 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
479 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
480 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
481 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
482 |
bm_word_t orig = dest_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
483 |
bm_word_t temp = orig | other_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
484 |
changed = changed || (temp != orig); |
26937 | 485 |
dest_map[index] = temp; |
1 | 486 |
} |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
487 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
488 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
489 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
490 |
bm_word_t temp = merge_tail_of_map(orig | other_map[limit], orig, rest); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
491 |
changed = changed || (temp != orig); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
492 |
dest_map[limit] = temp; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
493 |
} |
1 | 494 |
return changed; |
495 |
} |
|
496 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
497 |
bool BitMap::set_difference_with_result(const BitMap& other) { |
1 | 498 |
assert(size() == other.size(), "must have same size"); |
499 |
bool changed = false; |
|
1374 | 500 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
501 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
502 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
503 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
504 |
bm_word_t orig = dest_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
505 |
bm_word_t temp = orig & ~other_map[index]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
506 |
changed = changed || (temp != orig); |
1 | 507 |
dest_map[index] = temp; |
508 |
} |
|
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
509 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
510 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
511 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
512 |
bm_word_t temp = merge_tail_of_map(orig & ~other_map[limit], orig, rest); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
513 |
changed = changed || (temp != orig); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
514 |
dest_map[limit] = temp; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
515 |
} |
1 | 516 |
return changed; |
517 |
} |
|
518 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
519 |
bool BitMap::set_intersection_with_result(const BitMap& other) { |
1 | 520 |
assert(size() == other.size(), "must have same size"); |
521 |
bool changed = false; |
|
1374 | 522 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
523 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
524 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
525 |
for (idx_t index = 0; index < limit; ++index) { |
1374 | 526 |
bm_word_t orig = dest_map[index]; |
527 |
bm_word_t temp = orig & other_map[index]; |
|
1 | 528 |
changed = changed || (temp != orig); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
529 |
dest_map[index] = temp; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
530 |
} |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
531 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
532 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
533 |
bm_word_t orig = dest_map[limit]; |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
534 |
bm_word_t temp = merge_tail_of_map(orig & other_map[limit], orig, rest); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
535 |
changed = changed || (temp != orig); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
536 |
dest_map[limit] = temp; |
1 | 537 |
} |
538 |
return changed; |
|
539 |
} |
|
540 |
||
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
541 |
void BitMap::set_from(const BitMap& other) { |
1 | 542 |
assert(size() == other.size(), "must have same size"); |
1374 | 543 |
bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
544 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
545 |
idx_t copy_words = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
546 |
Copy::disjoint_words((HeapWord*)other_map, (HeapWord*)dest_map, copy_words); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
547 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
548 |
if (rest > 0) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
549 |
dest_map[copy_words] = merge_tail_of_map(other_map[copy_words], |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
550 |
dest_map[copy_words], |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
551 |
rest); |
1 | 552 |
} |
553 |
} |
|
554 |
||
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
555 |
bool BitMap::is_same(const BitMap& other) const { |
1 | 556 |
assert(size() == other.size(), "must have same size"); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
557 |
const bm_word_t* dest_map = map(); |
38102
839593075df1
8141496: BitMap set operations copy their other BitMap argument
stefank
parents:
37414
diff
changeset
|
558 |
const bm_word_t* other_map = other.map(); |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
559 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
560 |
for (idx_t index = 0; index < limit; ++index) { |
1 | 561 |
if (dest_map[index] != other_map[index]) return false; |
562 |
} |
|
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
563 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
564 |
return (rest == 0) || (tail_of_map(dest_map[limit] ^ other_map[limit], rest) == 0); |
1 | 565 |
} |
566 |
||
567 |
bool BitMap::is_full() const { |
|
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
568 |
const bm_word_t* words = map(); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
569 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
570 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
571 |
if (~words[index] != 0) return false; |
1 | 572 |
} |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
573 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
574 |
return (rest == 0) || (tail_of_map(~words[limit], rest) == 0); |
1 | 575 |
} |
576 |
||
577 |
bool BitMap::is_empty() const { |
|
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
578 |
const bm_word_t* words = map(); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
579 |
idx_t limit = word_index(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
580 |
for (idx_t index = 0; index < limit; ++index) { |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
581 |
if (words[index] != 0) return false; |
1 | 582 |
} |
40639
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
583 |
idx_t rest = bit_in_word(size()); |
83c879c8db57
8155043: BitMap set operations assume clear bits beyond unaligned end
kbarrett
parents:
38177
diff
changeset
|
584 |
return (rest == 0) || (tail_of_map(words[limit], rest) == 0); |
1 | 585 |
} |
586 |
||
587 |
void BitMap::clear_large() { |
|
588 |
clear_large_range_of_words(0, size_in_words()); |
|
589 |
} |
|
590 |
||
591 |
// Note that if the closure itself modifies the bitmap |
|
592 |
// then modifications in and to the left of the _bit_ being |
|
593 |
// currently sampled will not be seen. Note also that the |
|
594 |
// interval [leftOffset, rightOffset) is right open. |
|
1374 | 595 |
bool BitMap::iterate(BitMapClosure* blk, idx_t leftOffset, idx_t rightOffset) { |
1 | 596 |
verify_range(leftOffset, rightOffset); |
597 |
||
598 |
idx_t startIndex = word_index(leftOffset); |
|
599 |
idx_t endIndex = MIN2(word_index(rightOffset) + 1, size_in_words()); |
|
600 |
for (idx_t index = startIndex, offset = leftOffset; |
|
601 |
offset < rightOffset && index < endIndex; |
|
602 |
offset = (++index) << LogBitsPerWord) { |
|
603 |
idx_t rest = map(index) >> (offset & (BitsPerWord - 1)); |
|
26937 | 604 |
for (; offset < rightOffset && rest != 0; offset++) { |
1 | 605 |
if (rest & 1) { |
1374 | 606 |
if (!blk->do_bit(offset)) return false; |
1 | 607 |
// resample at each closure application |
608 |
// (see, for instance, CMS bug 4525989) |
|
609 |
rest = map(index) >> (offset & (BitsPerWord -1)); |
|
610 |
} |
|
611 |
rest = rest >> 1; |
|
612 |
} |
|
613 |
} |
|
1374 | 614 |
return true; |
615 |
} |
|
616 |
||
617 |
BitMap::idx_t* BitMap::_pop_count_table = NULL; |
|
618 |
||
619 |
void BitMap::init_pop_count_table() { |
|
620 |
if (_pop_count_table == NULL) { |
|
13195 | 621 |
BitMap::idx_t *table = NEW_C_HEAP_ARRAY(idx_t, 256, mtInternal); |
1374 | 622 |
for (uint i = 0; i < 256; i++) { |
623 |
table[i] = num_set_bits(i); |
|
624 |
} |
|
625 |
||
626 |
intptr_t res = Atomic::cmpxchg_ptr((intptr_t) table, |
|
627 |
(intptr_t*) &_pop_count_table, |
|
628 |
(intptr_t) NULL_WORD); |
|
629 |
if (res != NULL_WORD) { |
|
630 |
guarantee( _pop_count_table == (void*) res, "invariant" ); |
|
27880
afb974a04396
8060074: os::free() takes MemoryTrackingLevel but doesn't need it
coleenp
parents:
26937
diff
changeset
|
631 |
FREE_C_HEAP_ARRAY(idx_t, table); |
1374 | 632 |
} |
633 |
} |
|
1 | 634 |
} |
635 |
||
1374 | 636 |
BitMap::idx_t BitMap::num_set_bits(bm_word_t w) { |
637 |
idx_t bits = 0; |
|
1 | 638 |
|
1374 | 639 |
while (w != 0) { |
640 |
while ((w & 1) == 0) { |
|
641 |
w >>= 1; |
|
1 | 642 |
} |
1374 | 643 |
bits++; |
644 |
w >>= 1; |
|
1 | 645 |
} |
1374 | 646 |
return bits; |
1 | 647 |
} |
648 |
||
1374 | 649 |
BitMap::idx_t BitMap::num_set_bits_from_table(unsigned char c) { |
650 |
assert(_pop_count_table != NULL, "precondition"); |
|
651 |
return _pop_count_table[c]; |
|
652 |
} |
|
1 | 653 |
|
1374 | 654 |
BitMap::idx_t BitMap::count_one_bits() const { |
655 |
init_pop_count_table(); // If necessary. |
|
656 |
idx_t sum = 0; |
|
657 |
typedef unsigned char uchar; |
|
658 |
for (idx_t i = 0; i < size_in_words(); i++) { |
|
659 |
bm_word_t w = map()[i]; |
|
660 |
for (size_t j = 0; j < sizeof(bm_word_t); j++) { |
|
661 |
sum += num_set_bits_from_table(uchar(w & 255)); |
|
662 |
w >>= 8; |
|
1 | 663 |
} |
664 |
} |
|
1374 | 665 |
return sum; |
1 | 666 |
} |
667 |
||
16685
41c34debcde0
8011872: Include Bit Map addresses in the hs_err files
stefank
parents:
13195
diff
changeset
|
668 |
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
|
669 |
st->print_cr("%s[" PTR_FORMAT ", " PTR_FORMAT ")", |
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
23545
diff
changeset
|
670 |
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
|
671 |
} |
1374 | 672 |
|
1 | 673 |
#ifndef PRODUCT |
674 |
||
675 |
void BitMap::print_on(outputStream* st) const { |
|
24424
2658d7834c6e
8037816: Fix for 8036122 breaks build with Xcode5/clang
drchase
parents:
23545
diff
changeset
|
676 |
tty->print("Bitmap(" SIZE_FORMAT "):", size()); |
1 | 677 |
for (idx_t index = 0; index < size(); index++) { |
678 |
tty->print("%c", at(index) ? '1' : '0'); |
|
679 |
} |
|
680 |
tty->cr(); |
|
681 |
} |
|
682 |
||
683 |
#endif |