src/share/vm/opto/bytecodeInfo.cpp

Thu, 02 Oct 2008 08:37:44 -0700

author
kvn
date
Thu, 02 Oct 2008 08:37:44 -0700
changeset 835
cc80376deb0c
parent 802
194b8e3a2fc4
child 1110
f6da6f0174ac
permissions
-rw-r--r--

6667595: Set probability FAIR for pre-, post- loops and ALWAYS for main loop
Summary: Fix loop's probability. Add optimizations to avoid spilling. Change InlineSmallCode to product flag.
Reviewed-by: never

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

mercurial