src/share/vm/runtime/compilationPolicy.cpp

Thu, 02 May 2013 18:50:05 -0700

author
kvn
date
Thu, 02 May 2013 18:50:05 -0700
changeset 5040
9ce110b1d14a
parent 5032
d1c9384eecb4
child 5541
f99558245e5c
permissions
-rw-r--r--

Merge

duke@435 1 /*
jiangli@4936 2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
duke@435 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435 4 *
duke@435 5 * This code is free software; you can redistribute it and/or modify it
duke@435 6 * under the terms of the GNU General Public License version 2 only, as
duke@435 7 * published by the Free Software Foundation.
duke@435 8 *
duke@435 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@435 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@435 13 * accompanied this code).
duke@435 14 *
duke@435 15 * You should have received a copy of the GNU General Public License version
duke@435 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@435 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435 18 *
trims@1907 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
trims@1907 20 * or visit www.oracle.com if you need additional information or have any
trims@1907 21 * questions.
duke@435 22 *
duke@435 23 */
duke@435 24
stefank@2314 25 #include "precompiled.hpp"
stefank@2314 26 #include "code/compiledIC.hpp"
stefank@2314 27 #include "code/nmethod.hpp"
stefank@2314 28 #include "code/scopeDesc.hpp"
stefank@2314 29 #include "compiler/compilerOracle.hpp"
stefank@2314 30 #include "interpreter/interpreter.hpp"
coleenp@4037 31 #include "oops/methodData.hpp"
coleenp@4037 32 #include "oops/method.hpp"
stefank@2314 33 #include "oops/oop.inline.hpp"
stefank@2314 34 #include "prims/nativeLookup.hpp"
iveresov@2630 35 #include "runtime/advancedThresholdPolicy.hpp"
stefank@2314 36 #include "runtime/compilationPolicy.hpp"
stefank@2314 37 #include "runtime/frame.hpp"
stefank@2314 38 #include "runtime/handles.inline.hpp"
stefank@2314 39 #include "runtime/rframe.hpp"
stefank@2314 40 #include "runtime/simpleThresholdPolicy.hpp"
stefank@2314 41 #include "runtime/stubRoutines.hpp"
stefank@2314 42 #include "runtime/thread.hpp"
stefank@2314 43 #include "runtime/timer.hpp"
stefank@2314 44 #include "runtime/vframe.hpp"
stefank@2314 45 #include "runtime/vm_operations.hpp"
stefank@2314 46 #include "utilities/events.hpp"
stefank@2314 47 #include "utilities/globalDefinitions.hpp"
duke@435 48
duke@435 49 CompilationPolicy* CompilationPolicy::_policy;
duke@435 50 elapsedTimer CompilationPolicy::_accumulated_time;
duke@435 51 bool CompilationPolicy::_in_vm_startup;
duke@435 52
duke@435 53 // Determine compilation policy based on command line argument
duke@435 54 void compilationPolicy_init() {
duke@435 55 CompilationPolicy::set_in_vm_startup(DelayCompilationDuringStartup);
duke@435 56
duke@435 57 switch(CompilationPolicyChoice) {
duke@435 58 case 0:
duke@435 59 CompilationPolicy::set_policy(new SimpleCompPolicy());
duke@435 60 break;
duke@435 61
duke@435 62 case 1:
duke@435 63 #ifdef COMPILER2
duke@435 64 CompilationPolicy::set_policy(new StackWalkCompPolicy());
duke@435 65 #else
duke@435 66 Unimplemented();
duke@435 67 #endif
duke@435 68 break;
iveresov@2138 69 case 2:
iveresov@2138 70 #ifdef TIERED
iveresov@2138 71 CompilationPolicy::set_policy(new SimpleThresholdPolicy());
iveresov@2138 72 #else
iveresov@2138 73 Unimplemented();
iveresov@2138 74 #endif
iveresov@2138 75 break;
iveresov@2630 76 case 3:
iveresov@2630 77 #ifdef TIERED
iveresov@2630 78 CompilationPolicy::set_policy(new AdvancedThresholdPolicy());
iveresov@2630 79 #else
iveresov@2630 80 Unimplemented();
iveresov@2630 81 #endif
iveresov@2630 82 break;
duke@435 83 default:
iveresov@2630 84 fatal("CompilationPolicyChoice must be in the range: [0-3]");
duke@435 85 }
iveresov@2138 86 CompilationPolicy::policy()->initialize();
duke@435 87 }
duke@435 88
duke@435 89 void CompilationPolicy::completed_vm_startup() {
duke@435 90 if (TraceCompilationPolicy) {
duke@435 91 tty->print("CompilationPolicy: completed vm startup.\n");
duke@435 92 }
duke@435 93 _in_vm_startup = false;
duke@435 94 }
duke@435 95
duke@435 96 // Returns true if m must be compiled before executing it
duke@435 97 // This is intended to force compiles for methods (usually for
duke@435 98 // debugging) that would otherwise be interpreted for some reason.
iveresov@2138 99 bool CompilationPolicy::must_be_compiled(methodHandle m, int comp_level) {
minqi@4267 100 // Don't allow Xcomp to cause compiles in replay mode
minqi@4267 101 if (ReplayCompiles) return false;
minqi@4267 102
duke@435 103 if (m->has_compiled_code()) return false; // already compiled
iveresov@2138 104 if (!can_be_compiled(m, comp_level)) return false;
duke@435 105
duke@435 106 return !UseInterpreter || // must compile all methods
kvn@1637 107 (UseCompiler && AlwaysCompileLoopMethods && m->has_loops() && CompileBroker::should_compile_new_jobs()); // eagerly compile loop methods
duke@435 108 }
duke@435 109
duke@435 110 // Returns true if m is allowed to be compiled
iveresov@2138 111 bool CompilationPolicy::can_be_compiled(methodHandle m, int comp_level) {
iignatyev@5032 112 // allow any levels for WhiteBox
iignatyev@5032 113 assert(WhiteBoxAPI || comp_level == CompLevel_all || is_compile(comp_level), "illegal compilation level");
iignatyev@5032 114
duke@435 115 if (m->is_abstract()) return false;
duke@435 116 if (DontCompileHugeMethods && m->code_size() > HugeMethodLimit) return false;
duke@435 117
never@1609 118 // Math intrinsics should never be compiled as this can lead to
never@1609 119 // monotonicity problems because the interpreter will prefer the
never@1609 120 // compiled code to the intrinsic version. This can't happen in
never@1609 121 // production because the invocation counter can't be incremented
never@1609 122 // but we shouldn't expose the system to this problem in testing
never@1609 123 // modes.
never@1609 124 if (!AbstractInterpreter::can_be_compiled(m)) {
never@1609 125 return false;
never@1609 126 }
iveresov@2138 127 if (comp_level == CompLevel_all) {
iignatyev@5032 128 if (TieredCompilation) {
iignatyev@5032 129 // enough to be compilable at any level for tiered
iignatyev@5032 130 return !m->is_not_compilable(CompLevel_simple) || !m->is_not_compilable(CompLevel_full_optimization);
iignatyev@5032 131 } else {
iignatyev@5032 132 // must be compilable at available level for non-tiered
iignatyev@5032 133 return !m->is_not_compilable(CompLevel_highest_tier);
iignatyev@5032 134 }
iignatyev@4908 135 } else if (is_compile(comp_level)) {
iveresov@2138 136 return !m->is_not_compilable(comp_level);
iveresov@2138 137 }
iignatyev@4908 138 return false;
iveresov@2138 139 }
never@1609 140
iveresov@2138 141 bool CompilationPolicy::is_compilation_enabled() {
iveresov@2138 142 // NOTE: CompileBroker::should_compile_new_jobs() checks for UseCompiler
iveresov@2138 143 return !delay_compilation_during_startup() && CompileBroker::should_compile_new_jobs();
duke@435 144 }
duke@435 145
duke@435 146 #ifndef PRODUCT
duke@435 147 void CompilationPolicy::print_time() {
duke@435 148 tty->print_cr ("Accumulated compilationPolicy times:");
duke@435 149 tty->print_cr ("---------------------------");
duke@435 150 tty->print_cr (" Total: %3.3f sec.", _accumulated_time.seconds());
duke@435 151 }
duke@435 152
iveresov@2138 153 void NonTieredCompPolicy::trace_osr_completion(nmethod* osr_nm) {
duke@435 154 if (TraceOnStackReplacement) {
duke@435 155 if (osr_nm == NULL) tty->print_cr("compilation failed");
duke@435 156 else tty->print_cr("nmethod " INTPTR_FORMAT, osr_nm);
duke@435 157 }
duke@435 158 }
duke@435 159 #endif // !PRODUCT
duke@435 160
iveresov@2138 161 void NonTieredCompPolicy::initialize() {
iveresov@2138 162 // Setup the compiler thread numbers
iveresov@2138 163 if (CICompilerCountPerCPU) {
iveresov@2138 164 // Example: if CICompilerCountPerCPU is true, then we get
iveresov@2138 165 // max(log2(8)-1,1) = 2 compiler threads on an 8-way machine.
iveresov@2138 166 // May help big-app startup time.
iveresov@2138 167 _compiler_count = MAX2(log2_intptr(os::active_processor_count())-1,1);
iveresov@2138 168 } else {
iveresov@2138 169 _compiler_count = CICompilerCount;
iveresov@2138 170 }
iveresov@2138 171 }
iveresov@2138 172
iveresov@2176 173 // Note: this policy is used ONLY if TieredCompilation is off.
iveresov@2176 174 // compiler_count() behaves the following way:
iveresov@2176 175 // - with TIERED build (with both COMPILER1 and COMPILER2 defined) it should return
iveresov@2176 176 // zero for the c1 compilation levels, hence the particular ordering of the
iveresov@2176 177 // statements.
iveresov@2176 178 // - the same should happen when COMPILER2 is defined and COMPILER1 is not
iveresov@2176 179 // (server build without TIERED defined).
iveresov@2176 180 // - if only COMPILER1 is defined (client build), zero should be returned for
iveresov@2176 181 // the c2 level.
iveresov@2176 182 // - if neither is defined - always return zero.
iveresov@2138 183 int NonTieredCompPolicy::compiler_count(CompLevel comp_level) {
iveresov@2176 184 assert(!TieredCompilation, "This policy should not be used with TieredCompilation");
iveresov@2176 185 #ifdef COMPILER2
iveresov@2176 186 if (is_c2_compile(comp_level)) {
iveresov@2176 187 return _compiler_count;
iveresov@2176 188 } else {
iveresov@2176 189 return 0;
iveresov@2176 190 }
iveresov@2176 191 #endif
iveresov@2176 192
iveresov@2138 193 #ifdef COMPILER1
iveresov@2138 194 if (is_c1_compile(comp_level)) {
iveresov@2138 195 return _compiler_count;
iveresov@2176 196 } else {
iveresov@2176 197 return 0;
iveresov@2138 198 }
iveresov@2138 199 #endif
iveresov@2138 200
iveresov@2138 201 return 0;
iveresov@2138 202 }
iveresov@2138 203
iveresov@2138 204 void NonTieredCompPolicy::reset_counter_for_invocation_event(methodHandle m) {
duke@435 205 // Make sure invocation and backedge counter doesn't overflow again right away
duke@435 206 // as would be the case for native methods.
duke@435 207
duke@435 208 // BUT also make sure the method doesn't look like it was never executed.
duke@435 209 // Set carry bit and reduce counter's value to min(count, CompileThreshold/2).
jiangli@4936 210 MethodCounters* mcs = m->method_counters();
jiangli@4936 211 assert(mcs != NULL, "MethodCounters cannot be NULL for profiling");
jiangli@4936 212 mcs->invocation_counter()->set_carry();
jiangli@4936 213 mcs->backedge_counter()->set_carry();
duke@435 214
duke@435 215 assert(!m->was_never_executed(), "don't reset to 0 -- could be mistaken for never-executed");
duke@435 216 }
duke@435 217
iveresov@2138 218 void NonTieredCompPolicy::reset_counter_for_back_branch_event(methodHandle m) {
duke@435 219 // Delay next back-branch event but pump up invocation counter to triger
duke@435 220 // whole method compilation.
jiangli@4936 221 MethodCounters* mcs = m->method_counters();
jiangli@4936 222 assert(mcs != NULL, "MethodCounters cannot be NULL for profiling");
jiangli@4936 223 InvocationCounter* i = mcs->invocation_counter();
jiangli@4936 224 InvocationCounter* b = mcs->backedge_counter();
duke@435 225
duke@435 226 // Don't set invocation_counter's value too low otherwise the method will
duke@435 227 // look like immature (ic < ~5300) which prevents the inlining based on
duke@435 228 // the type profiling.
duke@435 229 i->set(i->state(), CompileThreshold);
duke@435 230 // Don't reset counter too low - it is used to check if OSR method is ready.
duke@435 231 b->set(b->state(), CompileThreshold / 2);
duke@435 232 }
duke@435 233
iveresov@2138 234 //
iveresov@2138 235 // CounterDecay
iveresov@2138 236 //
iveresov@2138 237 // Interates through invocation counters and decrements them. This
iveresov@2138 238 // is done at each safepoint.
iveresov@2138 239 //
iveresov@2138 240 class CounterDecay : public AllStatic {
iveresov@2138 241 static jlong _last_timestamp;
coleenp@4037 242 static void do_method(Method* m) {
jiangli@4936 243 MethodCounters* mcs = m->method_counters();
jiangli@4936 244 if (mcs != NULL) {
jiangli@4936 245 mcs->invocation_counter()->decay();
jiangli@4936 246 }
iveresov@2138 247 }
iveresov@2138 248 public:
iveresov@2138 249 static void decay();
iveresov@2138 250 static bool is_decay_needed() {
iveresov@2138 251 return (os::javaTimeMillis() - _last_timestamp) > CounterDecayMinIntervalLength;
iveresov@2138 252 }
iveresov@2138 253 };
iveresov@2138 254
iveresov@2138 255 jlong CounterDecay::_last_timestamp = 0;
iveresov@2138 256
iveresov@2138 257 void CounterDecay::decay() {
iveresov@2138 258 _last_timestamp = os::javaTimeMillis();
iveresov@2138 259
iveresov@2138 260 // This operation is going to be performed only at the end of a safepoint
iveresov@2138 261 // and hence GC's will not be going on, all Java mutators are suspended
iveresov@2138 262 // at this point and hence SystemDictionary_lock is also not needed.
iveresov@2138 263 assert(SafepointSynchronize::is_at_safepoint(), "can only be executed at a safepoint");
iveresov@2138 264 int nclasses = SystemDictionary::number_of_classes();
iveresov@2138 265 double classes_per_tick = nclasses * (CounterDecayMinIntervalLength * 1e-3 /
iveresov@2138 266 CounterHalfLifeTime);
iveresov@2138 267 for (int i = 0; i < classes_per_tick; i++) {
coleenp@4037 268 Klass* k = SystemDictionary::try_get_next_class();
coleenp@4037 269 if (k != NULL && k->oop_is_instance()) {
coleenp@4037 270 InstanceKlass::cast(k)->methods_do(do_method);
iveresov@2138 271 }
iveresov@2138 272 }
iveresov@2138 273 }
iveresov@2138 274
iveresov@2138 275 // Called at the end of the safepoint
iveresov@2138 276 void NonTieredCompPolicy::do_safepoint_work() {
iveresov@2138 277 if(UseCounterDecay && CounterDecay::is_decay_needed()) {
iveresov@2138 278 CounterDecay::decay();
iveresov@2138 279 }
iveresov@2138 280 }
iveresov@2138 281
iveresov@2138 282 void NonTieredCompPolicy::reprofile(ScopeDesc* trap_scope, bool is_osr) {
iveresov@2138 283 ScopeDesc* sd = trap_scope;
jiangli@4936 284 MethodCounters* mcs;
jiangli@4936 285 InvocationCounter* c;
iveresov@2138 286 for (; !sd->is_top(); sd = sd->sender()) {
jiangli@4936 287 mcs = sd->method()->method_counters();
jiangli@4936 288 if (mcs != NULL) {
jiangli@4936 289 // Reset ICs of inlined methods, since they can trigger compilations also.
jiangli@4936 290 mcs->invocation_counter()->reset();
jiangli@4936 291 }
iveresov@2138 292 }
jiangli@4936 293 mcs = sd->method()->method_counters();
jiangli@4936 294 if (mcs != NULL) {
jiangli@4936 295 c = mcs->invocation_counter();
jiangli@4936 296 if (is_osr) {
jiangli@4936 297 // It was an OSR method, so bump the count higher.
jiangli@4936 298 c->set(c->state(), CompileThreshold);
jiangli@4936 299 } else {
jiangli@4936 300 c->reset();
jiangli@4936 301 }
jiangli@4936 302 mcs->backedge_counter()->reset();
iveresov@2138 303 }
iveresov@2138 304 }
iveresov@2138 305
iveresov@2138 306 // This method can be called by any component of the runtime to notify the policy
iveresov@2138 307 // that it's recommended to delay the complation of this method.
coleenp@4037 308 void NonTieredCompPolicy::delay_compilation(Method* method) {
jiangli@4936 309 MethodCounters* mcs = method->method_counters();
jiangli@4937 310 if (mcs != NULL) {
jiangli@4937 311 mcs->invocation_counter()->decay();
jiangli@4937 312 mcs->backedge_counter()->decay();
jiangli@4937 313 }
iveresov@2138 314 }
iveresov@2138 315
coleenp@4037 316 void NonTieredCompPolicy::disable_compilation(Method* method) {
jiangli@4936 317 MethodCounters* mcs = method->method_counters();
jiangli@4936 318 if (mcs != NULL) {
jiangli@4936 319 mcs->invocation_counter()->set_state(InvocationCounter::wait_for_nothing);
jiangli@4936 320 mcs->backedge_counter()->set_state(InvocationCounter::wait_for_nothing);
jiangli@4936 321 }
iveresov@2138 322 }
iveresov@2138 323
iveresov@2138 324 CompileTask* NonTieredCompPolicy::select_task(CompileQueue* compile_queue) {
iveresov@2138 325 return compile_queue->first();
iveresov@2138 326 }
iveresov@2138 327
coleenp@4037 328 bool NonTieredCompPolicy::is_mature(Method* method) {
coleenp@4037 329 MethodData* mdo = method->method_data();
iveresov@2138 330 assert(mdo != NULL, "Should be");
iveresov@2138 331 uint current = mdo->mileage_of(method);
iveresov@2138 332 uint initial = mdo->creation_mileage();
iveresov@2138 333 if (current < initial)
iveresov@2138 334 return true; // some sort of overflow
iveresov@2138 335 uint target;
iveresov@2138 336 if (ProfileMaturityPercentage <= 0)
iveresov@2138 337 target = (uint) -ProfileMaturityPercentage; // absolute value
iveresov@2138 338 else
iveresov@2138 339 target = (uint)( (ProfileMaturityPercentage * CompileThreshold) / 100 );
iveresov@2138 340 return (current >= initial + target);
iveresov@2138 341 }
iveresov@2138 342
iveresov@3452 343 nmethod* NonTieredCompPolicy::event(methodHandle method, methodHandle inlinee, int branch_bci,
iveresov@3452 344 int bci, CompLevel comp_level, nmethod* nm, JavaThread* thread) {
iveresov@2138 345 assert(comp_level == CompLevel_none, "This should be only called from the interpreter");
iveresov@2138 346 NOT_PRODUCT(trace_frequency_counter_overflow(method, branch_bci, bci));
iveresov@3452 347 if (JvmtiExport::can_post_interpreter_events() && thread->is_interp_only_mode()) {
iveresov@3452 348 // If certain JVMTI events (e.g. frame pop event) are requested then the
iveresov@3452 349 // thread is forced to remain in interpreted code. This is
iveresov@3452 350 // implemented partly by a check in the run_compiled_code
iveresov@3452 351 // section of the interpreter whether we should skip running
iveresov@3452 352 // compiled code, and partly by skipping OSR compiles for
iveresov@3452 353 // interpreted-only threads.
iveresov@3452 354 if (bci != InvocationEntryBci) {
iveresov@3452 355 reset_counter_for_back_branch_event(method);
iveresov@3452 356 return NULL;
iveresov@2138 357 }
iveresov@2138 358 }
minqi@4267 359 if (CompileTheWorld || ReplayCompiles) {
minqi@4267 360 // Don't trigger other compiles in testing mode
minqi@4267 361 if (bci == InvocationEntryBci) {
minqi@4267 362 reset_counter_for_invocation_event(method);
minqi@4267 363 } else {
minqi@4267 364 reset_counter_for_back_branch_event(method);
minqi@4267 365 }
minqi@4267 366 return NULL;
minqi@4267 367 }
minqi@4267 368
iveresov@2138 369 if (bci == InvocationEntryBci) {
iveresov@2138 370 // when code cache is full, compilation gets switched off, UseCompiler
iveresov@2138 371 // is set to false
iveresov@2138 372 if (!method->has_compiled_code() && UseCompiler) {
iveresov@3452 373 method_invocation_event(method, thread);
iveresov@2138 374 } else {
iveresov@2138 375 // Force counter overflow on method entry, even if no compilation
iveresov@2138 376 // happened. (The method_invocation_event call does this also.)
iveresov@2138 377 reset_counter_for_invocation_event(method);
iveresov@2138 378 }
iveresov@2138 379 // compilation at an invocation overflow no longer goes and retries test for
iveresov@2138 380 // compiled method. We always run the loser of the race as interpreted.
iveresov@2138 381 // so return NULL
iveresov@2138 382 return NULL;
iveresov@2138 383 } else {
iveresov@2138 384 // counter overflow in a loop => try to do on-stack-replacement
iveresov@2138 385 nmethod* osr_nm = method->lookup_osr_nmethod_for(bci, CompLevel_highest_tier, true);
iveresov@2138 386 NOT_PRODUCT(trace_osr_request(method, osr_nm, bci));
iveresov@2138 387 // when code cache is full, we should not compile any more...
iveresov@2138 388 if (osr_nm == NULL && UseCompiler) {
iveresov@3452 389 method_back_branch_event(method, bci, thread);
iveresov@2138 390 osr_nm = method->lookup_osr_nmethod_for(bci, CompLevel_highest_tier, true);
iveresov@2138 391 }
iveresov@2138 392 if (osr_nm == NULL) {
iveresov@2138 393 reset_counter_for_back_branch_event(method);
iveresov@2138 394 return NULL;
iveresov@2138 395 }
iveresov@2138 396 return osr_nm;
iveresov@2138 397 }
iveresov@2138 398 return NULL;
iveresov@2138 399 }
iveresov@2138 400
iveresov@2138 401 #ifndef PRODUCT
iveresov@2138 402 void NonTieredCompPolicy::trace_frequency_counter_overflow(methodHandle m, int branch_bci, int bci) {
iveresov@2138 403 if (TraceInvocationCounterOverflow) {
jiangli@4936 404 MethodCounters* mcs = m->method_counters();
jiangli@4936 405 assert(mcs != NULL, "MethodCounters cannot be NULL for profiling");
jiangli@4936 406 InvocationCounter* ic = mcs->invocation_counter();
jiangli@4936 407 InvocationCounter* bc = mcs->backedge_counter();
iveresov@2138 408 ResourceMark rm;
iveresov@2138 409 const char* msg =
iveresov@2138 410 bci == InvocationEntryBci
iveresov@2138 411 ? "comp-policy cntr ovfl @ %d in entry of "
iveresov@2138 412 : "comp-policy cntr ovfl @ %d in loop of ";
iveresov@2138 413 tty->print(msg, bci);
iveresov@2138 414 m->print_value();
iveresov@2138 415 tty->cr();
iveresov@2138 416 ic->print();
iveresov@2138 417 bc->print();
iveresov@2138 418 if (ProfileInterpreter) {
iveresov@2138 419 if (bci != InvocationEntryBci) {
coleenp@4037 420 MethodData* mdo = m->method_data();
iveresov@2138 421 if (mdo != NULL) {
iveresov@2138 422 int count = mdo->bci_to_data(branch_bci)->as_JumpData()->taken();
iveresov@2138 423 tty->print_cr("back branch count = %d", count);
iveresov@2138 424 }
iveresov@2138 425 }
iveresov@2138 426 }
iveresov@2138 427 }
iveresov@2138 428 }
iveresov@2138 429
iveresov@2138 430 void NonTieredCompPolicy::trace_osr_request(methodHandle method, nmethod* osr, int bci) {
iveresov@2138 431 if (TraceOnStackReplacement) {
iveresov@2138 432 ResourceMark rm;
iveresov@2138 433 tty->print(osr != NULL ? "Reused OSR entry for " : "Requesting OSR entry for ");
iveresov@2138 434 method->print_short_name(tty);
iveresov@2138 435 tty->print_cr(" at bci %d", bci);
iveresov@2138 436 }
iveresov@2138 437 }
iveresov@2138 438 #endif // !PRODUCT
iveresov@2138 439
duke@435 440 // SimpleCompPolicy - compile current method
duke@435 441
iveresov@3452 442 void SimpleCompPolicy::method_invocation_event(methodHandle m, JavaThread* thread) {
twisti@4111 443 const int comp_level = CompLevel_highest_tier;
twisti@4111 444 const int hot_count = m->invocation_count();
duke@435 445 reset_counter_for_invocation_event(m);
duke@435 446 const char* comment = "count";
duke@435 447
iignatyev@5032 448 if (is_compilation_enabled() && can_be_compiled(m, comp_level)) {
duke@435 449 nmethod* nm = m->code();
duke@435 450 if (nm == NULL ) {
twisti@4111 451 CompileBroker::compile_method(m, InvocationEntryBci, comp_level, m, hot_count, comment, thread);
duke@435 452 }
duke@435 453 }
duke@435 454 }
duke@435 455
iveresov@3452 456 void SimpleCompPolicy::method_back_branch_event(methodHandle m, int bci, JavaThread* thread) {
twisti@4111 457 const int comp_level = CompLevel_highest_tier;
twisti@4111 458 const int hot_count = m->backedge_count();
duke@435 459 const char* comment = "backedge_count";
duke@435 460
iignatyev@5032 461 if (is_compilation_enabled() && !m->is_not_osr_compilable(comp_level) && can_be_compiled(m, comp_level)) {
twisti@4111 462 CompileBroker::compile_method(m, bci, comp_level, m, hot_count, comment, thread);
twisti@4111 463 NOT_PRODUCT(trace_osr_completion(m->lookup_osr_nmethod_for(bci, comp_level, true));)
duke@435 464 }
duke@435 465 }
duke@435 466 // StackWalkCompPolicy - walk up stack to find a suitable method to compile
duke@435 467
duke@435 468 #ifdef COMPILER2
duke@435 469 const char* StackWalkCompPolicy::_msg = NULL;
duke@435 470
duke@435 471
duke@435 472 // Consider m for compilation
iveresov@3452 473 void StackWalkCompPolicy::method_invocation_event(methodHandle m, JavaThread* thread) {
twisti@4111 474 const int comp_level = CompLevel_highest_tier;
twisti@4111 475 const int hot_count = m->invocation_count();
duke@435 476 reset_counter_for_invocation_event(m);
duke@435 477 const char* comment = "count";
duke@435 478
iignatyev@5032 479 if (is_compilation_enabled() && m->code() == NULL && can_be_compiled(m, comp_level)) {
iveresov@3452 480 ResourceMark rm(thread);
duke@435 481 frame fr = thread->last_frame();
duke@435 482 assert(fr.is_interpreted_frame(), "must be interpreted");
duke@435 483 assert(fr.interpreter_frame_method() == m(), "bad method");
duke@435 484
duke@435 485 if (TraceCompilationPolicy) {
duke@435 486 tty->print("method invocation trigger: ");
duke@435 487 m->print_short_name(tty);
duke@435 488 tty->print(" ( interpreted " INTPTR_FORMAT ", size=%d ) ", (address)m(), m->code_size());
duke@435 489 }
duke@435 490 RegisterMap reg_map(thread, false);
duke@435 491 javaVFrame* triggerVF = thread->last_java_vframe(&reg_map);
duke@435 492 // triggerVF is the frame that triggered its counter
duke@435 493 RFrame* first = new InterpretedRFrame(triggerVF->fr(), thread, m);
duke@435 494
duke@435 495 if (first->top_method()->code() != NULL) {
duke@435 496 // called obsolete method/nmethod -- no need to recompile
duke@435 497 if (TraceCompilationPolicy) tty->print_cr(" --> " INTPTR_FORMAT, first->top_method()->code());
duke@435 498 } else {
duke@435 499 if (TimeCompilationPolicy) accumulated_time()->start();
duke@435 500 GrowableArray<RFrame*>* stack = new GrowableArray<RFrame*>(50);
duke@435 501 stack->push(first);
duke@435 502 RFrame* top = findTopInlinableFrame(stack);
duke@435 503 if (TimeCompilationPolicy) accumulated_time()->stop();
duke@435 504 assert(top != NULL, "findTopInlinableFrame returned null");
duke@435 505 if (TraceCompilationPolicy) top->print();
twisti@4111 506 CompileBroker::compile_method(top->top_method(), InvocationEntryBci, comp_level,
iveresov@3452 507 m, hot_count, comment, thread);
duke@435 508 }
duke@435 509 }
duke@435 510 }
duke@435 511
iveresov@3452 512 void StackWalkCompPolicy::method_back_branch_event(methodHandle m, int bci, JavaThread* thread) {
twisti@4111 513 const int comp_level = CompLevel_highest_tier;
twisti@4111 514 const int hot_count = m->backedge_count();
duke@435 515 const char* comment = "backedge_count";
duke@435 516
iignatyev@5032 517 if (is_compilation_enabled() && !m->is_not_osr_compilable(comp_level) && can_be_compiled(m, comp_level)) {
twisti@4111 518 CompileBroker::compile_method(m, bci, comp_level, m, hot_count, comment, thread);
twisti@4111 519 NOT_PRODUCT(trace_osr_completion(m->lookup_osr_nmethod_for(bci, comp_level, true));)
duke@435 520 }
duke@435 521 }
duke@435 522
duke@435 523 RFrame* StackWalkCompPolicy::findTopInlinableFrame(GrowableArray<RFrame*>* stack) {
duke@435 524 // go up the stack until finding a frame that (probably) won't be inlined
duke@435 525 // into its caller
duke@435 526 RFrame* current = stack->at(0); // current choice for stopping
duke@435 527 assert( current && !current->is_compiled(), "" );
duke@435 528 const char* msg = NULL;
duke@435 529
duke@435 530 while (1) {
duke@435 531
duke@435 532 // before going up the stack further, check if doing so would get us into
duke@435 533 // compiled code
duke@435 534 RFrame* next = senderOf(current, stack);
duke@435 535 if( !next ) // No next frame up the stack?
duke@435 536 break; // Then compile with current frame
duke@435 537
duke@435 538 methodHandle m = current->top_method();
duke@435 539 methodHandle next_m = next->top_method();
duke@435 540
duke@435 541 if (TraceCompilationPolicy && Verbose) {
duke@435 542 tty->print("[caller: ");
duke@435 543 next_m->print_short_name(tty);
duke@435 544 tty->print("] ");
duke@435 545 }
duke@435 546
duke@435 547 if( !Inline ) { // Inlining turned off
duke@435 548 msg = "Inlining turned off";
duke@435 549 break;
duke@435 550 }
duke@435 551 if (next_m->is_not_compilable()) { // Did fail to compile this before/
duke@435 552 msg = "caller not compilable";
duke@435 553 break;
duke@435 554 }
duke@435 555 if (next->num() > MaxRecompilationSearchLength) {
duke@435 556 // don't go up too high when searching for recompilees
duke@435 557 msg = "don't go up any further: > MaxRecompilationSearchLength";
duke@435 558 break;
duke@435 559 }
duke@435 560 if (next->distance() > MaxInterpretedSearchLength) {
duke@435 561 // don't go up too high when searching for recompilees
duke@435 562 msg = "don't go up any further: next > MaxInterpretedSearchLength";
duke@435 563 break;
duke@435 564 }
duke@435 565 // Compiled frame above already decided not to inline;
duke@435 566 // do not recompile him.
duke@435 567 if (next->is_compiled()) {
duke@435 568 msg = "not going up into optimized code";
duke@435 569 break;
duke@435 570 }
duke@435 571
duke@435 572 // Interpreted frame above us was already compiled. Do not force
duke@435 573 // a recompile, although if the frame above us runs long enough an
duke@435 574 // OSR might still happen.
duke@435 575 if( current->is_interpreted() && next_m->has_compiled_code() ) {
duke@435 576 msg = "not going up -- already compiled caller";
duke@435 577 break;
duke@435 578 }
duke@435 579
duke@435 580 // Compute how frequent this call site is. We have current method 'm'.
duke@435 581 // We know next method 'next_m' is interpreted. Find the call site and
duke@435 582 // check the various invocation counts.
duke@435 583 int invcnt = 0; // Caller counts
duke@435 584 if (ProfileInterpreter) {
duke@435 585 invcnt = next_m->interpreter_invocation_count();
duke@435 586 }
duke@435 587 int cnt = 0; // Call site counts
duke@435 588 if (ProfileInterpreter && next_m->method_data() != NULL) {
duke@435 589 ResourceMark rm;
duke@435 590 int bci = next->top_vframe()->bci();
duke@435 591 ProfileData* data = next_m->method_data()->bci_to_data(bci);
duke@435 592 if (data != NULL && data->is_CounterData())
duke@435 593 cnt = data->as_CounterData()->count();
duke@435 594 }
duke@435 595
duke@435 596 // Caller counts / call-site counts; i.e. is this call site
duke@435 597 // a hot call site for method next_m?
duke@435 598 int freq = (invcnt) ? cnt/invcnt : cnt;
duke@435 599
duke@435 600 // Check size and frequency limits
duke@435 601 if ((msg = shouldInline(m, freq, cnt)) != NULL) {
duke@435 602 break;
duke@435 603 }
duke@435 604 // Check inlining negative tests
duke@435 605 if ((msg = shouldNotInline(m)) != NULL) {
duke@435 606 break;
duke@435 607 }
duke@435 608
duke@435 609
duke@435 610 // If the caller method is too big or something then we do not want to
duke@435 611 // compile it just to inline a method
iignatyev@5032 612 if (!can_be_compiled(next_m, CompLevel_any)) {
duke@435 613 msg = "caller cannot be compiled";
duke@435 614 break;
duke@435 615 }
duke@435 616
duke@435 617 if( next_m->name() == vmSymbols::class_initializer_name() ) {
duke@435 618 msg = "do not compile class initializer (OSR ok)";
duke@435 619 break;
duke@435 620 }
duke@435 621
duke@435 622 if (TraceCompilationPolicy && Verbose) {
duke@435 623 tty->print("\n\t check caller: ");
duke@435 624 next_m->print_short_name(tty);
duke@435 625 tty->print(" ( interpreted " INTPTR_FORMAT ", size=%d ) ", (address)next_m(), next_m->code_size());
duke@435 626 }
duke@435 627
duke@435 628 current = next;
duke@435 629 }
duke@435 630
duke@435 631 assert( !current || !current->is_compiled(), "" );
duke@435 632
duke@435 633 if (TraceCompilationPolicy && msg) tty->print("(%s)\n", msg);
duke@435 634
duke@435 635 return current;
duke@435 636 }
duke@435 637
duke@435 638 RFrame* StackWalkCompPolicy::senderOf(RFrame* rf, GrowableArray<RFrame*>* stack) {
duke@435 639 RFrame* sender = rf->caller();
duke@435 640 if (sender && sender->num() == stack->length()) stack->push(sender);
duke@435 641 return sender;
duke@435 642 }
duke@435 643
duke@435 644
duke@435 645 const char* StackWalkCompPolicy::shouldInline(methodHandle m, float freq, int cnt) {
duke@435 646 // Allows targeted inlining
duke@435 647 // positive filter: should send be inlined? returns NULL (--> yes)
duke@435 648 // or rejection msg
duke@435 649 int max_size = MaxInlineSize;
duke@435 650 int cost = m->code_size();
duke@435 651
duke@435 652 // Check for too many throws (and not too huge)
duke@435 653 if (m->interpreter_throwout_count() > InlineThrowCount && cost < InlineThrowMaxSize ) {
duke@435 654 return NULL;
duke@435 655 }
duke@435 656
duke@435 657 // bump the max size if the call is frequent
duke@435 658 if ((freq >= InlineFrequencyRatio) || (cnt >= InlineFrequencyCount)) {
duke@435 659 if (TraceFrequencyInlining) {
duke@435 660 tty->print("(Inlined frequent method)\n");
duke@435 661 m->print();
duke@435 662 }
duke@435 663 max_size = FreqInlineSize;
duke@435 664 }
duke@435 665 if (cost > max_size) {
duke@435 666 return (_msg = "too big");
duke@435 667 }
duke@435 668 return NULL;
duke@435 669 }
duke@435 670
duke@435 671
duke@435 672 const char* StackWalkCompPolicy::shouldNotInline(methodHandle m) {
duke@435 673 // negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg
duke@435 674 if (m->is_abstract()) return (_msg = "abstract method");
duke@435 675 // note: we allow ik->is_abstract()
coleenp@4251 676 if (!m->method_holder()->is_initialized()) return (_msg = "method holder not initialized");
duke@435 677 if (m->is_native()) return (_msg = "native method");
duke@435 678 nmethod* m_code = m->code();
twisti@2103 679 if (m_code != NULL && m_code->code_size() > InlineSmallCode)
duke@435 680 return (_msg = "already compiled into a big method");
duke@435 681
duke@435 682 // use frequency-based objections only for non-trivial methods
duke@435 683 if (m->code_size() <= MaxTrivialSize) return NULL;
duke@435 684 if (UseInterpreter) { // don't use counts with -Xcomp
duke@435 685 if ((m->code() == NULL) && m->was_never_executed()) return (_msg = "never executed");
duke@435 686 if (!m->was_executed_more_than(MIN2(MinInliningThreshold, CompileThreshold >> 1))) return (_msg = "executed < MinInliningThreshold times");
duke@435 687 }
coleenp@4037 688 if (Method::has_unloaded_classes_in_signature(m, JavaThread::current())) return (_msg = "unloaded signature classes");
duke@435 689
duke@435 690 return NULL;
duke@435 691 }
duke@435 692
duke@435 693
duke@435 694
duke@435 695 #endif // COMPILER2

mercurial