src/share/vm/memory/sharedHeap.cpp

Print this page
rev 4769 : 8015237: Parallelize string table scanning during strong root processing
Summary: Parallelize the scanning of the intern string table by having each GC worker claim a given number of buckets.
Reviewed-by:
   1 /*
   2  * Copyright (c) 2000, 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  *


  30 #include "memory/sharedHeap.hpp"
  31 #include "oops/oop.inline.hpp"
  32 #include "runtime/fprofiler.hpp"
  33 #include "runtime/java.hpp"
  34 #include "services/management.hpp"
  35 #include "utilities/copy.hpp"
  36 #include "utilities/workgroup.hpp"
  37 
  38 SharedHeap* SharedHeap::_sh;
  39 
  40 // The set of potentially parallel tasks in strong root scanning.
  41 enum SH_process_strong_roots_tasks {
  42   SH_PS_Universe_oops_do,
  43   SH_PS_JNIHandles_oops_do,
  44   SH_PS_ObjectSynchronizer_oops_do,
  45   SH_PS_FlatProfiler_oops_do,
  46   SH_PS_Management_oops_do,
  47   SH_PS_SystemDictionary_oops_do,
  48   SH_PS_ClassLoaderDataGraph_oops_do,
  49   SH_PS_jvmti_oops_do,
  50   SH_PS_StringTable_oops_do,
  51   SH_PS_CodeCache_oops_do,
  52   // Leave this one last.
  53   SH_PS_NumElements
  54 };
  55 
  56 SharedHeap::SharedHeap(CollectorPolicy* policy_) :
  57   CollectedHeap(),
  58   _collector_policy(policy_),
  59   _rem_set(NULL),
  60   _strong_roots_parity(0),
  61   _process_strong_tasks(new SubTasksDone(SH_PS_NumElements)),
  62   _workers(NULL)
  63 {
  64   if (_process_strong_tasks == NULL || !_process_strong_tasks->valid()) {
  65     vm_exit_during_initialization("Failed necessary allocation.");
  66   }
  67   _sh = this;  // ch is static, should be set only once.
  68   if ((UseParNewGC ||
  69       (UseConcMarkSweepGC && CMSParallelRemarkEnabled) ||
  70        UseG1GC) &&


 110   virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
 111 };
 112 static AssertNonScavengableClosure assert_is_non_scavengable_closure;
 113 #endif
 114 
 115 void SharedHeap::change_strong_roots_parity() {
 116   // Also set the new collection parity.
 117   assert(_strong_roots_parity >= 0 && _strong_roots_parity <= 2,
 118          "Not in range.");
 119   _strong_roots_parity++;
 120   if (_strong_roots_parity == 3) _strong_roots_parity = 1;
 121   assert(_strong_roots_parity >= 1 && _strong_roots_parity <= 2,
 122          "Not in range.");
 123 }
 124 
 125 SharedHeap::StrongRootsScope::StrongRootsScope(SharedHeap* outer, bool activate)
 126   : MarkScope(activate)
 127 {
 128   if (_active) {
 129     outer->change_strong_roots_parity();


 130   }
 131 }
 132 
 133 SharedHeap::StrongRootsScope::~StrongRootsScope() {
 134   // nothing particular
 135 }
 136 
 137 void SharedHeap::process_strong_roots(bool activate_scope,
 138                                       bool is_scavenging,
 139                                       ScanningOption so,
 140                                       OopClosure* roots,
 141                                       CodeBlobClosure* code_roots,
 142                                       KlassClosure* klass_closure) {
 143   StrongRootsScope srs(this, activate_scope);
 144 
 145   // General strong roots.
 146   assert(_strong_roots_parity != 0, "must have called prologue code");
 147   // _n_termination for _process_strong_tasks should be set up stream
 148   // in a method not running in a GC worker.  Otherwise the GC worker
 149   // could be trying to change the termination condition while the task
 150   // is executing in another GC worker.
 151   if (!_process_strong_tasks->is_task_claimed(SH_PS_Universe_oops_do)) {
 152     Universe::oops_do(roots);
 153   }
 154   // Global (strong) JNI handles
 155   if (!_process_strong_tasks->is_task_claimed(SH_PS_JNIHandles_oops_do))
 156     JNIHandles::oops_do(roots);

 157   // All threads execute this; the individual threads are task groups.
 158   CLDToOopClosure roots_from_clds(roots);
 159   CLDToOopClosure* roots_from_clds_p = (is_scavenging ? NULL : &roots_from_clds);
 160   if (ParallelGCThreads > 0) {
 161     Threads::possibly_parallel_oops_do(roots, roots_from_clds_p ,code_roots);
 162   } else {
 163     Threads::oops_do(roots, roots_from_clds_p, code_roots);
 164   }

 165   if (!_process_strong_tasks-> is_task_claimed(SH_PS_ObjectSynchronizer_oops_do))
 166     ObjectSynchronizer::oops_do(roots);
 167   if (!_process_strong_tasks->is_task_claimed(SH_PS_FlatProfiler_oops_do))
 168     FlatProfiler::oops_do(roots);
 169   if (!_process_strong_tasks->is_task_claimed(SH_PS_Management_oops_do))
 170     Management::oops_do(roots);
 171   if (!_process_strong_tasks->is_task_claimed(SH_PS_jvmti_oops_do))
 172     JvmtiExport::oops_do(roots);
 173 
 174   if (!_process_strong_tasks->is_task_claimed(SH_PS_SystemDictionary_oops_do)) {
 175     if (so & SO_AllClasses) {
 176       SystemDictionary::oops_do(roots);
 177     } else if (so & SO_SystemClasses) {
 178       SystemDictionary::always_strong_oops_do(roots);
 179     } else {
 180       fatal("We should always have selected either SO_AllClasses or SO_SystemClasses");
 181     }
 182   }
 183 
 184   if (!_process_strong_tasks->is_task_claimed(SH_PS_ClassLoaderDataGraph_oops_do)) {
 185     if (so & SO_AllClasses) {
 186       ClassLoaderDataGraph::oops_do(roots, klass_closure, !is_scavenging);
 187     } else if (so & SO_SystemClasses) {
 188       ClassLoaderDataGraph::always_strong_oops_do(roots, klass_closure, !is_scavenging);
 189     }
 190   }
 191 
 192   if (!_process_strong_tasks->is_task_claimed(SH_PS_StringTable_oops_do)) {

 193     if (so & SO_Strings) {



 194       StringTable::oops_do(roots);
 195     }
 196   }
 197 
 198   if (!_process_strong_tasks->is_task_claimed(SH_PS_CodeCache_oops_do)) {
 199     if (so & SO_CodeCache) {
 200       assert(code_roots != NULL, "must supply closure for code cache");
 201 
 202       if (is_scavenging) {
 203         // We only visit parts of the CodeCache when scavenging.
 204         CodeCache::scavenge_root_nmethods_do(code_roots);
 205       } else {
 206         // CMSCollector uses this to do intermediate-strength collections.
 207         // We scan the entire code cache, since CodeCache::do_unloading is not called.
 208         CodeCache::blobs_do(code_roots);
 209       }
 210     }
 211     // Verify that the code cache contents are not subject to
 212     // movement by a scavenging collection.
 213     DEBUG_ONLY(CodeBlobToOopClosure assert_code_is_non_scavengable(&assert_is_non_scavengable_closure, /*do_marking=*/ false));


   1 /*
   2  * Copyright (c) 2000, 2013, 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  *


  30 #include "memory/sharedHeap.hpp"
  31 #include "oops/oop.inline.hpp"
  32 #include "runtime/fprofiler.hpp"
  33 #include "runtime/java.hpp"
  34 #include "services/management.hpp"
  35 #include "utilities/copy.hpp"
  36 #include "utilities/workgroup.hpp"
  37 
  38 SharedHeap* SharedHeap::_sh;
  39 
  40 // The set of potentially parallel tasks in strong root scanning.
  41 enum SH_process_strong_roots_tasks {
  42   SH_PS_Universe_oops_do,
  43   SH_PS_JNIHandles_oops_do,
  44   SH_PS_ObjectSynchronizer_oops_do,
  45   SH_PS_FlatProfiler_oops_do,
  46   SH_PS_Management_oops_do,
  47   SH_PS_SystemDictionary_oops_do,
  48   SH_PS_ClassLoaderDataGraph_oops_do,
  49   SH_PS_jvmti_oops_do,

  50   SH_PS_CodeCache_oops_do,
  51   // Leave this one last.
  52   SH_PS_NumElements
  53 };
  54 
  55 SharedHeap::SharedHeap(CollectorPolicy* policy_) :
  56   CollectedHeap(),
  57   _collector_policy(policy_),
  58   _rem_set(NULL),
  59   _strong_roots_parity(0),
  60   _process_strong_tasks(new SubTasksDone(SH_PS_NumElements)),
  61   _workers(NULL)
  62 {
  63   if (_process_strong_tasks == NULL || !_process_strong_tasks->valid()) {
  64     vm_exit_during_initialization("Failed necessary allocation.");
  65   }
  66   _sh = this;  // ch is static, should be set only once.
  67   if ((UseParNewGC ||
  68       (UseConcMarkSweepGC && CMSParallelRemarkEnabled) ||
  69        UseG1GC) &&


 109   virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
 110 };
 111 static AssertNonScavengableClosure assert_is_non_scavengable_closure;
 112 #endif
 113 
 114 void SharedHeap::change_strong_roots_parity() {
 115   // Also set the new collection parity.
 116   assert(_strong_roots_parity >= 0 && _strong_roots_parity <= 2,
 117          "Not in range.");
 118   _strong_roots_parity++;
 119   if (_strong_roots_parity == 3) _strong_roots_parity = 1;
 120   assert(_strong_roots_parity >= 1 && _strong_roots_parity <= 2,
 121          "Not in range.");
 122 }
 123 
 124 SharedHeap::StrongRootsScope::StrongRootsScope(SharedHeap* outer, bool activate)
 125   : MarkScope(activate)
 126 {
 127   if (_active) {
 128     outer->change_strong_roots_parity();
 129     // Zero the claimed high water mark in the StringTable
 130     StringTable::clear_par_claimed_index();
 131   }
 132 }
 133 
 134 SharedHeap::StrongRootsScope::~StrongRootsScope() {
 135   // nothing particular
 136 }
 137 
 138 void SharedHeap::process_strong_roots(bool activate_scope,
 139                                       bool is_scavenging,
 140                                       ScanningOption so,
 141                                       OopClosure* roots,
 142                                       CodeBlobClosure* code_roots,
 143                                       KlassClosure* klass_closure) {
 144   StrongRootsScope srs(this, activate_scope);
 145 
 146   // General strong roots.
 147   assert(_strong_roots_parity != 0, "must have called prologue code");
 148   // _n_termination for _process_strong_tasks should be set up stream
 149   // in a method not running in a GC worker.  Otherwise the GC worker
 150   // could be trying to change the termination condition while the task
 151   // is executing in another GC worker.
 152   if (!_process_strong_tasks->is_task_claimed(SH_PS_Universe_oops_do)) {
 153     Universe::oops_do(roots);
 154   }
 155   // Global (strong) JNI handles
 156   if (!_process_strong_tasks->is_task_claimed(SH_PS_JNIHandles_oops_do))
 157     JNIHandles::oops_do(roots);
 158 
 159   // All threads execute this; the individual threads are task groups.
 160   CLDToOopClosure roots_from_clds(roots);
 161   CLDToOopClosure* roots_from_clds_p = (is_scavenging ? NULL : &roots_from_clds);
 162   if (CollectedHeap::use_parallel_gc_threads()) {
 163     Threads::possibly_parallel_oops_do(roots, roots_from_clds_p, code_roots);
 164   } else {
 165     Threads::oops_do(roots, roots_from_clds_p, code_roots);
 166   }
 167 
 168   if (!_process_strong_tasks-> is_task_claimed(SH_PS_ObjectSynchronizer_oops_do))
 169     ObjectSynchronizer::oops_do(roots);
 170   if (!_process_strong_tasks->is_task_claimed(SH_PS_FlatProfiler_oops_do))
 171     FlatProfiler::oops_do(roots);
 172   if (!_process_strong_tasks->is_task_claimed(SH_PS_Management_oops_do))
 173     Management::oops_do(roots);
 174   if (!_process_strong_tasks->is_task_claimed(SH_PS_jvmti_oops_do))
 175     JvmtiExport::oops_do(roots);
 176 
 177   if (!_process_strong_tasks->is_task_claimed(SH_PS_SystemDictionary_oops_do)) {
 178     if (so & SO_AllClasses) {
 179       SystemDictionary::oops_do(roots);
 180     } else if (so & SO_SystemClasses) {
 181       SystemDictionary::always_strong_oops_do(roots);
 182     } else {
 183       fatal("We should always have selected either SO_AllClasses or SO_SystemClasses");
 184     }
 185   }
 186 
 187   if (!_process_strong_tasks->is_task_claimed(SH_PS_ClassLoaderDataGraph_oops_do)) {
 188     if (so & SO_AllClasses) {
 189       ClassLoaderDataGraph::oops_do(roots, klass_closure, !is_scavenging);
 190     } else if (so & SO_SystemClasses) {
 191       ClassLoaderDataGraph::always_strong_oops_do(roots, klass_closure, !is_scavenging);
 192     }
 193   }
 194 
 195   // All threads execute the following. A specific chunk of buckets
 196   // from the StringTable are the individual tasks.
 197   if (so & SO_Strings) {
 198     if (CollectedHeap::use_parallel_gc_threads()) {
 199       StringTable::possibly_parallel_oops_do(roots);
 200     } else {
 201       StringTable::oops_do(roots);
 202     }
 203   }
 204 
 205   if (!_process_strong_tasks->is_task_claimed(SH_PS_CodeCache_oops_do)) {
 206     if (so & SO_CodeCache) {
 207       assert(code_roots != NULL, "must supply closure for code cache");
 208 
 209       if (is_scavenging) {
 210         // We only visit parts of the CodeCache when scavenging.
 211         CodeCache::scavenge_root_nmethods_do(code_roots);
 212       } else {
 213         // CMSCollector uses this to do intermediate-strength collections.
 214         // We scan the entire code cache, since CodeCache::do_unloading is not called.
 215         CodeCache::blobs_do(code_roots);
 216       }
 217     }
 218     // Verify that the code cache contents are not subject to
 219     // movement by a scavenging collection.
 220     DEBUG_ONLY(CodeBlobToOopClosure assert_code_is_non_scavengable(&assert_is_non_scavengable_closure, /*do_marking=*/ false));