Wed, 26 Jun 2013 16:58:37 +0200
8013590: NPG: Add a memory pool MXBean for Metaspace
Reviewed-by: jmasa, mgerdin
duke@435 | 1 | /* |
sla@5237 | 2 | * Copyright (c) 2001, 2013, 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/javaClasses.hpp" |
stefank@2314 | 27 | #include "classfile/symbolTable.hpp" |
stefank@2314 | 28 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 29 | #include "classfile/vmSymbols.hpp" |
stefank@2314 | 30 | #include "code/codeCache.hpp" |
stefank@2314 | 31 | #include "code/icBuffer.hpp" |
sla@5237 | 32 | #include "gc_implementation/shared/gcHeapSummary.hpp" |
sla@5237 | 33 | #include "gc_implementation/shared/gcTimer.hpp" |
sla@5237 | 34 | #include "gc_implementation/shared/gcTrace.hpp" |
sla@5237 | 35 | #include "gc_implementation/shared/gcTraceTime.hpp" |
stefank@2314 | 36 | #include "gc_interface/collectedHeap.inline.hpp" |
stefank@2314 | 37 | #include "memory/genCollectedHeap.hpp" |
stefank@2314 | 38 | #include "memory/genMarkSweep.hpp" |
stefank@2314 | 39 | #include "memory/genOopClosures.inline.hpp" |
stefank@2314 | 40 | #include "memory/generation.inline.hpp" |
stefank@2314 | 41 | #include "memory/modRefBarrierSet.hpp" |
stefank@2314 | 42 | #include "memory/referencePolicy.hpp" |
stefank@2314 | 43 | #include "memory/space.hpp" |
stefank@2314 | 44 | #include "oops/instanceRefKlass.hpp" |
stefank@2314 | 45 | #include "oops/oop.inline.hpp" |
stefank@2314 | 46 | #include "prims/jvmtiExport.hpp" |
stefank@2314 | 47 | #include "runtime/fprofiler.hpp" |
stefank@2314 | 48 | #include "runtime/handles.inline.hpp" |
stefank@2314 | 49 | #include "runtime/synchronizer.hpp" |
stefank@4299 | 50 | #include "runtime/thread.inline.hpp" |
stefank@2314 | 51 | #include "runtime/vmThread.hpp" |
stefank@2314 | 52 | #include "utilities/copy.hpp" |
stefank@2314 | 53 | #include "utilities/events.hpp" |
duke@435 | 54 | |
duke@435 | 55 | void GenMarkSweep::invoke_at_safepoint(int level, ReferenceProcessor* rp, |
duke@435 | 56 | bool clear_all_softrefs) { |
duke@435 | 57 | assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint"); |
duke@435 | 58 | |
jmasa@1822 | 59 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
jmasa@1822 | 60 | #ifdef ASSERT |
jmasa@1822 | 61 | if (gch->collector_policy()->should_clear_all_soft_refs()) { |
jmasa@1822 | 62 | assert(clear_all_softrefs, "Policy should have been checked earlier"); |
jmasa@1822 | 63 | } |
jmasa@1822 | 64 | #endif |
jmasa@1822 | 65 | |
duke@435 | 66 | // hook up weak ref data so it can be used during Mark-Sweep |
duke@435 | 67 | assert(ref_processor() == NULL, "no stomping"); |
ysr@888 | 68 | assert(rp != NULL, "should be non-NULL"); |
duke@435 | 69 | _ref_processor = rp; |
ysr@892 | 70 | rp->setup_policy(clear_all_softrefs); |
duke@435 | 71 | |
sla@5237 | 72 | GCTraceTime t1(GCCauseString("Full GC", gch->gc_cause()), PrintGC && !PrintGCDetails, true, NULL); |
sla@5237 | 73 | |
sla@5237 | 74 | gch->trace_heap_before_gc(_gc_tracer); |
duke@435 | 75 | |
coleenp@4037 | 76 | // When collecting the permanent generation Method*s may be moving, |
duke@435 | 77 | // so we either have to flush all bcp data or convert it into bci. |
duke@435 | 78 | CodeCache::gc_prologue(); |
duke@435 | 79 | Threads::gc_prologue(); |
duke@435 | 80 | |
coleenp@4037 | 81 | // Increment the invocation count |
coleenp@4037 | 82 | _total_invocations++; |
duke@435 | 83 | |
duke@435 | 84 | // Capture heap size before collection for printing. |
duke@435 | 85 | size_t gch_prev_used = gch->used(); |
duke@435 | 86 | |
duke@435 | 87 | // Some of the card table updates below assume that the perm gen is |
duke@435 | 88 | // also being collected. |
duke@435 | 89 | assert(level == gch->n_gens() - 1, |
duke@435 | 90 | "All generations are being collected, ergo perm gen too."); |
duke@435 | 91 | |
duke@435 | 92 | // Capture used regions for each generation that will be |
duke@435 | 93 | // subject to collection, so that card table adjustments can |
duke@435 | 94 | // be made intelligently (see clear / invalidate further below). |
coleenp@4037 | 95 | gch->save_used_regions(level); |
duke@435 | 96 | |
duke@435 | 97 | allocate_stacks(); |
duke@435 | 98 | |
duke@435 | 99 | mark_sweep_phase1(level, clear_all_softrefs); |
duke@435 | 100 | |
duke@435 | 101 | mark_sweep_phase2(); |
duke@435 | 102 | |
duke@435 | 103 | // Don't add any more derived pointers during phase3 |
duke@435 | 104 | COMPILER2_PRESENT(assert(DerivedPointerTable::is_active(), "Sanity")); |
duke@435 | 105 | COMPILER2_PRESENT(DerivedPointerTable::set_active(false)); |
duke@435 | 106 | |
duke@435 | 107 | mark_sweep_phase3(level); |
duke@435 | 108 | |
duke@435 | 109 | mark_sweep_phase4(); |
duke@435 | 110 | |
duke@435 | 111 | restore_marks(); |
duke@435 | 112 | |
duke@435 | 113 | // Set saved marks for allocation profiler (and other things? -- dld) |
duke@435 | 114 | // (Should this be in general part?) |
duke@435 | 115 | gch->save_marks(); |
duke@435 | 116 | |
duke@435 | 117 | deallocate_stacks(); |
duke@435 | 118 | |
duke@435 | 119 | // If compaction completely evacuated all generations younger than this |
duke@435 | 120 | // one, then we can clear the card table. Otherwise, we must invalidate |
duke@435 | 121 | // it (consider all cards dirty). In the future, we might consider doing |
duke@435 | 122 | // compaction within generations only, and doing card-table sliding. |
duke@435 | 123 | bool all_empty = true; |
duke@435 | 124 | for (int i = 0; all_empty && i < level; i++) { |
duke@435 | 125 | Generation* g = gch->get_gen(i); |
duke@435 | 126 | all_empty = all_empty && gch->get_gen(i)->used() == 0; |
duke@435 | 127 | } |
duke@435 | 128 | GenRemSet* rs = gch->rem_set(); |
duke@435 | 129 | // Clear/invalidate below make use of the "prev_used_regions" saved earlier. |
duke@435 | 130 | if (all_empty) { |
duke@435 | 131 | // We've evacuated all generations below us. |
duke@435 | 132 | Generation* g = gch->get_gen(level); |
coleenp@4037 | 133 | rs->clear_into_younger(g); |
duke@435 | 134 | } else { |
duke@435 | 135 | // Invalidate the cards corresponding to the currently used |
duke@435 | 136 | // region and clear those corresponding to the evacuated region |
duke@435 | 137 | // of all generations just collected (i.e. level and younger). |
duke@435 | 138 | rs->invalidate_or_clear(gch->get_gen(level), |
coleenp@4037 | 139 | true /* younger */); |
duke@435 | 140 | } |
duke@435 | 141 | |
duke@435 | 142 | Threads::gc_epilogue(); |
duke@435 | 143 | CodeCache::gc_epilogue(); |
kamg@2467 | 144 | JvmtiExport::gc_epilogue(); |
duke@435 | 145 | |
duke@435 | 146 | if (PrintGC && !PrintGCDetails) { |
duke@435 | 147 | gch->print_heap_change(gch_prev_used); |
duke@435 | 148 | } |
duke@435 | 149 | |
duke@435 | 150 | // refs processing: clean slate |
duke@435 | 151 | _ref_processor = NULL; |
duke@435 | 152 | |
duke@435 | 153 | // Update heap occupancy information which is used as |
duke@435 | 154 | // input to soft ref clearing policy at the next gc. |
duke@435 | 155 | Universe::update_heap_info_at_gc(); |
duke@435 | 156 | |
duke@435 | 157 | // Update time of last gc for all generations we collected |
duke@435 | 158 | // (which curently is all the generations in the heap). |
johnc@3538 | 159 | // We need to use a monotonically non-deccreasing time in ms |
johnc@3538 | 160 | // or we will see time-warp warnings and os::javaTimeMillis() |
johnc@3538 | 161 | // does not guarantee monotonicity. |
johnc@3538 | 162 | jlong now = os::javaTimeNanos() / NANOSECS_PER_MILLISEC; |
johnc@3538 | 163 | gch->update_time_of_last_gc(now); |
sla@5237 | 164 | |
sla@5237 | 165 | gch->trace_heap_after_gc(_gc_tracer); |
duke@435 | 166 | } |
duke@435 | 167 | |
duke@435 | 168 | void GenMarkSweep::allocate_stacks() { |
duke@435 | 169 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 170 | // Scratch request on behalf of oldest generation; will do no |
duke@435 | 171 | // allocation. |
duke@435 | 172 | ScratchBlock* scratch = gch->gather_scratch(gch->_gens[gch->_n_gens-1], 0); |
duke@435 | 173 | |
duke@435 | 174 | // $$$ To cut a corner, we'll only use the first scratch block, and then |
duke@435 | 175 | // revert to malloc. |
duke@435 | 176 | if (scratch != NULL) { |
duke@435 | 177 | _preserved_count_max = |
duke@435 | 178 | scratch->num_words * HeapWordSize / sizeof(PreservedMark); |
duke@435 | 179 | } else { |
duke@435 | 180 | _preserved_count_max = 0; |
duke@435 | 181 | } |
duke@435 | 182 | |
duke@435 | 183 | _preserved_marks = (PreservedMark*)scratch; |
duke@435 | 184 | _preserved_count = 0; |
duke@435 | 185 | } |
duke@435 | 186 | |
duke@435 | 187 | |
duke@435 | 188 | void GenMarkSweep::deallocate_stacks() { |
tonyp@791 | 189 | if (!UseG1GC) { |
tonyp@791 | 190 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
tonyp@791 | 191 | gch->release_scratch(); |
tonyp@791 | 192 | } |
jmasa@698 | 193 | |
jcoomes@2191 | 194 | _preserved_mark_stack.clear(true); |
jcoomes@2191 | 195 | _preserved_oop_stack.clear(true); |
jcoomes@2191 | 196 | _marking_stack.clear(); |
jcoomes@2191 | 197 | _objarray_stack.clear(true); |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | void GenMarkSweep::mark_sweep_phase1(int level, |
duke@435 | 201 | bool clear_all_softrefs) { |
duke@435 | 202 | // Recursively traverse all live objects and mark them |
sla@5237 | 203 | GCTraceTime tm("phase 1", PrintGC && Verbose, true, _gc_timer); |
duke@435 | 204 | trace(" 1"); |
duke@435 | 205 | |
duke@435 | 206 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 207 | |
duke@435 | 208 | // Because follow_root_closure is created statically, cannot |
duke@435 | 209 | // use OopsInGenClosure constructor which takes a generation, |
duke@435 | 210 | // as the Universe has not been created when the static constructors |
duke@435 | 211 | // are run. |
duke@435 | 212 | follow_root_closure.set_orig_generation(gch->get_gen(level)); |
duke@435 | 213 | |
coleenp@4037 | 214 | // Need new claim bits before marking starts. |
coleenp@4037 | 215 | ClassLoaderDataGraph::clear_claimed_marks(); |
coleenp@4037 | 216 | |
duke@435 | 217 | gch->gen_process_strong_roots(level, |
duke@435 | 218 | false, // Younger gens are not roots. |
jrose@1424 | 219 | true, // activate StrongRootsScope |
coleenp@4037 | 220 | false, // not scavenging |
duke@435 | 221 | SharedHeap::SO_SystemClasses, |
jrose@1424 | 222 | &follow_root_closure, |
jrose@1424 | 223 | true, // walk code active on stacks |
coleenp@4037 | 224 | &follow_root_closure, |
coleenp@4037 | 225 | &follow_klass_closure); |
duke@435 | 226 | |
duke@435 | 227 | // Process reference objects found during marking |
duke@435 | 228 | { |
ysr@892 | 229 | ref_processor()->setup_policy(clear_all_softrefs); |
sla@5237 | 230 | const ReferenceProcessorStats& stats = |
sla@5237 | 231 | ref_processor()->process_discovered_references( |
sla@5237 | 232 | &is_alive, &keep_alive, &follow_stack_closure, NULL, _gc_timer); |
sla@5237 | 233 | gc_tracer()->report_gc_reference_stats(stats); |
duke@435 | 234 | } |
duke@435 | 235 | |
stefank@5020 | 236 | // This is the point where the entire marking should have completed. |
stefank@5020 | 237 | assert(_marking_stack.is_empty(), "Marking should have completed"); |
stefank@5020 | 238 | |
stefank@5020 | 239 | // Unload classes and purge the SystemDictionary. |
duke@435 | 240 | bool purged_class = SystemDictionary::do_unloading(&is_alive); |
duke@435 | 241 | |
stefank@5020 | 242 | // Unload nmethods. |
brutisso@4098 | 243 | CodeCache::do_unloading(&is_alive, purged_class); |
duke@435 | 244 | |
stefank@5020 | 245 | // Prune dead klasses from subklass/sibling/implementor lists. |
coleenp@4037 | 246 | Klass::clean_weak_klass_links(&is_alive); |
ysr@1376 | 247 | |
stefank@5020 | 248 | // Delete entries for dead interned strings. |
duke@435 | 249 | StringTable::unlink(&is_alive); |
stefank@5020 | 250 | |
coleenp@2497 | 251 | // Clean up unreferenced symbols in symbol table. |
coleenp@2497 | 252 | SymbolTable::unlink(); |
sla@5237 | 253 | |
sla@5237 | 254 | gc_tracer()->report_object_count_after_gc(&is_alive); |
duke@435 | 255 | } |
duke@435 | 256 | |
duke@435 | 257 | |
duke@435 | 258 | void GenMarkSweep::mark_sweep_phase2() { |
duke@435 | 259 | // Now all live objects are marked, compute the new object addresses. |
duke@435 | 260 | |
duke@435 | 261 | // It is imperative that we traverse perm_gen LAST. If dead space is |
duke@435 | 262 | // allowed a range of dead object may get overwritten by a dead int |
coleenp@4037 | 263 | // array. If perm_gen is not traversed last a Klass* may get |
duke@435 | 264 | // overwritten. This is fine since it is dead, but if the class has dead |
duke@435 | 265 | // instances we have to skip them, and in order to find their size we |
coleenp@4037 | 266 | // need the Klass*! |
duke@435 | 267 | // |
duke@435 | 268 | // It is not required that we traverse spaces in the same order in |
duke@435 | 269 | // phase2, phase3 and phase4, but the ValidateMarkSweep live oops |
duke@435 | 270 | // tracking expects us to do so. See comment under phase4. |
duke@435 | 271 | |
duke@435 | 272 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 273 | |
sla@5237 | 274 | GCTraceTime tm("phase 2", PrintGC && Verbose, true, _gc_timer); |
duke@435 | 275 | trace("2"); |
duke@435 | 276 | |
duke@435 | 277 | gch->prepare_for_compaction(); |
duke@435 | 278 | } |
duke@435 | 279 | |
duke@435 | 280 | class GenAdjustPointersClosure: public GenCollectedHeap::GenClosure { |
duke@435 | 281 | public: |
duke@435 | 282 | void do_generation(Generation* gen) { |
duke@435 | 283 | gen->adjust_pointers(); |
duke@435 | 284 | } |
duke@435 | 285 | }; |
duke@435 | 286 | |
duke@435 | 287 | void GenMarkSweep::mark_sweep_phase3(int level) { |
duke@435 | 288 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 289 | |
duke@435 | 290 | // Adjust the pointers to reflect the new locations |
sla@5237 | 291 | GCTraceTime tm("phase 3", PrintGC && Verbose, true, _gc_timer); |
duke@435 | 292 | trace("3"); |
duke@435 | 293 | |
coleenp@4037 | 294 | // Need new claim bits for the pointer adjustment tracing. |
coleenp@4037 | 295 | ClassLoaderDataGraph::clear_claimed_marks(); |
duke@435 | 296 | |
stefank@5011 | 297 | // Because the closure below is created statically, we cannot |
duke@435 | 298 | // use OopsInGenClosure constructor which takes a generation, |
duke@435 | 299 | // as the Universe has not been created when the static constructors |
duke@435 | 300 | // are run. |
duke@435 | 301 | adjust_pointer_closure.set_orig_generation(gch->get_gen(level)); |
duke@435 | 302 | |
duke@435 | 303 | gch->gen_process_strong_roots(level, |
duke@435 | 304 | false, // Younger gens are not roots. |
jrose@1424 | 305 | true, // activate StrongRootsScope |
coleenp@4037 | 306 | false, // not scavenging |
duke@435 | 307 | SharedHeap::SO_AllClasses, |
stefank@5011 | 308 | &adjust_pointer_closure, |
jrose@1424 | 309 | false, // do not walk code |
stefank@5011 | 310 | &adjust_pointer_closure, |
coleenp@4037 | 311 | &adjust_klass_closure); |
duke@435 | 312 | |
duke@435 | 313 | // Now adjust pointers in remaining weak roots. (All of which should |
duke@435 | 314 | // have been cleared if they pointed to non-surviving objects.) |
jrose@1424 | 315 | CodeBlobToOopClosure adjust_code_pointer_closure(&adjust_pointer_closure, |
jrose@1424 | 316 | /*do_marking=*/ false); |
stefank@5011 | 317 | gch->gen_process_weak_roots(&adjust_pointer_closure, |
stefank@5011 | 318 | &adjust_code_pointer_closure); |
duke@435 | 319 | |
duke@435 | 320 | adjust_marks(); |
duke@435 | 321 | GenAdjustPointersClosure blk; |
duke@435 | 322 | gch->generation_iterate(&blk, true); |
duke@435 | 323 | } |
duke@435 | 324 | |
duke@435 | 325 | class GenCompactClosure: public GenCollectedHeap::GenClosure { |
duke@435 | 326 | public: |
duke@435 | 327 | void do_generation(Generation* gen) { |
duke@435 | 328 | gen->compact(); |
duke@435 | 329 | } |
duke@435 | 330 | }; |
duke@435 | 331 | |
duke@435 | 332 | void GenMarkSweep::mark_sweep_phase4() { |
duke@435 | 333 | // All pointers are now adjusted, move objects accordingly |
duke@435 | 334 | |
duke@435 | 335 | // It is imperative that we traverse perm_gen first in phase4. All |
duke@435 | 336 | // classes must be allocated earlier than their instances, and traversing |
coleenp@4037 | 337 | // perm_gen first makes sure that all Klass*s have moved to their new |
duke@435 | 338 | // location before any instance does a dispatch through it's klass! |
duke@435 | 339 | |
duke@435 | 340 | // The ValidateMarkSweep live oops tracking expects us to traverse spaces |
duke@435 | 341 | // in the same order in phase2, phase3 and phase4. We don't quite do that |
duke@435 | 342 | // here (perm_gen first rather than last), so we tell the validate code |
duke@435 | 343 | // to use a higher index (saved from phase2) when verifying perm_gen. |
duke@435 | 344 | GenCollectedHeap* gch = GenCollectedHeap::heap(); |
duke@435 | 345 | |
sla@5237 | 346 | GCTraceTime tm("phase 4", PrintGC && Verbose, true, _gc_timer); |
duke@435 | 347 | trace("4"); |
duke@435 | 348 | |
duke@435 | 349 | GenCompactClosure blk; |
duke@435 | 350 | gch->generation_iterate(&blk, true); |
duke@435 | 351 | } |