duke@435: /* iveresov@3536: * Copyright (c) 2002, 2012, 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: stefank@2314: #include "precompiled.hpp" stefank@2314: #include "classfile/systemDictionary.hpp" stefank@2314: #include "code/codeCache.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/cardTableExtension.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/gcTaskManager.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psMarkSweep.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psPromotionManager.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psPromotionManager.inline.hpp" jcoomes@2661: #include "gc_implementation/parallelScavenge/psScavenge.inline.hpp" stefank@2314: #include "gc_implementation/parallelScavenge/psTasks.hpp" stefank@2314: #include "memory/iterator.hpp" stefank@2314: #include "memory/universe.hpp" stefank@2314: #include "oops/oop.inline.hpp" stefank@2314: #include "oops/oop.psgc.inline.hpp" stefank@2314: #include "runtime/fprofiler.hpp" stefank@2314: #include "runtime/thread.hpp" stefank@2314: #include "runtime/vmThread.hpp" stefank@2314: #include "services/management.hpp" stefank@2314: #include "utilities/taskqueue.hpp" duke@435: duke@435: // duke@435: // ScavengeRootsTask duke@435: // duke@435: duke@435: void ScavengeRootsTask::do_it(GCTaskManager* manager, uint which) { duke@435: assert(Universe::heap()->is_gc_active(), "called outside gc"); duke@435: duke@435: PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); duke@435: PSScavengeRootsClosure roots_closure(pm); iveresov@3536: PSPromoteRootsClosure roots_to_old_closure(pm); duke@435: duke@435: switch (_root_type) { duke@435: case universe: duke@435: Universe::oops_do(&roots_closure); duke@435: break; duke@435: duke@435: case jni_handles: duke@435: JNIHandles::oops_do(&roots_closure); duke@435: break; duke@435: duke@435: case threads: duke@435: { duke@435: ResourceMark rm; stefank@4298: CLDToOopClosure* cld_closure = NULL; // Not needed. All CLDs are already visited. stefank@4298: Threads::oops_do(&roots_closure, cld_closure, NULL); duke@435: } duke@435: break; duke@435: duke@435: case object_synchronizer: duke@435: ObjectSynchronizer::oops_do(&roots_closure); duke@435: break; duke@435: duke@435: case flat_profiler: duke@435: FlatProfiler::oops_do(&roots_closure); duke@435: break; duke@435: duke@435: case system_dictionary: duke@435: SystemDictionary::oops_do(&roots_closure); stefank@5194: break; coleenp@4037: stefank@5194: case class_loader_data: stefank@5194: { stefank@5194: PSScavengeKlassClosure klass_closure(pm); stefank@5194: ClassLoaderDataGraph::oops_do(&roots_closure, &klass_closure, false); stefank@5194: } stefank@5194: break; duke@435: duke@435: case management: duke@435: Management::oops_do(&roots_closure); duke@435: break; duke@435: duke@435: case jvmti: duke@435: JvmtiExport::oops_do(&roots_closure); duke@435: break; duke@435: jrose@1424: jrose@1424: case code_cache: jrose@1424: { iveresov@3536: CodeBlobToOopClosure each_scavengable_code_blob(&roots_to_old_closure, /*do_marking=*/ true); jrose@1424: CodeCache::scavenge_root_nmethods_do(&each_scavengable_code_blob); jrose@1424: } jrose@1424: break; jrose@1424: duke@435: default: duke@435: fatal("Unknown root type"); duke@435: } duke@435: duke@435: // Do the real work duke@435: pm->drain_stacks(false); duke@435: } duke@435: duke@435: // duke@435: // ThreadRootsTask duke@435: // duke@435: duke@435: void ThreadRootsTask::do_it(GCTaskManager* manager, uint which) { duke@435: assert(Universe::heap()->is_gc_active(), "called outside gc"); duke@435: duke@435: PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); duke@435: PSScavengeRootsClosure roots_closure(pm); stefank@4298: CLDToOopClosure* roots_from_clds = NULL; // Not needed. All CLDs are already visited. jrose@1424: CodeBlobToOopClosure roots_in_blobs(&roots_closure, /*do_marking=*/ true); duke@435: duke@435: if (_java_thread != NULL) stefank@4298: _java_thread->oops_do(&roots_closure, roots_from_clds, &roots_in_blobs); duke@435: duke@435: if (_vm_thread != NULL) stefank@4298: _vm_thread->oops_do(&roots_closure, roots_from_clds, &roots_in_blobs); duke@435: duke@435: // Do the real work duke@435: pm->drain_stacks(false); duke@435: } duke@435: duke@435: // duke@435: // StealTask duke@435: // duke@435: duke@435: StealTask::StealTask(ParallelTaskTerminator* t) : duke@435: _terminator(t) {} duke@435: duke@435: void StealTask::do_it(GCTaskManager* manager, uint which) { duke@435: assert(Universe::heap()->is_gc_active(), "called outside gc"); duke@435: duke@435: PSPromotionManager* pm = duke@435: PSPromotionManager::gc_thread_promotion_manager(which); duke@435: pm->drain_stacks(true); duke@435: guarantee(pm->stacks_empty(), duke@435: "stacks should be empty at this point"); duke@435: duke@435: int random_seed = 17; tonyp@2061: while(true) { tonyp@2061: StarTask p; tonyp@2061: if (PSPromotionManager::steal_depth(which, &random_seed, p)) { tonyp@2061: TASKQUEUE_STATS_ONLY(pm->record_steal(p)); tonyp@2061: pm->process_popped_location_depth(p); tonyp@2061: pm->drain_stacks_depth(true); tonyp@2061: } else { tonyp@2061: if (terminator()->offer_termination()) { tonyp@2061: break; duke@435: } duke@435: } duke@435: } coleenp@548: guarantee(pm->stacks_empty(), "stacks should be empty at this point"); duke@435: } duke@435: duke@435: // duke@435: // OldToYoungRootsTask duke@435: // duke@435: duke@435: void OldToYoungRootsTask::do_it(GCTaskManager* manager, uint which) { jmasa@4128: // There are not old-to-young pointers if the old gen is empty. jmasa@4128: assert(!_gen->object_space()->is_empty(), jmasa@4128: "Should not be called is there is no work"); duke@435: assert(_gen != NULL, "Sanity"); duke@435: assert(_gen->object_space()->contains(_gen_top) || _gen_top == _gen->object_space()->top(), "Sanity"); duke@435: assert(_stripe_number < ParallelGCThreads, "Sanity"); duke@435: duke@435: { duke@435: PSPromotionManager* pm = PSPromotionManager::gc_thread_promotion_manager(which); duke@435: duke@435: assert(Universe::heap()->kind() == CollectedHeap::ParallelScavengeHeap, "Sanity"); duke@435: CardTableExtension* card_table = (CardTableExtension *)Universe::heap()->barrier_set(); duke@435: // FIX ME! Assert that card_table is the type we believe it to be. duke@435: duke@435: card_table->scavenge_contents_parallel(_gen->start_array(), duke@435: _gen->object_space(), duke@435: _gen_top, duke@435: pm, jmasa@3294: _stripe_number, jmasa@3294: _stripe_total); duke@435: duke@435: // Do the real work duke@435: pm->drain_stacks(false); duke@435: } duke@435: }