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