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