|
342
|
1 /*
|
|
|
2 * Copyright 2001-2007 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
|
21 * have any questions.
|
|
|
22 *
|
|
|
23 */
|
|
|
24
|
|
|
25 // Forward Decl.
|
|
|
26 class ConcurrentG1Refine;
|
|
|
27
|
|
|
28 // The G1 Concurrent Refinement Thread (could be several in the future).
|
|
|
29
|
|
|
30 class ConcurrentG1RefineThread: public ConcurrentGCThread {
|
|
|
31 friend class VMStructs;
|
|
|
32 friend class G1CollectedHeap;
|
|
|
33
|
|
|
34 double _vtime_start; // Initial virtual time.
|
|
|
35 double _vtime_accum; // Initial virtual time.
|
|
794
|
36 int _worker_id;
|
|
342
|
37
|
|
794
|
38 // The refinement threads collection is linked list. A predecessor can activate a successor
|
|
|
39 // when the number of the rset update buffer crosses a certain threshold. A successor
|
|
|
40 // would self-deactivate when the number of the buffers falls below the threshold.
|
|
|
41 bool _active;
|
|
|
42 ConcurrentG1RefineThread * _next;
|
|
342
|
43 public:
|
|
|
44 virtual void run();
|
|
|
45
|
|
794
|
46 bool is_active() { return _active; }
|
|
|
47 void activate() { _active = true; }
|
|
|
48 void deactivate() { _active = false; }
|
|
|
49
|
|
342
|
50 private:
|
|
|
51 ConcurrentG1Refine* _cg1r;
|
|
|
52
|
|
|
53 COTracker _co_tracker;
|
|
|
54 double _interval_ms;
|
|
|
55
|
|
|
56 void decreaseInterval(int processing_time_ms) {
|
|
|
57 double min_interval_ms = (double) processing_time_ms;
|
|
|
58 _interval_ms = 0.8 * _interval_ms;
|
|
|
59 if (_interval_ms < min_interval_ms)
|
|
|
60 _interval_ms = min_interval_ms;
|
|
|
61 }
|
|
|
62 void increaseInterval(int processing_time_ms) {
|
|
|
63 double max_interval_ms = 9.0 * (double) processing_time_ms;
|
|
|
64 _interval_ms = 1.1 * _interval_ms;
|
|
|
65 if (max_interval_ms > 0 && _interval_ms > max_interval_ms)
|
|
|
66 _interval_ms = max_interval_ms;
|
|
|
67 }
|
|
|
68
|
|
|
69 void sleepBeforeNextCycle();
|
|
|
70
|
|
|
71 // For use by G1CollectedHeap, which is a friend.
|
|
|
72 static SuspendibleThreadSet* sts() { return &_sts; }
|
|
|
73
|
|
|
74 public:
|
|
|
75 // Constructor
|
|
794
|
76 ConcurrentG1RefineThread(ConcurrentG1Refine* cg1r, ConcurrentG1RefineThread* next, int worker_id);
|
|
342
|
77
|
|
|
78 // Printing
|
|
|
79 void print();
|
|
|
80
|
|
|
81 // Total virtual time so far.
|
|
|
82 double vtime_accum() { return _vtime_accum; }
|
|
|
83
|
|
|
84 ConcurrentG1Refine* cg1r() { return _cg1r; }
|
|
|
85
|
|
|
86 void sample_young_list_rs_lengths();
|
|
|
87
|
|
|
88 // Yield for GC
|
|
|
89 void yield();
|
|
|
90
|
|
|
91 // shutdown
|
|
794
|
92 void stop();
|
|
342
|
93 };
|
