concurrentMarkThread.cpp revision 10643:767bc8e5cb19
1 /*
2 * Copyright (c) 2001, 2016, 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 */
24
25#include "precompiled.hpp"
26#include "classfile/classLoaderData.hpp"
27#include "gc/g1/concurrentMarkThread.inline.hpp"
28#include "gc/g1/g1CollectedHeap.inline.hpp"
29#include "gc/g1/g1CollectorPolicy.hpp"
30#include "gc/g1/g1MMUTracker.hpp"
31#include "gc/g1/suspendibleThreadSet.hpp"
32#include "gc/g1/vm_operations_g1.hpp"
33#include "gc/shared/gcId.hpp"
34#include "gc/shared/gcTrace.hpp"
35#include "gc/shared/gcTraceTime.inline.hpp"
36#include "logging/log.hpp"
37#include "memory/resourceArea.hpp"
38#include "runtime/vmThread.hpp"
39
40// ======= Concurrent Mark Thread ========
41
42// The CM thread is created when the G1 garbage collector is used
43
44ConcurrentMarkThread::ConcurrentMarkThread(G1ConcurrentMark* cm) :
45  ConcurrentGCThread(),
46  _cm(cm),
47  _state(Idle),
48  _vtime_accum(0.0),
49  _vtime_mark_accum(0.0) {
50
51  set_name("G1 Main Marker");
52  create_and_start();
53}
54
55class CMCheckpointRootsFinalClosure: public VoidClosure {
56
57  G1ConcurrentMark* _cm;
58public:
59
60  CMCheckpointRootsFinalClosure(G1ConcurrentMark* cm) :
61    _cm(cm) {}
62
63  void do_void(){
64    _cm->checkpointRootsFinal(false); // !clear_all_soft_refs
65  }
66};
67
68class CMCleanUp: public VoidClosure {
69  G1ConcurrentMark* _cm;
70public:
71
72  CMCleanUp(G1ConcurrentMark* cm) :
73    _cm(cm) {}
74
75  void do_void(){
76    _cm->cleanup();
77  }
78};
79
80// Marking pauses can be scheduled flexibly, so we might delay marking to meet MMU.
81void ConcurrentMarkThread::delay_to_keep_mmu(G1CollectorPolicy* g1_policy, bool remark) {
82  if (g1_policy->adaptive_young_list_length()) {
83    double now = os::elapsedTime();
84    double prediction_ms = remark ? g1_policy->predict_remark_time_ms()
85                                  : g1_policy->predict_cleanup_time_ms();
86    G1MMUTracker *mmu_tracker = g1_policy->mmu_tracker();
87    jlong sleep_time_ms = mmu_tracker->when_ms(now, prediction_ms);
88    os::sleep(this, sleep_time_ms, false);
89  }
90}
91
92class G1ConcPhaseTimer : public GCTraceConcTimeImpl<LogLevel::Info, LOG_TAGS(gc, marking)> {
93  G1ConcurrentMark* _cm;
94
95 public:
96  G1ConcPhaseTimer(G1ConcurrentMark* cm, const char* title) :
97     GCTraceConcTimeImpl<LogLevel::Info,  LogTag::_gc, LogTag::_marking>(title),
98     _cm(cm) {
99    _cm->register_concurrent_phase_start(title);
100  }
101
102  ~G1ConcPhaseTimer() {
103    _cm->register_concurrent_phase_end();
104  }
105};
106
107void ConcurrentMarkThread::run_service() {
108  _vtime_start = os::elapsedVTime();
109
110  G1CollectedHeap* g1h = G1CollectedHeap::heap();
111  G1CollectorPolicy* g1_policy = g1h->g1_policy();
112
113  while (!should_terminate()) {
114    // wait until started is set.
115    sleepBeforeNextCycle();
116    if (should_terminate()) {
117      break;
118    }
119
120    assert(GCId::current() != GCId::undefined(), "GC id should have been set up by the initial mark GC.");
121
122    GCTraceConcTime(Info, gc) tt("Concurrent Cycle");
123    {
124      ResourceMark rm;
125      HandleMark   hm;
126      double cycle_start = os::elapsedVTime();
127
128      {
129        G1ConcPhaseTimer t(_cm, "Concurrent Clear Claimed Marks");
130        ClassLoaderDataGraph::clear_claimed_marks();
131      }
132
133      // We have to ensure that we finish scanning the root regions
134      // before the next GC takes place. To ensure this we have to
135      // make sure that we do not join the STS until the root regions
136      // have been scanned. If we did then it's possible that a
137      // subsequent GC could block us from joining the STS and proceed
138      // without the root regions have been scanned which would be a
139      // correctness issue.
140
141      {
142        G1ConcPhaseTimer t(_cm, "Concurrent Scan Root Regions");
143        _cm->scan_root_regions();
144      }
145
146      // It would be nice to use the GCTraceConcTime class here but
147      // the "end" logging is inside the loop and not at the end of
148      // a scope. Mimicking the same log output as GCTraceConcTime instead.
149      jlong mark_start = os::elapsed_counter();
150      log_info(gc, marking)("Concurrent Mark (%.3fs)", TimeHelper::counter_to_seconds(mark_start));
151
152      int iter = 0;
153      do {
154        iter++;
155        if (!cm()->has_aborted()) {
156          G1ConcPhaseTimer t(_cm, "Concurrent Mark From Roots");
157          _cm->mark_from_roots();
158        }
159
160        double mark_end_time = os::elapsedVTime();
161        jlong mark_end = os::elapsed_counter();
162        _vtime_mark_accum += (mark_end_time - cycle_start);
163        if (!cm()->has_aborted()) {
164          delay_to_keep_mmu(g1_policy, true /* remark */);
165          log_info(gc, marking)("Concurrent Mark (%.3fs, %.3fs) %.3fms",
166                                TimeHelper::counter_to_seconds(mark_start),
167                                TimeHelper::counter_to_seconds(mark_end),
168                                TimeHelper::counter_to_millis(mark_end - mark_start));
169
170          CMCheckpointRootsFinalClosure final_cl(_cm);
171          VM_CGC_Operation op(&final_cl, "Pause Remark", true /* needs_pll */);
172          VMThread::execute(&op);
173        }
174        if (cm()->restart_for_overflow()) {
175          log_debug(gc, marking)("Restarting Concurrent Marking because of Mark Stack Overflow in Remark (Iteration #%d).", iter);
176          log_info(gc, marking)("Concurrent Mark Restart due to overflow");
177        }
178      } while (cm()->restart_for_overflow());
179
180      double end_time = os::elapsedVTime();
181      // Update the total virtual time before doing this, since it will try
182      // to measure it to get the vtime for this marking.  We purposely
183      // neglect the presumably-short "completeCleanup" phase here.
184      _vtime_accum = (end_time - _vtime_start);
185
186      if (!cm()->has_aborted()) {
187        delay_to_keep_mmu(g1_policy, false /* cleanup */);
188
189        CMCleanUp cl_cl(_cm);
190        VM_CGC_Operation op(&cl_cl, "Pause Cleanup", false /* needs_pll */);
191        VMThread::execute(&op);
192      } else {
193        // We don't want to update the marking status if a GC pause
194        // is already underway.
195        SuspendibleThreadSetJoiner sts_join;
196        g1h->collector_state()->set_mark_in_progress(false);
197      }
198
199      // Check if cleanup set the free_regions_coming flag. If it
200      // hasn't, we can just skip the next step.
201      if (g1h->free_regions_coming()) {
202        // The following will finish freeing up any regions that we
203        // found to be empty during cleanup. We'll do this part
204        // without joining the suspendible set. If an evacuation pause
205        // takes place, then we would carry on freeing regions in
206        // case they are needed by the pause. If a Full GC takes
207        // place, it would wait for us to process the regions
208        // reclaimed by cleanup.
209
210        G1ConcPhaseTimer t(_cm, "Concurrent Complete Cleanup");
211        // Now do the concurrent cleanup operation.
212        _cm->complete_cleanup();
213
214        // Notify anyone who's waiting that there are no more free
215        // regions coming. We have to do this before we join the STS
216        // (in fact, we should not attempt to join the STS in the
217        // interval between finishing the cleanup pause and clearing
218        // the free_regions_coming flag) otherwise we might deadlock:
219        // a GC worker could be blocked waiting for the notification
220        // whereas this thread will be blocked for the pause to finish
221        // while it's trying to join the STS, which is conditional on
222        // the GC workers finishing.
223        g1h->reset_free_regions_coming();
224      }
225      guarantee(cm()->cleanup_list_is_empty(),
226                "at this point there should be no regions on the cleanup list");
227
228      // There is a tricky race before recording that the concurrent
229      // cleanup has completed and a potential Full GC starting around
230      // the same time. We want to make sure that the Full GC calls
231      // abort() on concurrent mark after
232      // record_concurrent_mark_cleanup_completed(), since abort() is
233      // the method that will reset the concurrent mark state. If we
234      // end up calling record_concurrent_mark_cleanup_completed()
235      // after abort() then we might incorrectly undo some of the work
236      // abort() did. Checking the has_aborted() flag after joining
237      // the STS allows the correct ordering of the two methods. There
238      // are two scenarios:
239      //
240      // a) If we reach here before the Full GC, the fact that we have
241      // joined the STS means that the Full GC cannot start until we
242      // leave the STS, so record_concurrent_mark_cleanup_completed()
243      // will complete before abort() is called.
244      //
245      // b) If we reach here during the Full GC, we'll be held up from
246      // joining the STS until the Full GC is done, which means that
247      // abort() will have completed and has_aborted() will return
248      // true to prevent us from calling
249      // record_concurrent_mark_cleanup_completed() (and, in fact, it's
250      // not needed any more as the concurrent mark state has been
251      // already reset).
252      {
253        SuspendibleThreadSetJoiner sts_join;
254        if (!cm()->has_aborted()) {
255          g1_policy->record_concurrent_mark_cleanup_completed();
256        } else {
257          log_info(gc, marking)("Concurrent Mark Abort");
258        }
259      }
260
261      // We now want to allow clearing of the marking bitmap to be
262      // suspended by a collection pause.
263      // We may have aborted just before the remark. Do not bother clearing the
264      // bitmap then, as it has been done during mark abort.
265      if (!cm()->has_aborted()) {
266        G1ConcPhaseTimer t(_cm, "Concurrent Cleanup for Next Mark");
267        _cm->cleanup_for_next_mark();
268      } else {
269        assert(!G1VerifyBitmaps || _cm->nextMarkBitmapIsClear(), "Next mark bitmap must be clear");
270      }
271    }
272
273    // Update the number of full collections that have been
274    // completed. This will also notify the FullGCCount_lock in case a
275    // Java thread is waiting for a full GC to happen (e.g., it
276    // called System.gc() with +ExplicitGCInvokesConcurrent).
277    {
278      SuspendibleThreadSetJoiner sts_join;
279      g1h->increment_old_marking_cycles_completed(true /* concurrent */);
280      g1h->register_concurrent_cycle_end();
281    }
282  }
283  _cm->root_regions()->cancel_scan();
284}
285
286void ConcurrentMarkThread::stop_service() {
287  MutexLockerEx ml(CGC_lock, Mutex::_no_safepoint_check_flag);
288  CGC_lock->notify_all();
289}
290
291void ConcurrentMarkThread::sleepBeforeNextCycle() {
292  // We join here because we don't want to do the "shouldConcurrentMark()"
293  // below while the world is otherwise stopped.
294  assert(!in_progress(), "should have been cleared");
295
296  MutexLockerEx x(CGC_lock, Mutex::_no_safepoint_check_flag);
297  while (!started() && !should_terminate()) {
298    CGC_lock->wait(Mutex::_no_safepoint_check_flag);
299  }
300
301  if (started()) {
302    set_in_progress();
303  }
304}
305