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