|
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 #include "incls/_precompiled.incl"
|
|
|
26 #include "incls/_g1MMUTracker.cpp.incl"
|
|
|
27
|
|
|
28 #define _DISABLE_MMU 0
|
|
|
29
|
|
|
30 // can't rely on comparing doubles with tolerating a small margin for error
|
|
|
31 #define SMALL_MARGIN 0.0000001
|
|
|
32 #define is_double_leq_0(_value) ( (_value) < SMALL_MARGIN )
|
|
|
33 #define is_double_leq(_val1, _val2) is_double_leq_0((_val1) - (_val2))
|
|
|
34 #define is_double_geq(_val1, _val2) is_double_leq_0((_val2) - (_val1))
|
|
|
35
|
|
|
36 /***** ALL TIMES ARE IN SECS!!!!!!! *****/
|
|
|
37
|
|
|
38 G1MMUTracker::G1MMUTracker(double time_slice, double max_gc_time) :
|
|
|
39 _time_slice(time_slice),
|
|
936
|
40 _max_gc_time(max_gc_time) { }
|
|
342
|
41
|
|
|
42 G1MMUTrackerQueue::G1MMUTrackerQueue(double time_slice, double max_gc_time) :
|
|
|
43 G1MMUTracker(time_slice, max_gc_time),
|
|
|
44 _head_index(0),
|
|
|
45 _tail_index(trim_index(_head_index+1)),
|
|
|
46 _no_entries(0) { }
|
|
|
47
|
|
|
48 void G1MMUTrackerQueue::remove_expired_entries(double current_time) {
|
|
|
49 double limit = current_time - _time_slice;
|
|
|
50 while (_no_entries > 0) {
|
|
|
51 if (is_double_geq(limit, _array[_tail_index].end_time())) {
|
|
|
52 _tail_index = trim_index(_tail_index + 1);
|
|
|
53 --_no_entries;
|
|
|
54 } else
|
|
|
55 return;
|
|
|
56 }
|
|
|
57 guarantee(_no_entries == 0, "should have no entries in the array");
|
|
|
58 }
|
|
|
59
|
|
|
60 double G1MMUTrackerQueue::calculate_gc_time(double current_time) {
|
|
|
61 double gc_time = 0.0;
|
|
|
62 double limit = current_time - _time_slice;
|
|
|
63 for (int i = 0; i < _no_entries; ++i) {
|
|
|
64 int index = trim_index(_tail_index + i);
|
|
|
65 G1MMUTrackerQueueElem *elem = &_array[index];
|
|
|
66 if (elem->end_time() > limit) {
|
|
|
67 if (elem->start_time() > limit)
|
|
|
68 gc_time += elem->duration();
|
|
|
69 else
|
|
|
70 gc_time += elem->end_time() - limit;
|
|
|
71 }
|
|
|
72 }
|
|
|
73 return gc_time;
|
|
|
74 }
|
|
|
75
|
|
|
76 void G1MMUTrackerQueue::add_pause(double start, double end, bool gc_thread) {
|
|
|
77 double longest_allowed = longest_pause_internal(start);
|
|
|
78 if (longest_allowed < 0.0)
|
|
|
79 longest_allowed = 0.0;
|
|
|
80 double duration = end - start;
|
|
|
81
|
|
|
82 remove_expired_entries(end);
|
|
|
83 if (_no_entries == QueueLength) {
|
|
|
84 // OK, right now when we fill up we bomb out
|
|
|
85 // there are a few ways of dealing with this "gracefully"
|
|
|
86 // increase the array size (:-)
|
|
|
87 // remove the oldest entry (this might allow more GC time for
|
|
|
88 // the time slice than what's allowed)
|
|
|
89 // concolidate the two entries with the minimum gap between them
|
|
|
90 // (this mighte allow less GC time than what's allowed)
|
|
|
91 guarantee(0, "array full, currently we can't recover");
|
|
|
92 }
|
|
|
93 _head_index = trim_index(_head_index + 1);
|
|
|
94 ++_no_entries;
|
|
|
95 _array[_head_index] = G1MMUTrackerQueueElem(start, end);
|
|
|
96 }
|
|
|
97
|
|
|
98 // basically the _internal call does not remove expired entries
|
|
|
99 // this is for trying things out in the future and a couple
|
|
|
100 // of other places (debugging)
|
|
|
101
|
|
|
102 double G1MMUTrackerQueue::longest_pause(double current_time) {
|
|
|
103 if (_DISABLE_MMU)
|
|
|
104 return _max_gc_time;
|
|
|
105
|
|
|
106 MutexLockerEx x(MMUTracker_lock, Mutex::_no_safepoint_check_flag);
|
|
|
107 remove_expired_entries(current_time);
|
|
|
108
|
|
|
109 return longest_pause_internal(current_time);
|
|
|
110 }
|
|
|
111
|
|
|
112 double G1MMUTrackerQueue::longest_pause_internal(double current_time) {
|
|
|
113 double target_time = _max_gc_time;
|
|
|
114
|
|
|
115 while( 1 ) {
|
|
|
116 double gc_time =
|
|
936
|
117 calculate_gc_time(current_time + target_time);
|
|
342
|
118 double diff = target_time + gc_time - _max_gc_time;
|
|
|
119 if (!is_double_leq_0(diff)) {
|
|
|
120 target_time -= diff;
|
|
|
121 if (is_double_leq_0(target_time)) {
|
|
|
122 target_time = -1.0;
|
|
|
123 break;
|
|
|
124 }
|
|
|
125 } else {
|
|
|
126 break;
|
|
|
127 }
|
|
|
128 }
|
|
|
129
|
|
|
130 return target_time;
|
|
|
131 }
|
|
|
132
|
|
|
133 // basically the _internal call does not remove expired entries
|
|
|
134 // this is for trying things out in the future and a couple
|
|
|
135 // of other places (debugging)
|
|
|
136
|
|
|
137 double G1MMUTrackerQueue::when_sec(double current_time, double pause_time) {
|
|
|
138 if (_DISABLE_MMU)
|
|
|
139 return 0.0;
|
|
|
140
|
|
|
141 MutexLockerEx x(MMUTracker_lock, Mutex::_no_safepoint_check_flag);
|
|
|
142 remove_expired_entries(current_time);
|
|
|
143
|
|
|
144 return when_internal(current_time, pause_time);
|
|
|
145 }
|
|
|
146
|
|
|
147 double G1MMUTrackerQueue::when_internal(double current_time,
|
|
|
148 double pause_time) {
|
|
|
149 // if the pause is over the maximum, just assume that it's the maximum
|
|
|
150 double adjusted_pause_time =
|
|
|
151 (pause_time > max_gc_time()) ? max_gc_time() : pause_time;
|
|
|
152 double earliest_end = current_time + adjusted_pause_time;
|
|
|
153 double limit = earliest_end - _time_slice;
|
|
|
154 double gc_time = calculate_gc_time(earliest_end);
|
|
|
155 double diff = gc_time + adjusted_pause_time - max_gc_time();
|
|
|
156 if (is_double_leq_0(diff))
|
|
|
157 return 0.0;
|
|
|
158
|
|
|
159 int index = _tail_index;
|
|
|
160 while ( 1 ) {
|
|
|
161 G1MMUTrackerQueueElem *elem = &_array[index];
|
|
|
162 if (elem->end_time() > limit) {
|
|
|
163 if (elem->start_time() > limit)
|
|
|
164 diff -= elem->duration();
|
|
|
165 else
|
|
|
166 diff -= elem->end_time() - limit;
|
|
|
167 if (is_double_leq_0(diff))
|
|
|
168 return elem->end_time() + diff + _time_slice - adjusted_pause_time - current_time;
|
|
|
169 }
|
|
|
170 index = trim_index(index+1);
|
|
|
171 guarantee(index != trim_index(_head_index + 1), "should not go past head");
|
|
|
172 }
|
|
|
173 }
|
