Tue, 26 Apr 2011 14:04:43 -0400
7009923: JSR 292: VM crash in JavaThread::last_frame
Summary: Handle stack overflow before the first frame is called, by printing out the called method and not walking the stack.
Reviewed-by: dholmes, phh, dsamersoff
iveresov@2630 | 1 | /* |
iveresov@2630 | 2 | * Copyright (c) 2010, 2011 Oracle and/or its affiliates. All rights reserved. |
iveresov@2630 | 3 | * ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms. |
iveresov@2630 | 4 | */ |
iveresov@2630 | 5 | |
iveresov@2630 | 6 | #include "precompiled.hpp" |
iveresov@2630 | 7 | #include "runtime/advancedThresholdPolicy.hpp" |
iveresov@2630 | 8 | #include "runtime/simpleThresholdPolicy.inline.hpp" |
iveresov@2630 | 9 | |
iveresov@2630 | 10 | #ifdef TIERED |
iveresov@2630 | 11 | // Print an event. |
iveresov@2630 | 12 | void AdvancedThresholdPolicy::print_specific(EventType type, methodHandle mh, methodHandle imh, |
iveresov@2630 | 13 | int bci, CompLevel level) { |
iveresov@2630 | 14 | tty->print(" rate: "); |
iveresov@2630 | 15 | if (mh->prev_time() == 0) tty->print("n/a"); |
iveresov@2630 | 16 | else tty->print("%f", mh->rate()); |
iveresov@2630 | 17 | |
iveresov@2630 | 18 | tty->print(" k: %.2lf,%.2lf", threshold_scale(CompLevel_full_profile, Tier3LoadFeedback), |
iveresov@2630 | 19 | threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback)); |
iveresov@2630 | 20 | |
iveresov@2630 | 21 | } |
iveresov@2630 | 22 | |
iveresov@2630 | 23 | void AdvancedThresholdPolicy::initialize() { |
iveresov@2630 | 24 | // Turn on ergonomic compiler count selection |
iveresov@2630 | 25 | if (FLAG_IS_DEFAULT(CICompilerCountPerCPU) && FLAG_IS_DEFAULT(CICompilerCount)) { |
iveresov@2630 | 26 | FLAG_SET_DEFAULT(CICompilerCountPerCPU, true); |
iveresov@2630 | 27 | } |
iveresov@2630 | 28 | int count = CICompilerCount; |
iveresov@2630 | 29 | if (CICompilerCountPerCPU) { |
iveresov@2630 | 30 | // Simple log n seems to grow too slowly for tiered, try something faster: log n * log log n |
iveresov@2630 | 31 | int log_cpu = log2_intptr(os::active_processor_count()); |
iveresov@2630 | 32 | int loglog_cpu = log2_intptr(MAX2(log_cpu, 1)); |
iveresov@2630 | 33 | count = MAX2(log_cpu * loglog_cpu, 1) * 3 / 2; |
iveresov@2630 | 34 | } |
iveresov@2630 | 35 | |
iveresov@2630 | 36 | set_c1_count(MAX2(count / 3, 1)); |
iveresov@2630 | 37 | set_c2_count(MAX2(count - count / 3, 1)); |
iveresov@2630 | 38 | |
iveresov@2630 | 39 | // Some inlining tuning |
iveresov@2630 | 40 | #ifdef X86 |
iveresov@2630 | 41 | if (FLAG_IS_DEFAULT(InlineSmallCode)) { |
iveresov@2630 | 42 | FLAG_SET_DEFAULT(InlineSmallCode, 2000); |
iveresov@2630 | 43 | } |
iveresov@2630 | 44 | #endif |
iveresov@2630 | 45 | |
iveresov@2630 | 46 | #ifdef SPARC |
iveresov@2630 | 47 | if (FLAG_IS_DEFAULT(InlineSmallCode)) { |
iveresov@2630 | 48 | FLAG_SET_DEFAULT(InlineSmallCode, 2500); |
iveresov@2630 | 49 | } |
iveresov@2630 | 50 | #endif |
iveresov@2630 | 51 | |
iveresov@2630 | 52 | |
iveresov@2630 | 53 | set_start_time(os::javaTimeMillis()); |
iveresov@2630 | 54 | } |
iveresov@2630 | 55 | |
iveresov@2630 | 56 | // update_rate() is called from select_task() while holding a compile queue lock. |
iveresov@2630 | 57 | void AdvancedThresholdPolicy::update_rate(jlong t, methodOop m) { |
iveresov@2630 | 58 | if (is_old(m)) { |
iveresov@2630 | 59 | // We don't remove old methods from the queue, |
iveresov@2630 | 60 | // so we can just zero the rate. |
iveresov@2630 | 61 | m->set_rate(0); |
iveresov@2630 | 62 | return; |
iveresov@2630 | 63 | } |
iveresov@2630 | 64 | |
iveresov@2630 | 65 | // We don't update the rate if we've just came out of a safepoint. |
iveresov@2630 | 66 | // delta_s is the time since last safepoint in milliseconds. |
iveresov@2630 | 67 | jlong delta_s = t - SafepointSynchronize::end_of_last_safepoint(); |
iveresov@2630 | 68 | jlong delta_t = t - (m->prev_time() != 0 ? m->prev_time() : start_time()); // milliseconds since the last measurement |
iveresov@2630 | 69 | // How many events were there since the last time? |
iveresov@2630 | 70 | int event_count = m->invocation_count() + m->backedge_count(); |
iveresov@2630 | 71 | int delta_e = event_count - m->prev_event_count(); |
iveresov@2630 | 72 | |
iveresov@2630 | 73 | // We should be running for at least 1ms. |
iveresov@2630 | 74 | if (delta_s >= TieredRateUpdateMinTime) { |
iveresov@2630 | 75 | // And we must've taken the previous point at least 1ms before. |
iveresov@2630 | 76 | if (delta_t >= TieredRateUpdateMinTime && delta_e > 0) { |
iveresov@2630 | 77 | m->set_prev_time(t); |
iveresov@2630 | 78 | m->set_prev_event_count(event_count); |
iveresov@2630 | 79 | m->set_rate((float)delta_e / (float)delta_t); // Rate is events per millisecond |
iveresov@2630 | 80 | } else |
iveresov@2630 | 81 | if (delta_t > TieredRateUpdateMaxTime && delta_e == 0) { |
iveresov@2630 | 82 | // If nothing happened for 25ms, zero the rate. Don't modify prev values. |
iveresov@2630 | 83 | m->set_rate(0); |
iveresov@2630 | 84 | } |
iveresov@2630 | 85 | } |
iveresov@2630 | 86 | } |
iveresov@2630 | 87 | |
iveresov@2630 | 88 | // Check if this method has been stale from a given number of milliseconds. |
iveresov@2630 | 89 | // See select_task(). |
iveresov@2630 | 90 | bool AdvancedThresholdPolicy::is_stale(jlong t, jlong timeout, methodOop m) { |
iveresov@2630 | 91 | jlong delta_s = t - SafepointSynchronize::end_of_last_safepoint(); |
iveresov@2630 | 92 | jlong delta_t = t - m->prev_time(); |
iveresov@2630 | 93 | if (delta_t > timeout && delta_s > timeout) { |
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 | // Return true if there were no events. |
iveresov@2630 | 97 | return delta_e == 0; |
iveresov@2630 | 98 | } |
iveresov@2630 | 99 | return false; |
iveresov@2630 | 100 | } |
iveresov@2630 | 101 | |
iveresov@2630 | 102 | // We don't remove old methods from the compile queue even if they have |
iveresov@2630 | 103 | // very low activity. See select_task(). |
iveresov@2630 | 104 | bool AdvancedThresholdPolicy::is_old(methodOop method) { |
iveresov@2630 | 105 | return method->invocation_count() > 50000 || method->backedge_count() > 500000; |
iveresov@2630 | 106 | } |
iveresov@2630 | 107 | |
iveresov@2630 | 108 | double AdvancedThresholdPolicy::weight(methodOop method) { |
iveresov@2630 | 109 | return (method->rate() + 1) * ((method->invocation_count() + 1) * (method->backedge_count() + 1)); |
iveresov@2630 | 110 | } |
iveresov@2630 | 111 | |
iveresov@2630 | 112 | // Apply heuristics and return true if x should be compiled before y |
iveresov@2630 | 113 | bool AdvancedThresholdPolicy::compare_methods(methodOop x, methodOop y) { |
iveresov@2630 | 114 | if (x->highest_comp_level() > y->highest_comp_level()) { |
iveresov@2630 | 115 | // recompilation after deopt |
iveresov@2630 | 116 | return true; |
iveresov@2630 | 117 | } else |
iveresov@2630 | 118 | if (x->highest_comp_level() == y->highest_comp_level()) { |
iveresov@2630 | 119 | if (weight(x) > weight(y)) { |
iveresov@2630 | 120 | return true; |
iveresov@2630 | 121 | } |
iveresov@2630 | 122 | } |
iveresov@2630 | 123 | return false; |
iveresov@2630 | 124 | } |
iveresov@2630 | 125 | |
iveresov@2630 | 126 | // Is method profiled enough? |
iveresov@2630 | 127 | bool AdvancedThresholdPolicy::is_method_profiled(methodOop method) { |
iveresov@2630 | 128 | methodDataOop mdo = method->method_data(); |
iveresov@2630 | 129 | if (mdo != NULL) { |
iveresov@2630 | 130 | int i = mdo->invocation_count_delta(); |
iveresov@2630 | 131 | int b = mdo->backedge_count_delta(); |
iveresov@2630 | 132 | return call_predicate_helper<CompLevel_full_profile>(i, b, 1); |
iveresov@2630 | 133 | } |
iveresov@2630 | 134 | return false; |
iveresov@2630 | 135 | } |
iveresov@2630 | 136 | |
iveresov@2630 | 137 | // Called with the queue locked and with at least one element |
iveresov@2630 | 138 | CompileTask* AdvancedThresholdPolicy::select_task(CompileQueue* compile_queue) { |
iveresov@2630 | 139 | CompileTask *max_task = NULL; |
iveresov@2630 | 140 | methodOop max_method; |
iveresov@2630 | 141 | jlong t = os::javaTimeMillis(); |
iveresov@2630 | 142 | // Iterate through the queue and find a method with a maximum rate. |
iveresov@2630 | 143 | for (CompileTask* task = compile_queue->first(); task != NULL;) { |
iveresov@2630 | 144 | CompileTask* next_task = task->next(); |
iveresov@2630 | 145 | methodOop method = (methodOop)JNIHandles::resolve(task->method_handle()); |
iveresov@2630 | 146 | methodDataOop mdo = method->method_data(); |
iveresov@2630 | 147 | update_rate(t, method); |
iveresov@2630 | 148 | if (max_task == NULL) { |
iveresov@2630 | 149 | max_task = task; |
iveresov@2630 | 150 | max_method = method; |
iveresov@2630 | 151 | } else { |
iveresov@2630 | 152 | // If a method has been stale for some time, remove it from the queue. |
iveresov@2630 | 153 | if (is_stale(t, TieredCompileTaskTimeout, method) && !is_old(method)) { |
iveresov@2630 | 154 | if (PrintTieredEvents) { |
iveresov@2630 | 155 | print_event(KILL, method, method, task->osr_bci(), (CompLevel)task->comp_level()); |
iveresov@2630 | 156 | } |
iveresov@2630 | 157 | CompileTaskWrapper ctw(task); // Frees the task |
iveresov@2630 | 158 | compile_queue->remove(task); |
iveresov@2630 | 159 | method->clear_queued_for_compilation(); |
iveresov@2630 | 160 | task = next_task; |
iveresov@2630 | 161 | continue; |
iveresov@2630 | 162 | } |
iveresov@2630 | 163 | |
iveresov@2630 | 164 | // Select a method with a higher rate |
iveresov@2630 | 165 | if (compare_methods(method, max_method)) { |
iveresov@2630 | 166 | max_task = task; |
iveresov@2630 | 167 | max_method = method; |
iveresov@2630 | 168 | } |
iveresov@2630 | 169 | } |
iveresov@2630 | 170 | task = next_task; |
iveresov@2630 | 171 | } |
iveresov@2630 | 172 | |
iveresov@2630 | 173 | if (max_task->comp_level() == CompLevel_full_profile && is_method_profiled(max_method)) { |
iveresov@2630 | 174 | max_task->set_comp_level(CompLevel_limited_profile); |
iveresov@2630 | 175 | if (PrintTieredEvents) { |
iveresov@2630 | 176 | print_event(UPDATE, max_method, max_method, max_task->osr_bci(), (CompLevel)max_task->comp_level()); |
iveresov@2630 | 177 | } |
iveresov@2630 | 178 | } |
iveresov@2630 | 179 | |
iveresov@2630 | 180 | return max_task; |
iveresov@2630 | 181 | } |
iveresov@2630 | 182 | |
iveresov@2630 | 183 | double AdvancedThresholdPolicy::threshold_scale(CompLevel level, int feedback_k) { |
iveresov@2630 | 184 | double queue_size = CompileBroker::queue_size(level); |
iveresov@2630 | 185 | int comp_count = compiler_count(level); |
iveresov@2630 | 186 | double k = queue_size / (feedback_k * comp_count) + 1; |
iveresov@2630 | 187 | return k; |
iveresov@2630 | 188 | } |
iveresov@2630 | 189 | |
iveresov@2630 | 190 | // Call and loop predicates determine whether a transition to a higher |
iveresov@2630 | 191 | // compilation level should be performed (pointers to predicate functions |
iveresov@2630 | 192 | // are passed to common()). |
iveresov@2630 | 193 | // Tier?LoadFeedback is basically a coefficient that determines of |
iveresov@2630 | 194 | // how many methods per compiler thread can be in the queue before |
iveresov@2630 | 195 | // the threshold values double. |
iveresov@2630 | 196 | bool AdvancedThresholdPolicy::loop_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2630 | 197 | switch(cur_level) { |
iveresov@2630 | 198 | case CompLevel_none: |
iveresov@2630 | 199 | case CompLevel_limited_profile: { |
iveresov@2630 | 200 | double k = threshold_scale(CompLevel_full_profile, Tier3LoadFeedback); |
iveresov@2630 | 201 | return loop_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 202 | } |
iveresov@2630 | 203 | case CompLevel_full_profile: { |
iveresov@2630 | 204 | double k = threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback); |
iveresov@2630 | 205 | return loop_predicate_helper<CompLevel_full_profile>(i, b, k); |
iveresov@2630 | 206 | } |
iveresov@2630 | 207 | default: |
iveresov@2630 | 208 | return true; |
iveresov@2630 | 209 | } |
iveresov@2630 | 210 | } |
iveresov@2630 | 211 | |
iveresov@2630 | 212 | bool AdvancedThresholdPolicy::call_predicate(int i, int b, CompLevel cur_level) { |
iveresov@2630 | 213 | switch(cur_level) { |
iveresov@2630 | 214 | case CompLevel_none: |
iveresov@2630 | 215 | case CompLevel_limited_profile: { |
iveresov@2630 | 216 | double k = threshold_scale(CompLevel_full_profile, Tier3LoadFeedback); |
iveresov@2630 | 217 | return call_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 218 | } |
iveresov@2630 | 219 | case CompLevel_full_profile: { |
iveresov@2630 | 220 | double k = threshold_scale(CompLevel_full_optimization, Tier4LoadFeedback); |
iveresov@2630 | 221 | return call_predicate_helper<CompLevel_full_profile>(i, b, k); |
iveresov@2630 | 222 | } |
iveresov@2630 | 223 | default: |
iveresov@2630 | 224 | return true; |
iveresov@2630 | 225 | } |
iveresov@2630 | 226 | } |
iveresov@2630 | 227 | |
iveresov@2630 | 228 | // If a method is old enough and is still in the interpreter we would want to |
iveresov@2630 | 229 | // start profiling without waiting for the compiled method to arrive. |
iveresov@2630 | 230 | // We also take the load on compilers into the account. |
iveresov@2630 | 231 | bool AdvancedThresholdPolicy::should_create_mdo(methodOop method, CompLevel cur_level) { |
iveresov@2630 | 232 | if (cur_level == CompLevel_none && |
iveresov@2630 | 233 | CompileBroker::queue_size(CompLevel_full_optimization) <= |
iveresov@2630 | 234 | Tier3DelayOn * compiler_count(CompLevel_full_optimization)) { |
iveresov@2630 | 235 | int i = method->invocation_count(); |
iveresov@2630 | 236 | int b = method->backedge_count(); |
iveresov@2630 | 237 | double k = Tier0ProfilingStartPercentage / 100.0; |
iveresov@2630 | 238 | return call_predicate_helper<CompLevel_none>(i, b, k) || loop_predicate_helper<CompLevel_none>(i, b, k); |
iveresov@2630 | 239 | } |
iveresov@2630 | 240 | return false; |
iveresov@2630 | 241 | } |
iveresov@2630 | 242 | |
iveresov@2630 | 243 | // Create MDO if necessary. |
iveresov@2630 | 244 | void AdvancedThresholdPolicy::create_mdo(methodHandle mh, TRAPS) { |
iveresov@2630 | 245 | if (mh->is_native() || mh->is_abstract() || mh->is_accessor()) return; |
iveresov@2630 | 246 | if (mh->method_data() == NULL) { |
iveresov@2630 | 247 | methodOopDesc::build_interpreter_method_data(mh, THREAD); |
iveresov@2630 | 248 | if (HAS_PENDING_EXCEPTION) { |
iveresov@2630 | 249 | CLEAR_PENDING_EXCEPTION; |
iveresov@2630 | 250 | } |
iveresov@2630 | 251 | } |
iveresov@2630 | 252 | } |
iveresov@2630 | 253 | |
iveresov@2630 | 254 | |
iveresov@2630 | 255 | /* |
iveresov@2630 | 256 | * Method states: |
iveresov@2630 | 257 | * 0 - interpreter (CompLevel_none) |
iveresov@2630 | 258 | * 1 - pure C1 (CompLevel_simple) |
iveresov@2630 | 259 | * 2 - C1 with invocation and backedge counting (CompLevel_limited_profile) |
iveresov@2630 | 260 | * 3 - C1 with full profiling (CompLevel_full_profile) |
iveresov@2630 | 261 | * 4 - C2 (CompLevel_full_optimization) |
iveresov@2630 | 262 | * |
iveresov@2630 | 263 | * Common state transition patterns: |
iveresov@2630 | 264 | * a. 0 -> 3 -> 4. |
iveresov@2630 | 265 | * The most common path. But note that even in this straightforward case |
iveresov@2630 | 266 | * profiling can start at level 0 and finish at level 3. |
iveresov@2630 | 267 | * |
iveresov@2630 | 268 | * b. 0 -> 2 -> 3 -> 4. |
iveresov@2630 | 269 | * This case occures when the load on C2 is deemed too high. So, instead of transitioning |
iveresov@2630 | 270 | * into state 3 directly and over-profiling while a method is in the C2 queue we transition to |
iveresov@2630 | 271 | * level 2 and wait until the load on C2 decreases. This path is disabled for OSRs. |
iveresov@2630 | 272 | * |
iveresov@2630 | 273 | * c. 0 -> (3->2) -> 4. |
iveresov@2630 | 274 | * In this case we enqueue a method for compilation at level 3, but the C1 queue is long enough |
iveresov@2630 | 275 | * to enable the profiling to fully occur at level 0. In this case we change the compilation level |
iveresov@2630 | 276 | * of the method to 2, because it'll allow it to run much faster without full profiling while c2 |
iveresov@2630 | 277 | * is compiling. |
iveresov@2630 | 278 | * |
iveresov@2630 | 279 | * d. 0 -> 3 -> 1 or 0 -> 2 -> 1. |
iveresov@2630 | 280 | * After a method was once compiled with C1 it can be identified as trivial and be compiled to |
iveresov@2630 | 281 | * level 1. These transition can also occur if a method can't be compiled with C2 but can with C1. |
iveresov@2630 | 282 | * |
iveresov@2630 | 283 | * e. 0 -> 4. |
iveresov@2630 | 284 | * This can happen if a method fails C1 compilation (it will still be profiled in the interpreter) |
iveresov@2630 | 285 | * or because of a deopt that didn't require reprofiling (compilation won't happen in this case because |
iveresov@2630 | 286 | * the compiled version already exists). |
iveresov@2630 | 287 | * |
iveresov@2630 | 288 | * Note that since state 0 can be reached from any other state via deoptimization different loops |
iveresov@2630 | 289 | * are possible. |
iveresov@2630 | 290 | * |
iveresov@2630 | 291 | */ |
iveresov@2630 | 292 | |
iveresov@2630 | 293 | // Common transition function. Given a predicate determines if a method should transition to another level. |
iveresov@2630 | 294 | CompLevel AdvancedThresholdPolicy::common(Predicate p, methodOop method, CompLevel cur_level) { |
iveresov@2630 | 295 | if (is_trivial(method)) return CompLevel_simple; |
iveresov@2630 | 296 | |
iveresov@2630 | 297 | CompLevel next_level = cur_level; |
iveresov@2630 | 298 | int i = method->invocation_count(); |
iveresov@2630 | 299 | int b = method->backedge_count(); |
iveresov@2630 | 300 | |
iveresov@2630 | 301 | switch(cur_level) { |
iveresov@2630 | 302 | case CompLevel_none: |
iveresov@2630 | 303 | // If we were at full profile level, would we switch to full opt? |
iveresov@2630 | 304 | if (common(p, method, CompLevel_full_profile) == CompLevel_full_optimization) { |
iveresov@2630 | 305 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 306 | } else if ((this->*p)(i, b, cur_level)) { |
iveresov@2630 | 307 | // C1-generated fully profiled code is about 30% slower than the limited profile |
iveresov@2630 | 308 | // code that has only invocation and backedge counters. The observation is that |
iveresov@2630 | 309 | // if C2 queue is large enough we can spend too much time in the fully profiled code |
iveresov@2630 | 310 | // while waiting for C2 to pick the method from the queue. To alleviate this problem |
iveresov@2630 | 311 | // we introduce a feedback on the C2 queue size. If the C2 queue is sufficiently long |
iveresov@2630 | 312 | // we choose to compile a limited profiled version and then recompile with full profiling |
iveresov@2630 | 313 | // when the load on C2 goes down. |
iveresov@2630 | 314 | if (CompileBroker::queue_size(CompLevel_full_optimization) > |
iveresov@2630 | 315 | Tier3DelayOn * compiler_count(CompLevel_full_optimization)) { |
iveresov@2630 | 316 | next_level = CompLevel_limited_profile; |
iveresov@2630 | 317 | } else { |
iveresov@2630 | 318 | next_level = CompLevel_full_profile; |
iveresov@2630 | 319 | } |
iveresov@2630 | 320 | } |
iveresov@2630 | 321 | break; |
iveresov@2630 | 322 | case CompLevel_limited_profile: |
iveresov@2630 | 323 | if (is_method_profiled(method)) { |
iveresov@2630 | 324 | // Special case: we got here because this method was fully profiled in the interpreter. |
iveresov@2630 | 325 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 326 | } else { |
iveresov@2630 | 327 | methodDataOop mdo = method->method_data(); |
iveresov@2630 | 328 | if (mdo != NULL) { |
iveresov@2630 | 329 | if (mdo->would_profile()) { |
iveresov@2630 | 330 | if (CompileBroker::queue_size(CompLevel_full_optimization) <= |
iveresov@2630 | 331 | Tier3DelayOff * compiler_count(CompLevel_full_optimization) && |
iveresov@2630 | 332 | (this->*p)(i, b, cur_level)) { |
iveresov@2630 | 333 | next_level = CompLevel_full_profile; |
iveresov@2630 | 334 | } |
iveresov@2630 | 335 | } else { |
iveresov@2630 | 336 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 337 | } |
iveresov@2630 | 338 | } |
iveresov@2630 | 339 | } |
iveresov@2630 | 340 | break; |
iveresov@2630 | 341 | case CompLevel_full_profile: |
iveresov@2630 | 342 | { |
iveresov@2630 | 343 | methodDataOop mdo = method->method_data(); |
iveresov@2630 | 344 | if (mdo != NULL) { |
iveresov@2630 | 345 | if (mdo->would_profile()) { |
iveresov@2630 | 346 | int mdo_i = mdo->invocation_count_delta(); |
iveresov@2630 | 347 | int mdo_b = mdo->backedge_count_delta(); |
iveresov@2630 | 348 | if ((this->*p)(mdo_i, mdo_b, cur_level)) { |
iveresov@2630 | 349 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 350 | } |
iveresov@2630 | 351 | } else { |
iveresov@2630 | 352 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 353 | } |
iveresov@2630 | 354 | } |
iveresov@2630 | 355 | } |
iveresov@2630 | 356 | break; |
iveresov@2630 | 357 | } |
iveresov@2630 | 358 | return next_level; |
iveresov@2630 | 359 | } |
iveresov@2630 | 360 | |
iveresov@2630 | 361 | // Determine if a method should be compiled with a normal entry point at a different level. |
iveresov@2630 | 362 | CompLevel AdvancedThresholdPolicy::call_event(methodOop method, CompLevel cur_level) { |
iveresov@2630 | 363 | CompLevel osr_level = (CompLevel) method->highest_osr_comp_level(); |
iveresov@2630 | 364 | CompLevel next_level = common(&AdvancedThresholdPolicy::call_predicate, method, cur_level); |
iveresov@2630 | 365 | |
iveresov@2630 | 366 | // If OSR method level is greater than the regular method level, the levels should be |
iveresov@2630 | 367 | // equalized by raising the regular method level in order to avoid OSRs during each |
iveresov@2630 | 368 | // invocation of the method. |
iveresov@2630 | 369 | if (osr_level == CompLevel_full_optimization && cur_level == CompLevel_full_profile) { |
iveresov@2630 | 370 | methodDataOop mdo = method->method_data(); |
iveresov@2630 | 371 | guarantee(mdo != NULL, "MDO should not be NULL"); |
iveresov@2630 | 372 | if (mdo->invocation_count() >= 1) { |
iveresov@2630 | 373 | next_level = CompLevel_full_optimization; |
iveresov@2630 | 374 | } |
iveresov@2630 | 375 | } else { |
iveresov@2630 | 376 | next_level = MAX2(osr_level, next_level); |
iveresov@2630 | 377 | } |
iveresov@2630 | 378 | |
iveresov@2630 | 379 | return next_level; |
iveresov@2630 | 380 | } |
iveresov@2630 | 381 | |
iveresov@2630 | 382 | // Determine if we should do an OSR compilation of a given method. |
iveresov@2630 | 383 | CompLevel AdvancedThresholdPolicy::loop_event(methodOop method, CompLevel cur_level) { |
iveresov@2630 | 384 | if (cur_level == CompLevel_none) { |
iveresov@2630 | 385 | // If there is a live OSR method that means that we deopted to the interpreter |
iveresov@2630 | 386 | // for the transition. |
iveresov@2630 | 387 | CompLevel osr_level = (CompLevel)method->highest_osr_comp_level(); |
iveresov@2630 | 388 | if (osr_level > CompLevel_none) { |
iveresov@2630 | 389 | return osr_level; |
iveresov@2630 | 390 | } |
iveresov@2630 | 391 | } |
iveresov@2630 | 392 | return common(&AdvancedThresholdPolicy::loop_predicate, method, cur_level); |
iveresov@2630 | 393 | } |
iveresov@2630 | 394 | |
iveresov@2630 | 395 | // Update the rate and submit compile |
iveresov@2630 | 396 | void AdvancedThresholdPolicy::submit_compile(methodHandle mh, int bci, CompLevel level, TRAPS) { |
iveresov@2630 | 397 | int hot_count = (bci == InvocationEntryBci) ? mh->invocation_count() : mh->backedge_count(); |
iveresov@2630 | 398 | update_rate(os::javaTimeMillis(), mh()); |
iveresov@2630 | 399 | CompileBroker::compile_method(mh, bci, level, mh, hot_count, "tiered", THREAD); |
iveresov@2630 | 400 | } |
iveresov@2630 | 401 | |
iveresov@2630 | 402 | |
iveresov@2630 | 403 | // Handle the invocation event. |
iveresov@2630 | 404 | void AdvancedThresholdPolicy::method_invocation_event(methodHandle mh, methodHandle imh, |
iveresov@2630 | 405 | CompLevel level, TRAPS) { |
iveresov@2630 | 406 | if (should_create_mdo(mh(), level)) { |
iveresov@2630 | 407 | create_mdo(mh, THREAD); |
iveresov@2630 | 408 | } |
iveresov@2630 | 409 | if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, InvocationEntryBci)) { |
iveresov@2630 | 410 | CompLevel next_level = call_event(mh(), level); |
iveresov@2630 | 411 | if (next_level != level) { |
iveresov@2630 | 412 | compile(mh, InvocationEntryBci, next_level, THREAD); |
iveresov@2630 | 413 | } |
iveresov@2630 | 414 | } |
iveresov@2630 | 415 | } |
iveresov@2630 | 416 | |
iveresov@2630 | 417 | // Handle the back branch event. Notice that we can compile the method |
iveresov@2630 | 418 | // with a regular entry from here. |
iveresov@2630 | 419 | void AdvancedThresholdPolicy::method_back_branch_event(methodHandle mh, methodHandle imh, |
iveresov@2630 | 420 | int bci, CompLevel level, TRAPS) { |
iveresov@2630 | 421 | if (should_create_mdo(mh(), level)) { |
iveresov@2630 | 422 | create_mdo(mh, THREAD); |
iveresov@2630 | 423 | } |
iveresov@2630 | 424 | |
iveresov@2630 | 425 | // If the method is already compiling, quickly bail out. |
iveresov@2630 | 426 | if (is_compilation_enabled() && !CompileBroker::compilation_is_in_queue(mh, bci)) { |
iveresov@2630 | 427 | // Use loop event as an opportinity to also check there's been |
iveresov@2630 | 428 | // enough calls. |
iveresov@2630 | 429 | CompLevel cur_level = comp_level(mh()); |
iveresov@2630 | 430 | CompLevel next_level = call_event(mh(), cur_level); |
iveresov@2630 | 431 | CompLevel next_osr_level = loop_event(mh(), level); |
iveresov@2630 | 432 | if (next_osr_level == CompLevel_limited_profile) { |
iveresov@2630 | 433 | next_osr_level = CompLevel_full_profile; // OSRs are supposed to be for very hot methods. |
iveresov@2630 | 434 | } |
iveresov@2630 | 435 | next_level = MAX2(next_level, |
iveresov@2630 | 436 | next_osr_level < CompLevel_full_optimization ? next_osr_level : cur_level); |
iveresov@2630 | 437 | bool is_compiling = false; |
iveresov@2630 | 438 | if (next_level != cur_level) { |
iveresov@2630 | 439 | compile(mh, InvocationEntryBci, next_level, THREAD); |
iveresov@2630 | 440 | is_compiling = true; |
iveresov@2630 | 441 | } |
iveresov@2630 | 442 | |
iveresov@2630 | 443 | // Do the OSR version |
iveresov@2630 | 444 | if (!is_compiling && next_osr_level != level) { |
iveresov@2630 | 445 | compile(mh, bci, next_osr_level, THREAD); |
iveresov@2630 | 446 | } |
iveresov@2630 | 447 | } |
iveresov@2630 | 448 | } |
iveresov@2630 | 449 | |
iveresov@2630 | 450 | #endif // TIERED |