author | trims |
Tue, 05 Apr 2011 14:12:31 -0700 | |
changeset 8921 | 14bfe81f2a9d |
parent 8101 | 1778246610fa |
child 9183 | 3d0e0687fe28 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
8921
14bfe81f2a9d
7010070: Update all 2010 Oracle-changed OpenJDK files to have the proper copyright dates - second pass
trims
parents:
8101
diff
changeset
|
2 |
* Copyright (c) 2001, 2011, Oracle and/or its affiliates. All rights reserved. |
1 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
4574
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
4574
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
4574
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#ifndef SHARE_VM_GC_IMPLEMENTATION_SHARED_ALLOCATIONSTATS_HPP |
26 |
#define SHARE_VM_GC_IMPLEMENTATION_SHARED_ALLOCATIONSTATS_HPP |
|
27 |
||
28 |
#ifndef SERIALGC |
|
29 |
#include "gc_implementation/shared/gcUtil.hpp" |
|
30 |
#include "memory/allocation.hpp" |
|
31 |
#include "utilities/globalDefinitions.hpp" |
|
32 |
#endif |
|
33 |
||
1 | 34 |
class AllocationStats VALUE_OBJ_CLASS_SPEC { |
35 |
// A duration threshold (in ms) used to filter |
|
36 |
// possibly unreliable samples. |
|
37 |
static float _threshold; |
|
38 |
||
39 |
// We measure the demand between the end of the previous sweep and |
|
40 |
// beginning of this sweep: |
|
41 |
// Count(end_last_sweep) - Count(start_this_sweep) |
|
42 |
// + splitBirths(between) - splitDeaths(between) |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
43 |
// The above number divided by the time since the end of the |
1 | 44 |
// previous sweep gives us a time rate of demand for blocks |
45 |
// of this size. We compute a padded average of this rate as |
|
46 |
// our current estimate for the time rate of demand for blocks |
|
47 |
// of this size. Similarly, we keep a padded average for the time |
|
48 |
// between sweeps. Our current estimate for demand for blocks of |
|
49 |
// this size is then simply computed as the product of these two |
|
50 |
// estimates. |
|
51 |
AdaptivePaddedAverage _demand_rate_estimate; |
|
52 |
||
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
53 |
ssize_t _desired; // Demand stimate computed as described above |
1 | 54 |
ssize_t _coalDesired; // desired +/- small-percent for tuning coalescing |
55 |
||
56 |
ssize_t _surplus; // count - (desired +/- small-percent), |
|
57 |
// used to tune splitting in best fit |
|
58 |
ssize_t _bfrSurp; // surplus at start of current sweep |
|
59 |
ssize_t _prevSweep; // count from end of previous sweep |
|
60 |
ssize_t _beforeSweep; // count from before current sweep |
|
61 |
ssize_t _coalBirths; // additional chunks from coalescing |
|
62 |
ssize_t _coalDeaths; // loss from coalescing |
|
63 |
ssize_t _splitBirths; // additional chunks from splitting |
|
64 |
ssize_t _splitDeaths; // loss from splitting |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
65 |
size_t _returnedBytes; // number of bytes returned to list. |
1 | 66 |
public: |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
67 |
void initialize(bool split_birth = false) { |
1 | 68 |
AdaptivePaddedAverage* dummy = |
69 |
new (&_demand_rate_estimate) AdaptivePaddedAverage(CMS_FLSWeight, |
|
70 |
CMS_FLSPadding); |
|
71 |
_desired = 0; |
|
72 |
_coalDesired = 0; |
|
73 |
_surplus = 0; |
|
74 |
_bfrSurp = 0; |
|
75 |
_prevSweep = 0; |
|
76 |
_beforeSweep = 0; |
|
77 |
_coalBirths = 0; |
|
78 |
_coalDeaths = 0; |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
79 |
_splitBirths = split_birth? 1 : 0; |
1 | 80 |
_splitDeaths = 0; |
81 |
_returnedBytes = 0; |
|
82 |
} |
|
83 |
||
84 |
AllocationStats() { |
|
85 |
initialize(); |
|
86 |
} |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
87 |
|
1 | 88 |
// The rate estimate is in blocks per second. |
89 |
void compute_desired(size_t count, |
|
90 |
float inter_sweep_current, |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
91 |
float inter_sweep_estimate, |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
92 |
float intra_sweep_estimate) { |
1 | 93 |
// If the latest inter-sweep time is below our granularity |
94 |
// of measurement, we may call in here with |
|
95 |
// inter_sweep_current == 0. However, even for suitably small |
|
96 |
// but non-zero inter-sweep durations, we may not trust the accuracy |
|
97 |
// of accumulated data, since it has not been "integrated" |
|
98 |
// (read "low-pass-filtered") long enough, and would be |
|
99 |
// vulnerable to noisy glitches. In such cases, we |
|
100 |
// ignore the current sample and use currently available |
|
101 |
// historical estimates. |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
102 |
// XXX NEEDS TO BE FIXED |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
103 |
// assert(prevSweep() + splitBirths() >= splitDeaths() + (ssize_t)count, "Conservation Principle"); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
104 |
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
105 |
// "Total Stock" "Not used at this block size" |
1 | 106 |
if (inter_sweep_current > _threshold) { |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
107 |
ssize_t demand = prevSweep() - (ssize_t)count + splitBirths() - splitDeaths(); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
108 |
// XXX NEEDS TO BE FIXED |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
109 |
// assert(demand >= 0, "Demand should be non-negative"); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
110 |
// Defensive: adjust for imprecision in event counting |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
111 |
if (demand < 0) { |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
112 |
demand = 0; |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
113 |
} |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
114 |
float old_rate = _demand_rate_estimate.padded_average(); |
1 | 115 |
float rate = ((float)demand)/inter_sweep_current; |
116 |
_demand_rate_estimate.sample(rate); |
|
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
117 |
float new_rate = _demand_rate_estimate.padded_average(); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
118 |
ssize_t old_desired = _desired; |
8101
1778246610fa
6999988: CMS: Increased fragmentation leading to promotion failure after CR#6631166 got implemented
ysr
parents:
7397
diff
changeset
|
119 |
float delta_ise = (CMSExtrapolateSweep ? intra_sweep_estimate : 0.0); |
1778246610fa
6999988: CMS: Increased fragmentation leading to promotion failure after CR#6631166 got implemented
ysr
parents:
7397
diff
changeset
|
120 |
_desired = (ssize_t)(new_rate * (inter_sweep_estimate + delta_ise)); |
4574
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
121 |
if (PrintFLSStatistics > 1) { |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
122 |
gclog_or_tty->print_cr("demand: %d, old_rate: %f, current_rate: %f, new_rate: %f, old_desired: %d, new_desired: %d", |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
123 |
demand, old_rate, rate, new_rate, old_desired, _desired); |
b2d5b0975515
6631166: CMS: better heuristics when combatting fragmentation
ysr
parents:
670
diff
changeset
|
124 |
} |
1 | 125 |
} |
126 |
} |
|
127 |
||
128 |
ssize_t desired() const { return _desired; } |
|
185
cda2a1eb4be5
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
1
diff
changeset
|
129 |
void set_desired(ssize_t v) { _desired = v; } |
cda2a1eb4be5
6668743: CMS: Consolidate block statistics reporting code
ysr
parents:
1
diff
changeset
|
130 |
|
1 | 131 |
ssize_t coalDesired() const { return _coalDesired; } |
132 |
void set_coalDesired(ssize_t v) { _coalDesired = v; } |
|
133 |
||
134 |
ssize_t surplus() const { return _surplus; } |
|
135 |
void set_surplus(ssize_t v) { _surplus = v; } |
|
136 |
void increment_surplus() { _surplus++; } |
|
137 |
void decrement_surplus() { _surplus--; } |
|
138 |
||
139 |
ssize_t bfrSurp() const { return _bfrSurp; } |
|
140 |
void set_bfrSurp(ssize_t v) { _bfrSurp = v; } |
|
141 |
ssize_t prevSweep() const { return _prevSweep; } |
|
142 |
void set_prevSweep(ssize_t v) { _prevSweep = v; } |
|
143 |
ssize_t beforeSweep() const { return _beforeSweep; } |
|
144 |
void set_beforeSweep(ssize_t v) { _beforeSweep = v; } |
|
145 |
||
146 |
ssize_t coalBirths() const { return _coalBirths; } |
|
147 |
void set_coalBirths(ssize_t v) { _coalBirths = v; } |
|
148 |
void increment_coalBirths() { _coalBirths++; } |
|
149 |
||
150 |
ssize_t coalDeaths() const { return _coalDeaths; } |
|
151 |
void set_coalDeaths(ssize_t v) { _coalDeaths = v; } |
|
152 |
void increment_coalDeaths() { _coalDeaths++; } |
|
153 |
||
154 |
ssize_t splitBirths() const { return _splitBirths; } |
|
155 |
void set_splitBirths(ssize_t v) { _splitBirths = v; } |
|
156 |
void increment_splitBirths() { _splitBirths++; } |
|
157 |
||
158 |
ssize_t splitDeaths() const { return _splitDeaths; } |
|
159 |
void set_splitDeaths(ssize_t v) { _splitDeaths = v; } |
|
160 |
void increment_splitDeaths() { _splitDeaths++; } |
|
161 |
||
162 |
NOT_PRODUCT( |
|
163 |
size_t returnedBytes() const { return _returnedBytes; } |
|
164 |
void set_returnedBytes(size_t v) { _returnedBytes = v; } |
|
165 |
) |
|
166 |
}; |
|
7397 | 167 |
|
168 |
#endif // SHARE_VM_GC_IMPLEMENTATION_SHARED_ALLOCATIONSTATS_HPP |