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 #ifndef SHARE_VM_GC_G1_CONCURRENTG1REFINETHREAD_HPP |
|
26 #define SHARE_VM_GC_G1_CONCURRENTG1REFINETHREAD_HPP |
|
27 |
|
28 #include "gc/g1/dirtyCardQueue.hpp" |
|
29 #include "gc/shared/concurrentGCThread.hpp" |
|
30 |
|
31 // Forward Decl. |
|
32 class CardTableEntryClosure; |
|
33 class ConcurrentG1Refine; |
|
34 |
|
35 // One or more G1 Concurrent Refinement Threads may be active if concurrent |
|
36 // refinement is in progress. |
|
37 class ConcurrentG1RefineThread: public ConcurrentGCThread { |
|
38 friend class VMStructs; |
|
39 friend class G1CollectedHeap; |
|
40 |
|
41 double _vtime_start; // Initial virtual time. |
|
42 double _vtime_accum; // Accumulated virtual time. |
|
43 uint _worker_id; |
|
44 uint _worker_id_offset; |
|
45 |
|
46 // The refinement threads collection is linked list. A predecessor can activate a successor |
|
47 // when the number of the rset update buffer crosses a certain threshold. A successor |
|
48 // would self-deactivate when the number of the buffers falls below the threshold. |
|
49 bool _active; |
|
50 ConcurrentG1RefineThread* _next; |
|
51 Monitor* _monitor; |
|
52 ConcurrentG1Refine* _cg1r; |
|
53 |
|
54 // This thread's activation/deactivation thresholds |
|
55 size_t _activation_threshold; |
|
56 size_t _deactivation_threshold; |
|
57 |
|
58 void wait_for_completed_buffers(); |
|
59 |
|
60 void set_active(bool x) { _active = x; } |
|
61 bool is_active(); |
|
62 void activate(); |
|
63 void deactivate(); |
|
64 |
|
65 bool is_primary() { return (_worker_id == 0); } |
|
66 |
|
67 void run_service(); |
|
68 void stop_service(); |
|
69 |
|
70 public: |
|
71 // Constructor |
|
72 ConcurrentG1RefineThread(ConcurrentG1Refine* cg1r, ConcurrentG1RefineThread* next, |
|
73 uint worker_id_offset, uint worker_id, |
|
74 size_t activate, size_t deactivate); |
|
75 |
|
76 void update_thresholds(size_t activate, size_t deactivate); |
|
77 size_t activation_threshold() const { return _activation_threshold; } |
|
78 |
|
79 // Total virtual time so far. |
|
80 double vtime_accum() { return _vtime_accum; } |
|
81 |
|
82 ConcurrentG1Refine* cg1r() { return _cg1r; } |
|
83 }; |
|
84 |
|
85 #endif // SHARE_VM_GC_G1_CONCURRENTG1REFINETHREAD_HPP |
|