src/share/vm/gc_implementation/g1/survRateGroup.cpp

Tue, 17 Oct 2017 12:58:25 +0800

author
aoqi
date
Tue, 17 Oct 2017 12:58:25 +0800
changeset 7994
04ff2f6cd0eb
parent 6876
710a3c8b516e
permissions
-rw-r--r--

merge

aoqi@0 1 /*
aoqi@0 2 * Copyright (c) 2001, 2014, Oracle and/or its affiliates. All rights reserved.
aoqi@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0 4 *
aoqi@0 5 * This code is free software; you can redistribute it and/or modify it
aoqi@0 6 * under the terms of the GNU General Public License version 2 only, as
aoqi@0 7 * published by the Free Software Foundation.
aoqi@0 8 *
aoqi@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0 12 * version 2 for more details (a copy is included in the LICENSE file that
aoqi@0 13 * accompanied this code).
aoqi@0 14 *
aoqi@0 15 * You should have received a copy of the GNU General Public License version
aoqi@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0 18 *
aoqi@0 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0 20 * or visit www.oracle.com if you need additional information or have any
aoqi@0 21 * questions.
aoqi@0 22 *
aoqi@0 23 */
aoqi@0 24
aoqi@0 25 #include "precompiled.hpp"
aoqi@0 26 #include "gc_implementation/g1/g1CollectedHeap.inline.hpp"
aoqi@0 27 #include "gc_implementation/g1/g1CollectorPolicy.hpp"
aoqi@0 28 #include "gc_implementation/g1/heapRegion.hpp"
aoqi@0 29 #include "gc_implementation/g1/survRateGroup.hpp"
aoqi@0 30 #include "memory/allocation.hpp"
aoqi@0 31
aoqi@0 32 PRAGMA_FORMAT_MUTE_WARNINGS_FOR_GCC
aoqi@0 33
aoqi@0 34 SurvRateGroup::SurvRateGroup(G1CollectorPolicy* g1p,
aoqi@0 35 const char* name,
aoqi@0 36 size_t summary_surv_rates_len) :
aoqi@0 37 _g1p(g1p), _name(name),
aoqi@0 38 _summary_surv_rates_len(summary_surv_rates_len),
aoqi@0 39 _summary_surv_rates_max_len(0),
aoqi@0 40 _summary_surv_rates(NULL),
aoqi@0 41 _surv_rate(NULL),
aoqi@0 42 _accum_surv_rate_pred(NULL),
aoqi@0 43 _surv_rate_pred(NULL),
aoqi@0 44 _stats_arrays_length(0) {
aoqi@0 45 reset();
aoqi@0 46 if (summary_surv_rates_len > 0) {
aoqi@0 47 size_t length = summary_surv_rates_len;
aoqi@0 48 _summary_surv_rates = NEW_C_HEAP_ARRAY(NumberSeq*, length, mtGC);
aoqi@0 49 for (size_t i = 0; i < length; ++i) {
aoqi@0 50 _summary_surv_rates[i] = new NumberSeq();
aoqi@0 51 }
aoqi@0 52 }
aoqi@0 53
aoqi@0 54 start_adding_regions();
aoqi@0 55 }
aoqi@0 56
aoqi@0 57 void SurvRateGroup::reset() {
aoqi@0 58 _all_regions_allocated = 0;
aoqi@0 59 _setup_seq_num = 0;
aoqi@0 60 _accum_surv_rate = 0.0;
aoqi@0 61 _last_pred = 0.0;
aoqi@0 62 // the following will set up the arrays with length 1
aoqi@0 63 _region_num = 1;
aoqi@0 64
aoqi@0 65 // The call to stop_adding_regions() will use "new" to refill
aoqi@0 66 // the _surv_rate_pred array, so we need to make sure to call
aoqi@0 67 // "delete".
aoqi@0 68 for (size_t i = 0; i < _stats_arrays_length; ++i) {
aoqi@0 69 delete _surv_rate_pred[i];
aoqi@0 70 }
aoqi@0 71 _stats_arrays_length = 0;
aoqi@0 72
aoqi@0 73 stop_adding_regions();
aoqi@0 74 guarantee( _stats_arrays_length == 1, "invariant" );
aoqi@0 75 guarantee( _surv_rate_pred[0] != NULL, "invariant" );
aoqi@0 76 _surv_rate_pred[0]->add(0.4);
aoqi@0 77 all_surviving_words_recorded(false);
aoqi@0 78 _region_num = 0;
aoqi@0 79 }
aoqi@0 80
aoqi@0 81 void
aoqi@0 82 SurvRateGroup::start_adding_regions() {
aoqi@0 83 _setup_seq_num = _stats_arrays_length;
aoqi@0 84 _region_num = 0;
aoqi@0 85 _accum_surv_rate = 0.0;
aoqi@0 86 }
aoqi@0 87
aoqi@0 88 void
aoqi@0 89 SurvRateGroup::stop_adding_regions() {
aoqi@0 90 if (_region_num > _stats_arrays_length) {
aoqi@0 91 double* old_surv_rate = _surv_rate;
aoqi@0 92 double* old_accum_surv_rate_pred = _accum_surv_rate_pred;
aoqi@0 93 TruncatedSeq** old_surv_rate_pred = _surv_rate_pred;
aoqi@0 94
aoqi@0 95 _surv_rate = NEW_C_HEAP_ARRAY(double, _region_num, mtGC);
aoqi@0 96 _accum_surv_rate_pred = NEW_C_HEAP_ARRAY(double, _region_num, mtGC);
aoqi@0 97 _surv_rate_pred = NEW_C_HEAP_ARRAY(TruncatedSeq*, _region_num, mtGC);
aoqi@0 98
aoqi@0 99 for (size_t i = 0; i < _stats_arrays_length; ++i) {
aoqi@0 100 _surv_rate_pred[i] = old_surv_rate_pred[i];
aoqi@0 101 }
aoqi@0 102 for (size_t i = _stats_arrays_length; i < _region_num; ++i) {
aoqi@0 103 _surv_rate_pred[i] = new TruncatedSeq(10);
aoqi@0 104 }
aoqi@0 105
aoqi@0 106 _stats_arrays_length = _region_num;
aoqi@0 107
aoqi@0 108 if (old_surv_rate != NULL) {
aoqi@0 109 FREE_C_HEAP_ARRAY(double, old_surv_rate, mtGC);
aoqi@0 110 }
aoqi@0 111 if (old_accum_surv_rate_pred != NULL) {
aoqi@0 112 FREE_C_HEAP_ARRAY(double, old_accum_surv_rate_pred, mtGC);
aoqi@0 113 }
aoqi@0 114 if (old_surv_rate_pred != NULL) {
aoqi@0 115 FREE_C_HEAP_ARRAY(TruncatedSeq*, old_surv_rate_pred, mtGC);
aoqi@0 116 }
aoqi@0 117 }
aoqi@0 118
aoqi@0 119 for (size_t i = 0; i < _stats_arrays_length; ++i) {
aoqi@0 120 _surv_rate[i] = 0.0;
aoqi@0 121 }
aoqi@0 122 }
aoqi@0 123
aoqi@0 124 double
aoqi@0 125 SurvRateGroup::accum_surv_rate(size_t adjustment) {
aoqi@0 126 // we might relax this one in the future...
aoqi@0 127 guarantee( adjustment == 0 || adjustment == 1, "pre-condition" );
aoqi@0 128
aoqi@0 129 double ret = _accum_surv_rate;
aoqi@0 130 if (adjustment > 0) {
aoqi@0 131 TruncatedSeq* seq = get_seq(_region_num+1);
aoqi@0 132 double surv_rate = _g1p->get_new_prediction(seq);
aoqi@0 133 ret += surv_rate;
aoqi@0 134 }
aoqi@0 135
aoqi@0 136 return ret;
aoqi@0 137 }
aoqi@0 138
aoqi@0 139 int
aoqi@0 140 SurvRateGroup::next_age_index() {
aoqi@0 141 TruncatedSeq* seq = get_seq(_region_num);
aoqi@0 142 double surv_rate = _g1p->get_new_prediction(seq);
aoqi@0 143 _accum_surv_rate += surv_rate;
aoqi@0 144
aoqi@0 145 ++_region_num;
aoqi@0 146 return (int) ++_all_regions_allocated;
aoqi@0 147 }
aoqi@0 148
aoqi@0 149 void
aoqi@0 150 SurvRateGroup::record_surviving_words(int age_in_group, size_t surv_words) {
aoqi@0 151 guarantee( 0 <= age_in_group && (size_t) age_in_group < _region_num,
aoqi@0 152 "pre-condition" );
aoqi@0 153 guarantee( _surv_rate[age_in_group] <= 0.00001,
aoqi@0 154 "should only update each slot once" );
aoqi@0 155
aoqi@0 156 double surv_rate = (double) surv_words / (double) HeapRegion::GrainWords;
aoqi@0 157 _surv_rate[age_in_group] = surv_rate;
aoqi@0 158 _surv_rate_pred[age_in_group]->add(surv_rate);
aoqi@0 159 if ((size_t)age_in_group < _summary_surv_rates_len) {
aoqi@0 160 _summary_surv_rates[age_in_group]->add(surv_rate);
aoqi@0 161 if ((size_t)(age_in_group+1) > _summary_surv_rates_max_len)
aoqi@0 162 _summary_surv_rates_max_len = age_in_group+1;
aoqi@0 163 }
aoqi@0 164 }
aoqi@0 165
aoqi@0 166 void
aoqi@0 167 SurvRateGroup::all_surviving_words_recorded(bool propagate) {
aoqi@0 168 if (propagate && _region_num > 0) { // conservative
aoqi@0 169 double surv_rate = _surv_rate_pred[_region_num-1]->last();
aoqi@0 170 for (size_t i = _region_num; i < _stats_arrays_length; ++i) {
aoqi@0 171 guarantee( _surv_rate[i] <= 0.00001,
aoqi@0 172 "the slot should not have been updated" );
aoqi@0 173 _surv_rate_pred[i]->add(surv_rate);
aoqi@0 174 }
aoqi@0 175 }
aoqi@0 176
aoqi@0 177 double accum = 0.0;
aoqi@0 178 double pred = 0.0;
aoqi@0 179 for (size_t i = 0; i < _stats_arrays_length; ++i) {
aoqi@0 180 pred = _g1p->get_new_prediction(_surv_rate_pred[i]);
aoqi@0 181 if (pred > 1.0) pred = 1.0;
aoqi@0 182 accum += pred;
aoqi@0 183 _accum_surv_rate_pred[i] = accum;
aoqi@0 184 // gclog_or_tty->print_cr("age %3d, accum %10.2lf", i, accum);
aoqi@0 185 }
aoqi@0 186 _last_pred = pred;
aoqi@0 187 }
aoqi@0 188
aoqi@0 189 #ifndef PRODUCT
aoqi@0 190 void
aoqi@0 191 SurvRateGroup::print() {
aoqi@0 192 gclog_or_tty->print_cr("Surv Rate Group: %s (%d entries)",
aoqi@0 193 _name, _region_num);
aoqi@0 194 for (size_t i = 0; i < _region_num; ++i) {
aoqi@0 195 gclog_or_tty->print_cr(" age %4d surv rate %6.2lf %% pred %6.2lf %%",
aoqi@0 196 i, _surv_rate[i] * 100.0,
aoqi@0 197 _g1p->get_new_prediction(_surv_rate_pred[i]) * 100.0);
aoqi@0 198 }
aoqi@0 199 }
aoqi@0 200
aoqi@0 201 void
aoqi@0 202 SurvRateGroup::print_surv_rate_summary() {
aoqi@0 203 size_t length = _summary_surv_rates_max_len;
aoqi@0 204 if (length == 0)
aoqi@0 205 return;
aoqi@0 206
aoqi@0 207 gclog_or_tty->cr();
aoqi@0 208 gclog_or_tty->print_cr("%s Rate Summary (for up to age %d)", _name, length-1);
aoqi@0 209 gclog_or_tty->print_cr(" age range survival rate (avg) samples (avg)");
aoqi@0 210 gclog_or_tty->print_cr(" ---------------------------------------------------------");
aoqi@0 211
aoqi@0 212 size_t index = 0;
aoqi@0 213 size_t limit = MIN2((int) length, 10);
aoqi@0 214 while (index < limit) {
aoqi@0 215 gclog_or_tty->print_cr(" %4d %6.2lf%% %6.2lf",
aoqi@0 216 index, _summary_surv_rates[index]->avg() * 100.0,
aoqi@0 217 (double) _summary_surv_rates[index]->num());
aoqi@0 218 ++index;
aoqi@0 219 }
aoqi@0 220
aoqi@0 221 gclog_or_tty->print_cr(" ---------------------------------------------------------");
aoqi@0 222
aoqi@0 223 int num = 0;
aoqi@0 224 double sum = 0.0;
aoqi@0 225 int samples = 0;
aoqi@0 226 while (index < length) {
aoqi@0 227 ++num;
aoqi@0 228 sum += _summary_surv_rates[index]->avg() * 100.0;
aoqi@0 229 samples += _summary_surv_rates[index]->num();
aoqi@0 230 ++index;
aoqi@0 231
aoqi@0 232 if (index == length || num % 10 == 0) {
aoqi@0 233 gclog_or_tty->print_cr(" %4d .. %4d %6.2lf%% %6.2lf",
aoqi@0 234 (index-1) / 10 * 10, index-1, sum / (double) num,
aoqi@0 235 (double) samples / (double) num);
aoqi@0 236 sum = 0.0;
aoqi@0 237 num = 0;
aoqi@0 238 samples = 0;
aoqi@0 239 }
aoqi@0 240 }
aoqi@0 241
aoqi@0 242 gclog_or_tty->print_cr(" ---------------------------------------------------------");
aoqi@0 243 }
aoqi@0 244 #endif // PRODUCT

mercurial