src/share/vm/memory/sharedHeap.cpp

Wed, 15 Feb 2012 10:12:55 -0800

author
never
date
Wed, 15 Feb 2012 10:12:55 -0800
changeset 3571
09d00c18e323
parent 3357
441e946dc1af
child 4037
da91efe96a93
permissions
-rw-r--r--

7145537: minor tweaks to LogEvents
Reviewed-by: kvn, twisti

duke@435 1 /*
trims@2708 2 * Copyright (c) 2000, 2011, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "classfile/symbolTable.hpp"
stefank@2314 27 #include "classfile/systemDictionary.hpp"
stefank@2314 28 #include "code/codeCache.hpp"
stefank@2314 29 #include "gc_interface/collectedHeap.inline.hpp"
stefank@2314 30 #include "memory/sharedHeap.hpp"
stefank@2314 31 #include "oops/oop.inline.hpp"
stefank@2314 32 #include "runtime/fprofiler.hpp"
stefank@2314 33 #include "runtime/java.hpp"
stefank@2314 34 #include "services/management.hpp"
stefank@2314 35 #include "utilities/copy.hpp"
stefank@2314 36 #include "utilities/workgroup.hpp"
duke@435 37
duke@435 38 SharedHeap* SharedHeap::_sh;
duke@435 39
duke@435 40 // The set of potentially parallel tasks in strong root scanning.
duke@435 41 enum SH_process_strong_roots_tasks {
duke@435 42 SH_PS_Universe_oops_do,
duke@435 43 SH_PS_JNIHandles_oops_do,
duke@435 44 SH_PS_ObjectSynchronizer_oops_do,
duke@435 45 SH_PS_FlatProfiler_oops_do,
duke@435 46 SH_PS_Management_oops_do,
duke@435 47 SH_PS_SystemDictionary_oops_do,
duke@435 48 SH_PS_jvmti_oops_do,
duke@435 49 SH_PS_StringTable_oops_do,
duke@435 50 SH_PS_CodeCache_oops_do,
duke@435 51 // Leave this one last.
duke@435 52 SH_PS_NumElements
duke@435 53 };
duke@435 54
duke@435 55 SharedHeap::SharedHeap(CollectorPolicy* policy_) :
duke@435 56 CollectedHeap(),
duke@435 57 _collector_policy(policy_),
duke@435 58 _perm_gen(NULL), _rem_set(NULL),
duke@435 59 _strong_roots_parity(0),
duke@435 60 _process_strong_tasks(new SubTasksDone(SH_PS_NumElements)),
jmasa@2188 61 _workers(NULL)
duke@435 62 {
duke@435 63 if (_process_strong_tasks == NULL || !_process_strong_tasks->valid()) {
duke@435 64 vm_exit_during_initialization("Failed necessary allocation.");
duke@435 65 }
duke@435 66 _sh = this; // ch is static, should be set only once.
duke@435 67 if ((UseParNewGC ||
ysr@777 68 (UseConcMarkSweepGC && CMSParallelRemarkEnabled) ||
ysr@777 69 UseG1GC) &&
duke@435 70 ParallelGCThreads > 0) {
jmasa@2188 71 _workers = new FlexibleWorkGang("Parallel GC Threads", ParallelGCThreads,
ysr@777 72 /* are_GC_task_threads */true,
ysr@777 73 /* are_ConcurrentGC_threads */false);
duke@435 74 if (_workers == NULL) {
duke@435 75 vm_exit_during_initialization("Failed necessary allocation.");
jmasa@2188 76 } else {
jmasa@2188 77 _workers->initialize_workers();
duke@435 78 }
duke@435 79 }
duke@435 80 }
duke@435 81
jmasa@3294 82 int SharedHeap::n_termination() {
jmasa@3294 83 return _process_strong_tasks->n_threads();
jmasa@3294 84 }
jmasa@3294 85
jmasa@3294 86 void SharedHeap::set_n_termination(int t) {
jmasa@3294 87 _process_strong_tasks->set_n_threads(t);
jmasa@3294 88 }
jmasa@3294 89
ysr@777 90 bool SharedHeap::heap_lock_held_for_gc() {
ysr@777 91 Thread* t = Thread::current();
ysr@777 92 return Heap_lock->owned_by_self()
ysr@777 93 || ( (t->is_GC_task_thread() || t->is_VM_thread())
ysr@777 94 && _thread_holds_heap_lock_for_gc);
ysr@777 95 }
duke@435 96
jmasa@3357 97 void SharedHeap::set_par_threads(uint t) {
jmasa@2188 98 assert(t == 0 || !UseSerialGC, "Cannot have parallel threads");
duke@435 99 _n_par_threads = t;
jmasa@2188 100 _process_strong_tasks->set_n_threads(t);
duke@435 101 }
duke@435 102
duke@435 103 class AssertIsPermClosure: public OopClosure {
duke@435 104 public:
coleenp@548 105 virtual void do_oop(oop* p) {
duke@435 106 assert((*p) == NULL || (*p)->is_perm(), "Referent should be perm.");
duke@435 107 }
coleenp@548 108 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
duke@435 109 };
duke@435 110 static AssertIsPermClosure assert_is_perm_closure;
duke@435 111
jmasa@2909 112 #ifdef ASSERT
jmasa@2909 113 class AssertNonScavengableClosure: public OopClosure {
jmasa@2909 114 public:
jmasa@2909 115 virtual void do_oop(oop* p) {
jmasa@2909 116 assert(!Universe::heap()->is_in_partial_collection(*p),
jmasa@2909 117 "Referent should not be scavengable."); }
jmasa@2909 118 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
jmasa@2909 119 };
jmasa@2909 120 static AssertNonScavengableClosure assert_is_non_scavengable_closure;
jmasa@2909 121 #endif
jmasa@2909 122
duke@435 123 void SharedHeap::change_strong_roots_parity() {
duke@435 124 // Also set the new collection parity.
duke@435 125 assert(_strong_roots_parity >= 0 && _strong_roots_parity <= 2,
duke@435 126 "Not in range.");
duke@435 127 _strong_roots_parity++;
duke@435 128 if (_strong_roots_parity == 3) _strong_roots_parity = 1;
duke@435 129 assert(_strong_roots_parity >= 1 && _strong_roots_parity <= 2,
duke@435 130 "Not in range.");
duke@435 131 }
duke@435 132
jrose@1424 133 SharedHeap::StrongRootsScope::StrongRootsScope(SharedHeap* outer, bool activate)
jrose@1424 134 : MarkScope(activate)
jrose@1424 135 {
jrose@1424 136 if (_active) {
jrose@1424 137 outer->change_strong_roots_parity();
jrose@1424 138 }
jrose@1424 139 }
jrose@1424 140
jrose@1424 141 SharedHeap::StrongRootsScope::~StrongRootsScope() {
jrose@1424 142 // nothing particular
jrose@1424 143 }
jrose@1424 144
jrose@1424 145 void SharedHeap::process_strong_roots(bool activate_scope,
jrose@1424 146 bool collecting_perm_gen,
duke@435 147 ScanningOption so,
duke@435 148 OopClosure* roots,
jrose@1424 149 CodeBlobClosure* code_roots,
duke@435 150 OopsInGenClosure* perm_blk) {
jrose@1424 151 StrongRootsScope srs(this, activate_scope);
duke@435 152 // General strong roots.
jrose@1424 153 assert(_strong_roots_parity != 0, "must have called prologue code");
jmasa@3294 154 // _n_termination for _process_strong_tasks should be set up stream
jmasa@3294 155 // in a method not running in a GC worker. Otherwise the GC worker
jmasa@3294 156 // could be trying to change the termination condition while the task
jmasa@3294 157 // is executing in another GC worker.
duke@435 158 if (!_process_strong_tasks->is_task_claimed(SH_PS_Universe_oops_do)) {
duke@435 159 Universe::oops_do(roots);
duke@435 160 // Consider perm-gen discovered lists to be strong.
duke@435 161 perm_gen()->ref_processor()->weak_oops_do(roots);
duke@435 162 }
duke@435 163 // Global (strong) JNI handles
duke@435 164 if (!_process_strong_tasks->is_task_claimed(SH_PS_JNIHandles_oops_do))
duke@435 165 JNIHandles::oops_do(roots);
duke@435 166 // All threads execute this; the individual threads are task groups.
duke@435 167 if (ParallelGCThreads > 0) {
jrose@1424 168 Threads::possibly_parallel_oops_do(roots, code_roots);
duke@435 169 } else {
jrose@1424 170 Threads::oops_do(roots, code_roots);
duke@435 171 }
duke@435 172 if (!_process_strong_tasks-> is_task_claimed(SH_PS_ObjectSynchronizer_oops_do))
duke@435 173 ObjectSynchronizer::oops_do(roots);
duke@435 174 if (!_process_strong_tasks->is_task_claimed(SH_PS_FlatProfiler_oops_do))
duke@435 175 FlatProfiler::oops_do(roots);
duke@435 176 if (!_process_strong_tasks->is_task_claimed(SH_PS_Management_oops_do))
duke@435 177 Management::oops_do(roots);
duke@435 178 if (!_process_strong_tasks->is_task_claimed(SH_PS_jvmti_oops_do))
duke@435 179 JvmtiExport::oops_do(roots);
duke@435 180
duke@435 181 if (!_process_strong_tasks->is_task_claimed(SH_PS_SystemDictionary_oops_do)) {
duke@435 182 if (so & SO_AllClasses) {
duke@435 183 SystemDictionary::oops_do(roots);
ysr@2825 184 } else if (so & SO_SystemClasses) {
ysr@2825 185 SystemDictionary::always_strong_oops_do(roots);
ysr@2825 186 }
duke@435 187 }
duke@435 188
duke@435 189 if (!_process_strong_tasks->is_task_claimed(SH_PS_StringTable_oops_do)) {
jcoomes@2661 190 if (so & SO_Strings || (!collecting_perm_gen && !JavaObjectsInPerm)) {
jcoomes@2661 191 StringTable::oops_do(roots);
jcoomes@2661 192 }
jcoomes@2661 193 if (JavaObjectsInPerm) {
jcoomes@2661 194 // Verify the string table contents are in the perm gen
jcoomes@2661 195 NOT_PRODUCT(StringTable::oops_do(&assert_is_perm_closure));
jcoomes@2661 196 }
duke@435 197 }
duke@435 198
duke@435 199 if (!_process_strong_tasks->is_task_claimed(SH_PS_CodeCache_oops_do)) {
jrose@1424 200 if (so & SO_CodeCache) {
jrose@1424 201 // (Currently, CMSCollector uses this to do intermediate-strength collections.)
jrose@1424 202 assert(collecting_perm_gen, "scanning all of code cache");
jrose@1424 203 assert(code_roots != NULL, "must supply closure for code cache");
jrose@1424 204 if (code_roots != NULL) {
jrose@1424 205 CodeCache::blobs_do(code_roots);
jrose@1424 206 }
jrose@1424 207 } else if (so & (SO_SystemClasses|SO_AllClasses)) {
jrose@1424 208 if (!collecting_perm_gen) {
jrose@1424 209 // If we are collecting from class statics, but we are not going to
jrose@1424 210 // visit all of the CodeCache, collect from the non-perm roots if any.
jrose@1424 211 // This makes the code cache function temporarily as a source of strong
jrose@1424 212 // roots for oops, until the next major collection.
jrose@1424 213 //
jrose@1424 214 // If collecting_perm_gen is true, we require that this phase will call
jrose@1424 215 // CodeCache::do_unloading. This will kill off nmethods with expired
jrose@1424 216 // weak references, such as stale invokedynamic targets.
jrose@1424 217 CodeCache::scavenge_root_nmethods_do(code_roots);
jrose@1424 218 }
jrose@1424 219 }
jmasa@2909 220 // Verify that the code cache contents are not subject to
jmasa@2909 221 // movement by a scavenging collection.
jmasa@2909 222 DEBUG_ONLY(CodeBlobToOopClosure assert_code_is_non_scavengable(&assert_is_non_scavengable_closure, /*do_marking=*/ false));
jmasa@2909 223 DEBUG_ONLY(CodeCache::asserted_non_scavengable_nmethods_do(&assert_code_is_non_scavengable));
duke@435 224 }
duke@435 225
duke@435 226 if (!collecting_perm_gen) {
duke@435 227 // All threads perform this; coordination is handled internally.
duke@435 228
duke@435 229 rem_set()->younger_refs_iterate(perm_gen(), perm_blk);
duke@435 230 }
duke@435 231 _process_strong_tasks->all_tasks_completed();
duke@435 232 }
duke@435 233
duke@435 234 class AlwaysTrueClosure: public BoolObjectClosure {
duke@435 235 public:
duke@435 236 void do_object(oop p) { ShouldNotReachHere(); }
duke@435 237 bool do_object_b(oop p) { return true; }
duke@435 238 };
duke@435 239 static AlwaysTrueClosure always_true;
duke@435 240
duke@435 241 class SkipAdjustingSharedStrings: public OopClosure {
duke@435 242 OopClosure* _clo;
duke@435 243 public:
duke@435 244 SkipAdjustingSharedStrings(OopClosure* clo) : _clo(clo) {}
duke@435 245
coleenp@548 246 virtual void do_oop(oop* p) {
duke@435 247 oop o = (*p);
duke@435 248 if (!o->is_shared_readwrite()) {
duke@435 249 _clo->do_oop(p);
duke@435 250 }
duke@435 251 }
coleenp@548 252 virtual void do_oop(narrowOop* p) { ShouldNotReachHere(); }
duke@435 253 };
duke@435 254
duke@435 255 // Unmarked shared Strings in the StringTable (which got there due to
duke@435 256 // being in the constant pools of as-yet unloaded shared classes) were
duke@435 257 // not marked and therefore did not have their mark words preserved.
duke@435 258 // These entries are also deliberately not purged from the string
duke@435 259 // table during unloading of unmarked strings. If an identity hash
duke@435 260 // code was computed for any of these objects, it will not have been
duke@435 261 // cleared to zero during the forwarding process or by the
duke@435 262 // RecursiveAdjustSharedObjectClosure, and will be confused by the
duke@435 263 // adjusting process as a forwarding pointer. We need to skip
duke@435 264 // forwarding StringTable entries which contain unmarked shared
duke@435 265 // Strings. Actually, since shared strings won't be moving, we can
duke@435 266 // just skip adjusting any shared entries in the string table.
duke@435 267
duke@435 268 void SharedHeap::process_weak_roots(OopClosure* root_closure,
jrose@1424 269 CodeBlobClosure* code_roots,
duke@435 270 OopClosure* non_root_closure) {
duke@435 271 // Global (weak) JNI handles
duke@435 272 JNIHandles::weak_oops_do(&always_true, root_closure);
duke@435 273
jrose@1424 274 CodeCache::blobs_do(code_roots);
duke@435 275 if (UseSharedSpaces && !DumpSharedSpaces) {
duke@435 276 SkipAdjustingSharedStrings skip_closure(root_closure);
duke@435 277 StringTable::oops_do(&skip_closure);
duke@435 278 } else {
duke@435 279 StringTable::oops_do(root_closure);
duke@435 280 }
duke@435 281 }
duke@435 282
duke@435 283 void SharedHeap::set_barrier_set(BarrierSet* bs) {
duke@435 284 _barrier_set = bs;
duke@435 285 // Cached barrier set for fast access in oops
duke@435 286 oopDesc::set_bs(bs);
duke@435 287 }
duke@435 288
duke@435 289 void SharedHeap::post_initialize() {
duke@435 290 ref_processing_init();
duke@435 291 }
duke@435 292
duke@435 293 void SharedHeap::ref_processing_init() {
duke@435 294 perm_gen()->ref_processor_init();
duke@435 295 }
duke@435 296
duke@435 297 // Some utilities.
ysr@777 298 void SharedHeap::print_size_transition(outputStream* out,
ysr@777 299 size_t bytes_before,
duke@435 300 size_t bytes_after,
duke@435 301 size_t capacity) {
ysr@777 302 out->print(" %d%s->%d%s(%d%s)",
duke@435 303 byte_size_in_proper_unit(bytes_before),
duke@435 304 proper_unit_for_byte_size(bytes_before),
duke@435 305 byte_size_in_proper_unit(bytes_after),
duke@435 306 proper_unit_for_byte_size(bytes_after),
duke@435 307 byte_size_in_proper_unit(capacity),
duke@435 308 proper_unit_for_byte_size(capacity));
duke@435 309 }

mercurial