annotate src/share/vm/opto/bytecodeInfo.cpp @ 196:d1605aabd0a1

6719955: Update copyright year Summary: Update copyright year for files that have been modified in 2008 Reviewed-by: ohair, tbell
author xdono
date Wed, 02 Jul 2008 12:55:16 -0700
parents 874b2c4f43d1
children 4a4c365f777d
rev   line source
duke@0 1 /*
xdono@196 2 * Copyright 1998-2008 Sun Microsystems, Inc. All Rights Reserved.
duke@0 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@0 4 *
duke@0 5 * This code is free software; you can redistribute it and/or modify it
duke@0 6 * under the terms of the GNU General Public License version 2 only, as
duke@0 7 * published by the Free Software Foundation.
duke@0 8 *
duke@0 9 * This code is distributed in the hope that it will be useful, but WITHOUT
duke@0 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@0 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
duke@0 12 * version 2 for more details (a copy is included in the LICENSE file that
duke@0 13 * accompanied this code).
duke@0 14 *
duke@0 15 * You should have received a copy of the GNU General Public License version
duke@0 16 * 2 along with this work; if not, write to the Free Software Foundation,
duke@0 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@0 18 *
duke@0 19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@0 20 * CA 95054 USA or visit www.sun.com if you need additional information or
duke@0 21 * have any questions.
duke@0 22 *
duke@0 23 */
duke@0 24
duke@0 25 #include "incls/_precompiled.incl"
duke@0 26 #include "incls/_bytecodeInfo.cpp.incl"
duke@0 27
duke@0 28 // These variables are declared in parse1.cpp
duke@0 29 extern int explicit_null_checks_inserted;
duke@0 30 extern int explicit_null_checks_elided;
duke@0 31 extern int explicit_null_checks_inserted_old;
duke@0 32 extern int explicit_null_checks_elided_old;
duke@0 33 extern int nodes_created_old;
duke@0 34 extern int nodes_created;
duke@0 35 extern int methods_parsed_old;
duke@0 36 extern int methods_parsed;
duke@0 37 extern int methods_seen;
duke@0 38 extern int methods_seen_old;
duke@0 39
duke@0 40
duke@0 41 //=============================================================================
duke@0 42 //------------------------------InlineTree-------------------------------------
duke@0 43 InlineTree::InlineTree( Compile* c, const InlineTree *caller_tree, ciMethod* callee, JVMState* caller_jvms, int caller_bci, float site_invoke_ratio )
duke@0 44 : C(c), _caller_jvms(caller_jvms),
duke@0 45 _caller_tree((InlineTree*)caller_tree),
duke@0 46 _method(callee), _site_invoke_ratio(site_invoke_ratio),
duke@0 47 _count_inline_bcs(method()->code_size()) {
duke@0 48 NOT_PRODUCT(_count_inlines = 0;)
duke@0 49 if (_caller_jvms != NULL) {
duke@0 50 // Keep a private copy of the caller_jvms:
duke@0 51 _caller_jvms = new (C) JVMState(caller_jvms->method(), caller_tree->caller_jvms());
duke@0 52 _caller_jvms->set_bci(caller_jvms->bci());
duke@0 53 }
duke@0 54 assert(_caller_jvms->same_calls_as(caller_jvms), "consistent JVMS");
duke@0 55 assert((caller_tree == NULL ? 0 : caller_tree->inline_depth() + 1) == inline_depth(), "correct (redundant) depth parameter");
duke@0 56 assert(caller_bci == this->caller_bci(), "correct (redundant) bci parameter");
duke@0 57 if (UseOldInlining) {
duke@0 58 // Update hierarchical counts, count_inline_bcs() and count_inlines()
duke@0 59 InlineTree *caller = (InlineTree *)caller_tree;
duke@0 60 for( ; caller != NULL; caller = ((InlineTree *)(caller->caller_tree())) ) {
duke@0 61 caller->_count_inline_bcs += count_inline_bcs();
duke@0 62 NOT_PRODUCT(caller->_count_inlines++;)
duke@0 63 }
duke@0 64 }
duke@0 65 }
duke@0 66
duke@0 67 InlineTree::InlineTree(Compile* c, ciMethod* callee_method, JVMState* caller_jvms, float site_invoke_ratio)
duke@0 68 : C(c), _caller_jvms(caller_jvms), _caller_tree(NULL),
duke@0 69 _method(callee_method), _site_invoke_ratio(site_invoke_ratio),
duke@0 70 _count_inline_bcs(method()->code_size()) {
duke@0 71 NOT_PRODUCT(_count_inlines = 0;)
duke@0 72 assert(!UseOldInlining, "do not use for old stuff");
duke@0 73 }
duke@0 74
duke@0 75
duke@0 76
duke@0 77 static void print_indent(int depth) {
duke@0 78 tty->print(" ");
duke@0 79 for (int i = depth; i != 0; --i) tty->print(" ");
duke@0 80 }
duke@0 81
kvn@41 82 static bool is_init_with_ea(ciMethod* callee_method,
kvn@41 83 ciMethod* caller_method, Compile* C) {
kvn@41 84 // True when EA is ON and a java constructor is called or
kvn@41 85 // a super constructor is called from an inlined java constructor.
kvn@41 86 return DoEscapeAnalysis && EliminateAllocations &&
kvn@41 87 ( callee_method->is_initializer() ||
kvn@41 88 (caller_method->is_initializer() &&
kvn@41 89 caller_method != C->method() &&
kvn@41 90 caller_method->holder()->is_subclass_of(callee_method->holder()))
kvn@41 91 );
kvn@41 92 }
kvn@41 93
duke@0 94 // positive filter: should send be inlined? returns NULL, if yes, or rejection msg
kvn@41 95 const char* InlineTree::shouldInline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) const {
duke@0 96 // Allows targeted inlining
duke@0 97 if(callee_method->should_inline()) {
duke@0 98 *wci_result = *(WarmCallInfo::always_hot());
duke@0 99 if (PrintInlining && Verbose) {
duke@0 100 print_indent(inline_depth());
duke@0 101 tty->print_cr("Inlined method is hot: ");
duke@0 102 }
duke@0 103 return NULL;
duke@0 104 }
duke@0 105
duke@0 106 // positive filter: should send be inlined? returns NULL (--> yes)
duke@0 107 // or rejection msg
duke@0 108 int max_size = C->max_inline_size();
duke@0 109 int size = callee_method->code_size();
duke@0 110
duke@0 111 // Check for too many throws (and not too huge)
kvn@41 112 if(callee_method->interpreter_throwout_count() > InlineThrowCount &&
kvn@41 113 size < InlineThrowMaxSize ) {
duke@0 114 wci_result->set_profit(wci_result->profit() * 100);
duke@0 115 if (PrintInlining && Verbose) {
duke@0 116 print_indent(inline_depth());
duke@0 117 tty->print_cr("Inlined method with many throws (throws=%d):", callee_method->interpreter_throwout_count());
duke@0 118 }
duke@0 119 return NULL;
duke@0 120 }
duke@0 121
duke@0 122 if (!UseOldInlining) {
duke@0 123 return NULL; // size and frequency are represented in a new way
duke@0 124 }
duke@0 125
duke@0 126 int call_site_count = method()->scale_count(profile.count());
duke@0 127 int invoke_count = method()->interpreter_invocation_count();
duke@0 128 assert( invoke_count != 0, "Require invokation count greater than zero");
duke@0 129 int freq = call_site_count/invoke_count;
kvn@41 130
duke@0 131 // bump the max size if the call is frequent
kvn@41 132 if ((freq >= InlineFrequencyRatio) ||
kvn@41 133 (call_site_count >= InlineFrequencyCount) ||
kvn@41 134 is_init_with_ea(callee_method, caller_method, C)) {
kvn@41 135
duke@0 136 max_size = C->freq_inline_size();
duke@0 137 if (size <= max_size && TraceFrequencyInlining) {
duke@0 138 print_indent(inline_depth());
duke@0 139 tty->print_cr("Inlined frequent method (freq=%d count=%d):", freq, call_site_count);
duke@0 140 print_indent(inline_depth());
duke@0 141 callee_method->print();
duke@0 142 tty->cr();
duke@0 143 }
duke@0 144 } else {
duke@0 145 // Not hot. Check for medium-sized pre-existing nmethod at cold sites.
kvn@41 146 if (callee_method->has_compiled_code() &&
kvn@41 147 callee_method->instructions_size() > InlineSmallCode/4)
duke@0 148 return "already compiled into a medium method";
duke@0 149 }
duke@0 150 if (size > max_size) {
duke@0 151 if (max_size > C->max_inline_size())
duke@0 152 return "hot method too big";
duke@0 153 return "too big";
duke@0 154 }
duke@0 155 return NULL;
duke@0 156 }
duke@0 157
duke@0 158
duke@0 159 // negative filter: should send NOT be inlined? returns NULL, ok to inline, or rejection msg
kvn@41 160 const char* InlineTree::shouldNotInline(ciMethod *callee_method, ciMethod* caller_method, WarmCallInfo* wci_result) const {
duke@0 161 // negative filter: should send NOT be inlined? returns NULL (--> inline) or rejection msg
duke@0 162 if (!UseOldInlining) {
duke@0 163 const char* fail = NULL;
duke@0 164 if (callee_method->is_abstract()) fail = "abstract method";
duke@0 165 // note: we allow ik->is_abstract()
duke@0 166 if (!callee_method->holder()->is_initialized()) fail = "method holder not initialized";
duke@0 167 if (callee_method->is_native()) fail = "native method";
duke@0 168
duke@0 169 if (fail) {
duke@0 170 *wci_result = *(WarmCallInfo::always_cold());
duke@0 171 return fail;
duke@0 172 }
duke@0 173
duke@0 174 if (callee_method->has_unloaded_classes_in_signature()) {
duke@0 175 wci_result->set_profit(wci_result->profit() * 0.1);
duke@0 176 }
duke@0 177
duke@0 178 // don't inline exception code unless the top method belongs to an
duke@0 179 // exception class
duke@0 180 if (callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
duke@0 181 ciMethod* top_method = caller_jvms() ? caller_jvms()->of_depth(1)->method() : method();
duke@0 182 if (!top_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
duke@0 183 wci_result->set_profit(wci_result->profit() * 0.1);
duke@0 184 }
duke@0 185 }
duke@0 186
duke@0 187 if (callee_method->has_compiled_code() && callee_method->instructions_size() > InlineSmallCode) {
duke@0 188 wci_result->set_profit(wci_result->profit() * 0.1);
duke@0 189 // %%% adjust wci_result->size()?
duke@0 190 }
duke@0 191
duke@0 192 return NULL;
duke@0 193 }
duke@0 194
duke@0 195 // First check all inlining restrictions which are required for correctness
duke@0 196 if (callee_method->is_abstract()) return "abstract method";
duke@0 197 // note: we allow ik->is_abstract()
duke@0 198 if (!callee_method->holder()->is_initialized()) return "method holder not initialized";
duke@0 199 if (callee_method->is_native()) return "native method";
duke@0 200 if (callee_method->has_unloaded_classes_in_signature()) return "unloaded signature classes";
duke@0 201
duke@0 202 if (callee_method->should_inline()) {
duke@0 203 // ignore heuristic controls on inlining
duke@0 204 return NULL;
duke@0 205 }
duke@0 206
duke@0 207 // Now perform checks which are heuristic
duke@0 208
duke@0 209 if( callee_method->has_compiled_code() && callee_method->instructions_size() > InlineSmallCode )
duke@0 210 return "already compiled into a big method";
duke@0 211
duke@0 212 // don't inline exception code unless the top method belongs to an
duke@0 213 // exception class
duke@0 214 if (caller_tree() != NULL &&
duke@0 215 callee_method->holder()->is_subclass_of(C->env()->Throwable_klass())) {
duke@0 216 const InlineTree *top = this;
duke@0 217 while (top->caller_tree() != NULL) top = top->caller_tree();
duke@0 218 ciInstanceKlass* k = top->method()->holder();
duke@0 219 if (!k->is_subclass_of(C->env()->Throwable_klass()))
duke@0 220 return "exception method";
duke@0 221 }
duke@0 222
duke@0 223 // use frequency-based objections only for non-trivial methods
duke@0 224 if (callee_method->code_size() <= MaxTrivialSize) return NULL;
kvn@41 225
kvn@41 226 // don't use counts with -Xcomp or CTW
kvn@41 227 if (UseInterpreter && !CompileTheWorld) {
kvn@41 228
kvn@41 229 if (!callee_method->has_compiled_code() &&
kvn@41 230 !callee_method->was_executed_more_than(0)) {
kvn@41 231 return "never executed";
kvn@41 232 }
kvn@41 233
kvn@41 234 if (is_init_with_ea(callee_method, caller_method, C)) {
kvn@41 235
kvn@41 236 // Escape Analysis: inline all executed constructors
kvn@41 237
kvn@41 238 } else if (!callee_method->was_executed_more_than(MIN2(MinInliningThreshold,
kvn@41 239 CompileThreshold >> 1))) {
kvn@41 240 return "executed < MinInliningThreshold times";
kvn@41 241 }
duke@0 242 }
duke@0 243
duke@0 244 if (callee_method->should_not_inline()) {
duke@0 245 return "disallowed by CompilerOracle";
duke@0 246 }
duke@0 247
duke@0 248 return NULL;
duke@0 249 }
duke@0 250
duke@0 251 //-----------------------------try_to_inline-----------------------------------
duke@0 252 // return NULL if ok, reason for not inlining otherwise
duke@0 253 // Relocated from "InliningClosure::try_to_inline"
kvn@41 254 const char* InlineTree::try_to_inline(ciMethod* callee_method, ciMethod* caller_method, int caller_bci, ciCallProfile& profile, WarmCallInfo* wci_result) {
duke@0 255
duke@0 256 // Old algorithm had funny accumulating BC-size counters
duke@0 257 if (UseOldInlining && ClipInlining
duke@0 258 && (int)count_inline_bcs() >= DesiredMethodLimit) {
duke@0 259 return "size > DesiredMethodLimit";
duke@0 260 }
duke@0 261
duke@0 262 const char *msg = NULL;
kvn@41 263 if ((msg = shouldInline(callee_method, caller_method, caller_bci,
kvn@41 264 profile, wci_result)) != NULL) {
kvn@41 265 return msg;
kvn@41 266 }
kvn@41 267 if ((msg = shouldNotInline(callee_method, caller_method,
kvn@41 268 wci_result)) != NULL) {
kvn@41 269 return msg;
kvn@41 270 }
duke@0 271
duke@0 272 bool is_accessor = InlineAccessors && callee_method->is_accessor();
duke@0 273
duke@0 274 // suppress a few checks for accessors and trivial methods
duke@0 275 if (!is_accessor && callee_method->code_size() > MaxTrivialSize) {
kvn@41 276
duke@0 277 // don't inline into giant methods
kvn@41 278 if (C->unique() > (uint)NodeCountInliningCutoff) {
kvn@41 279 return "NodeCountInliningCutoff";
kvn@41 280 }
duke@0 281
kvn@41 282 if ((!UseInterpreter || CompileTheWorld) &&
kvn@41 283 is_init_with_ea(callee_method, caller_method, C)) {
kvn@41 284
kvn@41 285 // Escape Analysis stress testing when running Xcomp or CTW:
kvn@41 286 // inline constructors even if they are not reached.
kvn@41 287
kvn@41 288 } else if (profile.count() == 0) {
kvn@41 289 // don't inline unreached call sites
kvn@41 290 return "call site not reached";
kvn@41 291 }
duke@0 292 }
duke@0 293
kvn@41 294 if (!C->do_inlining() && InlineAccessors && !is_accessor) {
kvn@41 295 return "not an accessor";
kvn@41 296 }
kvn@41 297 if( inline_depth() > MaxInlineLevel ) {
kvn@41 298 return "inlining too deep";
kvn@41 299 }
duke@0 300 if( method() == callee_method &&
kvn@41 301 inline_depth() > MaxRecursiveInlineLevel ) {
kvn@41 302 return "recursively inlining too deep";
kvn@41 303 }
duke@0 304
duke@0 305 int size = callee_method->code_size();
duke@0 306
duke@0 307 if (UseOldInlining && ClipInlining
duke@0 308 && (int)count_inline_bcs() + size >= DesiredMethodLimit) {
duke@0 309 return "size > DesiredMethodLimit";
duke@0 310 }
duke@0 311
duke@0 312 // ok, inline this method
duke@0 313 return NULL;
duke@0 314 }
duke@0 315
duke@0 316 //------------------------------pass_initial_checks----------------------------
duke@0 317 bool pass_initial_checks(ciMethod* caller_method, int caller_bci, ciMethod* callee_method) {
duke@0 318 ciInstanceKlass *callee_holder = callee_method ? callee_method->holder() : NULL;
duke@0 319 // Check if a callee_method was suggested
duke@0 320 if( callee_method == NULL ) return false;
duke@0 321 // Check if klass of callee_method is loaded
duke@0 322 if( !callee_holder->is_loaded() ) return false;
duke@0 323 if( !callee_holder->is_initialized() ) return false;
duke@0 324 if( !UseInterpreter || CompileTheWorld /* running Xcomp or CTW */ ) {
duke@0 325 // Checks that constant pool's call site has been visited
duke@0 326 // stricter than callee_holder->is_initialized()
duke@0 327 ciBytecodeStream iter(caller_method);
duke@0 328 iter.force_bci(caller_bci);
duke@0 329 int index = iter.get_index_big();
duke@0 330 if( !caller_method->is_klass_loaded(index, true) ) {
duke@0 331 return false;
duke@0 332 }
duke@0 333 // Try to do constant pool resolution if running Xcomp
duke@0 334 Bytecodes::Code call_bc = iter.cur_bc();
duke@0 335 if( !caller_method->check_call(index, call_bc == Bytecodes::_invokestatic) ) {
duke@0 336 return false;
duke@0 337 }
duke@0 338 }
duke@0 339 // We will attempt to see if a class/field/etc got properly loaded. If it
duke@0 340 // did not, it may attempt to throw an exception during our probing. Catch
duke@0 341 // and ignore such exceptions and do not attempt to compile the method.
duke@0 342 if( callee_method->should_exclude() ) return false;
duke@0 343
duke@0 344 return true;
duke@0 345 }
duke@0 346
duke@0 347 #ifndef PRODUCT
duke@0 348 //------------------------------print_inlining---------------------------------
duke@0 349 // Really, the failure_msg can be a success message also.
duke@0 350 void InlineTree::print_inlining(ciMethod *callee_method, int caller_bci, const char *failure_msg) const {
duke@0 351 print_indent(inline_depth());
duke@0 352 tty->print("@ %d ", caller_bci);
duke@0 353 if( callee_method ) callee_method->print_short_name();
duke@0 354 else tty->print(" callee not monotonic or profiled");
duke@0 355 tty->print(" %s", (failure_msg ? failure_msg : "inline"));
duke@0 356 if( Verbose && callee_method ) {
duke@0 357 const InlineTree *top = this;
duke@0 358 while( top->caller_tree() != NULL ) { top = top->caller_tree(); }
duke@0 359 tty->print(" bcs: %d+%d invoked: %d", top->count_inline_bcs(), callee_method->code_size(), callee_method->interpreter_invocation_count());
duke@0 360 }
duke@0 361 tty->cr();
duke@0 362 }
duke@0 363 #endif
duke@0 364
duke@0 365 //------------------------------ok_to_inline-----------------------------------
duke@0 366 WarmCallInfo* InlineTree::ok_to_inline(ciMethod* callee_method, JVMState* jvms, ciCallProfile& profile, WarmCallInfo* initial_wci) {
duke@0 367 assert(callee_method != NULL, "caller checks for optimized virtual!");
duke@0 368 #ifdef ASSERT
duke@0 369 // Make sure the incoming jvms has the same information content as me.
duke@0 370 // This means that we can eventually make this whole class AllStatic.
duke@0 371 if (jvms->caller() == NULL) {
duke@0 372 assert(_caller_jvms == NULL, "redundant instance state");
duke@0 373 } else {
duke@0 374 assert(_caller_jvms->same_calls_as(jvms->caller()), "redundant instance state");
duke@0 375 }
duke@0 376 assert(_method == jvms->method(), "redundant instance state");
duke@0 377 #endif
duke@0 378 const char *failure_msg = NULL;
duke@0 379 int caller_bci = jvms->bci();
duke@0 380 ciMethod *caller_method = jvms->method();
duke@0 381
duke@0 382 if( !pass_initial_checks(caller_method, caller_bci, callee_method)) {
duke@0 383 if( PrintInlining ) {
duke@0 384 failure_msg = "failed_initial_checks";
duke@0 385 print_inlining( callee_method, caller_bci, failure_msg);
duke@0 386 }
duke@0 387 return NULL;
duke@0 388 }
duke@0 389
duke@0 390 // Check if inlining policy says no.
duke@0 391 WarmCallInfo wci = *(initial_wci);
kvn@41 392 failure_msg = try_to_inline(callee_method, caller_method, caller_bci, profile, &wci);
duke@0 393 if (failure_msg != NULL && C->log() != NULL) {
duke@0 394 C->log()->begin_elem("inline_fail reason='");
duke@0 395 C->log()->text("%s", failure_msg);
duke@0 396 C->log()->end_elem("'");
duke@0 397 }
duke@0 398
duke@0 399 #ifndef PRODUCT
duke@0 400 if (UseOldInlining && InlineWarmCalls
duke@0 401 && (PrintOpto || PrintOptoInlining || PrintInlining)) {
duke@0 402 bool cold = wci.is_cold();
duke@0 403 bool hot = !cold && wci.is_hot();
duke@0 404 bool old_cold = (failure_msg != NULL);
duke@0 405 if (old_cold != cold || (Verbose || WizardMode)) {
duke@0 406 tty->print(" OldInlining= %4s : %s\n WCI=",
duke@0 407 old_cold ? "cold" : "hot", failure_msg ? failure_msg : "OK");
duke@0 408 wci.print();
duke@0 409 }
duke@0 410 }
duke@0 411 #endif
duke@0 412 if (UseOldInlining) {
duke@0 413 if (failure_msg == NULL)
duke@0 414 wci = *(WarmCallInfo::always_hot());
duke@0 415 else
duke@0 416 wci = *(WarmCallInfo::always_cold());
duke@0 417 }
duke@0 418 if (!InlineWarmCalls) {
duke@0 419 if (!wci.is_cold() && !wci.is_hot()) {
duke@0 420 // Do not inline the warm calls.
duke@0 421 wci = *(WarmCallInfo::always_cold());
duke@0 422 }
duke@0 423 }
duke@0 424
duke@0 425 if (!wci.is_cold()) {
duke@0 426 // In -UseOldInlining, the failure_msg may also be a success message.
duke@0 427 if (failure_msg == NULL) failure_msg = "inline (hot)";
duke@0 428
duke@0 429 // Inline!
duke@0 430 if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg);
duke@0 431 if (UseOldInlining)
duke@0 432 build_inline_tree_for_callee(callee_method, jvms, caller_bci);
duke@0 433 if (InlineWarmCalls && !wci.is_hot())
duke@0 434 return new (C) WarmCallInfo(wci); // copy to heap
duke@0 435 return WarmCallInfo::always_hot();
duke@0 436 }
duke@0 437
duke@0 438 // Do not inline
duke@0 439 if (failure_msg == NULL) failure_msg = "too cold to inline";
duke@0 440 if( PrintInlining ) print_inlining( callee_method, caller_bci, failure_msg);
duke@0 441 return NULL;
duke@0 442 }
duke@0 443
duke@0 444 //------------------------------compute_callee_frequency-----------------------
duke@0 445 float InlineTree::compute_callee_frequency( int caller_bci ) const {
duke@0 446 int count = method()->interpreter_call_site_count(caller_bci);
duke@0 447 int invcnt = method()->interpreter_invocation_count();
duke@0 448 float freq = (float)count/(float)invcnt;
duke@0 449 // Call-site count / interpreter invocation count, scaled recursively.
duke@0 450 // Always between 0.0 and 1.0. Represents the percentage of the method's
duke@0 451 // total execution time used at this call site.
duke@0 452
duke@0 453 return freq;
duke@0 454 }
duke@0 455
duke@0 456 //------------------------------build_inline_tree_for_callee-------------------
duke@0 457 InlineTree *InlineTree::build_inline_tree_for_callee( ciMethod* callee_method, JVMState* caller_jvms, int caller_bci) {
duke@0 458 float recur_frequency = _site_invoke_ratio * compute_callee_frequency(caller_bci);
duke@0 459 // Attempt inlining.
duke@0 460 InlineTree* old_ilt = callee_at(caller_bci, callee_method);
duke@0 461 if (old_ilt != NULL) {
duke@0 462 return old_ilt;
duke@0 463 }
duke@0 464 InlineTree *ilt = new InlineTree( C, this, callee_method, caller_jvms, caller_bci, recur_frequency );
duke@0 465 _subtrees.append( ilt );
duke@0 466
duke@0 467 NOT_PRODUCT( _count_inlines += 1; )
duke@0 468
duke@0 469 return ilt;
duke@0 470 }
duke@0 471
duke@0 472
duke@0 473 //---------------------------------------callee_at-----------------------------
duke@0 474 InlineTree *InlineTree::callee_at(int bci, ciMethod* callee) const {
duke@0 475 for (int i = 0; i < _subtrees.length(); i++) {
duke@0 476 InlineTree* sub = _subtrees.at(i);
duke@0 477 if (sub->caller_bci() == bci && callee == sub->method()) {
duke@0 478 return sub;
duke@0 479 }
duke@0 480 }
duke@0 481 return NULL;
duke@0 482 }
duke@0 483
duke@0 484
duke@0 485 //------------------------------build_inline_tree_root-------------------------
duke@0 486 InlineTree *InlineTree::build_inline_tree_root() {
duke@0 487 Compile* C = Compile::current();
duke@0 488
duke@0 489 // Root of inline tree
duke@0 490 InlineTree *ilt = new InlineTree(C, NULL, C->method(), NULL, -1, 1.0F);
duke@0 491
duke@0 492 return ilt;
duke@0 493 }
duke@0 494
duke@0 495
duke@0 496 //-------------------------find_subtree_from_root-----------------------------
duke@0 497 // Given a jvms, which determines a call chain from the root method,
duke@0 498 // find the corresponding inline tree.
duke@0 499 // Note: This method will be removed or replaced as InlineTree goes away.
duke@0 500 InlineTree* InlineTree::find_subtree_from_root(InlineTree* root, JVMState* jvms, ciMethod* callee, bool create_if_not_found) {
duke@0 501 InlineTree* iltp = root;
duke@0 502 uint depth = jvms && jvms->has_method() ? jvms->depth() : 0;
duke@0 503 for (uint d = 1; d <= depth; d++) {
duke@0 504 JVMState* jvmsp = jvms->of_depth(d);
duke@0 505 // Select the corresponding subtree for this bci.
duke@0 506 assert(jvmsp->method() == iltp->method(), "tree still in sync");
duke@0 507 ciMethod* d_callee = (d == depth) ? callee : jvms->of_depth(d+1)->method();
duke@0 508 InlineTree* sub = iltp->callee_at(jvmsp->bci(), d_callee);
duke@0 509 if (!sub) {
duke@0 510 if (create_if_not_found && d == depth) {
duke@0 511 return iltp->build_inline_tree_for_callee(d_callee, jvmsp, jvmsp->bci());
duke@0 512 }
duke@0 513 assert(sub != NULL, "should be a sub-ilt here");
duke@0 514 return NULL;
duke@0 515 }
duke@0 516 iltp = sub;
duke@0 517 }
duke@0 518 return iltp;
duke@0 519 }
duke@0 520
duke@0 521 // ----------------------------------------------------------------------------
duke@0 522 #ifndef PRODUCT
duke@0 523
duke@0 524 static void per_method_stats() {
duke@0 525 // Compute difference between this method's cumulative totals and old totals
duke@0 526 int explicit_null_checks_cur = explicit_null_checks_inserted - explicit_null_checks_inserted_old;
duke@0 527 int elided_null_checks_cur = explicit_null_checks_elided - explicit_null_checks_elided_old;
duke@0 528
duke@0 529 // Print differences
duke@0 530 if( explicit_null_checks_cur )
duke@0 531 tty->print_cr("XXX Explicit NULL checks inserted: %d", explicit_null_checks_cur);
duke@0 532 if( elided_null_checks_cur )
duke@0 533 tty->print_cr("XXX Explicit NULL checks removed at parse time: %d", elided_null_checks_cur);
duke@0 534
duke@0 535 // Store the current cumulative totals
duke@0 536 nodes_created_old = nodes_created;
duke@0 537 methods_parsed_old = methods_parsed;
duke@0 538 methods_seen_old = methods_seen;
duke@0 539 explicit_null_checks_inserted_old = explicit_null_checks_inserted;
duke@0 540 explicit_null_checks_elided_old = explicit_null_checks_elided;
duke@0 541 }
duke@0 542
duke@0 543 #endif