duke@435: /* trims@1907: * Copyright (c) 2005, 2009, Oracle and/or its affiliates. All rights reserved. duke@435: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@435: * duke@435: * This code is free software; you can redistribute it and/or modify it duke@435: * under the terms of the GNU General Public License version 2 only, as duke@435: * published by the Free Software Foundation. duke@435: * duke@435: * This code is distributed in the hope that it will be useful, but WITHOUT duke@435: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@435: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@435: * version 2 for more details (a copy is included in the LICENSE file that duke@435: * accompanied this code). duke@435: * duke@435: * You should have received a copy of the GNU General Public License version duke@435: * 2 along with this work; if not, write to the Free Software Foundation, duke@435: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@435: * trims@1907: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA trims@1907: * or visit www.oracle.com if you need additional information or have any trims@1907: * questions. duke@435: * duke@435: */ duke@435: duke@435: #include "incls/_precompiled.incl" duke@435: #include "incls/_psCompactionManager.cpp.incl" duke@435: duke@435: PSOldGen* ParCompactionManager::_old_gen = NULL; duke@435: ParCompactionManager** ParCompactionManager::_manager_array = NULL; duke@435: OopTaskQueueSet* ParCompactionManager::_stack_array = NULL; jcoomes@1746: ParCompactionManager::ObjArrayTaskQueueSet* jcoomes@1746: ParCompactionManager::_objarray_queues = NULL; duke@435: ObjectStartArray* ParCompactionManager::_start_array = NULL; duke@435: ParMarkBitMap* ParCompactionManager::_mark_bitmap = NULL; jcoomes@810: RegionTaskQueueSet* ParCompactionManager::_region_array = NULL; duke@435: duke@435: ParCompactionManager::ParCompactionManager() : duke@435: _action(CopyAndUpdate) { duke@435: duke@435: ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); duke@435: assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); duke@435: duke@435: _old_gen = heap->old_gen(); duke@435: _start_array = old_gen()->start_array(); duke@435: duke@435: duke@435: marking_stack()->initialize(); duke@435: duke@435: // We want the overflow stack to be permanent duke@435: _overflow_stack = new (ResourceObj::C_HEAP) GrowableArray(10, true); jcoomes@1746: jcoomes@1746: _objarray_queue.initialize(); jcoomes@1746: _objarray_overflow_stack = jcoomes@1746: new (ResourceObj::C_HEAP) ObjArrayOverflowStack(10, true); jcoomes@1746: jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow jcoomes@810: region_stack()->initialize(); duke@435: #else jcoomes@810: region_stack()->initialize(); duke@435: duke@435: // We want the overflow stack to be permanent jcoomes@810: _region_overflow_stack = duke@435: new (ResourceObj::C_HEAP) GrowableArray(10, true); duke@435: #endif duke@435: duke@435: // Note that _revisit_klass_stack is allocated out of the duke@435: // C heap (as opposed to out of ResourceArena). duke@435: int size = duke@435: (SystemDictionary::number_of_classes() * 2) * 2 / ParallelGCThreads; duke@435: _revisit_klass_stack = new (ResourceObj::C_HEAP) GrowableArray(size, true); ysr@1376: // From some experiments (#klass/k)^2 for k = 10 seems a better fit, but this will ysr@1376: // have to do for now until we are able to investigate a more optimal setting. ysr@1376: _revisit_mdo_stack = new (ResourceObj::C_HEAP) GrowableArray(size*2, true); duke@435: duke@435: } duke@435: duke@435: ParCompactionManager::~ParCompactionManager() { duke@435: delete _overflow_stack; jcoomes@1746: delete _objarray_overflow_stack; duke@435: delete _revisit_klass_stack; ysr@1376: delete _revisit_mdo_stack; duke@435: // _manager_array and _stack_array are statics duke@435: // shared with all instances of ParCompactionManager duke@435: // should not be deallocated. duke@435: } duke@435: duke@435: void ParCompactionManager::initialize(ParMarkBitMap* mbm) { duke@435: assert(PSParallelCompact::gc_task_manager() != NULL, duke@435: "Needed for initialization"); duke@435: duke@435: _mark_bitmap = mbm; duke@435: duke@435: uint parallel_gc_threads = PSParallelCompact::gc_task_manager()->workers(); duke@435: duke@435: assert(_manager_array == NULL, "Attempt to initialize twice"); duke@435: _manager_array = NEW_C_HEAP_ARRAY(ParCompactionManager*, parallel_gc_threads+1 ); jcoomes@1746: guarantee(_manager_array != NULL, "Could not allocate manager_array"); duke@435: duke@435: _stack_array = new OopTaskQueueSet(parallel_gc_threads); jcoomes@1746: guarantee(_stack_array != NULL, "Could not allocate stack_array"); jcoomes@1746: _objarray_queues = new ObjArrayTaskQueueSet(parallel_gc_threads); jcoomes@1746: guarantee(_objarray_queues != NULL, "Could not allocate objarray_queues"); jcoomes@810: _region_array = new RegionTaskQueueSet(parallel_gc_threads); jcoomes@1746: guarantee(_region_array != NULL, "Could not allocate region_array"); duke@435: duke@435: // Create and register the ParCompactionManager(s) for the worker threads. duke@435: for(uint i=0; iregister_queue(i, _manager_array[i]->marking_stack()); jcoomes@1746: _objarray_queues->register_queue(i, &_manager_array[i]->_objarray_queue); jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow jcoomes@810: region_array()->register_queue(i, _manager_array[i]->region_stack()->task_queue()); duke@435: #else jcoomes@810: region_array()->register_queue(i, _manager_array[i]->region_stack()); duke@435: #endif duke@435: } duke@435: duke@435: // The VMThread gets its own ParCompactionManager, which is not available duke@435: // for work stealing. duke@435: _manager_array[parallel_gc_threads] = new ParCompactionManager(); duke@435: guarantee(_manager_array[parallel_gc_threads] != NULL, duke@435: "Could not create ParCompactionManager"); duke@435: assert(PSParallelCompact::gc_task_manager()->workers() != 0, duke@435: "Not initialized?"); duke@435: } duke@435: duke@435: bool ParCompactionManager::should_update() { duke@435: assert(action() != NotValid, "Action is not set"); duke@435: return (action() == ParCompactionManager::Update) || duke@435: (action() == ParCompactionManager::CopyAndUpdate) || duke@435: (action() == ParCompactionManager::UpdateAndCopy); duke@435: } duke@435: duke@435: bool ParCompactionManager::should_copy() { duke@435: assert(action() != NotValid, "Action is not set"); duke@435: return (action() == ParCompactionManager::Copy) || duke@435: (action() == ParCompactionManager::CopyAndUpdate) || duke@435: (action() == ParCompactionManager::UpdateAndCopy); duke@435: } duke@435: duke@435: bool ParCompactionManager::should_verify_only() { duke@435: assert(action() != NotValid, "Action is not set"); duke@435: return action() == ParCompactionManager::VerifyUpdate; duke@435: } duke@435: duke@435: bool ParCompactionManager::should_reset_only() { duke@435: assert(action() != NotValid, "Action is not set"); duke@435: return action() == ParCompactionManager::ResetObjects; duke@435: } duke@435: duke@435: // For now save on a stack duke@435: void ParCompactionManager::save_for_scanning(oop m) { duke@435: stack_push(m); duke@435: } duke@435: duke@435: void ParCompactionManager::stack_push(oop obj) { duke@435: duke@435: if(!marking_stack()->push(obj)) { duke@435: overflow_stack()->push(obj); duke@435: } duke@435: } duke@435: duke@435: oop ParCompactionManager::retrieve_for_scanning() { duke@435: duke@435: // Should not be used in the parallel case duke@435: ShouldNotReachHere(); duke@435: return NULL; duke@435: } duke@435: jcoomes@810: // Save region on a stack jcoomes@810: void ParCompactionManager::save_for_processing(size_t region_index) { duke@435: #ifdef ASSERT duke@435: const ParallelCompactData& sd = PSParallelCompact::summary_data(); jcoomes@810: ParallelCompactData::RegionData* const region_ptr = sd.region(region_index); jcoomes@810: assert(region_ptr->claimed(), "must be claimed"); jcoomes@810: assert(region_ptr->_pushed++ == 0, "should only be pushed once"); duke@435: #endif jcoomes@810: region_stack_push(region_index); duke@435: } duke@435: jcoomes@810: void ParCompactionManager::region_stack_push(size_t region_index) { duke@435: jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow jcoomes@810: region_stack()->save(region_index); duke@435: #else jcoomes@810: if(!region_stack()->push(region_index)) { jcoomes@810: region_overflow_stack()->push(region_index); duke@435: } duke@435: #endif duke@435: } duke@435: jcoomes@810: bool ParCompactionManager::retrieve_for_processing(size_t& region_index) { jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow jcoomes@810: return region_stack()->retrieve(region_index); duke@435: #else duke@435: // Should not be used in the parallel case duke@435: ShouldNotReachHere(); duke@435: return false; duke@435: #endif duke@435: } duke@435: duke@435: ParCompactionManager* duke@435: ParCompactionManager::gc_thread_compaction_manager(int index) { duke@435: assert(index >= 0 && index < (int)ParallelGCThreads, "index out of range"); duke@435: assert(_manager_array != NULL, "Sanity"); duke@435: return _manager_array[index]; duke@435: } duke@435: duke@435: void ParCompactionManager::reset() { duke@435: for(uint i=0; irevisit_klass_stack()->clear(); ysr@1376: manager_array(i)->revisit_mdo_stack()->clear(); duke@435: } duke@435: } duke@435: jcoomes@1746: void ParCompactionManager::follow_marking_stacks() { duke@435: do { jcoomes@1746: // Drain the overflow stack first, to allow stealing from the marking stack. jcoomes@1750: oop obj; jcoomes@1746: while (!overflow_stack()->is_empty()) { jcoomes@1746: overflow_stack()->pop()->follow_contents(this); jcoomes@1746: } jcoomes@1746: while (marking_stack()->pop_local(obj)) { duke@435: obj->follow_contents(this); duke@435: } duke@435: jcoomes@1750: // Process ObjArrays one at a time to avoid marking stack bloat. jcoomes@1746: ObjArrayTask task; jcoomes@1750: if (!_objarray_overflow_stack->is_empty()) { jcoomes@1746: task = _objarray_overflow_stack->pop(); jcoomes@1746: objArrayKlass* const k = (objArrayKlass*)task.obj()->blueprint(); jcoomes@1746: k->oop_follow_contents(this, task.obj(), task.index()); jcoomes@1750: } else if (_objarray_queue.pop_local(task)) { jcoomes@1746: objArrayKlass* const k = (objArrayKlass*)task.obj()->blueprint(); jcoomes@1746: k->oop_follow_contents(this, task.obj(), task.index()); jcoomes@1746: } jcoomes@1746: } while (!marking_stacks_empty()); duke@435: jcoomes@1746: assert(marking_stacks_empty(), "Sanity"); duke@435: } duke@435: jcoomes@810: void ParCompactionManager::drain_region_overflow_stack() { jcoomes@810: size_t region_index = (size_t) -1; jcoomes@810: while(region_stack()->retrieve_from_overflow(region_index)) { jcoomes@810: PSParallelCompact::fill_and_update_region(this, region_index); duke@435: } duke@435: } duke@435: jcoomes@810: void ParCompactionManager::drain_region_stacks() { duke@435: #ifdef ASSERT duke@435: ParallelScavengeHeap* heap = (ParallelScavengeHeap*)Universe::heap(); duke@435: assert(heap->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); duke@435: MutableSpace* to_space = heap->young_gen()->to_space(); duke@435: MutableSpace* old_space = heap->old_gen()->object_space(); duke@435: MutableSpace* perm_space = heap->perm_gen()->object_space(); duke@435: #endif /* ASSERT */ duke@435: duke@435: #if 1 // def DO_PARALLEL - the serial code hasn't been updated duke@435: do { duke@435: jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow duke@435: // Drain overflow stack first, so other threads can steal from duke@435: // claimed stack while we work. jcoomes@810: size_t region_index = (size_t) -1; jcoomes@810: while(region_stack()->retrieve_from_overflow(region_index)) { jcoomes@810: PSParallelCompact::fill_and_update_region(this, region_index); duke@435: } duke@435: jcoomes@810: while (region_stack()->retrieve_from_stealable_queue(region_index)) { jcoomes@810: PSParallelCompact::fill_and_update_region(this, region_index); duke@435: } jcoomes@810: } while (!region_stack()->is_empty()); duke@435: #else duke@435: // Drain overflow stack first, so other threads can steal from duke@435: // claimed stack while we work. jcoomes@810: while(!region_overflow_stack()->is_empty()) { jcoomes@810: size_t region_index = region_overflow_stack()->pop(); jcoomes@810: PSParallelCompact::fill_and_update_region(this, region_index); duke@435: } duke@435: jcoomes@810: size_t region_index = -1; duke@435: // obj is a reference!!! jcoomes@810: while (region_stack()->pop_local(region_index)) { duke@435: // It would be nice to assert about the type of objects we might duke@435: // pop, but they can come from anywhere, unfortunately. jcoomes@810: PSParallelCompact::fill_and_update_region(this, region_index); duke@435: } jcoomes@810: } while((region_stack()->size() != 0) || jcoomes@810: (region_overflow_stack()->length() != 0)); duke@435: #endif duke@435: jcoomes@810: #ifdef USE_RegionTaskQueueWithOverflow jcoomes@810: assert(region_stack()->is_empty(), "Sanity"); duke@435: #else jcoomes@810: assert(region_stack()->size() == 0, "Sanity"); jcoomes@810: assert(region_overflow_stack()->length() == 0, "Sanity"); duke@435: #endif duke@435: #else duke@435: oop obj; duke@435: while (obj = retrieve_for_scanning()) { duke@435: obj->follow_contents(this); duke@435: } duke@435: #endif duke@435: } duke@435: duke@435: #ifdef ASSERT duke@435: bool ParCompactionManager::stacks_have_been_allocated() { ysr@1376: return (revisit_klass_stack()->data_addr() != NULL && ysr@1376: revisit_mdo_stack()->data_addr() != NULL); duke@435: } duke@435: #endif