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