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