Mercurial > hg > truffle
comparison src/share/vm/gc_implementation/g1/concurrentG1RefineThread.hpp @ 342:37f87013dfd8
6711316: Open source the Garbage-First garbage collector
Summary: First mercurial integration of the code for the Garbage-First garbage collector.
Reviewed-by: apetrusenko, iveresov, jmasa, sgoldman, tonyp, ysr
author | ysr |
---|---|
date | Thu, 05 Jun 2008 15:57:56 -0700 |
parents | |
children | 315a5d70b295 |
comparison
equal
deleted
inserted
replaced
189:0b27f3512f9e | 342:37f87013dfd8 |
---|---|
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. | |
36 | |
37 public: | |
38 virtual void run(); | |
39 | |
40 private: | |
41 ConcurrentG1Refine* _cg1r; | |
42 bool _started; | |
43 bool _in_progress; | |
44 volatile bool _restart; | |
45 | |
46 COTracker _co_tracker; | |
47 double _interval_ms; | |
48 | |
49 bool _do_traversal; | |
50 | |
51 void decreaseInterval(int processing_time_ms) { | |
52 double min_interval_ms = (double) processing_time_ms; | |
53 _interval_ms = 0.8 * _interval_ms; | |
54 if (_interval_ms < min_interval_ms) | |
55 _interval_ms = min_interval_ms; | |
56 } | |
57 void increaseInterval(int processing_time_ms) { | |
58 double max_interval_ms = 9.0 * (double) processing_time_ms; | |
59 _interval_ms = 1.1 * _interval_ms; | |
60 if (max_interval_ms > 0 && _interval_ms > max_interval_ms) | |
61 _interval_ms = max_interval_ms; | |
62 } | |
63 | |
64 void sleepBeforeNextCycle(); | |
65 | |
66 void traversalBasedRefinement(); | |
67 | |
68 void queueBasedRefinement(); | |
69 | |
70 // For use by G1CollectedHeap, which is a friend. | |
71 static SuspendibleThreadSet* sts() { return &_sts; } | |
72 | |
73 public: | |
74 // Constructor | |
75 ConcurrentG1RefineThread(ConcurrentG1Refine* cg1r); | |
76 | |
77 // Printing | |
78 void print(); | |
79 | |
80 // Total virtual time so far. | |
81 double vtime_accum() { return _vtime_accum; } | |
82 | |
83 ConcurrentG1Refine* cg1r() { return _cg1r; } | |
84 | |
85 | |
86 void set_started() { _started = true; } | |
87 void clear_started() { _started = false; } | |
88 bool started() { return _started; } | |
89 | |
90 void set_in_progress() { _in_progress = true; } | |
91 void clear_in_progress() { _in_progress = false; } | |
92 bool in_progress() { return _in_progress; } | |
93 | |
94 void set_do_traversal(bool b); | |
95 bool do_traversal() { return _do_traversal; } | |
96 | |
97 void sample_young_list_rs_lengths(); | |
98 | |
99 // Yield for GC | |
100 void yield(); | |
101 | |
102 // shutdown | |
103 static void stop(); | |
104 }; |