src/share/vm/runtime/compilationPolicy.cpp

Sat, 01 Sep 2012 13:25:18 -0400

author
coleenp
date
Sat, 01 Sep 2012 13:25:18 -0400
changeset 4037
da91efe96a93
parent 3452
20334ed5ed3c
child 4111
9191895df19d
permissions
-rw-r--r--

6964458: Reimplement class meta-data storage to use native memory
Summary: Remove PermGen, allocate meta-data in metaspace linked to class loaders, rewrite GC walking, rewrite and rename metadata to be C++ classes
Reviewed-by: jmasa, stefank, never, coleenp, kvn, brutisso, mgerdin, dholmes, jrose, twisti, roland
Contributed-by: jmasa <jon.masamitsu@oracle.com>, stefank <stefan.karlsson@oracle.com>, mgerdin <mikael.gerdin@oracle.com>, never <tom.rodriguez@oracle.com>

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

mercurial