1 /* 2 * Copyright (c) 2002, 2012, Oracle and/or its affiliates. All rights reserved. 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 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "gc_implementation/parallelScavenge/parallelScavengeHeap.hpp" 27 #include "gc_implementation/parallelScavenge/psOldGen.hpp" 28 #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp" 29 #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp" 30 #include "gc_implementation/shared/gcTrace.hpp" 31 #include "gc_implementation/shared/mutableSpace.hpp" 32 #include "memory/memRegion.hpp" 33 #include "oops/oop.inline.hpp" 34 #include "oops/oop.psgc.inline.hpp" 35 36 PSPromotionManager** PSPromotionManager::_manager_array = NULL; 37 OopStarTaskQueueSet* PSPromotionManager::_stack_array_depth = NULL; 38 PSOldGen* PSPromotionManager::_old_gen = NULL; 39 MutableSpace* PSPromotionManager::_young_space = NULL; 40 41 void PSPromotionManager::initialize() { 42 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); 43 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); 44 45 _old_gen = heap->old_gen(); 46 _young_space = heap->young_gen()->to_space(); 47 48 assert(_manager_array == NULL, "Attempt to initialize twice"); 49 _manager_array = NEW_C_HEAP_ARRAY(PSPromotionManager*, ParallelGCThreads+1, mtGC); 50 guarantee(_manager_array != NULL, "Could not initialize promotion manager"); 51 52 _stack_array_depth = new OopStarTaskQueueSet(ParallelGCThreads); 53 guarantee(_stack_array_depth != NULL, "Could not initialize promotion manager"); 54 55 // Create and register the PSPromotionManager(s) for the worker threads. 56 for(uint i=0; i<ParallelGCThreads; i++) { 57 _manager_array[i] = new PSPromotionManager(); 58 guarantee(_manager_array[i] != NULL, "Could not create PSPromotionManager"); 59 stack_array_depth()->register_queue(i, _manager_array[i]->claimed_stack_depth()); 60 } 61 62 // The VMThread gets its own PSPromotionManager, which is not available 63 // for work stealing. 64 _manager_array[ParallelGCThreads] = new PSPromotionManager(); 65 guarantee(_manager_array[ParallelGCThreads] != NULL, "Could not create PSPromotionManager"); 66 } 67 68 PSPromotionManager* PSPromotionManager::gc_thread_promotion_manager(int index) { 69 assert(index >= 0 && index < (int)ParallelGCThreads, "index out of range"); 70 assert(_manager_array != NULL, "Sanity"); 71 return _manager_array[index]; 72 } 73 74 PSPromotionManager* PSPromotionManager::vm_thread_promotion_manager() { 75 assert(_manager_array != NULL, "Sanity"); 76 return _manager_array[ParallelGCThreads]; 77 } 78 79 void PSPromotionManager::pre_scavenge() { 80 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); 81 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); 82 83 _young_space = heap->young_gen()->to_space(); 84 85 for(uint i=0; i<ParallelGCThreads+1; i++) { 86 manager_array(i)->reset(); 87 } 88 } 89 90 bool PSPromotionManager::post_scavenge(YoungGCTracer& gc_tracer) { 91 bool promotion_failure_occurred = false; 92 93 TASKQUEUE_STATS_ONLY(if (PrintGCDetails && ParallelGCVerbose) print_stats()); 94 for (uint i = 0; i < ParallelGCThreads + 1; i++) { 95 PSPromotionManager* manager = manager_array(i); 96 assert(manager->claimed_stack_depth()->is_empty(), "should be empty"); 97 if (manager->_promotion_failed_info.promotion_failed()) { 98 gc_tracer.report_promotion_failed(manager->_promotion_failed_info); 99 promotion_failure_occurred = true; 100 } 101 manager->flush_labs(); 102 } 103 return promotion_failure_occurred; 104 } 105 106 #if TASKQUEUE_STATS 107 void 108 PSPromotionManager::print_taskqueue_stats(uint i) const { 109 tty->print("%3u ", i); 110 _claimed_stack_depth.stats.print(); 111 tty->cr(); 112 } 113 114 void 115 PSPromotionManager::print_local_stats(uint i) const { 116 #define FMT " " SIZE_FORMAT_W(10) 117 tty->print_cr("%3u" FMT FMT FMT FMT, i, _masked_pushes, _masked_steals, 118 _arrays_chunked, _array_chunks_processed); 119 #undef FMT 120 } 121 122 static const char* const pm_stats_hdr[] = { 123 " --------masked------- arrays array", 124 "thr push steal chunked chunks", 125 "--- ---------- ---------- ---------- ----------" 126 }; 127 128 void 129 PSPromotionManager::print_stats() { 130 tty->print_cr("== GC Tasks Stats, GC %3d", 131 Universe::heap()->total_collections()); 132 133 tty->print("thr "); TaskQueueStats::print_header(1); tty->cr(); 134 tty->print("--- "); TaskQueueStats::print_header(2); tty->cr(); 135 for (uint i = 0; i < ParallelGCThreads + 1; ++i) { 136 manager_array(i)->print_taskqueue_stats(i); 137 } 138 139 const uint hlines = sizeof(pm_stats_hdr) / sizeof(pm_stats_hdr[0]); 140 for (uint i = 0; i < hlines; ++i) tty->print_cr(pm_stats_hdr[i]); 141 for (uint i = 0; i < ParallelGCThreads + 1; ++i) { 142 manager_array(i)->print_local_stats(i); 143 } 144 } 145 146 void 147 PSPromotionManager::reset_stats() { 148 claimed_stack_depth()->stats.reset(); 149 _masked_pushes = _masked_steals = 0; 150 _arrays_chunked = _array_chunks_processed = 0; 151 } 152 #endif // TASKQUEUE_STATS 153 154 PSPromotionManager::PSPromotionManager() { 155 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); 156 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); 157 158 // We set the old lab's start array. 159 _old_lab.set_start_array(old_gen()->start_array()); 160 161 uint queue_size; 162 claimed_stack_depth()->initialize(); 163 queue_size = claimed_stack_depth()->max_elems(); 164 165 _totally_drain = (ParallelGCThreads == 1) || (GCDrainStackTargetSize == 0); 166 if (_totally_drain) { 167 _target_stack_size = 0; 168 } else { 169 // don't let the target stack size to be more than 1/4 of the entries 170 _target_stack_size = (uint) MIN2((uint) GCDrainStackTargetSize, 171 (uint) (queue_size / 4)); 172 } 173 174 _array_chunk_size = ParGCArrayScanChunk; 175 // let's choose 1.5x the chunk size 176 _min_array_size_for_chunking = 3 * _array_chunk_size / 2; 177 178 reset(); 179 } 180 181 void PSPromotionManager::reset() { 182 assert(stacks_empty(), "reset of non-empty stack"); 183 184 // We need to get an assert in here to make sure the labs are always flushed. 185 186 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); 187 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); 188 189 // Do not prefill the LAB's, save heap wastage! 190 HeapWord* lab_base = young_space()->top(); 191 _young_lab.initialize(MemRegion(lab_base, (size_t)0)); 192 _young_gen_is_full = false; 193 194 lab_base = old_gen()->object_space()->top(); 195 _old_lab.initialize(MemRegion(lab_base, (size_t)0)); 196 _old_gen_is_full = false; 197 198 _promotion_failed_info.reset(); 199 200 TASKQUEUE_STATS_ONLY(reset_stats()); 201 } 202 203 204 void PSPromotionManager::drain_stacks_depth(bool totally_drain) { 205 totally_drain = totally_drain || _totally_drain; 206 207 #ifdef ASSERT 208 ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); 209 assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); 210 MutableSpace* to_space = heap->young_gen()->to_space(); 211 MutableSpace* old_space = heap->old_gen()->object_space(); 212 MutableSpace* perm_space = heap->perm_gen()->object_space(); 213 #endif /* ASSERT */ 214 215 OopStarTaskQueue* const tq = claimed_stack_depth(); 216 do { 217 StarTask p; 218 219 // Drain overflow stack first, so other threads can steal from 220 // claimed stack while we work. 221 while (tq->pop_overflow(p)) { 222 process_popped_location_depth(p); 223 } 224 225 if (totally_drain) { 226 while (tq->pop_local(p)) { 227 process_popped_location_depth(p); 228 } 229 } else { 230 while (tq->size() > _target_stack_size && tq->pop_local(p)) { 231 process_popped_location_depth(p); 232 } 233 } 234 } while (totally_drain && !tq->taskqueue_empty() || !tq->overflow_empty()); 235 236 assert(!totally_drain || tq->taskqueue_empty(), "Sanity"); 237 assert(totally_drain || tq->size() <= _target_stack_size, "Sanity"); 238 assert(tq->overflow_empty(), "Sanity"); 239 } 240 241 void PSPromotionManager::flush_labs() { 242 assert(stacks_empty(), "Attempt to flush lab with live stack"); 243 244 // If either promotion lab fills up, we can flush the 245 // lab but not refill it, so check first. 246 assert(!_young_lab.is_flushed() || _young_gen_is_full, "Sanity"); 247 if (!_young_lab.is_flushed()) 248 _young_lab.flush(); 249 250 assert(!_old_lab.is_flushed() || _old_gen_is_full, "Sanity"); 251 if (!_old_lab.is_flushed()) 252 _old_lab.flush(); 253 254 // Let PSScavenge know if we overflowed 255 if (_young_gen_is_full) { 256 PSScavenge::set_survivor_overflow(true); 257 } 258 } 259 260 template <class T> void PSPromotionManager::process_array_chunk_work( 261 oop obj, 262 int start, int end) { 263 assert(start <= end, "invariant"); 264 T* const base = (T*)objArrayOop(obj)->base(); 265 T* p = base + start; 266 T* const chunk_end = base + end; 267 while (p < chunk_end) { 268 if (PSScavenge::should_scavenge(p)) { 269 claim_or_forward_depth(p); 270 } 271 ++p; 272 } 273 } 274 275 void PSPromotionManager::process_array_chunk(oop old) { 276 assert(PSChunkLargeArrays, "invariant"); 277 assert(old->is_objArray(), "invariant"); 278 assert(old->is_forwarded(), "invariant"); 279 280 TASKQUEUE_STATS_ONLY(++_array_chunks_processed); 281 282 oop const obj = old->forwardee(); 283 284 int start; 285 int const end = arrayOop(old)->length(); 286 if (end > (int) _min_array_size_for_chunking) { 287 // we'll chunk more 288 start = end - _array_chunk_size; 289 assert(start > 0, "invariant"); 290 arrayOop(old)->set_length(start); 291 push_depth(mask_chunked_array_oop(old)); 292 TASKQUEUE_STATS_ONLY(++_masked_pushes); 293 } else { 294 // this is the final chunk for this array 295 start = 0; 296 int const actual_length = arrayOop(obj)->length(); 297 arrayOop(old)->set_length(actual_length); 298 } 299 300 if (UseCompressedOops) { 301 process_array_chunk_work<narrowOop>(obj, start, end); 302 } else { 303 process_array_chunk_work<oop>(obj, start, end); 304 } 305 } 306 307 oop PSPromotionManager::oop_promotion_failed(oop obj, markOop obj_mark) { 308 assert(_old_gen_is_full || PromotionFailureALot, "Sanity"); 309 310 // Attempt to CAS in the header. 311 // This tests if the header is still the same as when 312 // this started. If it is the same (i.e., no forwarding 313 // pointer has been installed), then this thread owns 314 // it. 315 if (obj->cas_forward_to(obj, obj_mark)) { 316 // We won any races, we "own" this object. 317 assert(obj == obj->forwardee(), "Sanity"); 318 319 _promotion_failed_info.register_promotion_failed(obj->size()); 320 321 obj->push_contents(this); 322 323 // Save the mark if needed 324 PSScavenge::oop_promotion_failed(obj, obj_mark); 325 } else { 326 // We lost, someone else "owns" this object 327 guarantee(obj->is_forwarded(), "Object must be forwarded if the cas failed."); 328 329 // No unallocation to worry about. 330 obj = obj->forwardee(); 331 } 332 333 #ifdef DEBUG 334 if (TraceScavenge) { 335 gclog_or_tty->print_cr("{%s %s 0x%x (%d)}", 336 "promotion-failure", 337 obj->blueprint()->internal_name(), 338 obj, obj->size()); 339 340 } 341 #endif 342 343 return obj; 344 }