src/share/vm/gc_implementation/g1/g1MarkSweep.cpp

Wed, 27 Apr 2016 01:25:04 +0800

author
aoqi
date
Wed, 27 Apr 2016 01:25:04 +0800
changeset 0
f90c822e73f8
child 6876
710a3c8b516e
permissions
-rw-r--r--

Initial load
http://hg.openjdk.java.net/jdk8u/jdk8u/hotspot/
changeset: 6782:28b50d07f6f8
tag: jdk8u25-b17

     1 /*
     2  * Copyright (c) 2001, 2014, 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/javaClasses.hpp"
    27 #include "classfile/symbolTable.hpp"
    28 #include "classfile/systemDictionary.hpp"
    29 #include "classfile/vmSymbols.hpp"
    30 #include "code/codeCache.hpp"
    31 #include "code/icBuffer.hpp"
    32 #include "gc_implementation/g1/g1Log.hpp"
    33 #include "gc_implementation/g1/g1MarkSweep.hpp"
    34 #include "gc_implementation/g1/g1StringDedup.hpp"
    35 #include "gc_implementation/shared/gcHeapSummary.hpp"
    36 #include "gc_implementation/shared/gcTimer.hpp"
    37 #include "gc_implementation/shared/gcTrace.hpp"
    38 #include "gc_implementation/shared/gcTraceTime.hpp"
    39 #include "memory/gcLocker.hpp"
    40 #include "memory/genCollectedHeap.hpp"
    41 #include "memory/modRefBarrierSet.hpp"
    42 #include "memory/referencePolicy.hpp"
    43 #include "memory/space.hpp"
    44 #include "oops/instanceRefKlass.hpp"
    45 #include "oops/oop.inline.hpp"
    46 #include "prims/jvmtiExport.hpp"
    47 #include "runtime/biasedLocking.hpp"
    48 #include "runtime/fprofiler.hpp"
    49 #include "runtime/synchronizer.hpp"
    50 #include "runtime/thread.hpp"
    51 #include "runtime/vmThread.hpp"
    52 #include "utilities/copy.hpp"
    53 #include "utilities/events.hpp"
    55 class HeapRegion;
    57 void G1MarkSweep::invoke_at_safepoint(ReferenceProcessor* rp,
    58                                       bool clear_all_softrefs) {
    59   assert(SafepointSynchronize::is_at_safepoint(), "must be at a safepoint");
    61   SharedHeap* sh = SharedHeap::heap();
    62 #ifdef ASSERT
    63   if (sh->collector_policy()->should_clear_all_soft_refs()) {
    64     assert(clear_all_softrefs, "Policy should have been checked earler");
    65   }
    66 #endif
    67   // hook up weak ref data so it can be used during Mark-Sweep
    68   assert(GenMarkSweep::ref_processor() == NULL, "no stomping");
    69   assert(rp != NULL, "should be non-NULL");
    70   assert(rp == G1CollectedHeap::heap()->ref_processor_stw(), "Precondition");
    72   GenMarkSweep::_ref_processor = rp;
    73   rp->setup_policy(clear_all_softrefs);
    75   // When collecting the permanent generation Method*s may be moving,
    76   // so we either have to flush all bcp data or convert it into bci.
    77   CodeCache::gc_prologue();
    78   Threads::gc_prologue();
    80   bool marked_for_unloading = false;
    82   allocate_stacks();
    84   // We should save the marks of the currently locked biased monitors.
    85   // The marking doesn't preserve the marks of biased objects.
    86   BiasedLocking::preserve_marks();
    88   mark_sweep_phase1(marked_for_unloading, clear_all_softrefs);
    90   mark_sweep_phase2();
    92   // Don't add any more derived pointers during phase3
    93   COMPILER2_PRESENT(DerivedPointerTable::set_active(false));
    95   mark_sweep_phase3();
    97   mark_sweep_phase4();
    99   GenMarkSweep::restore_marks();
   100   BiasedLocking::restore_marks();
   101   GenMarkSweep::deallocate_stacks();
   103   // "free at last gc" is calculated from these.
   104   // CHF: cheating for now!!!
   105   //  Universe::set_heap_capacity_at_last_gc(Universe::heap()->capacity());
   106   //  Universe::set_heap_used_at_last_gc(Universe::heap()->used());
   108   Threads::gc_epilogue();
   109   CodeCache::gc_epilogue();
   110   JvmtiExport::gc_epilogue();
   112   // refs processing: clean slate
   113   GenMarkSweep::_ref_processor = NULL;
   114 }
   117 void G1MarkSweep::allocate_stacks() {
   118   GenMarkSweep::_preserved_count_max = 0;
   119   GenMarkSweep::_preserved_marks = NULL;
   120   GenMarkSweep::_preserved_count = 0;
   121 }
   123 void G1MarkSweep::mark_sweep_phase1(bool& marked_for_unloading,
   124                                     bool clear_all_softrefs) {
   125   // Recursively traverse all live objects and mark them
   126   GCTraceTime tm("phase 1", G1Log::fine() && Verbose, true, gc_timer());
   127   GenMarkSweep::trace(" 1");
   129   SharedHeap* sh = SharedHeap::heap();
   131   // Need cleared claim bits for the strong roots processing
   132   ClassLoaderDataGraph::clear_claimed_marks();
   134   sh->process_strong_roots(true,  // activate StrongRootsScope
   135                            false, // not scavenging.
   136                            SharedHeap::SO_SystemClasses,
   137                            &GenMarkSweep::follow_root_closure,
   138                            &GenMarkSweep::follow_code_root_closure,
   139                            &GenMarkSweep::follow_klass_closure);
   141   // Process reference objects found during marking
   142   ReferenceProcessor* rp = GenMarkSweep::ref_processor();
   143   assert(rp == G1CollectedHeap::heap()->ref_processor_stw(), "Sanity");
   145   rp->setup_policy(clear_all_softrefs);
   146   const ReferenceProcessorStats& stats =
   147     rp->process_discovered_references(&GenMarkSweep::is_alive,
   148                                       &GenMarkSweep::keep_alive,
   149                                       &GenMarkSweep::follow_stack_closure,
   150                                       NULL,
   151                                       gc_timer());
   152   gc_tracer()->report_gc_reference_stats(stats);
   155   // This is the point where the entire marking should have completed.
   156   assert(GenMarkSweep::_marking_stack.is_empty(), "Marking should have completed");
   158   // Unload classes and purge the SystemDictionary.
   159   bool purged_class = SystemDictionary::do_unloading(&GenMarkSweep::is_alive);
   161   // Unload nmethods.
   162   CodeCache::do_unloading(&GenMarkSweep::is_alive, purged_class);
   164   // Prune dead klasses from subklass/sibling/implementor lists.
   165   Klass::clean_weak_klass_links(&GenMarkSweep::is_alive);
   167   // Delete entries for dead interned string and clean up unreferenced symbols in symbol table.
   168   G1CollectedHeap::heap()->unlink_string_and_symbol_table(&GenMarkSweep::is_alive);
   170   if (VerifyDuringGC) {
   171     HandleMark hm;  // handle scope
   172     COMPILER2_PRESENT(DerivedPointerTableDeactivate dpt_deact);
   173     Universe::heap()->prepare_for_verify();
   174     // Note: we can verify only the heap here. When an object is
   175     // marked, the previous value of the mark word (including
   176     // identity hash values, ages, etc) is preserved, and the mark
   177     // word is set to markOop::marked_value - effectively removing
   178     // any hash values from the mark word. These hash values are
   179     // used when verifying the dictionaries and so removing them
   180     // from the mark word can make verification of the dictionaries
   181     // fail. At the end of the GC, the orginal mark word values
   182     // (including hash values) are restored to the appropriate
   183     // objects.
   184     if (!VerifySilently) {
   185       gclog_or_tty->print(" VerifyDuringGC:(full)[Verifying ");
   186     }
   187     Universe::heap()->verify(VerifySilently, VerifyOption_G1UseMarkWord);
   188     if (!VerifySilently) {
   189       gclog_or_tty->print_cr("]");
   190     }
   191   }
   193   gc_tracer()->report_object_count_after_gc(&GenMarkSweep::is_alive);
   194 }
   196 class G1PrepareCompactClosure: public HeapRegionClosure {
   197   G1CollectedHeap* _g1h;
   198   ModRefBarrierSet* _mrbs;
   199   CompactPoint _cp;
   200   HeapRegionSetCount _humongous_regions_removed;
   202   void free_humongous_region(HeapRegion* hr) {
   203     HeapWord* end = hr->end();
   204     FreeRegionList dummy_free_list("Dummy Free List for G1MarkSweep");
   206     assert(hr->startsHumongous(),
   207            "Only the start of a humongous region should be freed.");
   209     hr->set_containing_set(NULL);
   210     _humongous_regions_removed.increment(1u, hr->capacity());
   212     _g1h->free_humongous_region(hr, &dummy_free_list, false /* par */);
   213     hr->prepare_for_compaction(&_cp);
   214     // Also clear the part of the card table that will be unused after
   215     // compaction.
   216     _mrbs->clear(MemRegion(hr->compaction_top(), end));
   217     dummy_free_list.remove_all();
   218   }
   220 public:
   221   G1PrepareCompactClosure(CompactibleSpace* cs)
   222   : _g1h(G1CollectedHeap::heap()),
   223     _mrbs(_g1h->g1_barrier_set()),
   224     _cp(NULL, cs, cs->initialize_threshold()),
   225     _humongous_regions_removed() { }
   227   void update_sets() {
   228     // We'll recalculate total used bytes and recreate the free list
   229     // at the end of the GC, so no point in updating those values here.
   230     HeapRegionSetCount empty_set;
   231     _g1h->remove_from_old_sets(empty_set, _humongous_regions_removed);
   232   }
   234   bool doHeapRegion(HeapRegion* hr) {
   235     if (hr->isHumongous()) {
   236       if (hr->startsHumongous()) {
   237         oop obj = oop(hr->bottom());
   238         if (obj->is_gc_marked()) {
   239           obj->forward_to(obj);
   240         } else  {
   241           free_humongous_region(hr);
   242         }
   243       } else {
   244         assert(hr->continuesHumongous(), "Invalid humongous.");
   245       }
   246     } else {
   247       hr->prepare_for_compaction(&_cp);
   248       // Also clear the part of the card table that will be unused after
   249       // compaction.
   250       _mrbs->clear(MemRegion(hr->compaction_top(), hr->end()));
   251     }
   252     return false;
   253   }
   254 };
   256 void G1MarkSweep::mark_sweep_phase2() {
   257   // Now all live objects are marked, compute the new object addresses.
   259   // It is not required that we traverse spaces in the same order in
   260   // phase2, phase3 and phase4, but the ValidateMarkSweep live oops
   261   // tracking expects us to do so. See comment under phase4.
   263   G1CollectedHeap* g1h = G1CollectedHeap::heap();
   265   GCTraceTime tm("phase 2", G1Log::fine() && Verbose, true, gc_timer());
   266   GenMarkSweep::trace("2");
   268   // find the first region
   269   HeapRegion* r = g1h->region_at(0);
   270   CompactibleSpace* sp = r;
   271   if (r->isHumongous() && oop(r->bottom())->is_gc_marked()) {
   272     sp = r->next_compaction_space();
   273   }
   275   G1PrepareCompactClosure blk(sp);
   276   g1h->heap_region_iterate(&blk);
   277   blk.update_sets();
   278 }
   280 class G1AdjustPointersClosure: public HeapRegionClosure {
   281  public:
   282   bool doHeapRegion(HeapRegion* r) {
   283     if (r->isHumongous()) {
   284       if (r->startsHumongous()) {
   285         // We must adjust the pointers on the single H object.
   286         oop obj = oop(r->bottom());
   287         // point all the oops to the new location
   288         obj->adjust_pointers();
   289       }
   290     } else {
   291       // This really ought to be "as_CompactibleSpace"...
   292       r->adjust_pointers();
   293     }
   294     return false;
   295   }
   296 };
   298 void G1MarkSweep::mark_sweep_phase3() {
   299   G1CollectedHeap* g1h = G1CollectedHeap::heap();
   301   // Adjust the pointers to reflect the new locations
   302   GCTraceTime tm("phase 3", G1Log::fine() && Verbose, true, gc_timer());
   303   GenMarkSweep::trace("3");
   305   SharedHeap* sh = SharedHeap::heap();
   307   // Need cleared claim bits for the strong roots processing
   308   ClassLoaderDataGraph::clear_claimed_marks();
   310   sh->process_strong_roots(true,  // activate StrongRootsScope
   311                            false, // not scavenging.
   312                            SharedHeap::SO_AllClasses,
   313                            &GenMarkSweep::adjust_pointer_closure,
   314                            NULL,  // do not touch code cache here
   315                            &GenMarkSweep::adjust_klass_closure);
   317   assert(GenMarkSweep::ref_processor() == g1h->ref_processor_stw(), "Sanity");
   318   g1h->ref_processor_stw()->weak_oops_do(&GenMarkSweep::adjust_pointer_closure);
   320   // Now adjust pointers in remaining weak roots.  (All of which should
   321   // have been cleared if they pointed to non-surviving objects.)
   322   g1h->g1_process_weak_roots(&GenMarkSweep::adjust_pointer_closure);
   324   if (G1StringDedup::is_enabled()) {
   325     G1StringDedup::oops_do(&GenMarkSweep::adjust_pointer_closure);
   326   }
   328   GenMarkSweep::adjust_marks();
   330   G1AdjustPointersClosure blk;
   331   g1h->heap_region_iterate(&blk);
   332 }
   334 class G1SpaceCompactClosure: public HeapRegionClosure {
   335 public:
   336   G1SpaceCompactClosure() {}
   338   bool doHeapRegion(HeapRegion* hr) {
   339     if (hr->isHumongous()) {
   340       if (hr->startsHumongous()) {
   341         oop obj = oop(hr->bottom());
   342         if (obj->is_gc_marked()) {
   343           obj->init_mark();
   344         } else {
   345           assert(hr->is_empty(), "Should have been cleared in phase 2.");
   346         }
   347         hr->reset_during_compaction();
   348       }
   349     } else {
   350       hr->compact();
   351     }
   352     return false;
   353   }
   354 };
   356 void G1MarkSweep::mark_sweep_phase4() {
   357   // All pointers are now adjusted, move objects accordingly
   359   // The ValidateMarkSweep live oops tracking expects us to traverse spaces
   360   // in the same order in phase2, phase3 and phase4. We don't quite do that
   361   // here (code and comment not fixed for perm removal), so we tell the validate code
   362   // to use a higher index (saved from phase2) when verifying perm_gen.
   363   G1CollectedHeap* g1h = G1CollectedHeap::heap();
   365   GCTraceTime tm("phase 4", G1Log::fine() && Verbose, true, gc_timer());
   366   GenMarkSweep::trace("4");
   368   G1SpaceCompactClosure blk;
   369   g1h->heap_region_iterate(&blk);
   371 }

mercurial