Thu, 27 Feb 2020 05:40:59 +0000
8187078: -XX:+VerifyOops finds numerous problems when running JPRT
Reviewed-by: andrew
iveresov@2630 | 1 | /* |
xliu@9690 | 2 | * Copyright (c) 2010, 2019, Oracle and/or its affiliates. All rights reserved. |
iveresov@2890 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
iveresov@2890 | 4 | * |
iveresov@2890 | 5 | * This code is free software; you can redistribute it and/or modify it |
iveresov@2890 | 6 | * under the terms of the GNU General Public License version 2 only, as |
iveresov@2890 | 7 | * published by the Free Software Foundation. |
iveresov@2890 | 8 | * |
iveresov@2890 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
iveresov@2890 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
iveresov@2890 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
iveresov@2890 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
iveresov@2890 | 13 | * accompanied this code). |
iveresov@2890 | 14 | * |
iveresov@2890 | 15 | * You should have received a copy of the GNU General Public License version |
iveresov@2890 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
iveresov@2890 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
iveresov@2890 | 18 | * |
iveresov@2890 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
iveresov@2890 | 20 | * or visit www.oracle.com if you need additional information or have any |
iveresov@2890 | 21 | * questions. |
iveresov@2890 | 22 | * |
iveresov@2890 | 23 | */ |
iveresov@2630 | 24 | |
iveresov@2630 | 25 | #include "precompiled.hpp" |
iveresov@2630 | 26 | #include "runtime/advancedThresholdPolicy.hpp" |
iveresov@2630 | 27 | #include "runtime/simpleThresholdPolicy.inline.hpp" |
iveresov@2630 | 28 | |
iveresov@2630 | 29 | #ifdef TIERED |
iveresov@2630 | 30 | // Print an event. |
iveresov@2630 | 31 | void AdvancedThresholdPolicy::print_specific(EventType type, methodHandle mh, methodHandle imh, |
iveresov@2630 | 32 | int bci, CompLevel level) { |
twisti@4111 | 33 | tty->print(" rate="); |
iveresov@2630 | 34 | if (mh->prev_time() == 0) tty->print("n/a"); |
iveresov@2630 | 35 | else tty->print("%f", mh->rate()); |
iveresov@2630 | 36 | |
twisti@4111 | 37 | tty->print(" k=%.2lf,%.2lf", threshold_scale(CompLevel_full_profile, Tier3LoadFeedback), |
twisti@4111 | 38 | threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback)); |
iveresov@2630 | 39 | |
iveresov@2630 | 40 | } |
iveresov@2630 | 41 | |
iveresov@2630 | 42 | void AdvancedThresholdPolicy::initialize() { |
iveresov@2630 | 43 | // Turn on ergonomic compiler count selection |
iveresov@2630 | 44 | if (FLAG_IS_DEFAULT(CICompilerCountPerCPU) && FLAG_IS_DEFAULT(CICompilerCount)) { |
iveresov@2630 | 45 | FLAG_SET_DEFAULT(CICompilerCountPerCPU, true); |
iveresov@2630 | 46 | } |
iveresov@2630 | 47 | int count = CICompilerCount; |
iveresov@2630 | 48 | if (CICompilerCountPerCPU) { |
iveresov@2630 | 49 | // Simple log n seems to grow too slowly for tiered, try something faster: log n * log log n |
roland@9614 | 50 | int log_cpu = log2_int(os::active_processor_count()); |
roland@9614 | 51 | int loglog_cpu = log2_int(MAX2(log_cpu, 1)); |
iveresov@2630 | 52 | count = MAX2(log_cpu * loglog_cpu, 1) * 3 / 2; |
iveresov@2630 | 53 | } |
iveresov@2630 | 54 | |
iveresov@2630 | 55 | set_c1_count(MAX2(count / 3, 1)); |
anoll@6649 | 56 | set_c2_count(MAX2(count - c1_count(), 1)); |
anoll@6649 | 57 | FLAG_SET_ERGO(intx, CICompilerCount, c1_count() + c2_count()); |
iveresov@2630 | 58 | |
iveresov@2630 | 59 | // Some inlining tuning |
iveresov@2630 | 60 | #ifdef X86 |
iveresov@2630 | 61 | if (FLAG_IS_DEFAULT(InlineSmallCode)) { |
iveresov@2630 | 62 | FLAG_SET_DEFAULT(InlineSmallCode, 2000); |
iveresov@2630 | 63 | } |
iveresov@2630 | 64 | #endif |
iveresov@2630 | 65 | |
iveresov@2630 | 66 | #ifdef SPARC |
iveresov@2630 | 67 | if (FLAG_IS_DEFAULT(InlineSmallCode)) { |
iveresov@2630 | 68 | FLAG_SET_DEFAULT(InlineSmallCode, 2500); |
iveresov@2630 | 69 | } |
iveresov@2630 | 70 | #endif |
iveresov@2630 | 71 | |
anoll@5151 | 72 | set_increase_threshold_at_ratio(); |
iveresov@2630 | 73 | set_start_time(os::javaTimeMillis()); |
iveresov@2630 | 74 | } |
iveresov@2630 | 75 | |
iveresov@2630 | 76 | // update_rate() is called from select_task() while holding a compile queue lock. |
coleenp@4037 | 77 | void AdvancedThresholdPolicy::update_rate(jlong t, Method* m) { |
vlivanov@7179 | 78 | // Skip update if counters are absent. |
vlivanov@7179 | 79 | // Can't allocate them since we are holding compile queue lock. |
vlivanov@7179 | 80 | if (m->method_counters() == NULL) return; |
vlivanov@7179 | 81 | |
iveresov@2630 | 82 | if (is_old(m)) { |
iveresov@2630 | 83 | // We don't remove old methods from the queue, |
iveresov@2630 | 84 | // so we can just zero the rate. |
vlivanov@7179 | 85 | m->set_rate(0); |
iveresov@2630 | 86 | return; |
iveresov@2630 | 87 | } |
iveresov@2630 | 88 | |
iveresov@2630 | 89 | // We don't update the rate if we've just came out of a safepoint. |
iveresov@2630 | 90 | // delta_s is the time since last safepoint in milliseconds. |
iveresov@2630 | 91 | jlong delta_s = t - SafepointSynchronize::end_of_last_safepoint(); |
iveresov@2630 | 92 | jlong delta_t = t - (m->prev_time() != 0 ? m->prev_time() : start_time()); // milliseconds since the last measurement |
iveresov@2630 | 93 | // How many events were there since the last time? |
iveresov@2630 | 94 | int event_count = m->invocation_count() + m->backedge_count(); |
iveresov@2630 | 95 | int delta_e = event_count - m->prev_event_count(); |
iveresov@2630 | 96 | |
iveresov@2630 | 97 | // We should be running for at least 1ms. |
iveresov@2630 | 98 | if (delta_s >= TieredRateUpdateMinTime) { |
iveresov@2630 | 99 | // And we must've taken the previous point at least 1ms before. |
iveresov@2630 | 100 | if (delta_t >= TieredRateUpdateMinTime && delta_e > 0) { |
vlivanov@7179 | 101 | m->set_prev_time(t); |
vlivanov@7179 | 102 | m->set_prev_event_count(event_count); |
vlivanov@7179 | 103 | m->set_rate((float)delta_e / (float)delta_t); // Rate is events per millisecond |
vlivanov@7179 | 104 | } else { |
iveresov@2630 | 105 | if (delta_t > TieredRateUpdateMaxTime && delta_e == 0) { |
iveresov@2630 | 106 | // If nothing happened for 25ms, zero the rate. Don't modify prev values. |
vlivanov@7179 | 107 | m->set_rate(0); |
iveresov@2630 | 108 | } |
vlivanov@7179 | 109 | } |
iveresov@2630 | 110 | } |
iveresov@2630 | 111 | } |
iveresov@2630 | 112 | |
iveresov@2630 | 113 | // Check if this method has been stale from a given number of milliseconds. |
iveresov@2630 | 114 | // See select_task(). |
coleenp@4037 | 115 | bool AdvancedThresholdPolicy::is_stale(jlong t, jlong timeout, Method* m) { |
iveresov@2630 | 116 | jlong delta_s = t - SafepointSynchronize::end_of_last_safepoint(); |
iveresov@2630 | 117 | jlong delta_t = t - m->prev_time(); |
iveresov@2630 | 118 | if (delta_t > timeout && delta_s > timeout) { |
iveresov@2630 | 119 | int event_count = m->invocation_count() + m->backedge_count(); |
iveresov@2630 | 120 | int delta_e = event_count - m->prev_event_count(); |
iveresov@2630 | 121 | // Return true if there were no events. |
iveresov@2630 | 122 | return delta_e == 0; |
iveresov@2630 | 123 | } |
iveresov@2630 | 124 | return false; |
iveresov@2630 | 125 | } |
iveresov@2630 | 126 | |
iveresov@2630 | 127 | // We don't remove old methods from the compile queue even if they have |
iveresov@2630 | 128 | // very low activity. See select_task(). |
coleenp@4037 | 129 | bool AdvancedThresholdPolicy::is_old(Method* method) { |
iveresov@2630 | 130 | return method->invocation_count() > 50000 || method->backedge_count() > 500000; |
iveresov@2630 | 131 | } |
iveresov@2630 | 132 | |
coleenp@4037 | 133 | double AdvancedThresholdPolicy::weight(Method* method) { |
aph@9610 | 134 | return (double)(method->rate() + 1) * |
aph@9610 | 135 | (method->invocation_count() + 1) * (method->backedge_count() + 1); |
iveresov@2630 | 136 | } |
iveresov@2630 | 137 | |
iveresov@2630 | 138 | // Apply heuristics and return true if x should be compiled before y |
coleenp@4037 | 139 | bool AdvancedThresholdPolicy::compare_methods(Method* x, Method* y) { |
iveresov@2630 | 140 | if (x->highest_comp_level() > y->highest_comp_level()) { |
iveresov@2630 | 141 | // recompilation after deopt |
iveresov@2630 | 142 | return true; |
iveresov@2630 | 143 | } else |
iveresov@2630 | 144 | if (x->highest_comp_level() == y->highest_comp_level()) { |
iveresov@2630 | 145 | if (weight(x) > weight(y)) { |
iveresov@2630 | 146 | return true; |
iveresov@2630 | 147 | } |
iveresov@2630 | 148 | } |
iveresov@2630 | 149 | return false; |
iveresov@2630 | 150 | } |
iveresov@2630 | 151 | |
iveresov@2630 | 152 | // Is method profiled enough? |
coleenp@4037 | 153 | bool AdvancedThresholdPolicy::is_method_profiled(Method* method) { |
coleenp@4037 | 154 | MethodData* mdo = method->method_data(); |
iveresov@2630 | 155 | if (mdo != NULL) { |
iveresov@2630 | 156 | int i = mdo->invocation_count_delta(); |
iveresov@2630 | 157 | int b = mdo->backedge_count_delta(); |
iveresov@2630 | 158 | return call_predicate_helper<CompLevel_full_profile>(i, b, 1); |
iveresov@2630 | 159 | } |
iveresov@2630 | 160 | return false; |
iveresov@2630 | 161 | } |
iveresov@2630 | 162 | |
iveresov@2630 | 163 | // Called with the queue locked and with at least one element |
iveresov@2630 | 164 | CompileTask* AdvancedThresholdPolicy::select_task(CompileQueue* compile_queue) { |
iveresov@2630 | 165 | CompileTask *max_task = NULL; |
coleenp@4142 | 166 | Method* max_method = NULL; |
iveresov@2630 | 167 | jlong t = os::javaTimeMillis(); |
iveresov@2630 | 168 | // Iterate through the queue and find a method with a maximum rate. |
iveresov@2630 | 169 | for (CompileTask* task = compile_queue->first(); task != NULL;) { |
iveresov@2630 | 170 | CompileTask* next_task = task->next(); |
coleenp@4037 | 171 | Method* method = task->method(); |
coleenp@4037 | 172 | update_rate(t, method); |
iveresov@2630 | 173 | if (max_task == NULL) { |
iveresov@2630 | 174 | max_task = task; |
iveresov@2630 | 175 | max_method = method; |
iveresov@2630 | 176 | } else { |
iveresov@2630 | 177 | // If a method has been stale for some time, remove it from the queue. |
coleenp@4037 | 178 | if (is_stale(t, TieredCompileTaskTimeout, method) && !is_old(method)) { |
iveresov@2630 | 179 | if (PrintTieredEvents) { |
iveresov@2988 | 180 | print_event(REMOVE_FROM_QUEUE, method, method, task->osr_bci(), (CompLevel)task->comp_level()); |
iveresov@2630 | 181 | } |
vlivanov@7179 | 182 | compile_queue->remove_and_mark_stale(task); |
iveresov@2630 | 183 | method->clear_queued_for_compilation(); |
iveresov@2630 | 184 | task = next_task; |
iveresov@2630 | 185 | continue; |
iveresov@2630 | 186 | } |
iveresov@2630 | 187 | |
iveresov@2630 | 188 | // Select a method with a higher rate |
coleenp@4037 | 189 | if (compare_methods(method, max_method)) { |
iveresov@2630 | 190 | max_task = task; |
iveresov@2630 | 191 | max_method = method; |
iveresov@2630 | 192 | } |
iveresov@2630 | 193 | } |
iveresov@2630 | 194 | task = next_task; |
iveresov@2630 | 195 | } |
iveresov@2630 | 196 | |
iveresov@3035 | 197 | if (max_task->comp_level() == CompLevel_full_profile && TieredStopAtLevel > CompLevel_full_profile |
coleenp@4037 | 198 | && is_method_profiled(max_method)) { |
xliu@9690 | 199 | |
xliu@9690 | 200 | if (CompileBroker::compilation_is_complete(max_method, max_task->osr_bci(), CompLevel_limited_profile)) { |
xliu@9690 | 201 | if (PrintTieredEvents) { |
xliu@9690 | 202 | print_event(REMOVE_FROM_QUEUE, max_method, max_method, max_task->osr_bci(), (CompLevel)max_task->comp_level()); |
xliu@9690 | 203 | } |
xliu@9690 | 204 | compile_queue->remove_and_mark_stale(max_task); |
xliu@9690 | 205 | max_method->clear_queued_for_compilation(); |
xliu@9690 | 206 | return NULL; |
xliu@9690 | 207 | } |
xliu@9690 | 208 | |
iveresov@2630 | 209 | max_task->set_comp_level(CompLevel_limited_profile); |
iveresov@2630 | 210 | if (PrintTieredEvents) { |
iveresov@2988 | 211 | print_event(UPDATE_IN_QUEUE, max_method, max_method, max_task->osr_bci(), (CompLevel)max_task->comp_level()); |
iveresov@2630 | 212 | } |
iveresov@2630 | 213 | } |
iveresov@2630 | 214 | |
iveresov@2630 | 215 | return max_task; |
iveresov@2630 | 216 | } |
iveresov@2630 | 217 | |
iveresov@2630 | 218 | double AdvancedThresholdPolicy::threshold_scale(CompLevel level, int feedback_k) { |
iveresov@2630 | 219 | double queue_size = CompileBroker::queue_size(level); |
iveresov@2630 | 220 | int comp_count = compiler_count(level); |
iveresov@2630 | 221 | double k = queue_size / (feedback_k * comp_count) + 1; |
anoll@5151 | 222 | |
anoll@5151 | 223 | // Increase C1 compile threshold when the code cache is filled more |
anoll@5151 | 224 | // than specified by IncreaseFirstTierCompileThresholdAt percentage. |
anoll@5151 | 225 | // The main intention is to keep enough free space for C2 compiled code |
anoll@5151 | 226 | // to achieve peak performance if the code cache is under stress. |
anoll@5151 | 227 | if ((TieredStopAtLevel == CompLevel_full_optimization) && (level != CompLevel_full_optimization)) { |
anoll@5151 | 228 | double current_reverse_free_ratio = CodeCache::reverse_free_ratio(); |
anoll@5151 | 229 | if (current_reverse_free_ratio > _increase_threshold_at_ratio) { |
anoll@5151 | 230 | k *= exp(current_reverse_free_ratio - _increase_threshold_at_ratio); |
anoll@5151 | 231 | } |
anoll@5151 | 232 | } |
iveresov@2630 | 233 | return k; |
iveresov@2630 | 234 | } |
iveresov@2630 | 235 | |
iveresov@2630 | 236 | // Call and loop predicates determine whether a transition to a higher |
iveresov@2630 | 237 | // compilation level should be performed (pointers to predicate functions |
iveresov@2630 | 238 | // are passed to common()). |
iveresov@2630 | 239 | // Tier?LoadFeedback is basically a coefficient that determines of |
iveresov@2630 | 240 | // how many methods per compiler thread can be in the queue before |
iveresov@2630 | 241 | // the threshold values double. |
iveresov@2630 | 242 | bool AdvancedThresholdPolicy::loop_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2630 | 243 | switch(cur_level) { |
iveresov@2630 | 244 | case CompLevel_none: |
iveresov@2630 | 245 | case CompLevel_limited_profile: { |
iveresov@2630 | 246 | double k = threshold_scale(CompLevel_full_profile, Tier3LoadFeedback); |
iveresov@2630 | 247 | return loop_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 248 | } |
iveresov@2630 | 249 | case CompLevel_full_profile: { |
iveresov@2630 | 250 | double k = threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback); |
iveresov@2630 | 251 | return loop_predicate_helper<CompLevel_full_profile>(i, b, k); |
iveresov@2630 | 252 | } |
iveresov@2630 | 253 | default: |
iveresov@2630 | 254 | return true; |
iveresov@2630 | 255 | } |
iveresov@2630 | 256 | } |
iveresov@2630 | 257 | |
iveresov@2630 | 258 | bool AdvancedThresholdPolicy::call_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2630 | 259 | switch(cur_level) { |
iveresov@2630 | 260 | case CompLevel_none: |
iveresov@2630 | 261 | case CompLevel_limited_profile: { |
iveresov@2630 | 262 | double k = threshold_scale(CompLevel_full_profile, Tier3LoadFeedback); |
iveresov@2630 | 263 | return call_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 264 | } |
iveresov@2630 | 265 | case CompLevel_full_profile: { |
iveresov@2630 | 266 | double k = threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback); |
iveresov@2630 | 267 | return call_predicate_helper<CompLevel_full_profile>(i, b, k); |
iveresov@2630 | 268 | } |
iveresov@2630 | 269 | default: |
iveresov@2630 | 270 | return true; |
iveresov@2630 | 271 | } |
iveresov@2630 | 272 | } |
iveresov@2630 | 273 | |
iveresov@2630 | 274 | // If a method is old enough and is still in the interpreter we would want to |
iveresov@2630 | 275 | // start profiling without waiting for the compiled method to arrive. |
iveresov@2630 | 276 | // We also take the load on compilers into the account. |
coleenp@4037 | 277 | bool AdvancedThresholdPolicy::should_create_mdo(Method* method, CompLevel cur_level) { |
iveresov@2630 | 278 | if (cur_level == CompLevel_none && |
iveresov@2630 | 279 | CompileBroker::queue_size(CompLevel_full_optimization) <= |
iveresov@2630 | 280 | Tier3DelayOn * compiler_count(CompLevel_full_optimization)) { |
iveresov@2630 | 281 | int i = method->invocation_count(); |
iveresov@2630 | 282 | int b = method->backedge_count(); |
iveresov@2630 | 283 | double k = Tier0ProfilingStartPercentage / 100.0; |
iveresov@2630 | 284 | return call_predicate_helper<CompLevel_none>(i, b, k) || loop_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 285 | } |
iveresov@2630 | 286 | return false; |
iveresov@2630 | 287 | } |
iveresov@2630 | 288 | |
iveresov@2988 | 289 | // Inlining control: if we're compiling a profiled method with C1 and the callee |
iveresov@2988 | 290 | // is known to have OSRed in a C2 version, don't inline it. |
iveresov@2988 | 291 | bool AdvancedThresholdPolicy::should_not_inline(ciEnv* env, ciMethod* callee) { |
iveresov@2988 | 292 | CompLevel comp_level = (CompLevel)env->comp_level(); |
iveresov@2988 | 293 | if (comp_level == CompLevel_full_profile || |
iveresov@2988 | 294 | comp_level == CompLevel_limited_profile) { |
iveresov@2988 | 295 | return callee->highest_osr_comp_level() == CompLevel_full_optimization; |
iveresov@2988 | 296 | } |
iveresov@2988 | 297 | return false; |
iveresov@2988 | 298 | } |
iveresov@2988 | 299 | |
iveresov@2630 | 300 | // Create MDO if necessary. |
iveresov@3452 | 301 | void AdvancedThresholdPolicy::create_mdo(methodHandle mh, JavaThread* THREAD) { |
iveresov@2630 | 302 | if (mh->is_native() || mh->is_abstract() || mh->is_accessor()) return; |
iveresov@2630 | 303 | if (mh->method_data() == NULL) { |
coleenp@4037 | 304 | Method::build_interpreter_method_data(mh, CHECK_AND_CLEAR); |
iveresov@2630 | 305 | } |
iveresov@2630 | 306 | } |
iveresov@2630 | 307 | |
iveresov@2630 | 308 | |
iveresov@2630 | 309 | /* |
iveresov@2630 | 310 | * Method states: |
iveresov@2630 | 311 | * 0 - interpreter (CompLevel_none) |
iveresov@2630 | 312 | * 1 - pure C1 (CompLevel_simple) |
iveresov@2630 | 313 | * 2 - C1 with invocation and backedge counting (CompLevel_limited_profile) |
iveresov@2630 | 314 | * 3 - C1 with full profiling (CompLevel_full_profile) |
iveresov@2630 | 315 | * 4 - C2 (CompLevel_full_optimization) |
iveresov@2630 | 316 | * |
iveresov@2630 | 317 | * Common state transition patterns: |
iveresov@2630 | 318 | * a. 0 -> 3 -> 4. |
iveresov@2630 | 319 | * The most common path. But note that even in this straightforward case |
iveresov@2630 | 320 | * profiling can start at level 0 and finish at level 3. |
iveresov@2630 | 321 | * |
iveresov@2630 | 322 | * b. 0 -> 2 -> 3 -> 4. |
iveresov@2630 | 323 | * This case occures when the load on C2 is deemed too high. So, instead of transitioning |
iveresov@2630 | 324 | * into state 3 directly and over-profiling while a method is in the C2 queue we transition to |
iveresov@2630 | 325 | * level 2 and wait until the load on C2 decreases. This path is disabled for OSRs. |
iveresov@2630 | 326 | * |
iveresov@2630 | 327 | * c. 0 -> (3->2) -> 4. |
iveresov@2630 | 328 | * In this case we enqueue a method for compilation at level 3, but the C1 queue is long enough |
iveresov@2630 | 329 | * to enable the profiling to fully occur at level 0. In this case we change the compilation level |
thartmann@7365 | 330 | * of the method to 2 while the request is still in-queue, because it'll allow it to run much faster |
thartmann@7365 | 331 | * without full profiling while c2 is compiling. |
iveresov@2630 | 332 | * |
iveresov@2630 | 333 | * d. 0 -> 3 -> 1 or 0 -> 2 -> 1. |
iveresov@2630 | 334 | * After a method was once compiled with C1 it can be identified as trivial and be compiled to |
iveresov@2630 | 335 | * level 1. These transition can also occur if a method can't be compiled with C2 but can with C1. |
iveresov@2630 | 336 | * |
iveresov@2630 | 337 | * e. 0 -> 4. |
iveresov@2630 | 338 | * This can happen if a method fails C1 compilation (it will still be profiled in the interpreter) |
iveresov@2630 | 339 | * or because of a deopt that didn't require reprofiling (compilation won't happen in this case because |
iveresov@2630 | 340 | * the compiled version already exists). |
iveresov@2630 | 341 | * |
iveresov@2630 | 342 | * Note that since state 0 can be reached from any other state via deoptimization different loops |
iveresov@2630 | 343 | * are possible. |
iveresov@2630 | 344 | * |
iveresov@2630 | 345 | */ |
iveresov@2630 | 346 | |
iveresov@2630 | 347 | // Common transition function. Given a predicate determines if a method should transition to another level. |
coleenp@4037 | 348 | CompLevel AdvancedThresholdPolicy::common(Predicate p, Method* method, CompLevel cur_level, bool disable_feedback) { |
iveresov@2630 | 349 | CompLevel next_level = cur_level; |
iveresov@2630 | 350 | int i = method->invocation_count(); |
iveresov@2630 | 351 | int b = method->backedge_count(); |
iveresov@2630 | 352 | |
iveresov@3035 | 353 | if (is_trivial(method)) { |
iveresov@3035 | 354 | next_level = CompLevel_simple; |
iveresov@3035 | 355 | } else { |
iveresov@3035 | 356 | switch(cur_level) { |
iveresov@3035 | 357 | case CompLevel_none: |
iveresov@3035 | 358 | // If we were at full profile level, would we switch to full opt? |
iveresov@3035 | 359 | if (common(p, method, CompLevel_full_profile, disable_feedback) == CompLevel_full_optimization) { |
iveresov@3035 | 360 | next_level = CompLevel_full_optimization; |
iveresov@3035 | 361 | } else if ((this->*p)(i, b, cur_level)) { |
iveresov@3035 | 362 | // C1-generated fully profiled code is about 30% slower than the limited profile |
iveresov@3035 | 363 | // code that has only invocation and backedge counters. The observation is that |
iveresov@3035 | 364 | // if C2 queue is large enough we can spend too much time in the fully profiled code |
iveresov@3035 | 365 | // while waiting for C2 to pick the method from the queue. To alleviate this problem |
iveresov@3035 | 366 | // we introduce a feedback on the C2 queue size. If the C2 queue is sufficiently long |
iveresov@3035 | 367 | // we choose to compile a limited profiled version and then recompile with full profiling |
iveresov@3035 | 368 | // when the load on C2 goes down. |
iveresov@3035 | 369 | if (!disable_feedback && CompileBroker::queue_size(CompLevel_full_optimization) > |
iveresov@3035 | 370 | Tier3DelayOn * compiler_count(CompLevel_full_optimization)) { |
iveresov@3035 | 371 | next_level = CompLevel_limited_profile; |
iveresov@2630 | 372 | } else { |
iveresov@3035 | 373 | next_level = CompLevel_full_profile; |
iveresov@2630 | 374 | } |
iveresov@2630 | 375 | } |
iveresov@3035 | 376 | break; |
iveresov@3035 | 377 | case CompLevel_limited_profile: |
iveresov@3035 | 378 | if (is_method_profiled(method)) { |
iveresov@3035 | 379 | // Special case: we got here because this method was fully profiled in the interpreter. |
iveresov@3035 | 380 | next_level = CompLevel_full_optimization; |
iveresov@3035 | 381 | } else { |
coleenp@4037 | 382 | MethodData* mdo = method->method_data(); |
iveresov@3035 | 383 | if (mdo != NULL) { |
iveresov@3035 | 384 | if (mdo->would_profile()) { |
iveresov@3035 | 385 | if (disable_feedback || (CompileBroker::queue_size(CompLevel_full_optimization) <= |
iveresov@3035 | 386 | Tier3DelayOff * compiler_count(CompLevel_full_optimization) && |
iveresov@3035 | 387 | (this->*p)(i, b, cur_level))) { |
iveresov@3035 | 388 | next_level = CompLevel_full_profile; |
iveresov@3035 | 389 | } |
iveresov@3035 | 390 | } else { |
iveresov@2630 | 391 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 392 | } |
iveresov@2630 | 393 | } |
iveresov@2630 | 394 | } |
iveresov@3035 | 395 | break; |
iveresov@3035 | 396 | case CompLevel_full_profile: |
iveresov@3035 | 397 | { |
coleenp@4037 | 398 | MethodData* mdo = method->method_data(); |
iveresov@3035 | 399 | if (mdo != NULL) { |
iveresov@3035 | 400 | if (mdo->would_profile()) { |
iveresov@3035 | 401 | int mdo_i = mdo->invocation_count_delta(); |
iveresov@3035 | 402 | int mdo_b = mdo->backedge_count_delta(); |
iveresov@3035 | 403 | if ((this->*p)(mdo_i, mdo_b, cur_level)) { |
iveresov@3035 | 404 | next_level = CompLevel_full_optimization; |
iveresov@3035 | 405 | } |
iveresov@3035 | 406 | } else { |
iveresov@3035 | 407 | next_level = CompLevel_full_optimization; |
iveresov@3035 | 408 | } |
iveresov@3035 | 409 | } |
iveresov@3035 | 410 | } |
iveresov@3035 | 411 | break; |
iveresov@2630 | 412 | } |
iveresov@2630 | 413 | } |
iveresov@3035 | 414 | return MIN2(next_level, (CompLevel)TieredStopAtLevel); |
iveresov@2630 | 415 | } |
iveresov@2630 | 416 | |
iveresov@2630 | 417 | // Determine if a method should be compiled with a normal entry point at a different level. |
coleenp@4037 | 418 | CompLevel AdvancedThresholdPolicy::call_event(Method* method, CompLevel cur_level) { |
iveresov@2987 | 419 | CompLevel osr_level = MIN2((CompLevel) method->highest_osr_comp_level(), |
iveresov@3035 | 420 | common(&AdvancedThresholdPolicy::loop_predicate, method, cur_level, true)); |
iveresov@2630 | 421 | CompLevel next_level = common(&AdvancedThresholdPolicy::call_predicate, method, cur_level); |
iveresov@2630 | 422 | |
iveresov@2630 | 423 | // If OSR method level is greater than the regular method level, the levels should be |
iveresov@2630 | 424 | // equalized by raising the regular method level in order to avoid OSRs during each |
iveresov@2630 | 425 | // invocation of the method. |
iveresov@2630 | 426 | if (osr_level == CompLevel_full_optimization && cur_level == CompLevel_full_profile) { |
coleenp@4037 | 427 | MethodData* mdo = method->method_data(); |
iveresov@2630 | 428 | guarantee(mdo != NULL, "MDO should not be NULL"); |
iveresov@2630 | 429 | if (mdo->invocation_count() >= 1) { |
iveresov@2630 | 430 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 431 | } |
iveresov@2630 | 432 | } else { |
iveresov@2630 | 433 | next_level = MAX2(osr_level, next_level); |
iveresov@2630 | 434 | } |
iveresov@2630 | 435 | return next_level; |
iveresov@2630 | 436 | } |
iveresov@2630 | 437 | |
iveresov@2630 | 438 | // Determine if we should do an OSR compilation of a given method. |
coleenp@4037 | 439 | CompLevel AdvancedThresholdPolicy::loop_event(Method* method, CompLevel cur_level) { |
iveresov@3035 | 440 | CompLevel next_level = common(&AdvancedThresholdPolicy::loop_predicate, method, cur_level, true); |
iveresov@2630 | 441 | if (cur_level == CompLevel_none) { |
iveresov@2630 | 442 | // If there is a live OSR method that means that we deopted to the interpreter |
iveresov@2630 | 443 | // for the transition. |
iveresov@2987 | 444 | CompLevel osr_level = MIN2((CompLevel)method->highest_osr_comp_level(), next_level); |
iveresov@2630 | 445 | if (osr_level > CompLevel_none) { |
iveresov@2630 | 446 | return osr_level; |
iveresov@2630 | 447 | } |
iveresov@2630 | 448 | } |
iveresov@2987 | 449 | return next_level; |
iveresov@2630 | 450 | } |
iveresov@2630 | 451 | |
iveresov@2630 | 452 | // Update the rate and submit compile |
iveresov@3452 | 453 | void AdvancedThresholdPolicy::submit_compile(methodHandle mh, int bci, CompLevel level, JavaThread* thread) { |
iveresov@2630 | 454 | int hot_count = (bci == InvocationEntryBci) ? mh->invocation_count() : mh->backedge_count(); |
iveresov@2630 | 455 | update_rate(os::javaTimeMillis(), mh()); |
iveresov@3452 | 456 | CompileBroker::compile_method(mh, bci, level, mh, hot_count, "tiered", thread); |
iveresov@2630 | 457 | } |
iveresov@2630 | 458 | |
iveresov@2630 | 459 | // Handle the invocation event. |
iveresov@2630 | 460 | void AdvancedThresholdPolicy::method_invocation_event(methodHandle mh, methodHandle imh, |
iveresov@3452 | 461 | CompLevel level, nmethod* nm, JavaThread* thread) { |
iveresov@2630 | 462 | if (should_create_mdo(mh(), level)) { |
iveresov@3452 | 463 | create_mdo(mh, thread); |
iveresov@2630 | 464 | } |
anoll@7302 | 465 | if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh)) { |
iveresov@2630 | 466 | CompLevel next_level = call_event(mh(), level); |
iveresov@2630 | 467 | if (next_level != level) { |
iveresov@3452 | 468 | compile(mh, InvocationEntryBci, next_level, thread); |
iveresov@2630 | 469 | } |
iveresov@2630 | 470 | } |
iveresov@2630 | 471 | } |
iveresov@2630 | 472 | |
iveresov@2630 | 473 | // Handle the back branch event. Notice that we can compile the method |
iveresov@2630 | 474 | // with a regular entry from here. |
iveresov@2630 | 475 | void AdvancedThresholdPolicy::method_back_branch_event(methodHandle mh, methodHandle imh, |
iveresov@3452 | 476 | int bci, CompLevel level, nmethod* nm, JavaThread* thread) { |
iveresov@2630 | 477 | if (should_create_mdo(mh(), level)) { |
iveresov@3452 | 478 | create_mdo(mh, thread); |
iveresov@2630 | 479 | } |
iveresov@2988 | 480 | // Check if MDO should be created for the inlined method |
iveresov@2988 | 481 | if (should_create_mdo(imh(), level)) { |
iveresov@3452 | 482 | create_mdo(imh, thread); |
iveresov@2988 | 483 | } |
iveresov@2630 | 484 | |
iveresov@2988 | 485 | if (is_compilation_enabled()) { |
iveresov@2988 | 486 | CompLevel next_osr_level = loop_event(imh(), level); |
iveresov@2988 | 487 | CompLevel max_osr_level = (CompLevel)imh->highest_osr_comp_level(); |
iveresov@2988 | 488 | // At the very least compile the OSR version |
anoll@7302 | 489 | if (!CompileBroker::compilation_is_in_queue(imh) && (next_osr_level != level)) { |
iveresov@3452 | 490 | compile(imh, bci, next_osr_level, thread); |
iveresov@2630 | 491 | } |
iveresov@2630 | 492 | |
iveresov@2988 | 493 | // Use loop event as an opportunity to also check if there's been |
iveresov@2988 | 494 | // enough calls. |
iveresov@2988 | 495 | CompLevel cur_level, next_level; |
iveresov@2988 | 496 | if (mh() != imh()) { // If there is an enclosing method |
iveresov@2988 | 497 | guarantee(nm != NULL, "Should have nmethod here"); |
iveresov@2988 | 498 | cur_level = comp_level(mh()); |
iveresov@2988 | 499 | next_level = call_event(mh(), cur_level); |
iveresov@2988 | 500 | |
iveresov@2988 | 501 | if (max_osr_level == CompLevel_full_optimization) { |
iveresov@2988 | 502 | // The inlinee OSRed to full opt, we need to modify the enclosing method to avoid deopts |
iveresov@2988 | 503 | bool make_not_entrant = false; |
iveresov@2988 | 504 | if (nm->is_osr_method()) { |
iveresov@2988 | 505 | // This is an osr method, just make it not entrant and recompile later if needed |
iveresov@2988 | 506 | make_not_entrant = true; |
iveresov@2988 | 507 | } else { |
iveresov@2988 | 508 | if (next_level != CompLevel_full_optimization) { |
iveresov@2988 | 509 | // next_level is not full opt, so we need to recompile the |
iveresov@2988 | 510 | // enclosing method without the inlinee |
iveresov@2988 | 511 | cur_level = CompLevel_none; |
iveresov@2988 | 512 | make_not_entrant = true; |
iveresov@2988 | 513 | } |
iveresov@2988 | 514 | } |
iveresov@2988 | 515 | if (make_not_entrant) { |
iveresov@2988 | 516 | if (PrintTieredEvents) { |
iveresov@2988 | 517 | int osr_bci = nm->is_osr_method() ? nm->osr_entry_bci() : InvocationEntryBci; |
iveresov@2988 | 518 | print_event(MAKE_NOT_ENTRANT, mh(), mh(), osr_bci, level); |
iveresov@2988 | 519 | } |
iveresov@2988 | 520 | nm->make_not_entrant(); |
iveresov@2988 | 521 | } |
iveresov@2988 | 522 | } |
anoll@7302 | 523 | if (!CompileBroker::compilation_is_in_queue(mh)) { |
iveresov@2988 | 524 | // Fix up next_level if necessary to avoid deopts |
iveresov@2988 | 525 | if (next_level == CompLevel_limited_profile && max_osr_level == CompLevel_full_profile) { |
iveresov@2988 | 526 | next_level = CompLevel_full_profile; |
iveresov@2988 | 527 | } |
iveresov@2988 | 528 | if (cur_level != next_level) { |
iveresov@3452 | 529 | compile(mh, InvocationEntryBci, next_level, thread); |
iveresov@2988 | 530 | } |
iveresov@2988 | 531 | } |
iveresov@2988 | 532 | } else { |
iveresov@2988 | 533 | cur_level = comp_level(imh()); |
iveresov@2988 | 534 | next_level = call_event(imh(), cur_level); |
anoll@7302 | 535 | if (!CompileBroker::compilation_is_in_queue(imh) && (next_level != cur_level)) { |
iveresov@3452 | 536 | compile(imh, InvocationEntryBci, next_level, thread); |
iveresov@2988 | 537 | } |
iveresov@2630 | 538 | } |
iveresov@2630 | 539 | } |
iveresov@2630 | 540 | } |
iveresov@2630 | 541 | |
iveresov@2630 | 542 | #endif // TIERED |