Tue, 11 Sep 2012 16:20:57 +0200
7195816: NPG: Crash in c1_ValueType - ShouldNotReachHere
Summary: C1 needs knowledge of T_METADATA at the LIR level.
Reviewed-by: kvn, coleenp
duke@435 | 1 | /* |
jrose@2639 | 2 | * Copyright (c) 1998, 2011, Oracle and/or its affiliates. All rights reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "classfile/systemDictionary.hpp" |
stefank@2314 | 27 | #include "classfile/vmSymbols.hpp" |
twisti@2687 | 28 | #include "compiler/compileBroker.hpp" |
stefank@2314 | 29 | #include "compiler/compileLog.hpp" |
stefank@2314 | 30 | #include "interpreter/linkResolver.hpp" |
stefank@2314 | 31 | #include "oops/objArrayKlass.hpp" |
stefank@2314 | 32 | #include "opto/callGenerator.hpp" |
stefank@2314 | 33 | #include "opto/parse.hpp" |
stefank@2314 | 34 | #include "runtime/handles.inline.hpp" |
duke@435 | 35 | |
duke@435 | 36 | //============================================================================= |
duke@435 | 37 | //------------------------------InlineTree------------------------------------- |
never@2981 | 38 | InlineTree::InlineTree(Compile* c, |
never@2981 | 39 | const InlineTree *caller_tree, ciMethod* callee, |
never@2981 | 40 | JVMState* caller_jvms, int caller_bci, |
never@2981 | 41 | float site_invoke_ratio, int max_inline_level) : |
never@2981 | 42 | C(c), |
never@2981 | 43 | _caller_jvms(caller_jvms), |
never@2981 | 44 | _caller_tree((InlineTree*) caller_tree), |
never@2981 | 45 | _method(callee), |
never@2981 | 46 | _site_invoke_ratio(site_invoke_ratio), |
never@2981 | 47 | _max_inline_level(max_inline_level), |
twisti@3097 | 48 | _count_inline_bcs(method()->code_size_for_inlining()) |
jrose@1592 | 49 | { |
duke@435 | 50 | NOT_PRODUCT(_count_inlines = 0;) |
duke@435 | 51 | if (_caller_jvms != NULL) { |
duke@435 | 52 | // Keep a private copy of the caller_jvms: |
duke@435 | 53 | _caller_jvms = new (C) JVMState(caller_jvms->method(), caller_tree->caller_jvms()); |
duke@435 | 54 | _caller_jvms->set_bci(caller_jvms->bci()); |
cfang@1335 | 55 | assert(!caller_jvms->should_reexecute(), "there should be no reexecute bytecode with inlining"); |
duke@435 | 56 | } |
duke@435 | 57 | assert(_caller_jvms->same_calls_as(caller_jvms), "consistent JVMS"); |
jrose@1592 | 58 | assert((caller_tree == NULL ? 0 : caller_tree->stack_depth() + 1) == stack_depth(), "correct (redundant) depth parameter"); |
duke@435 | 59 | assert(caller_bci == this->caller_bci(), "correct (redundant) bci parameter"); |
duke@435 | 60 | if (UseOldInlining) { |
duke@435 | 61 | // Update hierarchical counts, count_inline_bcs() and count_inlines() |
duke@435 | 62 | InlineTree *caller = (InlineTree *)caller_tree; |
duke@435 | 63 | for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) { |
duke@435 | 64 | caller->_count_inline_bcs += count_inline_bcs(); |
duke@435 | 65 | NOT_PRODUCT(caller->_count_inlines++;) |
duke@435 | 66 | } |
duke@435 | 67 | } |
duke@435 | 68 | } |
duke@435 | 69 | |
jrose@1592 | 70 | InlineTree::InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, |
never@2981 | 71 | float site_invoke_ratio, int max_inline_level) : |
never@2981 | 72 | C(c), |
never@2981 | 73 | _caller_jvms(caller_jvms), |
never@2981 | 74 | _caller_tree(NULL), |
never@2981 | 75 | _method(callee_method), |
never@2981 | 76 | _site_invoke_ratio(site_invoke_ratio), |
never@2981 | 77 | _max_inline_level(max_inline_level), |
jrose@1592 | 78 | _count_inline_bcs(method()->code_size()) |
jrose@1592 | 79 | { |
duke@435 | 80 | NOT_PRODUCT(_count_inlines = 0;) |
duke@435 | 81 | assert(!UseOldInlining, "do not use for old stuff"); |
duke@435 | 82 | } |
duke@435 | 83 | |
kvn@476 | 84 | static bool is_init_with_ea(ciMethod* callee_method, |
kvn@476 | 85 | ciMethod* caller_method, Compile* C) { |
kvn@476 | 86 | // True when EA is ON and a java constructor is called or |
kvn@476 | 87 | // a super constructor is called from an inlined java constructor. |
kvn@679 | 88 | return C->do_escape_analysis() && EliminateAllocations && |
kvn@476 | 89 | ( callee_method->is_initializer() || |
kvn@476 | 90 | (caller_method->is_initializer() && |
kvn@476 | 91 | caller_method != C->method() && |
kvn@476 | 92 | caller_method->holder()->is_subclass_of(callee_method->holder())) |
kvn@476 | 93 | ); |
kvn@476 | 94 | } |
kvn@476 | 95 | |
twisti@3969 | 96 | // positive filter: should callee be inlined? returns NULL, if yes, or rejection msg |
twisti@2898 | 97 | const char* InlineTree::should_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const { |
duke@435 | 98 | // Allows targeted inlining |
duke@435 | 99 | if(callee_method->should_inline()) { |
duke@435 | 100 | *wci_result = *(WarmCallInfo::always_hot()); |
duke@435 | 101 | if (PrintInlining && Verbose) { |
never@2981 | 102 | CompileTask::print_inline_indent(inline_level()); |
duke@435 | 103 | tty->print_cr("Inlined method is hot: "); |
duke@435 | 104 | } |
duke@435 | 105 | return NULL; |
duke@435 | 106 | } |
duke@435 | 107 | |
duke@435 | 108 | // positive filter: should send be inlined? returns NULL (--> yes) |
duke@435 | 109 | // or rejection msg |
twisti@3097 | 110 | int size = callee_method->code_size_for_inlining(); |
duke@435 | 111 | |
duke@435 | 112 | // Check for too many throws (and not too huge) |
kvn@476 | 113 | if(callee_method->interpreter_throwout_count() > InlineThrowCount && |
kvn@476 | 114 | size < InlineThrowMaxSize ) { |
duke@435 | 115 | wci_result->set_profit(wci_result->profit() * 100); |
duke@435 | 116 | if (PrintInlining && Verbose) { |
never@2981 | 117 | CompileTask::print_inline_indent(inline_level()); |
duke@435 | 118 | tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count()); |
duke@435 | 119 | } |
duke@435 | 120 | return NULL; |
duke@435 | 121 | } |
duke@435 | 122 | |
duke@435 | 123 | if (!UseOldInlining) { |
duke@435 | 124 | return NULL; // size and frequency are represented in a new way |
duke@435 | 125 | } |
duke@435 | 126 | |
twisti@2898 | 127 | int default_max_inline_size = C->max_inline_size(); |
twisti@2898 | 128 | int inline_small_code_size = InlineSmallCode / 4; |
twisti@2898 | 129 | int max_inline_size = default_max_inline_size; |
twisti@2898 | 130 | |
duke@435 | 131 | int call_site_count = method()->scale_count(profile.count()); |
duke@435 | 132 | int invoke_count = method()->interpreter_invocation_count(); |
twisti@2898 | 133 | |
twisti@2898 | 134 | assert(invoke_count != 0, "require invocation count greater than zero"); |
twisti@2898 | 135 | int freq = call_site_count / invoke_count; |
kvn@476 | 136 | |
duke@435 | 137 | // bump the max size if the call is frequent |
kvn@476 | 138 | if ((freq >= InlineFrequencyRatio) || |
kvn@476 | 139 | (call_site_count >= InlineFrequencyCount) || |
kvn@476 | 140 | is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 141 | |
twisti@2898 | 142 | max_inline_size = C->freq_inline_size(); |
twisti@2898 | 143 | if (size <= max_inline_size && TraceFrequencyInlining) { |
never@2981 | 144 | CompileTask::print_inline_indent(inline_level()); |
duke@435 | 145 | tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count); |
never@2981 | 146 | CompileTask::print_inline_indent(inline_level()); |
duke@435 | 147 | callee_method->print(); |
duke@435 | 148 | tty->cr(); |
duke@435 | 149 | } |
duke@435 | 150 | } else { |
duke@435 | 151 | // Not hot. Check for medium-sized pre-existing nmethod at cold sites. |
kvn@476 | 152 | if (callee_method->has_compiled_code() && |
twisti@2898 | 153 | callee_method->instructions_size(CompLevel_full_optimization) > inline_small_code_size) |
duke@435 | 154 | return "already compiled into a medium method"; |
duke@435 | 155 | } |
twisti@2898 | 156 | if (size > max_inline_size) { |
twisti@2898 | 157 | if (max_inline_size > default_max_inline_size) |
duke@435 | 158 | return "hot method too big"; |
duke@435 | 159 | return "too big"; |
duke@435 | 160 | } |
duke@435 | 161 | return NULL; |
duke@435 | 162 | } |
duke@435 | 163 | |
duke@435 | 164 | |
twisti@3969 | 165 | // negative filter: should callee NOT be inlined? returns NULL, ok to inline, or rejection msg |
twisti@2898 | 166 | const char* InlineTree::should_not_inline(ciMethod *callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const { |
duke@435 | 167 | // negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg |
duke@435 | 168 | if (!UseOldInlining) { |
duke@435 | 169 | const char* fail = NULL; |
twisti@3969 | 170 | if ( callee_method->is_abstract()) fail = "abstract method"; |
duke@435 | 171 | // note: we allow ik->is_abstract() |
twisti@3969 | 172 | if (!callee_method->holder()->is_initialized()) fail = "method holder not initialized"; |
twisti@3969 | 173 | if ( callee_method->is_native()) fail = "native method"; |
twisti@3969 | 174 | if ( callee_method->dont_inline()) fail = "don't inline by annotation"; |
duke@435 | 175 | |
duke@435 | 176 | if (fail) { |
duke@435 | 177 | *wci_result = *(WarmCallInfo::always_cold()); |
duke@435 | 178 | return fail; |
duke@435 | 179 | } |
duke@435 | 180 | |
duke@435 | 181 | if (callee_method->has_unloaded_classes_in_signature()) { |
duke@435 | 182 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 183 | } |
duke@435 | 184 | |
duke@435 | 185 | // don't inline exception code unless the top method belongs to an |
duke@435 | 186 | // exception class |
duke@435 | 187 | if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 188 | ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method(); |
duke@435 | 189 | if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 190 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 191 | } |
duke@435 | 192 | } |
duke@435 | 193 | |
twisti@3969 | 194 | if (callee_method->has_compiled_code() && |
twisti@3969 | 195 | callee_method->instructions_size(CompLevel_full_optimization) > InlineSmallCode) { |
duke@435 | 196 | wci_result->set_profit(wci_result->profit() * 0.1); |
duke@435 | 197 | // %%% adjust wci_result->size()? |
duke@435 | 198 | } |
duke@435 | 199 | |
duke@435 | 200 | return NULL; |
duke@435 | 201 | } |
duke@435 | 202 | |
twisti@3969 | 203 | // First check all inlining restrictions which are required for correctness |
twisti@3969 | 204 | if ( callee_method->is_abstract()) return "abstract method"; |
twisti@3969 | 205 | // note: we allow ik->is_abstract() |
twisti@3969 | 206 | if (!callee_method->holder()->is_initialized()) return "method holder not initialized"; |
twisti@3969 | 207 | if ( callee_method->is_native()) return "native method"; |
twisti@3969 | 208 | if ( callee_method->dont_inline()) return "don't inline by annotation"; |
twisti@3969 | 209 | if ( callee_method->has_unloaded_classes_in_signature()) return "unloaded signature classes"; |
twisti@1573 | 210 | |
twisti@3969 | 211 | if (callee_method->force_inline() || callee_method->should_inline()) { |
duke@435 | 212 | // ignore heuristic controls on inlining |
duke@435 | 213 | return NULL; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | // Now perform checks which are heuristic |
duke@435 | 217 | |
twisti@3969 | 218 | if (callee_method->has_compiled_code() && |
twisti@3969 | 219 | callee_method->instructions_size(CompLevel_full_optimization) > InlineSmallCode) { |
duke@435 | 220 | return "already compiled into a big method"; |
twisti@3969 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | // don't inline exception code unless the top method belongs to an |
duke@435 | 224 | // exception class |
duke@435 | 225 | if (caller_tree() != NULL && |
duke@435 | 226 | callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) { |
duke@435 | 227 | const InlineTree *top = this; |
duke@435 | 228 | while (top->caller_tree() != NULL) top = top->caller_tree(); |
duke@435 | 229 | ciInstanceKlass* k = top->method()->holder(); |
duke@435 | 230 | if (!k->is_subclass_of(C->env()->Throwable_klass())) |
duke@435 | 231 | return "exception method"; |
duke@435 | 232 | } |
duke@435 | 233 | |
never@3653 | 234 | if (callee_method->should_not_inline()) { |
never@3653 | 235 | return "disallowed by CompilerOracle"; |
never@3653 | 236 | } |
never@3653 | 237 | |
never@3653 | 238 | if (UseStringCache) { |
never@3653 | 239 | // Do not inline StringCache::profile() method used only at the beginning. |
never@3653 | 240 | if (callee_method->name() == ciSymbol::profile_name() && |
never@3653 | 241 | callee_method->holder()->name() == ciSymbol::java_lang_StringCache()) { |
never@3653 | 242 | return "profiling method"; |
never@3653 | 243 | } |
never@3653 | 244 | } |
never@3653 | 245 | |
duke@435 | 246 | // use frequency-based objections only for non-trivial methods |
twisti@3969 | 247 | if (callee_method->code_size() <= MaxTrivialSize) return NULL; |
kvn@476 | 248 | |
kvn@476 | 249 | // don't use counts with -Xcomp or CTW |
kvn@476 | 250 | if (UseInterpreter && !CompileTheWorld) { |
kvn@476 | 251 | |
kvn@476 | 252 | if (!callee_method->has_compiled_code() && |
kvn@476 | 253 | !callee_method->was_executed_more_than(0)) { |
kvn@476 | 254 | return "never executed"; |
kvn@476 | 255 | } |
kvn@476 | 256 | |
kvn@476 | 257 | if (is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 258 | |
kvn@476 | 259 | // Escape Analysis: inline all executed constructors |
kvn@476 | 260 | |
kvn@476 | 261 | } else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold, |
kvn@476 | 262 | CompileThreshold >> 1))) { |
kvn@476 | 263 | return "executed < MinInliningThreshold times"; |
kvn@476 | 264 | } |
duke@435 | 265 | } |
duke@435 | 266 | |
duke@435 | 267 | return NULL; |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | //-----------------------------try_to_inline----------------------------------- |
duke@435 | 271 | // return NULL if ok, reason for not inlining otherwise |
duke@435 | 272 | // Relocated from "InliningClosure::try_to_inline" |
kvn@476 | 273 | const char* InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) { |
duke@435 | 274 | |
duke@435 | 275 | // Old algorithm had funny accumulating BC-size counters |
duke@435 | 276 | if (UseOldInlining && ClipInlining |
duke@435 | 277 | && (int)count_inline_bcs() >= DesiredMethodLimit) { |
duke@435 | 278 | return "size > DesiredMethodLimit"; |
duke@435 | 279 | } |
duke@435 | 280 | |
duke@435 | 281 | const char *msg = NULL; |
twisti@2898 | 282 | msg = should_inline(callee_method, caller_method, caller_bci, profile, wci_result); |
twisti@2898 | 283 | if (msg != NULL) |
kvn@476 | 284 | return msg; |
twisti@2898 | 285 | |
twisti@2898 | 286 | msg = should_not_inline(callee_method, caller_method, wci_result); |
twisti@2898 | 287 | if (msg != NULL) |
kvn@476 | 288 | return msg; |
duke@435 | 289 | |
jrose@1592 | 290 | if (InlineAccessors && callee_method->is_accessor()) { |
jrose@1592 | 291 | // accessor methods are not subject to any of the following limits. |
jrose@1592 | 292 | return NULL; |
jrose@1592 | 293 | } |
duke@435 | 294 | |
duke@435 | 295 | // suppress a few checks for accessors and trivial methods |
twisti@3969 | 296 | if (callee_method->code_size() > MaxTrivialSize) { |
kvn@476 | 297 | |
duke@435 | 298 | // don't inline into giant methods |
kvn@476 | 299 | if (C->unique() > (uint)NodeCountInliningCutoff) { |
kvn@476 | 300 | return "NodeCountInliningCutoff"; |
kvn@476 | 301 | } |
duke@435 | 302 | |
kvn@476 | 303 | if ((!UseInterpreter || CompileTheWorld) && |
kvn@476 | 304 | is_init_with_ea(callee_method, caller_method, C)) { |
kvn@476 | 305 | |
kvn@476 | 306 | // Escape Analysis stress testing when running Xcomp or CTW: |
kvn@476 | 307 | // inline constructors even if they are not reached. |
kvn@476 | 308 | |
kvn@476 | 309 | } else if (profile.count() == 0) { |
kvn@476 | 310 | // don't inline unreached call sites |
kvn@476 | 311 | return "call site not reached"; |
kvn@476 | 312 | } |
duke@435 | 313 | } |
duke@435 | 314 | |
jrose@1592 | 315 | if (!C->do_inlining() && InlineAccessors) { |
kvn@476 | 316 | return "not an accessor"; |
kvn@476 | 317 | } |
never@2981 | 318 | if (inline_level() > _max_inline_level) { |
kvn@476 | 319 | return "inlining too deep"; |
kvn@476 | 320 | } |
twisti@2687 | 321 | |
twisti@2866 | 322 | // detect direct and indirect recursive inlining |
twisti@3969 | 323 | if (!callee_method->is_compiled_lambda_form()) { |
twisti@2866 | 324 | // count the current method and the callee |
twisti@2866 | 325 | int inline_level = (method() == callee_method) ? 1 : 0; |
twisti@2866 | 326 | if (inline_level > MaxRecursiveInlineLevel) |
twisti@2866 | 327 | return "recursively inlining too deep"; |
twisti@2866 | 328 | // count callers of current method and callee |
twisti@2687 | 329 | JVMState* jvms = caller_jvms(); |
twisti@2687 | 330 | while (jvms != NULL && jvms->has_method()) { |
twisti@2687 | 331 | if (jvms->method() == callee_method) { |
twisti@2687 | 332 | inline_level++; |
twisti@2687 | 333 | if (inline_level > MaxRecursiveInlineLevel) |
twisti@2687 | 334 | return "recursively inlining too deep"; |
twisti@2687 | 335 | } |
twisti@2687 | 336 | jvms = jvms->caller(); |
twisti@2687 | 337 | } |
twisti@2687 | 338 | } |
twisti@2687 | 339 | |
twisti@3097 | 340 | int size = callee_method->code_size_for_inlining(); |
duke@435 | 341 | |
duke@435 | 342 | if (UseOldInlining && ClipInlining |
duke@435 | 343 | && (int)count_inline_bcs() + size >= DesiredMethodLimit) { |
duke@435 | 344 | return "size > DesiredMethodLimit"; |
duke@435 | 345 | } |
duke@435 | 346 | |
duke@435 | 347 | // ok, inline this method |
duke@435 | 348 | return NULL; |
duke@435 | 349 | } |
duke@435 | 350 | |
duke@435 | 351 | //------------------------------pass_initial_checks---------------------------- |
duke@435 | 352 | bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) { |
duke@435 | 353 | ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL; |
duke@435 | 354 | // Check if a callee_method was suggested |
duke@435 | 355 | if( callee_method == NULL ) return false; |
duke@435 | 356 | // Check if klass of callee_method is loaded |
duke@435 | 357 | if( !callee_holder->is_loaded() ) return false; |
duke@435 | 358 | if( !callee_holder->is_initialized() ) return false; |
duke@435 | 359 | if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) { |
duke@435 | 360 | // Checks that constant pool's call site has been visited |
duke@435 | 361 | // stricter than callee_holder->is_initialized() |
duke@435 | 362 | ciBytecodeStream iter(caller_method); |
duke@435 | 363 | iter.force_bci(caller_bci); |
duke@435 | 364 | Bytecodes::Code call_bc = iter.cur_bc(); |
twisti@1572 | 365 | // An invokedynamic instruction does not have a klass. |
twisti@1572 | 366 | if (call_bc != Bytecodes::_invokedynamic) { |
jrose@1920 | 367 | int index = iter.get_index_u2_cpcache(); |
twisti@1572 | 368 | if (!caller_method->is_klass_loaded(index, true)) { |
twisti@1572 | 369 | return false; |
twisti@1572 | 370 | } |
twisti@1572 | 371 | // Try to do constant pool resolution if running Xcomp |
twisti@1572 | 372 | if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) { |
twisti@1572 | 373 | return false; |
twisti@1572 | 374 | } |
duke@435 | 375 | } |
duke@435 | 376 | } |
duke@435 | 377 | // We will attempt to see if a class/field/etc got properly loaded. If it |
duke@435 | 378 | // did not, it may attempt to throw an exception during our probing. Catch |
duke@435 | 379 | // and ignore such exceptions and do not attempt to compile the method. |
duke@435 | 380 | if( callee_method->should_exclude() ) return false; |
duke@435 | 381 | |
duke@435 | 382 | return true; |
duke@435 | 383 | } |
duke@435 | 384 | |
twisti@3100 | 385 | //------------------------------check_can_parse-------------------------------- |
twisti@3100 | 386 | const char* InlineTree::check_can_parse(ciMethod* callee) { |
twisti@3100 | 387 | // Certain methods cannot be parsed at all: |
twisti@3100 | 388 | if ( callee->is_native()) return "native method"; |
twisti@3969 | 389 | if ( callee->is_abstract()) return "abstract method"; |
twisti@3100 | 390 | if (!callee->can_be_compiled()) return "not compilable (disabled)"; |
twisti@3100 | 391 | if (!callee->has_balanced_monitors()) return "not compilable (unbalanced monitors)"; |
twisti@3100 | 392 | if ( callee->get_flow_analysis()->failing()) return "not compilable (flow analysis failed)"; |
twisti@3100 | 393 | return NULL; |
twisti@3100 | 394 | } |
twisti@3100 | 395 | |
duke@435 | 396 | //------------------------------print_inlining--------------------------------- |
duke@435 | 397 | // Really, the failure_msg can be a success message also. |
twisti@2687 | 398 | void InlineTree::print_inlining(ciMethod* callee_method, int caller_bci, const char* failure_msg) const { |
never@2981 | 399 | CompileTask::print_inlining(callee_method, inline_level(), caller_bci, failure_msg ? failure_msg : "inline"); |
twisti@2687 | 400 | if (callee_method == NULL) tty->print(" callee not monotonic or profiled"); |
twisti@2687 | 401 | if (Verbose && callee_method) { |
duke@435 | 402 | const InlineTree *top = this; |
duke@435 | 403 | while( top->caller_tree() != NULL ) { top = top->caller_tree(); } |
twisti@3969 | 404 | //tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count()); |
duke@435 | 405 | } |
duke@435 | 406 | } |
duke@435 | 407 | |
duke@435 | 408 | //------------------------------ok_to_inline----------------------------------- |
duke@435 | 409 | WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci) { |
duke@435 | 410 | assert(callee_method != NULL, "caller checks for optimized virtual!"); |
duke@435 | 411 | #ifdef ASSERT |
duke@435 | 412 | // Make sure the incoming jvms has the same information content as me. |
duke@435 | 413 | // This means that we can eventually make this whole class AllStatic. |
duke@435 | 414 | if (jvms->caller() == NULL) { |
duke@435 | 415 | assert(_caller_jvms == NULL, "redundant instance state"); |
duke@435 | 416 | } else { |
duke@435 | 417 | assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state"); |
duke@435 | 418 | } |
duke@435 | 419 | assert(_method == jvms->method(), "redundant instance state"); |
duke@435 | 420 | #endif |
duke@435 | 421 | const char *failure_msg = NULL; |
duke@435 | 422 | int caller_bci = jvms->bci(); |
duke@435 | 423 | ciMethod *caller_method = jvms->method(); |
duke@435 | 424 | |
twisti@3100 | 425 | // Do some initial checks. |
twisti@3100 | 426 | if (!pass_initial_checks(caller_method, caller_bci, callee_method)) { |
twisti@3969 | 427 | if (PrintInlining) print_inlining(callee_method, caller_bci, "failed initial checks"); |
duke@435 | 428 | return NULL; |
duke@435 | 429 | } |
duke@435 | 430 | |
twisti@3100 | 431 | // Do some parse checks. |
twisti@3100 | 432 | failure_msg = check_can_parse(callee_method); |
twisti@3100 | 433 | if (failure_msg != NULL) { |
twisti@3100 | 434 | if (PrintInlining) print_inlining(callee_method, caller_bci, failure_msg); |
twisti@3100 | 435 | return NULL; |
twisti@3100 | 436 | } |
twisti@3100 | 437 | |
duke@435 | 438 | // Check if inlining policy says no. |
duke@435 | 439 | WarmCallInfo wci = *(initial_wci); |
kvn@476 | 440 | failure_msg = try_to_inline(callee_method, caller_method, caller_bci, profile, &wci); |
duke@435 | 441 | if (failure_msg != NULL && C->log() != NULL) { |
duke@435 | 442 | C->log()->begin_elem("inline_fail reason='"); |
duke@435 | 443 | C->log()->text("%s", failure_msg); |
duke@435 | 444 | C->log()->end_elem("'"); |
duke@435 | 445 | } |
duke@435 | 446 | |
duke@435 | 447 | #ifndef PRODUCT |
duke@435 | 448 | if (UseOldInlining && InlineWarmCalls |
duke@435 | 449 | && (PrintOpto || PrintOptoInlining || PrintInlining)) { |
duke@435 | 450 | bool cold = wci.is_cold(); |
duke@435 | 451 | bool hot = !cold && wci.is_hot(); |
duke@435 | 452 | bool old_cold = (failure_msg != NULL); |
duke@435 | 453 | if (old_cold != cold || (Verbose || WizardMode)) { |
duke@435 | 454 | tty->print(" OldInlining= %4s : %s\n WCI=", |
duke@435 | 455 | old_cold ? "cold" : "hot", failure_msg ? failure_msg : "OK"); |
duke@435 | 456 | wci.print(); |
duke@435 | 457 | } |
duke@435 | 458 | } |
duke@435 | 459 | #endif |
duke@435 | 460 | if (UseOldInlining) { |
duke@435 | 461 | if (failure_msg == NULL) |
duke@435 | 462 | wci = *(WarmCallInfo::always_hot()); |
duke@435 | 463 | else |
duke@435 | 464 | wci = *(WarmCallInfo::always_cold()); |
duke@435 | 465 | } |
duke@435 | 466 | if (!InlineWarmCalls) { |
duke@435 | 467 | if (!wci.is_cold() && !wci.is_hot()) { |
duke@435 | 468 | // Do not inline the warm calls. |
duke@435 | 469 | wci = *(WarmCallInfo::always_cold()); |
duke@435 | 470 | } |
duke@435 | 471 | } |
duke@435 | 472 | |
duke@435 | 473 | if (!wci.is_cold()) { |
duke@435 | 474 | // In -UseOldInlining, the failure_msg may also be a success message. |
duke@435 | 475 | if (failure_msg == NULL) failure_msg = "inline (hot)"; |
duke@435 | 476 | |
duke@435 | 477 | // Inline! |
twisti@3100 | 478 | if (PrintInlining) print_inlining(callee_method, caller_bci, failure_msg); |
duke@435 | 479 | if (UseOldInlining) |
duke@435 | 480 | build_inline_tree_for_callee(callee_method, jvms, caller_bci); |
duke@435 | 481 | if (InlineWarmCalls && !wci.is_hot()) |
duke@435 | 482 | return new (C) WarmCallInfo(wci); // copy to heap |
duke@435 | 483 | return WarmCallInfo::always_hot(); |
duke@435 | 484 | } |
duke@435 | 485 | |
duke@435 | 486 | // Do not inline |
duke@435 | 487 | if (failure_msg == NULL) failure_msg = "too cold to inline"; |
twisti@3100 | 488 | if (PrintInlining) print_inlining(callee_method, caller_bci, failure_msg); |
duke@435 | 489 | return NULL; |
duke@435 | 490 | } |
duke@435 | 491 | |
duke@435 | 492 | //------------------------------compute_callee_frequency----------------------- |
duke@435 | 493 | float InlineTree::compute_callee_frequency( int caller_bci ) const { |
duke@435 | 494 | int count = method()->interpreter_call_site_count(caller_bci); |
duke@435 | 495 | int invcnt = method()->interpreter_invocation_count(); |
duke@435 | 496 | float freq = (float)count/(float)invcnt; |
duke@435 | 497 | // Call-site count / interpreter invocation count, scaled recursively. |
duke@435 | 498 | // Always between 0.0 and 1.0. Represents the percentage of the method's |
duke@435 | 499 | // total execution time used at this call site. |
duke@435 | 500 | |
duke@435 | 501 | return freq; |
duke@435 | 502 | } |
duke@435 | 503 | |
duke@435 | 504 | //------------------------------build_inline_tree_for_callee------------------- |
duke@435 | 505 | InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) { |
duke@435 | 506 | float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci); |
duke@435 | 507 | // Attempt inlining. |
duke@435 | 508 | InlineTree* old_ilt = callee_at(caller_bci, callee_method); |
duke@435 | 509 | if (old_ilt != NULL) { |
duke@435 | 510 | return old_ilt; |
duke@435 | 511 | } |
never@2981 | 512 | int max_inline_level_adjust = 0; |
jrose@1592 | 513 | if (caller_jvms->method() != NULL) { |
twisti@3969 | 514 | if (caller_jvms->method()->is_compiled_lambda_form()) |
never@2981 | 515 | max_inline_level_adjust += 1; // don't count actions in MH or indy adapter frames |
twisti@3969 | 516 | else if (callee_method->is_method_handle_intrinsic() || |
twisti@3969 | 517 | callee_method->is_compiled_lambda_form()) { |
never@2981 | 518 | max_inline_level_adjust += 1; // don't count method handle calls from java.lang.invoke implem |
jrose@1592 | 519 | } |
never@2981 | 520 | if (max_inline_level_adjust != 0 && PrintInlining && (Verbose || WizardMode)) { |
never@2981 | 521 | CompileTask::print_inline_indent(inline_level()); |
twisti@2898 | 522 | tty->print_cr(" \\-> discounting inline depth"); |
jrose@1592 | 523 | } |
never@2981 | 524 | if (max_inline_level_adjust != 0 && C->log()) { |
jrose@1592 | 525 | int id1 = C->log()->identify(caller_jvms->method()); |
jrose@1592 | 526 | int id2 = C->log()->identify(callee_method); |
never@2981 | 527 | C->log()->elem("inline_level_discount caller='%d' callee='%d'", id1, id2); |
jrose@1592 | 528 | } |
jrose@1592 | 529 | } |
never@2981 | 530 | InlineTree* ilt = new InlineTree(C, this, callee_method, caller_jvms, caller_bci, recur_frequency, _max_inline_level + max_inline_level_adjust); |
never@2981 | 531 | _subtrees.append(ilt); |
duke@435 | 532 | |
duke@435 | 533 | NOT_PRODUCT( _count_inlines += 1; ) |
duke@435 | 534 | |
duke@435 | 535 | return ilt; |
duke@435 | 536 | } |
duke@435 | 537 | |
duke@435 | 538 | |
duke@435 | 539 | //---------------------------------------callee_at----------------------------- |
duke@435 | 540 | InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const { |
duke@435 | 541 | for (int i = 0; i < _subtrees.length(); i++) { |
duke@435 | 542 | InlineTree* sub = _subtrees.at(i); |
duke@435 | 543 | if (sub->caller_bci() == bci && callee == sub->method()) { |
duke@435 | 544 | return sub; |
duke@435 | 545 | } |
duke@435 | 546 | } |
duke@435 | 547 | return NULL; |
duke@435 | 548 | } |
duke@435 | 549 | |
duke@435 | 550 | |
duke@435 | 551 | //------------------------------build_inline_tree_root------------------------- |
duke@435 | 552 | InlineTree *InlineTree::build_inline_tree_root() { |
duke@435 | 553 | Compile* C = Compile::current(); |
duke@435 | 554 | |
duke@435 | 555 | // Root of inline tree |
never@2981 | 556 | InlineTree* ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F, MaxInlineLevel); |
duke@435 | 557 | |
duke@435 | 558 | return ilt; |
duke@435 | 559 | } |
duke@435 | 560 | |
duke@435 | 561 | |
duke@435 | 562 | //-------------------------find_subtree_from_root----------------------------- |
duke@435 | 563 | // Given a jvms, which determines a call chain from the root method, |
duke@435 | 564 | // find the corresponding inline tree. |
duke@435 | 565 | // Note: This method will be removed or replaced as InlineTree goes away. |
twisti@3969 | 566 | InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee) { |
duke@435 | 567 | InlineTree* iltp = root; |
duke@435 | 568 | uint depth = jvms && jvms->has_method() ? jvms->depth() : 0; |
duke@435 | 569 | for (uint d = 1; d <= depth; d++) { |
duke@435 | 570 | JVMState* jvmsp = jvms->of_depth(d); |
duke@435 | 571 | // Select the corresponding subtree for this bci. |
duke@435 | 572 | assert(jvmsp->method() == iltp->method(), "tree still in sync"); |
duke@435 | 573 | ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method(); |
duke@435 | 574 | InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee); |
twisti@3969 | 575 | if (sub == NULL) { |
twisti@3969 | 576 | if (d == depth) { |
twisti@3969 | 577 | sub = iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci()); |
duke@435 | 578 | } |
twisti@3969 | 579 | guarantee(sub != NULL, "should be a sub-ilt here"); |
twisti@3969 | 580 | return sub; |
duke@435 | 581 | } |
duke@435 | 582 | iltp = sub; |
duke@435 | 583 | } |
duke@435 | 584 | return iltp; |
duke@435 | 585 | } |
never@3138 | 586 | |
never@3138 | 587 | |
never@3138 | 588 | |
never@3138 | 589 | #ifndef PRODUCT |
never@3138 | 590 | void InlineTree::print_impl(outputStream* st, int indent) const { |
never@3138 | 591 | for (int i = 0; i < indent; i++) st->print(" "); |
never@3138 | 592 | st->print(" @ %d ", caller_bci()); |
never@3138 | 593 | method()->print_short_name(st); |
never@3138 | 594 | st->cr(); |
never@3138 | 595 | |
never@3138 | 596 | for (int i = 0 ; i < _subtrees.length(); i++) { |
never@3138 | 597 | _subtrees.at(i)->print_impl(st, indent + 2); |
never@3138 | 598 | } |
never@3138 | 599 | } |
never@3138 | 600 | |
never@3138 | 601 | void InlineTree::print_value_on(outputStream* st) const { |
never@3138 | 602 | print_impl(st, 2); |
never@3138 | 603 | } |
never@3138 | 604 | #endif |