src/share/vm/memory/sharedHeap.cpp

Mon, 17 Jun 2013 11:17:49 +0100

author
chegar
date
Mon, 17 Jun 2013 11:17:49 +0100
changeset 5251
eaf3742822ec
parent 5194
eda078b01c65
child 5277
01522ca68fc7
permissions
-rw-r--r--

Merge

     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  *
    23  */
    25 #include "precompiled.hpp"
    26 #include "classfile/symbolTable.hpp"
    27 #include "classfile/systemDictionary.hpp"
    28 #include "code/codeCache.hpp"
    29 #include "gc_interface/collectedHeap.inline.hpp"
    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"
    38 SharedHeap* SharedHeap::_sh;
    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 };
    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) &&
    71       ParallelGCThreads > 0) {
    72     _workers = new FlexibleWorkGang("Parallel GC Threads", ParallelGCThreads,
    73                             /* are_GC_task_threads */true,
    74                             /* are_ConcurrentGC_threads */false);
    75     if (_workers == NULL) {
    76       vm_exit_during_initialization("Failed necessary allocation.");
    77     } else {
    78       _workers->initialize_workers();
    79     }
    80   }
    81 }
    83 int SharedHeap::n_termination() {
    84   return _process_strong_tasks->n_threads();
    85 }
    87 void SharedHeap::set_n_termination(int t) {
    88   _process_strong_tasks->set_n_threads(t);
    89 }
    91 bool SharedHeap::heap_lock_held_for_gc() {
    92   Thread* t = Thread::current();
    93   return    Heap_lock->owned_by_self()
    94          || (   (t->is_GC_task_thread() ||  t->is_VM_thread())
    95              && _thread_holds_heap_lock_for_gc);
    96 }
    98 void SharedHeap::set_par_threads(uint t) {
    99   assert(t == 0 || !UseSerialGC, "Cannot have parallel threads");
   100   _n_par_threads = t;
   101   _process_strong_tasks->set_n_threads(t);
   102 }
   104 #ifdef ASSERT
   105 class AssertNonScavengableClosure: public OopClosure {
   106 public:
   107   virtual void do_oop(oop* p) {
   108     assert(!Universe::heap()->is_in_partial_collection(*p),
   109       "Referent should not be scavengable.");  }
   110   virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
   111 };
   112 static AssertNonScavengableClosure assert_is_non_scavengable_closure;
   113 #endif
   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 }
   125 SharedHeap::StrongRootsScope::StrongRootsScope(SharedHeap* outer, bool activate)
   126   : MarkScope(activate)
   127 {
   128   if (_active) {
   129     outer->change_strong_roots_parity();
   130   }
   131 }
   133 SharedHeap::StrongRootsScope::~StrongRootsScope() {
   134   // nothing particular
   135 }
   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);
   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);
   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   }
   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   }
   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   }
   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");
   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));
   214     DEBUG_ONLY(CodeCache::asserted_non_scavengable_nmethods_do(&assert_code_is_non_scavengable));
   215   }
   217   _process_strong_tasks->all_tasks_completed();
   218 }
   220 class AlwaysTrueClosure: public BoolObjectClosure {
   221 public:
   222   bool do_object_b(oop p) { return true; }
   223 };
   224 static AlwaysTrueClosure always_true;
   226 void SharedHeap::process_weak_roots(OopClosure* root_closure,
   227                                     CodeBlobClosure* code_roots) {
   228   // Global (weak) JNI handles
   229   JNIHandles::weak_oops_do(&always_true, root_closure);
   231   CodeCache::blobs_do(code_roots);
   232   StringTable::oops_do(root_closure);
   233 }
   235 void SharedHeap::set_barrier_set(BarrierSet* bs) {
   236   _barrier_set = bs;
   237   // Cached barrier set for fast access in oops
   238   oopDesc::set_bs(bs);
   239 }
   241 void SharedHeap::post_initialize() {
   242   ref_processing_init();
   243 }
   245 void SharedHeap::ref_processing_init() {}
   247 // Some utilities.
   248 void SharedHeap::print_size_transition(outputStream* out,
   249                                        size_t bytes_before,
   250                                        size_t bytes_after,
   251                                        size_t capacity) {
   252   out->print(" %d%s->%d%s(%d%s)",
   253              byte_size_in_proper_unit(bytes_before),
   254              proper_unit_for_byte_size(bytes_before),
   255              byte_size_in_proper_unit(bytes_after),
   256              proper_unit_for_byte_size(bytes_after),
   257              byte_size_in_proper_unit(capacity),
   258              proper_unit_for_byte_size(capacity));
   259 }

mercurial