1 /* 2 * Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. 8 * 9 * This code is distributed in the hope that it will be useful, but WITHOUT 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 12 * version 2 for more details (a copy is included in the LICENSE file that 13 * accompanied this code). 14 * 15 * You should have received a copy of the GNU General Public License version 16 * 2 along with this work; if not, write to the Free Software Foundation, 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 18 * 19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 20 * or visit www.oracle.com if you need additional information or have any 21 * questions. 22 * 23 */ 24 25 #include "precompiled.hpp" 26 #include "ci/bcEscapeAnalyzer.hpp" 27 #include "ci/ciCallSite.hpp" 28 #include "ci/ciObjArray.hpp" 29 #include "ci/ciMemberName.hpp" 30 #include "ci/ciMethodHandle.hpp" 31 #include "classfile/javaClasses.hpp" 32 #include "compiler/compileLog.hpp" 33 #include "opto/addnode.hpp" 34 #include "opto/callGenerator.hpp" 35 #include "opto/callnode.hpp" 36 #include "opto/cfgnode.hpp" 37 #include "opto/connode.hpp" 38 #include "opto/parse.hpp" 39 #include "opto/rootnode.hpp" 40 #include "opto/runtime.hpp" 41 #include "opto/subnode.hpp" 42 43 44 // Utility function. 45 const TypeFunc* CallGenerator::tf() const { 46 return TypeFunc::make(method()); 47 } 48 49 //-----------------------------ParseGenerator--------------------------------- 50 // Internal class which handles all direct bytecode traversal. 51 class ParseGenerator : public InlineCallGenerator { 52 private: 53 bool _is_osr; 54 float _expected_uses; 55 56 public: 57 ParseGenerator(ciMethod* method, float expected_uses, bool is_osr = false) 58 : InlineCallGenerator(method) 59 { 60 _is_osr = is_osr; 61 _expected_uses = expected_uses; 62 assert(InlineTree::check_can_parse(method) == NULL, "parse must be possible"); 63 } 64 65 virtual bool is_parse() const { return true; } 66 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 67 int is_osr() { return _is_osr; } 68 69 }; 70 71 JVMState* ParseGenerator::generate(JVMState* jvms, Parse* parent_parser) { 72 Compile* C = Compile::current(); 73 C->print_inlining_update(this); 74 75 if (is_osr()) { 76 // The JVMS for a OSR has a single argument (see its TypeFunc). 77 assert(jvms->depth() == 1, "no inline OSR"); 78 } 79 80 if (C->failing()) { 81 return NULL; // bailing out of the compile; do not try to parse 82 } 83 84 Parse parser(jvms, method(), _expected_uses, parent_parser); 85 // Grab signature for matching/allocation 86 #ifdef ASSERT 87 if (parser.tf() != (parser.depth() == 1 ? C->tf() : tf())) { 88 MutexLockerEx ml(Compile_lock, Mutex::_no_safepoint_check_flag); 89 assert(C->env()->system_dictionary_modification_counter_changed(), 90 "Must invalidate if TypeFuncs differ"); 91 } 92 #endif 93 94 GraphKit& exits = parser.exits(); 95 96 if (C->failing()) { 97 while (exits.pop_exception_state() != NULL) ; 98 return NULL; 99 } 100 101 assert(exits.jvms()->same_calls_as(jvms), "sanity"); 102 103 // Simply return the exit state of the parser, 104 // augmented by any exceptional states. 105 return exits.transfer_exceptions_into_jvms(); 106 } 107 108 //---------------------------DirectCallGenerator------------------------------ 109 // Internal class which handles all out-of-line calls w/o receiver type checks. 110 class DirectCallGenerator : public CallGenerator { 111 private: 112 CallStaticJavaNode* _call_node; 113 // Force separate memory and I/O projections for the exceptional 114 // paths to facilitate late inlinig. 115 bool _separate_io_proj; 116 117 public: 118 DirectCallGenerator(ciMethod* method, bool separate_io_proj) 119 : CallGenerator(method), 120 _separate_io_proj(separate_io_proj) 121 { 122 } 123 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 124 125 CallStaticJavaNode* call_node() const { return _call_node; } 126 }; 127 128 JVMState* DirectCallGenerator::generate(JVMState* jvms, Parse* parent_parser) { 129 GraphKit kit(jvms); 130 kit.C->print_inlining_update(this); 131 bool is_static = method()->is_static(); 132 address target = is_static ? SharedRuntime::get_resolve_static_call_stub() 133 : SharedRuntime::get_resolve_opt_virtual_call_stub(); 134 135 if (kit.C->log() != NULL) { 136 kit.C->log()->elem("direct_call bci='%d'", jvms->bci()); 137 } 138 139 CallStaticJavaNode *call = new (kit.C) CallStaticJavaNode(kit.C, tf(), target, method(), kit.bci()); 140 _call_node = call; // Save the call node in case we need it later 141 if (!is_static) { 142 // Make an explicit receiver null_check as part of this call. 143 // Since we share a map with the caller, his JVMS gets adjusted. 144 kit.null_check_receiver_before_call(method()); 145 if (kit.stopped()) { 146 // And dump it back to the caller, decorated with any exceptions: 147 return kit.transfer_exceptions_into_jvms(); 148 } 149 // Mark the call node as virtual, sort of: 150 call->set_optimized_virtual(true); 151 if (method()->is_method_handle_intrinsic() || 152 method()->is_compiled_lambda_form()) { 153 call->set_method_handle_invoke(true); 154 } 155 } 156 kit.set_arguments_for_java_call(call); 157 kit.set_edges_for_java_call(call, false, _separate_io_proj); 158 Node* ret = kit.set_results_for_java_call(call, _separate_io_proj); 159 kit.push_node(method()->return_type()->basic_type(), ret); 160 return kit.transfer_exceptions_into_jvms(); 161 } 162 163 //--------------------------VirtualCallGenerator------------------------------ 164 // Internal class which handles all out-of-line calls checking receiver type. 165 class VirtualCallGenerator : public CallGenerator { 166 private: 167 int _vtable_index; 168 public: 169 VirtualCallGenerator(ciMethod* method, int vtable_index) 170 : CallGenerator(method), _vtable_index(vtable_index) 171 { 172 assert(vtable_index == Method::invalid_vtable_index || 173 vtable_index >= 0, "either invalid or usable"); 174 } 175 virtual bool is_virtual() const { return true; } 176 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 177 }; 178 179 JVMState* VirtualCallGenerator::generate(JVMState* jvms, Parse* parent_parser) { 180 GraphKit kit(jvms); 181 Node* receiver = kit.argument(0); 182 183 kit.C->print_inlining_update(this); 184 185 if (kit.C->log() != NULL) { 186 kit.C->log()->elem("virtual_call bci='%d'", jvms->bci()); 187 } 188 189 // If the receiver is a constant null, do not torture the system 190 // by attempting to call through it. The compile will proceed 191 // correctly, but may bail out in final_graph_reshaping, because 192 // the call instruction will have a seemingly deficient out-count. 193 // (The bailout says something misleading about an "infinite loop".) 194 if (kit.gvn().type(receiver)->higher_equal(TypePtr::NULL_PTR)) { 195 kit.inc_sp(method()->arg_size()); // restore arguments 196 kit.uncommon_trap(Deoptimization::Reason_null_check, 197 Deoptimization::Action_none, 198 NULL, "null receiver"); 199 return kit.transfer_exceptions_into_jvms(); 200 } 201 202 // Ideally we would unconditionally do a null check here and let it 203 // be converted to an implicit check based on profile information. 204 // However currently the conversion to implicit null checks in 205 // Block::implicit_null_check() only looks for loads and stores, not calls. 206 ciMethod *caller = kit.method(); 207 ciMethodData *caller_md = (caller == NULL) ? NULL : caller->method_data(); 208 if (!UseInlineCaches || !ImplicitNullChecks || !os::zero_page_read_protected() || 209 ((ImplicitNullCheckThreshold > 0) && caller_md && 210 (caller_md->trap_count(Deoptimization::Reason_null_check) 211 >= (uint)ImplicitNullCheckThreshold))) { 212 // Make an explicit receiver null_check as part of this call. 213 // Since we share a map with the caller, his JVMS gets adjusted. 214 receiver = kit.null_check_receiver_before_call(method()); 215 if (kit.stopped()) { 216 // And dump it back to the caller, decorated with any exceptions: 217 return kit.transfer_exceptions_into_jvms(); 218 } 219 } 220 221 assert(!method()->is_static(), "virtual call must not be to static"); 222 assert(!method()->is_final(), "virtual call should not be to final"); 223 assert(!method()->is_private(), "virtual call should not be to private"); 224 assert(_vtable_index == Method::invalid_vtable_index || !UseInlineCaches, 225 "no vtable calls if +UseInlineCaches "); 226 address target = SharedRuntime::get_resolve_virtual_call_stub(); 227 // Normal inline cache used for call 228 CallDynamicJavaNode *call = new (kit.C) CallDynamicJavaNode(tf(), target, method(), _vtable_index, kit.bci()); 229 kit.set_arguments_for_java_call(call); 230 kit.set_edges_for_java_call(call); 231 Node* ret = kit.set_results_for_java_call(call); 232 kit.push_node(method()->return_type()->basic_type(), ret); 233 234 // Represent the effect of an implicit receiver null_check 235 // as part of this call. Since we share a map with the caller, 236 // his JVMS gets adjusted. 237 kit.cast_not_null(receiver); 238 return kit.transfer_exceptions_into_jvms(); 239 } 240 241 CallGenerator* CallGenerator::for_inline(ciMethod* m, float expected_uses) { 242 if (InlineTree::check_can_parse(m) != NULL) return NULL; 243 return new ParseGenerator(m, expected_uses); 244 } 245 246 // As a special case, the JVMS passed to this CallGenerator is 247 // for the method execution already in progress, not just the JVMS 248 // of the caller. Thus, this CallGenerator cannot be mixed with others! 249 CallGenerator* CallGenerator::for_osr(ciMethod* m, int osr_bci) { 250 if (InlineTree::check_can_parse(m) != NULL) return NULL; 251 float past_uses = m->interpreter_invocation_count(); 252 float expected_uses = past_uses; 253 return new ParseGenerator(m, expected_uses, true); 254 } 255 256 CallGenerator* CallGenerator::for_direct_call(ciMethod* m, bool separate_io_proj) { 257 assert(!m->is_abstract(), "for_direct_call mismatch"); 258 return new DirectCallGenerator(m, separate_io_proj); 259 } 260 261 CallGenerator* CallGenerator::for_virtual_call(ciMethod* m, int vtable_index) { 262 assert(!m->is_static(), "for_virtual_call mismatch"); 263 assert(!m->is_method_handle_intrinsic(), "should be a direct call"); 264 return new VirtualCallGenerator(m, vtable_index); 265 } 266 267 // Allow inlining decisions to be delayed 268 class LateInlineCallGenerator : public DirectCallGenerator { 269 protected: 270 CallGenerator* _inline_cg; 271 272 virtual bool do_late_inline_check(JVMState* jvms) { return true; } 273 274 public: 275 LateInlineCallGenerator(ciMethod* method, CallGenerator* inline_cg) : 276 DirectCallGenerator(method, true), _inline_cg(inline_cg) {} 277 278 virtual bool is_late_inline() const { return true; } 279 280 // Convert the CallStaticJava into an inline 281 virtual void do_late_inline(); 282 283 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) { 284 Compile *C = Compile::current(); 285 286 C->log_inline_id((jlong)this); 287 288 // Record that this call site should be revisited once the main 289 // parse is finished. 290 if (!is_mh_late_inline()) { 291 C->add_late_inline(this); 292 } 293 294 // Emit the CallStaticJava and request separate projections so 295 // that the late inlining logic can distinguish between fall 296 // through and exceptional uses of the memory and io projections 297 // as is done for allocations and macro expansion. 298 return DirectCallGenerator::generate(jvms, parent_parser); 299 } 300 301 virtual void print_inlining_late(const char* msg) { 302 CallNode* call = call_node(); 303 Compile* C = Compile::current(); 304 C->print_inlining_assert_ready(); 305 C->print_inlining(method(), call->jvms()->depth()-1, call->jvms()->bci(), msg); 306 C->print_inlining_move_to(this); 307 C->print_inlining_update_delayed(this); 308 } 309 }; 310 311 void LateInlineCallGenerator::do_late_inline() { 312 // Can't inline it 313 CallStaticJavaNode* call = call_node(); 314 if (call == NULL || call->outcnt() == 0 || 315 call->in(0) == NULL || call->in(0)->is_top()) { 316 return; 317 } 318 319 const TypeTuple *r = call->tf()->domain(); 320 for (int i1 = 0; i1 < method()->arg_size(); i1++) { 321 if (call->in(TypeFunc::Parms + i1)->is_top() && r->field_at(TypeFunc::Parms + i1) != Type::HALF) { 322 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing"); 323 return; 324 } 325 } 326 327 if (call->in(TypeFunc::Memory)->is_top()) { 328 assert(Compile::current()->inlining_incrementally(), "shouldn't happen during parsing"); 329 return; 330 } 331 332 Compile* C = Compile::current(); 333 // Remove inlined methods from Compiler's lists. 334 if (call->is_macro()) { 335 C->remove_macro_node(call); 336 } 337 338 // Make a clone of the JVMState that appropriate to use for driving a parse 339 JVMState* old_jvms = call->jvms(); 340 JVMState* jvms = old_jvms->clone_shallow(C); 341 uint size = call->req(); 342 SafePointNode* map = new (C) SafePointNode(size, jvms); 343 for (uint i1 = 0; i1 < size; i1++) { 344 map->init_req(i1, call->in(i1)); 345 } 346 347 // Make sure the state is a MergeMem for parsing. 348 if (!map->in(TypeFunc::Memory)->is_MergeMem()) { 349 Node* mem = MergeMemNode::make(C, map->in(TypeFunc::Memory)); 350 C->initial_gvn()->set_type_bottom(mem); 351 map->set_req(TypeFunc::Memory, mem); 352 } 353 354 uint nargs = method()->arg_size(); 355 // blow away old call arguments 356 Node* top = C->top(); 357 for (uint i1 = 0; i1 < nargs; i1++) { 358 map->set_req(TypeFunc::Parms + i1, top); 359 } 360 jvms->set_map(map); 361 362 // Make enough space in the expression stack to transfer 363 // the incoming arguments and return value. 364 map->ensure_stack(jvms, jvms->method()->max_stack()); 365 for (uint i1 = 0; i1 < nargs; i1++) { 366 map->set_argument(jvms, i1, call->in(TypeFunc::Parms + i1)); 367 } 368 369 C->print_inlining_assert_ready(); 370 371 C->print_inlining_move_to(this); 372 373 C->log_late_inline(this); 374 375 // This check is done here because for_method_handle_inline() method 376 // needs jvms for inlined state. 377 if (!do_late_inline_check(jvms)) { 378 map->disconnect_inputs(NULL, C); 379 return; 380 } 381 382 // Setup default node notes to be picked up by the inlining 383 Node_Notes* old_nn = C->default_node_notes(); 384 if (old_nn != NULL) { 385 Node_Notes* entry_nn = old_nn->clone(C); 386 entry_nn->set_jvms(jvms); 387 C->set_default_node_notes(entry_nn); 388 } 389 390 // Now perform the inlining using the synthesized JVMState 391 JVMState* new_jvms = _inline_cg->generate(jvms, NULL); 392 if (new_jvms == NULL) return; // no change 393 if (C->failing()) return; 394 395 // Capture any exceptional control flow 396 GraphKit kit(new_jvms); 397 398 // Find the result object 399 Node* result = C->top(); 400 int result_size = method()->return_type()->size(); 401 if (result_size != 0 && !kit.stopped()) { 402 result = (result_size == 1) ? kit.pop() : kit.pop_pair(); 403 } 404 405 C->set_has_loops(C->has_loops() || _inline_cg->method()->has_loops()); 406 C->env()->notice_inlined_method(_inline_cg->method()); 407 C->set_inlining_progress(true); 408 409 kit.replace_call(call, result); 410 } 411 412 413 CallGenerator* CallGenerator::for_late_inline(ciMethod* method, CallGenerator* inline_cg) { 414 return new LateInlineCallGenerator(method, inline_cg); 415 } 416 417 class LateInlineMHCallGenerator : public LateInlineCallGenerator { 418 ciMethod* _caller; 419 int _attempt; 420 bool _input_not_const; 421 422 virtual bool do_late_inline_check(JVMState* jvms); 423 virtual bool already_attempted() const { return _attempt > 0; } 424 425 public: 426 LateInlineMHCallGenerator(ciMethod* caller, ciMethod* callee, bool input_not_const) : 427 LateInlineCallGenerator(callee, NULL), _caller(caller), _attempt(0), _input_not_const(input_not_const) {} 428 429 virtual bool is_mh_late_inline() const { return true; } 430 431 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) { 432 JVMState* new_jvms = LateInlineCallGenerator::generate(jvms, parent_parser); 433 434 Compile* C = Compile::current(); 435 if (_input_not_const) { 436 // inlining won't be possible so no need to enqueue right now. 437 call_node()->set_generator(this); 438 } else { 439 C->add_late_inline(this); 440 } 441 return new_jvms; 442 } 443 }; 444 445 bool LateInlineMHCallGenerator::do_late_inline_check(JVMState* jvms) { 446 447 CallGenerator* cg = for_method_handle_inline(jvms, _caller, method(), _input_not_const); 448 449 Compile::current()->print_inlining_update_delayed(this); 450 451 if (!_input_not_const) { 452 _attempt++; 453 } 454 455 if (cg != NULL) { 456 assert(!cg->is_late_inline() && cg->is_inline(), "we're doing late inlining"); 457 _inline_cg = cg; 458 Compile::current()->dec_number_of_mh_late_inlines(); 459 return true; 460 } 461 462 call_node()->set_generator(this); 463 return false; 464 } 465 466 CallGenerator* CallGenerator::for_mh_late_inline(ciMethod* caller, ciMethod* callee, bool input_not_const) { 467 Compile::current()->inc_number_of_mh_late_inlines(); 468 CallGenerator* cg = new LateInlineMHCallGenerator(caller, callee, input_not_const); 469 return cg; 470 } 471 472 class LateInlineStringCallGenerator : public LateInlineCallGenerator { 473 474 public: 475 LateInlineStringCallGenerator(ciMethod* method, CallGenerator* inline_cg) : 476 LateInlineCallGenerator(method, inline_cg) {} 477 478 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) { 479 Compile *C = Compile::current(); 480 481 C->log_inline_id((jlong)this); 482 483 C->add_string_late_inline(this); 484 485 JVMState* new_jvms = DirectCallGenerator::generate(jvms, parent_parser); 486 return new_jvms; 487 } 488 489 virtual bool is_string_late_inline() const { return true; } 490 }; 491 492 CallGenerator* CallGenerator::for_string_late_inline(ciMethod* method, CallGenerator* inline_cg) { 493 return new LateInlineStringCallGenerator(method, inline_cg); 494 } 495 496 class LateInlineBoxingCallGenerator : public LateInlineCallGenerator { 497 498 public: 499 LateInlineBoxingCallGenerator(ciMethod* method, CallGenerator* inline_cg) : 500 LateInlineCallGenerator(method, inline_cg) {} 501 502 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser) { 503 Compile *C = Compile::current(); 504 505 C->log_inline_id((jlong)this); 506 507 C->add_boxing_late_inline(this); 508 509 JVMState* new_jvms = DirectCallGenerator::generate(jvms, parent_parser); 510 return new_jvms; 511 } 512 }; 513 514 CallGenerator* CallGenerator::for_boxing_late_inline(ciMethod* method, CallGenerator* inline_cg) { 515 return new LateInlineBoxingCallGenerator(method, inline_cg); 516 } 517 518 //---------------------------WarmCallGenerator-------------------------------- 519 // Internal class which handles initial deferral of inlining decisions. 520 class WarmCallGenerator : public CallGenerator { 521 WarmCallInfo* _call_info; 522 CallGenerator* _if_cold; 523 CallGenerator* _if_hot; 524 bool _is_virtual; // caches virtuality of if_cold 525 bool _is_inline; // caches inline-ness of if_hot 526 527 public: 528 WarmCallGenerator(WarmCallInfo* ci, 529 CallGenerator* if_cold, 530 CallGenerator* if_hot) 531 : CallGenerator(if_cold->method()) 532 { 533 assert(method() == if_hot->method(), "consistent choices"); 534 _call_info = ci; 535 _if_cold = if_cold; 536 _if_hot = if_hot; 537 _is_virtual = if_cold->is_virtual(); 538 _is_inline = if_hot->is_inline(); 539 } 540 541 virtual bool is_inline() const { return _is_inline; } 542 virtual bool is_virtual() const { return _is_virtual; } 543 virtual bool is_deferred() const { return true; } 544 545 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 546 }; 547 548 549 CallGenerator* CallGenerator::for_warm_call(WarmCallInfo* ci, 550 CallGenerator* if_cold, 551 CallGenerator* if_hot) { 552 return new WarmCallGenerator(ci, if_cold, if_hot); 553 } 554 555 JVMState* WarmCallGenerator::generate(JVMState* jvms, Parse* parent_parser) { 556 Compile* C = Compile::current(); 557 C->print_inlining_update(this); 558 559 if (C->log() != NULL) { 560 C->log()->elem("warm_call bci='%d'", jvms->bci()); 561 } 562 jvms = _if_cold->generate(jvms, parent_parser); 563 if (jvms != NULL) { 564 Node* m = jvms->map()->control(); 565 if (m->is_CatchProj()) m = m->in(0); else m = C->top(); 566 if (m->is_Catch()) m = m->in(0); else m = C->top(); 567 if (m->is_Proj()) m = m->in(0); else m = C->top(); 568 if (m->is_CallJava()) { 569 _call_info->set_call(m->as_Call()); 570 _call_info->set_hot_cg(_if_hot); 571 #ifndef PRODUCT 572 if (PrintOpto || PrintOptoInlining) { 573 tty->print_cr("Queueing for warm inlining at bci %d:", jvms->bci()); 574 tty->print("WCI: "); 575 _call_info->print(); 576 } 577 #endif 578 _call_info->set_heat(_call_info->compute_heat()); 579 C->set_warm_calls(_call_info->insert_into(C->warm_calls())); 580 } 581 } 582 return jvms; 583 } 584 585 void WarmCallInfo::make_hot() { 586 Unimplemented(); 587 } 588 589 void WarmCallInfo::make_cold() { 590 // No action: Just dequeue. 591 } 592 593 594 //------------------------PredictedCallGenerator------------------------------ 595 // Internal class which handles all out-of-line calls checking receiver type. 596 class PredictedCallGenerator : public CallGenerator { 597 ciKlass* _predicted_receiver; 598 CallGenerator* _if_missed; 599 CallGenerator* _if_hit; 600 float _hit_prob; 601 602 public: 603 PredictedCallGenerator(ciKlass* predicted_receiver, 604 CallGenerator* if_missed, 605 CallGenerator* if_hit, float hit_prob) 606 : CallGenerator(if_missed->method()) 607 { 608 // The call profile data may predict the hit_prob as extreme as 0 or 1. 609 // Remove the extremes values from the range. 610 if (hit_prob > PROB_MAX) hit_prob = PROB_MAX; 611 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN; 612 613 _predicted_receiver = predicted_receiver; 614 _if_missed = if_missed; 615 _if_hit = if_hit; 616 _hit_prob = hit_prob; 617 } 618 619 virtual bool is_virtual() const { return true; } 620 virtual bool is_inline() const { return _if_hit->is_inline(); } 621 virtual bool is_deferred() const { return _if_hit->is_deferred(); } 622 623 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 624 }; 625 626 627 CallGenerator* CallGenerator::for_predicted_call(ciKlass* predicted_receiver, 628 CallGenerator* if_missed, 629 CallGenerator* if_hit, 630 float hit_prob) { 631 return new PredictedCallGenerator(predicted_receiver, if_missed, if_hit, hit_prob); 632 } 633 634 635 JVMState* PredictedCallGenerator::generate(JVMState* jvms, Parse* parent_parser) { 636 GraphKit kit(jvms); 637 kit.C->print_inlining_update(this); 638 PhaseGVN& gvn = kit.gvn(); 639 // We need an explicit receiver null_check before checking its type. 640 // We share a map with the caller, so his JVMS gets adjusted. 641 Node* receiver = kit.argument(0); 642 643 CompileLog* log = kit.C->log(); 644 if (log != NULL) { 645 log->elem("predicted_call bci='%d' klass='%d'", 646 jvms->bci(), log->identify(_predicted_receiver)); 647 } 648 649 receiver = kit.null_check_receiver_before_call(method()); 650 if (kit.stopped()) { 651 return kit.transfer_exceptions_into_jvms(); 652 } 653 654 Node* exact_receiver = receiver; // will get updated in place... 655 Node* slow_ctl = kit.type_check_receiver(receiver, 656 _predicted_receiver, _hit_prob, 657 &exact_receiver); 658 659 SafePointNode* slow_map = NULL; 660 JVMState* slow_jvms; 661 { PreserveJVMState pjvms(&kit); 662 kit.set_control(slow_ctl); 663 if (!kit.stopped()) { 664 slow_jvms = _if_missed->generate(kit.sync_jvms(), parent_parser); 665 if (kit.failing()) 666 return NULL; // might happen because of NodeCountInliningCutoff 667 assert(slow_jvms != NULL, "must be"); 668 kit.add_exception_states_from(slow_jvms); 669 kit.set_map(slow_jvms->map()); 670 if (!kit.stopped()) 671 slow_map = kit.stop(); 672 } 673 } 674 675 if (kit.stopped()) { 676 // Instance exactly does not matches the desired type. 677 kit.set_jvms(slow_jvms); 678 return kit.transfer_exceptions_into_jvms(); 679 } 680 681 // fall through if the instance exactly matches the desired type 682 kit.replace_in_map(receiver, exact_receiver); 683 684 // Make the hot call: 685 JVMState* new_jvms = _if_hit->generate(kit.sync_jvms(), parent_parser); 686 if (new_jvms == NULL) { 687 // Inline failed, so make a direct call. 688 assert(_if_hit->is_inline(), "must have been a failed inline"); 689 CallGenerator* cg = CallGenerator::for_direct_call(_if_hit->method()); 690 new_jvms = cg->generate(kit.sync_jvms(), parent_parser); 691 } 692 kit.add_exception_states_from(new_jvms); 693 kit.set_jvms(new_jvms); 694 695 // Need to merge slow and fast? 696 if (slow_map == NULL) { 697 // The fast path is the only path remaining. 698 return kit.transfer_exceptions_into_jvms(); 699 } 700 701 if (kit.stopped()) { 702 // Inlined method threw an exception, so it's just the slow path after all. 703 kit.set_jvms(slow_jvms); 704 return kit.transfer_exceptions_into_jvms(); 705 } 706 707 // Finish the diamond. 708 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization 709 RegionNode* region = new (kit.C) RegionNode(3); 710 region->init_req(1, kit.control()); 711 region->init_req(2, slow_map->control()); 712 kit.set_control(gvn.transform(region)); 713 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); 714 iophi->set_req(2, slow_map->i_o()); 715 kit.set_i_o(gvn.transform(iophi)); 716 kit.merge_memory(slow_map->merged_memory(), region, 2); 717 uint tos = kit.jvms()->stkoff() + kit.sp(); 718 uint limit = slow_map->req(); 719 for (uint i = TypeFunc::Parms; i < limit; i++) { 720 // Skip unused stack slots; fast forward to monoff(); 721 if (i == tos) { 722 i = kit.jvms()->monoff(); 723 if( i >= limit ) break; 724 } 725 Node* m = kit.map()->in(i); 726 Node* n = slow_map->in(i); 727 if (m != n) { 728 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n)); 729 Node* phi = PhiNode::make(region, m, t); 730 phi->set_req(2, n); 731 kit.map()->set_req(i, gvn.transform(phi)); 732 } 733 } 734 return kit.transfer_exceptions_into_jvms(); 735 } 736 737 738 CallGenerator* CallGenerator::for_method_handle_call(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool delayed_forbidden) { 739 assert(callee->is_method_handle_intrinsic() || 740 callee->is_compiled_lambda_form(), "for_method_handle_call mismatch"); 741 bool input_not_const; 742 CallGenerator* cg = CallGenerator::for_method_handle_inline(jvms, caller, callee, input_not_const); 743 Compile* C = Compile::current(); 744 if (cg != NULL) { 745 if (!delayed_forbidden && AlwaysIncrementalInline) { 746 return CallGenerator::for_late_inline(callee, cg); 747 } else { 748 return cg; 749 } 750 } 751 int bci = jvms->bci(); 752 ciCallProfile profile = caller->call_profile_at_bci(bci); 753 int call_site_count = caller->scale_count(profile.count()); 754 755 if (IncrementalInline && call_site_count > 0 && 756 (input_not_const || !C->inlining_incrementally() || C->over_inlining_cutoff())) { 757 return CallGenerator::for_mh_late_inline(caller, callee, input_not_const); 758 } else { 759 // Out-of-line call. 760 return CallGenerator::for_direct_call(callee); 761 } 762 } 763 764 CallGenerator* CallGenerator::for_method_handle_inline(JVMState* jvms, ciMethod* caller, ciMethod* callee, bool& input_not_const) { 765 GraphKit kit(jvms); 766 PhaseGVN& gvn = kit.gvn(); 767 Compile* C = kit.C; 768 vmIntrinsics::ID iid = callee->intrinsic_id(); 769 input_not_const = true; 770 switch (iid) { 771 case vmIntrinsics::_invokeBasic: 772 { 773 // Get MethodHandle receiver: 774 Node* receiver = kit.argument(0); 775 if (receiver->Opcode() == Op_ConP) { 776 input_not_const = false; 777 const TypeOopPtr* oop_ptr = receiver->bottom_type()->is_oopptr(); 778 ciMethod* target = oop_ptr->const_oop()->as_method_handle()->get_vmtarget(); 779 guarantee(!target->is_method_handle_intrinsic(), "should not happen"); // XXX remove 780 const int vtable_index = Method::invalid_vtable_index; 781 CallGenerator* cg = C->call_generator(target, vtable_index, false, jvms, true, PROB_ALWAYS, NULL, true, true); 782 assert(cg == NULL || !cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here"); 783 if (cg != NULL && cg->is_inline()) 784 return cg; 785 } else { 786 const char* msg = "receiver not constant"; 787 if (PrintInlining) C->print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg); 788 C->log_inline_failure(msg); 789 } 790 } 791 break; 792 793 case vmIntrinsics::_linkToVirtual: 794 case vmIntrinsics::_linkToStatic: 795 case vmIntrinsics::_linkToSpecial: 796 case vmIntrinsics::_linkToInterface: 797 { 798 // Get MemberName argument: 799 Node* member_name = kit.argument(callee->arg_size() - 1); 800 if (member_name->Opcode() == Op_ConP) { 801 input_not_const = false; 802 const TypeOopPtr* oop_ptr = member_name->bottom_type()->is_oopptr(); 803 ciMethod* target = oop_ptr->const_oop()->as_member_name()->get_vmtarget(); 804 805 // In lamda forms we erase signature types to avoid resolving issues 806 // involving class loaders. When we optimize a method handle invoke 807 // to a direct call we must cast the receiver and arguments to its 808 // actual types. 809 ciSignature* signature = target->signature(); 810 const int receiver_skip = target->is_static() ? 0 : 1; 811 // Cast receiver to its type. 812 if (!target->is_static()) { 813 Node* arg = kit.argument(0); 814 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); 815 const Type* sig_type = TypeOopPtr::make_from_klass(signature->accessing_klass()); 816 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { 817 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type)); 818 kit.set_argument(0, cast_obj); 819 } 820 } 821 // Cast reference arguments to its type. 822 for (int i = 0; i < signature->count(); i++) { 823 ciType* t = signature->type_at(i); 824 if (t->is_klass()) { 825 Node* arg = kit.argument(receiver_skip + i); 826 const TypeOopPtr* arg_type = arg->bottom_type()->isa_oopptr(); 827 const Type* sig_type = TypeOopPtr::make_from_klass(t->as_klass()); 828 if (arg_type != NULL && !arg_type->higher_equal(sig_type)) { 829 Node* cast_obj = gvn.transform(new (C) CheckCastPPNode(kit.control(), arg, sig_type)); 830 kit.set_argument(receiver_skip + i, cast_obj); 831 } 832 } 833 } 834 835 // Try to get the most accurate receiver type 836 const bool is_virtual = (iid == vmIntrinsics::_linkToVirtual); 837 const bool is_virtual_or_interface = (is_virtual || iid == vmIntrinsics::_linkToInterface); 838 int vtable_index = Method::invalid_vtable_index; 839 bool call_does_dispatch = false; 840 841 ciKlass* speculative_receiver_type = NULL; 842 if (is_virtual_or_interface) { 843 ciInstanceKlass* klass = target->holder(); 844 Node* receiver_node = kit.argument(0); 845 const TypeOopPtr* receiver_type = gvn.type(receiver_node)->isa_oopptr(); 846 // call_does_dispatch and vtable_index are out-parameters. They might be changed. 847 target = C->optimize_virtual_call(caller, jvms->bci(), klass, target, receiver_type, 848 is_virtual, 849 call_does_dispatch, vtable_index); // out-parameters 850 // We lack profiling at this call but type speculation may 851 // provide us with a type 852 speculative_receiver_type = receiver_type->speculative_type(); 853 } 854 CallGenerator* cg = C->call_generator(target, vtable_index, call_does_dispatch, jvms, true, PROB_ALWAYS, speculative_receiver_type, true, true); 855 assert(cg == NULL || !cg->is_late_inline() || cg->is_mh_late_inline(), "no late inline here"); 856 if (cg != NULL && cg->is_inline()) 857 return cg; 858 } else { 859 const char* msg = "member_name not constant"; 860 if (PrintInlining) C->print_inlining(callee, jvms->depth() - 1, jvms->bci(), msg); 861 C->log_inline_failure(msg); 862 } 863 } 864 break; 865 866 default: 867 fatal(err_msg_res("unexpected intrinsic %d: %s", iid, vmIntrinsics::name_at(iid))); 868 break; 869 } 870 return NULL; 871 } 872 873 874 //------------------------PredictedIntrinsicGenerator------------------------------ 875 // Internal class which handles all predicted Intrinsic calls. 876 class PredictedIntrinsicGenerator : public CallGenerator { 877 CallGenerator* _intrinsic; 878 CallGenerator* _cg; 879 880 public: 881 PredictedIntrinsicGenerator(CallGenerator* intrinsic, 882 CallGenerator* cg) 883 : CallGenerator(cg->method()) 884 { 885 _intrinsic = intrinsic; 886 _cg = cg; 887 } 888 889 virtual bool is_virtual() const { return true; } 890 virtual bool is_inlined() const { return true; } 891 virtual bool is_intrinsic() const { return true; } 892 893 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 894 }; 895 896 897 CallGenerator* CallGenerator::for_predicted_intrinsic(CallGenerator* intrinsic, 898 CallGenerator* cg) { 899 return new PredictedIntrinsicGenerator(intrinsic, cg); 900 } 901 902 903 JVMState* PredictedIntrinsicGenerator::generate(JVMState* jvms, Parse* parent_parser) { 904 GraphKit kit(jvms); 905 PhaseGVN& gvn = kit.gvn(); 906 907 CompileLog* log = kit.C->log(); 908 if (log != NULL) { 909 log->elem("predicted_intrinsic bci='%d' method='%d'", 910 jvms->bci(), log->identify(method())); 911 } 912 913 Node* slow_ctl = _intrinsic->generate_predicate(kit.sync_jvms()); 914 if (kit.failing()) 915 return NULL; // might happen because of NodeCountInliningCutoff 916 917 kit.C->print_inlining_update(this); 918 SafePointNode* slow_map = NULL; 919 JVMState* slow_jvms; 920 if (slow_ctl != NULL) { 921 PreserveJVMState pjvms(&kit); 922 kit.set_control(slow_ctl); 923 if (!kit.stopped()) { 924 slow_jvms = _cg->generate(kit.sync_jvms(), parent_parser); 925 if (kit.failing()) 926 return NULL; // might happen because of NodeCountInliningCutoff 927 assert(slow_jvms != NULL, "must be"); 928 kit.add_exception_states_from(slow_jvms); 929 kit.set_map(slow_jvms->map()); 930 if (!kit.stopped()) 931 slow_map = kit.stop(); 932 } 933 } 934 935 if (kit.stopped()) { 936 // Predicate is always false. 937 kit.set_jvms(slow_jvms); 938 return kit.transfer_exceptions_into_jvms(); 939 } 940 941 // Generate intrinsic code: 942 JVMState* new_jvms = _intrinsic->generate(kit.sync_jvms(), parent_parser); 943 if (new_jvms == NULL) { 944 // Intrinsic failed, so use slow code or make a direct call. 945 if (slow_map == NULL) { 946 CallGenerator* cg = CallGenerator::for_direct_call(method()); 947 new_jvms = cg->generate(kit.sync_jvms(), parent_parser); 948 } else { 949 kit.set_jvms(slow_jvms); 950 return kit.transfer_exceptions_into_jvms(); 951 } 952 } 953 kit.add_exception_states_from(new_jvms); 954 kit.set_jvms(new_jvms); 955 956 // Need to merge slow and fast? 957 if (slow_map == NULL) { 958 // The fast path is the only path remaining. 959 return kit.transfer_exceptions_into_jvms(); 960 } 961 962 if (kit.stopped()) { 963 // Intrinsic method threw an exception, so it's just the slow path after all. 964 kit.set_jvms(slow_jvms); 965 return kit.transfer_exceptions_into_jvms(); 966 } 967 968 // Finish the diamond. 969 kit.C->set_has_split_ifs(true); // Has chance for split-if optimization 970 RegionNode* region = new (kit.C) RegionNode(3); 971 region->init_req(1, kit.control()); 972 region->init_req(2, slow_map->control()); 973 kit.set_control(gvn.transform(region)); 974 Node* iophi = PhiNode::make(region, kit.i_o(), Type::ABIO); 975 iophi->set_req(2, slow_map->i_o()); 976 kit.set_i_o(gvn.transform(iophi)); 977 kit.merge_memory(slow_map->merged_memory(), region, 2); 978 uint tos = kit.jvms()->stkoff() + kit.sp(); 979 uint limit = slow_map->req(); 980 for (uint i = TypeFunc::Parms; i < limit; i++) { 981 // Skip unused stack slots; fast forward to monoff(); 982 if (i == tos) { 983 i = kit.jvms()->monoff(); 984 if( i >= limit ) break; 985 } 986 Node* m = kit.map()->in(i); 987 Node* n = slow_map->in(i); 988 if (m != n) { 989 const Type* t = gvn.type(m)->meet_speculative(gvn.type(n)); 990 Node* phi = PhiNode::make(region, m, t); 991 phi->set_req(2, n); 992 kit.map()->set_req(i, gvn.transform(phi)); 993 } 994 } 995 return kit.transfer_exceptions_into_jvms(); 996 } 997 998 //-------------------------UncommonTrapCallGenerator----------------------------- 999 // Internal class which handles all out-of-line calls checking receiver type. 1000 class UncommonTrapCallGenerator : public CallGenerator { 1001 Deoptimization::DeoptReason _reason; 1002 Deoptimization::DeoptAction _action; 1003 1004 public: 1005 UncommonTrapCallGenerator(ciMethod* m, 1006 Deoptimization::DeoptReason reason, 1007 Deoptimization::DeoptAction action) 1008 : CallGenerator(m) 1009 { 1010 _reason = reason; 1011 _action = action; 1012 } 1013 1014 virtual bool is_virtual() const { ShouldNotReachHere(); return false; } 1015 virtual bool is_trap() const { return true; } 1016 1017 virtual JVMState* generate(JVMState* jvms, Parse* parent_parser); 1018 }; 1019 1020 1021 CallGenerator* 1022 CallGenerator::for_uncommon_trap(ciMethod* m, 1023 Deoptimization::DeoptReason reason, 1024 Deoptimization::DeoptAction action) { 1025 return new UncommonTrapCallGenerator(m, reason, action); 1026 } 1027 1028 1029 JVMState* UncommonTrapCallGenerator::generate(JVMState* jvms, Parse* parent_parser) { 1030 GraphKit kit(jvms); 1031 kit.C->print_inlining_update(this); 1032 // Take the trap with arguments pushed on the stack. (Cf. null_check_receiver). 1033 int nargs = method()->arg_size(); 1034 kit.inc_sp(nargs); 1035 assert(nargs <= kit.sp() && kit.sp() <= jvms->stk_size(), "sane sp w/ args pushed"); 1036 if (_reason == Deoptimization::Reason_class_check && 1037 _action == Deoptimization::Action_maybe_recompile) { 1038 // Temp fix for 6529811 1039 // Don't allow uncommon_trap to override our decision to recompile in the event 1040 // of a class cast failure for a monomorphic call as it will never let us convert 1041 // the call to either bi-morphic or megamorphic and can lead to unc-trap loops 1042 bool keep_exact_action = true; 1043 kit.uncommon_trap(_reason, _action, NULL, "monomorphic vcall checkcast", false, keep_exact_action); 1044 } else { 1045 kit.uncommon_trap(_reason, _action); 1046 } 1047 return kit.transfer_exceptions_into_jvms(); 1048 } 1049 1050 // (Note: Moved hook_up_call to GraphKit::set_edges_for_java_call.) 1051 1052 // (Node: Merged hook_up_exits into ParseGenerator::generate.) 1053 1054 #define NODES_OVERHEAD_PER_METHOD (30.0) 1055 #define NODES_PER_BYTECODE (9.5) 1056 1057 void WarmCallInfo::init(JVMState* call_site, ciMethod* call_method, ciCallProfile& profile, float prof_factor) { 1058 int call_count = profile.count(); 1059 int code_size = call_method->code_size(); 1060 1061 // Expected execution count is based on the historical count: 1062 _count = call_count < 0 ? 1 : call_site->method()->scale_count(call_count, prof_factor); 1063 1064 // Expected profit from inlining, in units of simple call-overheads. 1065 _profit = 1.0; 1066 1067 // Expected work performed by the call in units of call-overheads. 1068 // %%% need an empirical curve fit for "work" (time in call) 1069 float bytecodes_per_call = 3; 1070 _work = 1.0 + code_size / bytecodes_per_call; 1071 1072 // Expected size of compilation graph: 1073 // -XX:+PrintParseStatistics once reported: 1074 // Methods seen: 9184 Methods parsed: 9184 Nodes created: 1582391 1075 // Histogram of 144298 parsed bytecodes: 1076 // %%% Need an better predictor for graph size. 1077 _size = NODES_OVERHEAD_PER_METHOD + (NODES_PER_BYTECODE * code_size); 1078 } 1079 1080 // is_cold: Return true if the node should never be inlined. 1081 // This is true if any of the key metrics are extreme. 1082 bool WarmCallInfo::is_cold() const { 1083 if (count() < WarmCallMinCount) return true; 1084 if (profit() < WarmCallMinProfit) return true; 1085 if (work() > WarmCallMaxWork) return true; 1086 if (size() > WarmCallMaxSize) return true; 1087 return false; 1088 } 1089 1090 // is_hot: Return true if the node should be inlined immediately. 1091 // This is true if any of the key metrics are extreme. 1092 bool WarmCallInfo::is_hot() const { 1093 assert(!is_cold(), "eliminate is_cold cases before testing is_hot"); 1094 if (count() >= HotCallCountThreshold) return true; 1095 if (profit() >= HotCallProfitThreshold) return true; 1096 if (work() <= HotCallTrivialWork) return true; 1097 if (size() <= HotCallTrivialSize) return true; 1098 return false; 1099 } 1100 1101 // compute_heat: 1102 float WarmCallInfo::compute_heat() const { 1103 assert(!is_cold(), "compute heat only on warm nodes"); 1104 assert(!is_hot(), "compute heat only on warm nodes"); 1105 int min_size = MAX2(0, (int)HotCallTrivialSize); 1106 int max_size = MIN2(500, (int)WarmCallMaxSize); 1107 float method_size = (size() - min_size) / MAX2(1, max_size - min_size); 1108 float size_factor; 1109 if (method_size < 0.05) size_factor = 4; // 2 sigmas better than avg. 1110 else if (method_size < 0.15) size_factor = 2; // 1 sigma better than avg. 1111 else if (method_size < 0.5) size_factor = 1; // better than avg. 1112 else size_factor = 0.5; // worse than avg. 1113 return (count() * profit() * size_factor); 1114 } 1115 1116 bool WarmCallInfo::warmer_than(WarmCallInfo* that) { 1117 assert(this != that, "compare only different WCIs"); 1118 assert(this->heat() != 0 && that->heat() != 0, "call compute_heat 1st"); 1119 if (this->heat() > that->heat()) return true; 1120 if (this->heat() < that->heat()) return false; 1121 assert(this->heat() == that->heat(), "no NaN heat allowed"); 1122 // Equal heat. Break the tie some other way. 1123 if (!this->call() || !that->call()) return (address)this > (address)that; 1124 return this->call()->_idx > that->call()->_idx; 1125 } 1126 1127 //#define UNINIT_NEXT ((WarmCallInfo*)badAddress) 1128 #define UNINIT_NEXT ((WarmCallInfo*)NULL) 1129 1130 WarmCallInfo* WarmCallInfo::insert_into(WarmCallInfo* head) { 1131 assert(next() == UNINIT_NEXT, "not yet on any list"); 1132 WarmCallInfo* prev_p = NULL; 1133 WarmCallInfo* next_p = head; 1134 while (next_p != NULL && next_p->warmer_than(this)) { 1135 prev_p = next_p; 1136 next_p = prev_p->next(); 1137 } 1138 // Install this between prev_p and next_p. 1139 this->set_next(next_p); 1140 if (prev_p == NULL) 1141 head = this; 1142 else 1143 prev_p->set_next(this); 1144 return head; 1145 } 1146 1147 WarmCallInfo* WarmCallInfo::remove_from(WarmCallInfo* head) { 1148 WarmCallInfo* prev_p = NULL; 1149 WarmCallInfo* next_p = head; 1150 while (next_p != this) { 1151 assert(next_p != NULL, "this must be in the list somewhere"); 1152 prev_p = next_p; 1153 next_p = prev_p->next(); 1154 } 1155 next_p = this->next(); 1156 debug_only(this->set_next(UNINIT_NEXT)); 1157 // Remove this from between prev_p and next_p. 1158 if (prev_p == NULL) 1159 head = next_p; 1160 else 1161 prev_p->set_next(next_p); 1162 return head; 1163 } 1164 1165 WarmCallInfo WarmCallInfo::_always_hot(WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE(), 1166 WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE()); 1167 WarmCallInfo WarmCallInfo::_always_cold(WarmCallInfo::MIN_VALUE(), WarmCallInfo::MIN_VALUE(), 1168 WarmCallInfo::MAX_VALUE(), WarmCallInfo::MAX_VALUE()); 1169 1170 WarmCallInfo* WarmCallInfo::always_hot() { 1171 assert(_always_hot.is_hot(), "must always be hot"); 1172 return &_always_hot; 1173 } 1174 1175 WarmCallInfo* WarmCallInfo::always_cold() { 1176 assert(_always_cold.is_cold(), "must always be cold"); 1177 return &_always_cold; 1178 } 1179 1180 1181 #ifndef PRODUCT 1182 1183 void WarmCallInfo::print() const { 1184 tty->print("%s : C=%6.1f P=%6.1f W=%6.1f S=%6.1f H=%6.1f -> %p", 1185 is_cold() ? "cold" : is_hot() ? "hot " : "warm", 1186 count(), profit(), work(), size(), compute_heat(), next()); 1187 tty->cr(); 1188 if (call() != NULL) call()->dump(); 1189 } 1190 1191 void print_wci(WarmCallInfo* ci) { 1192 ci->print(); 1193 } 1194 1195 void WarmCallInfo::print_all() const { 1196 for (const WarmCallInfo* p = this; p != NULL; p = p->next()) 1197 p->print(); 1198 } 1199 1200 int WarmCallInfo::count_all() const { 1201 int cnt = 0; 1202 for (const WarmCallInfo* p = this; p != NULL; p = p->next()) 1203 cnt++; 1204 return cnt; 1205 } 1206 1207 #endif //PRODUCT