annotate src/share/vm/gc_implementation/parallelScavenge/parMarkBitMap.cpp @ 6842:b9a9ed0f8eeb

7197424: update copyright year to match last edit in jdk8 hotspot repository Summary: Update copyright year to 2012 for relevant files Reviewed-by: dholmes, coleenp
author mikael
date Tue, 09 Oct 2012 10:09:34 -0700
parents d2a62e0f25eb
children 4868caa99ecf
Ignore whitespace changes - Everywhere: Within whitespace: At end of lines:
rev   line source
0
a61af66fc99e Initial load
duke
parents:
diff changeset
1 /*
6842
b9a9ed0f8eeb 7197424: update copyright year to match last edit in jdk8 hotspot repository
mikael
parents: 6197
diff changeset
2 * Copyright (c) 2005, 2012, Oracle and/or its affiliates. All rights reserved.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
a61af66fc99e Initial load
duke
parents:
diff changeset
4 *
a61af66fc99e Initial load
duke
parents:
diff changeset
5 * This code is free software; you can redistribute it and/or modify it
a61af66fc99e Initial load
duke
parents:
diff changeset
6 * under the terms of the GNU General Public License version 2 only, as
a61af66fc99e Initial load
duke
parents:
diff changeset
7 * published by the Free Software Foundation.
a61af66fc99e Initial load
duke
parents:
diff changeset
8 *
a61af66fc99e Initial load
duke
parents:
diff changeset
9 * This code is distributed in the hope that it will be useful, but WITHOUT
a61af66fc99e Initial load
duke
parents:
diff changeset
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
a61af66fc99e Initial load
duke
parents:
diff changeset
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
a61af66fc99e Initial load
duke
parents:
diff changeset
12 * version 2 for more details (a copy is included in the LICENSE file that
a61af66fc99e Initial load
duke
parents:
diff changeset
13 * accompanied this code).
a61af66fc99e Initial load
duke
parents:
diff changeset
14 *
a61af66fc99e Initial load
duke
parents:
diff changeset
15 * You should have received a copy of the GNU General Public License version
a61af66fc99e Initial load
duke
parents:
diff changeset
16 * 2 along with this work; if not, write to the Free Software Foundation,
a61af66fc99e Initial load
duke
parents:
diff changeset
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
a61af66fc99e Initial load
duke
parents:
diff changeset
18 *
1552
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 237
diff changeset
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 237
diff changeset
20 * or visit www.oracle.com if you need additional information or have any
c18cbe5936b8 6941466: Oracle rebranding changes for Hotspot repositories
trims
parents: 237
diff changeset
21 * questions.
0
a61af66fc99e Initial load
duke
parents:
diff changeset
22 *
a61af66fc99e Initial load
duke
parents:
diff changeset
23 */
a61af66fc99e Initial load
duke
parents:
diff changeset
24
1972
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
25 #include "precompiled.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
26 #include "gc_implementation/parallelScavenge/parMarkBitMap.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
27 #include "gc_implementation/parallelScavenge/parMarkBitMap.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
28 #include "gc_implementation/parallelScavenge/psParallelCompact.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
29 #include "oops/oop.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
30 #include "runtime/os.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
31 #include "utilities/bitMap.inline.hpp"
6197
d2a62e0f25eb 6995781: Native Memory Tracking (Phase 1)
zgu
parents: 3960
diff changeset
32 #include "services/memTracker.hpp"
1972
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
33 #ifdef TARGET_OS_FAMILY_linux
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
34 # include "os_linux.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
35 #endif
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
36 #ifdef TARGET_OS_FAMILY_solaris
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
37 # include "os_solaris.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
38 #endif
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
39 #ifdef TARGET_OS_FAMILY_windows
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
40 # include "os_windows.inline.hpp"
f95d63e2154a 6989984: Use standard include model for Hospot
stefank
parents: 1552
diff changeset
41 #endif
3960
f08d439fab8c 7089790: integrate bsd-port changes
never
parents: 1972
diff changeset
42 #ifdef TARGET_OS_FAMILY_bsd
f08d439fab8c 7089790: integrate bsd-port changes
never
parents: 1972
diff changeset
43 # include "os_bsd.inline.hpp"
f08d439fab8c 7089790: integrate bsd-port changes
never
parents: 1972
diff changeset
44 #endif
0
a61af66fc99e Initial load
duke
parents:
diff changeset
45
a61af66fc99e Initial load
duke
parents:
diff changeset
46 bool
a61af66fc99e Initial load
duke
parents:
diff changeset
47 ParMarkBitMap::initialize(MemRegion covered_region)
a61af66fc99e Initial load
duke
parents:
diff changeset
48 {
a61af66fc99e Initial load
duke
parents:
diff changeset
49 const idx_t bits = bits_required(covered_region);
a61af66fc99e Initial load
duke
parents:
diff changeset
50 // The bits will be divided evenly between two bitmaps; each of them should be
a61af66fc99e Initial load
duke
parents:
diff changeset
51 // an integral number of words.
a61af66fc99e Initial load
duke
parents:
diff changeset
52 assert(bits % (BitsPerWord * 2) == 0, "region size unaligned");
a61af66fc99e Initial load
duke
parents:
diff changeset
53
a61af66fc99e Initial load
duke
parents:
diff changeset
54 const size_t words = bits / BitsPerWord;
a61af66fc99e Initial load
duke
parents:
diff changeset
55 const size_t raw_bytes = words * sizeof(idx_t);
a61af66fc99e Initial load
duke
parents:
diff changeset
56 const size_t page_sz = os::page_size_for_region(raw_bytes, raw_bytes, 10);
a61af66fc99e Initial load
duke
parents:
diff changeset
57 const size_t granularity = os::vm_allocation_granularity();
a61af66fc99e Initial load
duke
parents:
diff changeset
58 const size_t bytes = align_size_up(raw_bytes, MAX2(page_sz, granularity));
a61af66fc99e Initial load
duke
parents:
diff changeset
59
a61af66fc99e Initial load
duke
parents:
diff changeset
60 const size_t rs_align = page_sz == (size_t) os::vm_page_size() ? 0 :
a61af66fc99e Initial load
duke
parents:
diff changeset
61 MAX2(page_sz, granularity);
79
82db0859acbe 6642862: Code cache allocation fails with large pages after 6588638
jcoomes
parents: 0
diff changeset
62 ReservedSpace rs(bytes, rs_align, rs_align > 0);
0
a61af66fc99e Initial load
duke
parents:
diff changeset
63 os::trace_page_sizes("par bitmap", raw_bytes, raw_bytes, page_sz,
a61af66fc99e Initial load
duke
parents:
diff changeset
64 rs.base(), rs.size());
6197
d2a62e0f25eb 6995781: Native Memory Tracking (Phase 1)
zgu
parents: 3960
diff changeset
65
d2a62e0f25eb 6995781: Native Memory Tracking (Phase 1)
zgu
parents: 3960
diff changeset
66 MemTracker::record_virtual_memory_type((address)rs.base(), mtGC);
d2a62e0f25eb 6995781: Native Memory Tracking (Phase 1)
zgu
parents: 3960
diff changeset
67
0
a61af66fc99e Initial load
duke
parents:
diff changeset
68 _virtual_space = new PSVirtualSpace(rs, page_sz);
a61af66fc99e Initial load
duke
parents:
diff changeset
69 if (_virtual_space != NULL && _virtual_space->expand_by(bytes)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
70 _region_start = covered_region.start();
a61af66fc99e Initial load
duke
parents:
diff changeset
71 _region_size = covered_region.word_size();
a61af66fc99e Initial load
duke
parents:
diff changeset
72 idx_t* map = (idx_t*)_virtual_space->reserved_low_addr();
a61af66fc99e Initial load
duke
parents:
diff changeset
73 _beg_bits.set_map(map);
a61af66fc99e Initial load
duke
parents:
diff changeset
74 _beg_bits.set_size(bits / 2);
a61af66fc99e Initial load
duke
parents:
diff changeset
75 _end_bits.set_map(map + words / 2);
a61af66fc99e Initial load
duke
parents:
diff changeset
76 _end_bits.set_size(bits / 2);
a61af66fc99e Initial load
duke
parents:
diff changeset
77 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
78 }
a61af66fc99e Initial load
duke
parents:
diff changeset
79
a61af66fc99e Initial load
duke
parents:
diff changeset
80 _region_start = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
81 _region_size = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
82 if (_virtual_space != NULL) {
a61af66fc99e Initial load
duke
parents:
diff changeset
83 delete _virtual_space;
a61af66fc99e Initial load
duke
parents:
diff changeset
84 _virtual_space = NULL;
237
1fdb98a17101 6716785: implicit null checks not triggering with CompressedOops
coleenp
parents: 196
diff changeset
85 // Release memory reserved in the space.
1fdb98a17101 6716785: implicit null checks not triggering with CompressedOops
coleenp
parents: 196
diff changeset
86 rs.release();
0
a61af66fc99e Initial load
duke
parents:
diff changeset
87 }
a61af66fc99e Initial load
duke
parents:
diff changeset
88 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
89 }
a61af66fc99e Initial load
duke
parents:
diff changeset
90
a61af66fc99e Initial load
duke
parents:
diff changeset
91 #ifdef ASSERT
a61af66fc99e Initial load
duke
parents:
diff changeset
92 extern size_t mark_bitmap_count;
a61af66fc99e Initial load
duke
parents:
diff changeset
93 extern size_t mark_bitmap_size;
a61af66fc99e Initial load
duke
parents:
diff changeset
94 #endif // #ifdef ASSERT
a61af66fc99e Initial load
duke
parents:
diff changeset
95
a61af66fc99e Initial load
duke
parents:
diff changeset
96 bool
a61af66fc99e Initial load
duke
parents:
diff changeset
97 ParMarkBitMap::mark_obj(HeapWord* addr, size_t size)
a61af66fc99e Initial load
duke
parents:
diff changeset
98 {
a61af66fc99e Initial load
duke
parents:
diff changeset
99 const idx_t beg_bit = addr_to_bit(addr);
a61af66fc99e Initial load
duke
parents:
diff changeset
100 if (_beg_bits.par_set_bit(beg_bit)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
101 const idx_t end_bit = addr_to_bit(addr + size - 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
102 bool end_bit_ok = _end_bits.par_set_bit(end_bit);
a61af66fc99e Initial load
duke
parents:
diff changeset
103 assert(end_bit_ok, "concurrency problem");
a61af66fc99e Initial load
duke
parents:
diff changeset
104 DEBUG_ONLY(Atomic::inc_ptr(&mark_bitmap_count));
a61af66fc99e Initial load
duke
parents:
diff changeset
105 DEBUG_ONLY(Atomic::add_ptr(size, &mark_bitmap_size));
a61af66fc99e Initial load
duke
parents:
diff changeset
106 return true;
a61af66fc99e Initial load
duke
parents:
diff changeset
107 }
a61af66fc99e Initial load
duke
parents:
diff changeset
108 return false;
a61af66fc99e Initial load
duke
parents:
diff changeset
109 }
a61af66fc99e Initial load
duke
parents:
diff changeset
110
a61af66fc99e Initial load
duke
parents:
diff changeset
111 size_t
a61af66fc99e Initial load
duke
parents:
diff changeset
112 ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, HeapWord* end_addr) const
a61af66fc99e Initial load
duke
parents:
diff changeset
113 {
a61af66fc99e Initial load
duke
parents:
diff changeset
114 assert(beg_addr <= end_addr, "bad range");
a61af66fc99e Initial load
duke
parents:
diff changeset
115
a61af66fc99e Initial load
duke
parents:
diff changeset
116 idx_t live_bits = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
117
a61af66fc99e Initial load
duke
parents:
diff changeset
118 // The bitmap routines require the right boundary to be word-aligned.
a61af66fc99e Initial load
duke
parents:
diff changeset
119 const idx_t end_bit = addr_to_bit(end_addr);
a61af66fc99e Initial load
duke
parents:
diff changeset
120 const idx_t range_end = BitMap::word_align_up(end_bit);
a61af66fc99e Initial load
duke
parents:
diff changeset
121
a61af66fc99e Initial load
duke
parents:
diff changeset
122 idx_t beg_bit = find_obj_beg(addr_to_bit(beg_addr), range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
123 while (beg_bit < end_bit) {
a61af66fc99e Initial load
duke
parents:
diff changeset
124 idx_t tmp_end = find_obj_end(beg_bit, range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
125 if (tmp_end < end_bit) {
a61af66fc99e Initial load
duke
parents:
diff changeset
126 live_bits += tmp_end - beg_bit + 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
127 beg_bit = find_obj_beg(tmp_end + 1, range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
128 } else {
a61af66fc99e Initial load
duke
parents:
diff changeset
129 live_bits += end_bit - beg_bit; // No + 1 here; end_bit is not counted.
a61af66fc99e Initial load
duke
parents:
diff changeset
130 return bits_to_words(live_bits);
a61af66fc99e Initial load
duke
parents:
diff changeset
131 }
a61af66fc99e Initial load
duke
parents:
diff changeset
132 }
a61af66fc99e Initial load
duke
parents:
diff changeset
133 return bits_to_words(live_bits);
a61af66fc99e Initial load
duke
parents:
diff changeset
134 }
a61af66fc99e Initial load
duke
parents:
diff changeset
135
a61af66fc99e Initial load
duke
parents:
diff changeset
136 size_t ParMarkBitMap::live_words_in_range(HeapWord* beg_addr, oop end_obj) const
a61af66fc99e Initial load
duke
parents:
diff changeset
137 {
a61af66fc99e Initial load
duke
parents:
diff changeset
138 assert(beg_addr <= (HeapWord*)end_obj, "bad range");
a61af66fc99e Initial load
duke
parents:
diff changeset
139 assert(is_marked(end_obj), "end_obj must be live");
a61af66fc99e Initial load
duke
parents:
diff changeset
140
a61af66fc99e Initial load
duke
parents:
diff changeset
141 idx_t live_bits = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
142
a61af66fc99e Initial load
duke
parents:
diff changeset
143 // The bitmap routines require the right boundary to be word-aligned.
a61af66fc99e Initial load
duke
parents:
diff changeset
144 const idx_t end_bit = addr_to_bit((HeapWord*)end_obj);
a61af66fc99e Initial load
duke
parents:
diff changeset
145 const idx_t range_end = BitMap::word_align_up(end_bit);
a61af66fc99e Initial load
duke
parents:
diff changeset
146
a61af66fc99e Initial load
duke
parents:
diff changeset
147 idx_t beg_bit = find_obj_beg(addr_to_bit(beg_addr), range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
148 while (beg_bit < end_bit) {
a61af66fc99e Initial load
duke
parents:
diff changeset
149 idx_t tmp_end = find_obj_end(beg_bit, range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
150 assert(tmp_end < end_bit, "missing end bit");
a61af66fc99e Initial load
duke
parents:
diff changeset
151 live_bits += tmp_end - beg_bit + 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
152 beg_bit = find_obj_beg(tmp_end + 1, range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
153 }
a61af66fc99e Initial load
duke
parents:
diff changeset
154 return bits_to_words(live_bits);
a61af66fc99e Initial load
duke
parents:
diff changeset
155 }
a61af66fc99e Initial load
duke
parents:
diff changeset
156
a61af66fc99e Initial load
duke
parents:
diff changeset
157 ParMarkBitMap::IterationStatus
a61af66fc99e Initial load
duke
parents:
diff changeset
158 ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
a61af66fc99e Initial load
duke
parents:
diff changeset
159 idx_t range_beg, idx_t range_end) const
a61af66fc99e Initial load
duke
parents:
diff changeset
160 {
a61af66fc99e Initial load
duke
parents:
diff changeset
161 DEBUG_ONLY(verify_bit(range_beg);)
a61af66fc99e Initial load
duke
parents:
diff changeset
162 DEBUG_ONLY(verify_bit(range_end);)
a61af66fc99e Initial load
duke
parents:
diff changeset
163 assert(range_beg <= range_end, "live range invalid");
a61af66fc99e Initial load
duke
parents:
diff changeset
164
a61af66fc99e Initial load
duke
parents:
diff changeset
165 // The bitmap routines require the right boundary to be word-aligned.
a61af66fc99e Initial load
duke
parents:
diff changeset
166 const idx_t search_end = BitMap::word_align_up(range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
167
a61af66fc99e Initial load
duke
parents:
diff changeset
168 idx_t cur_beg = find_obj_beg(range_beg, search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
169 while (cur_beg < range_end) {
a61af66fc99e Initial load
duke
parents:
diff changeset
170 const idx_t cur_end = find_obj_end(cur_beg, search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
171 if (cur_end >= range_end) {
a61af66fc99e Initial load
duke
parents:
diff changeset
172 // The obj ends outside the range.
a61af66fc99e Initial load
duke
parents:
diff changeset
173 live_closure->set_source(bit_to_addr(cur_beg));
a61af66fc99e Initial load
duke
parents:
diff changeset
174 return incomplete;
a61af66fc99e Initial load
duke
parents:
diff changeset
175 }
a61af66fc99e Initial load
duke
parents:
diff changeset
176
a61af66fc99e Initial load
duke
parents:
diff changeset
177 const size_t size = obj_size(cur_beg, cur_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
178 IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
a61af66fc99e Initial load
duke
parents:
diff changeset
179 if (status != incomplete) {
a61af66fc99e Initial load
duke
parents:
diff changeset
180 assert(status == would_overflow || status == full, "sanity");
a61af66fc99e Initial load
duke
parents:
diff changeset
181 return status;
a61af66fc99e Initial load
duke
parents:
diff changeset
182 }
a61af66fc99e Initial load
duke
parents:
diff changeset
183
a61af66fc99e Initial load
duke
parents:
diff changeset
184 // Successfully processed the object; look for the next object.
a61af66fc99e Initial load
duke
parents:
diff changeset
185 cur_beg = find_obj_beg(cur_end + 1, search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
186 }
a61af66fc99e Initial load
duke
parents:
diff changeset
187
a61af66fc99e Initial load
duke
parents:
diff changeset
188 live_closure->set_source(bit_to_addr(range_end));
a61af66fc99e Initial load
duke
parents:
diff changeset
189 return complete;
a61af66fc99e Initial load
duke
parents:
diff changeset
190 }
a61af66fc99e Initial load
duke
parents:
diff changeset
191
a61af66fc99e Initial load
duke
parents:
diff changeset
192 ParMarkBitMap::IterationStatus
a61af66fc99e Initial load
duke
parents:
diff changeset
193 ParMarkBitMap::iterate(ParMarkBitMapClosure* live_closure,
a61af66fc99e Initial load
duke
parents:
diff changeset
194 ParMarkBitMapClosure* dead_closure,
a61af66fc99e Initial load
duke
parents:
diff changeset
195 idx_t range_beg, idx_t range_end,
a61af66fc99e Initial load
duke
parents:
diff changeset
196 idx_t dead_range_end) const
a61af66fc99e Initial load
duke
parents:
diff changeset
197 {
a61af66fc99e Initial load
duke
parents:
diff changeset
198 DEBUG_ONLY(verify_bit(range_beg);)
a61af66fc99e Initial load
duke
parents:
diff changeset
199 DEBUG_ONLY(verify_bit(range_end);)
a61af66fc99e Initial load
duke
parents:
diff changeset
200 DEBUG_ONLY(verify_bit(dead_range_end);)
a61af66fc99e Initial load
duke
parents:
diff changeset
201 assert(range_beg <= range_end, "live range invalid");
a61af66fc99e Initial load
duke
parents:
diff changeset
202 assert(range_end <= dead_range_end, "dead range invalid");
a61af66fc99e Initial load
duke
parents:
diff changeset
203
a61af66fc99e Initial load
duke
parents:
diff changeset
204 // The bitmap routines require the right boundary to be word-aligned.
a61af66fc99e Initial load
duke
parents:
diff changeset
205 const idx_t live_search_end = BitMap::word_align_up(range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
206 const idx_t dead_search_end = BitMap::word_align_up(dead_range_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
207
a61af66fc99e Initial load
duke
parents:
diff changeset
208 idx_t cur_beg = range_beg;
a61af66fc99e Initial load
duke
parents:
diff changeset
209 if (range_beg < range_end && is_unmarked(range_beg)) {
a61af66fc99e Initial load
duke
parents:
diff changeset
210 // The range starts with dead space. Look for the next object, then fill.
a61af66fc99e Initial load
duke
parents:
diff changeset
211 cur_beg = find_obj_beg(range_beg + 1, dead_search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
212 const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
213 const size_t size = obj_size(range_beg, dead_space_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
214 dead_closure->do_addr(bit_to_addr(range_beg), size);
a61af66fc99e Initial load
duke
parents:
diff changeset
215 }
a61af66fc99e Initial load
duke
parents:
diff changeset
216
a61af66fc99e Initial load
duke
parents:
diff changeset
217 while (cur_beg < range_end) {
a61af66fc99e Initial load
duke
parents:
diff changeset
218 const idx_t cur_end = find_obj_end(cur_beg, live_search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
219 if (cur_end >= range_end) {
a61af66fc99e Initial load
duke
parents:
diff changeset
220 // The obj ends outside the range.
a61af66fc99e Initial load
duke
parents:
diff changeset
221 live_closure->set_source(bit_to_addr(cur_beg));
a61af66fc99e Initial load
duke
parents:
diff changeset
222 return incomplete;
a61af66fc99e Initial load
duke
parents:
diff changeset
223 }
a61af66fc99e Initial load
duke
parents:
diff changeset
224
a61af66fc99e Initial load
duke
parents:
diff changeset
225 const size_t size = obj_size(cur_beg, cur_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
226 IterationStatus status = live_closure->do_addr(bit_to_addr(cur_beg), size);
a61af66fc99e Initial load
duke
parents:
diff changeset
227 if (status != incomplete) {
a61af66fc99e Initial load
duke
parents:
diff changeset
228 assert(status == would_overflow || status == full, "sanity");
a61af66fc99e Initial load
duke
parents:
diff changeset
229 return status;
a61af66fc99e Initial load
duke
parents:
diff changeset
230 }
a61af66fc99e Initial load
duke
parents:
diff changeset
231
a61af66fc99e Initial load
duke
parents:
diff changeset
232 // Look for the start of the next object.
a61af66fc99e Initial load
duke
parents:
diff changeset
233 const idx_t dead_space_beg = cur_end + 1;
a61af66fc99e Initial load
duke
parents:
diff changeset
234 cur_beg = find_obj_beg(dead_space_beg, dead_search_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
235 if (cur_beg > dead_space_beg) {
a61af66fc99e Initial load
duke
parents:
diff changeset
236 // Found dead space; compute the size and invoke the dead closure.
a61af66fc99e Initial load
duke
parents:
diff changeset
237 const idx_t dead_space_end = MIN2(cur_beg - 1, dead_range_end - 1);
a61af66fc99e Initial load
duke
parents:
diff changeset
238 const size_t size = obj_size(dead_space_beg, dead_space_end);
a61af66fc99e Initial load
duke
parents:
diff changeset
239 dead_closure->do_addr(bit_to_addr(dead_space_beg), size);
a61af66fc99e Initial load
duke
parents:
diff changeset
240 }
a61af66fc99e Initial load
duke
parents:
diff changeset
241 }
a61af66fc99e Initial load
duke
parents:
diff changeset
242
a61af66fc99e Initial load
duke
parents:
diff changeset
243 live_closure->set_source(bit_to_addr(range_end));
a61af66fc99e Initial load
duke
parents:
diff changeset
244 return complete;
a61af66fc99e Initial load
duke
parents:
diff changeset
245 }
a61af66fc99e Initial load
duke
parents:
diff changeset
246
a61af66fc99e Initial load
duke
parents:
diff changeset
247 #ifndef PRODUCT
a61af66fc99e Initial load
duke
parents:
diff changeset
248 void ParMarkBitMap::reset_counters()
a61af66fc99e Initial load
duke
parents:
diff changeset
249 {
a61af66fc99e Initial load
duke
parents:
diff changeset
250 _cas_tries = _cas_retries = _cas_by_another = 0;
a61af66fc99e Initial load
duke
parents:
diff changeset
251 }
a61af66fc99e Initial load
duke
parents:
diff changeset
252 #endif // #ifndef PRODUCT
a61af66fc99e Initial load
duke
parents:
diff changeset
253
a61af66fc99e Initial load
duke
parents:
diff changeset
254 #ifdef ASSERT
a61af66fc99e Initial load
duke
parents:
diff changeset
255 void ParMarkBitMap::verify_clear() const
a61af66fc99e Initial load
duke
parents:
diff changeset
256 {
a61af66fc99e Initial load
duke
parents:
diff changeset
257 const idx_t* const beg = (const idx_t*)_virtual_space->committed_low_addr();
a61af66fc99e Initial load
duke
parents:
diff changeset
258 const idx_t* const end = (const idx_t*)_virtual_space->committed_high_addr();
a61af66fc99e Initial load
duke
parents:
diff changeset
259 for (const idx_t* p = beg; p < end; ++p) {
a61af66fc99e Initial load
duke
parents:
diff changeset
260 assert(*p == 0, "bitmap not clear");
a61af66fc99e Initial load
duke
parents:
diff changeset
261 }
a61af66fc99e Initial load
duke
parents:
diff changeset
262 }
a61af66fc99e Initial load
duke
parents:
diff changeset
263 #endif // #ifdef ASSERT