1 /* 2 * Copyright (c) 1997, 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 "compiler/oopMap.hpp" 28 #include "opto/callGenerator.hpp" 29 #include "opto/callnode.hpp" 30 #include "opto/escape.hpp" 31 #include "opto/locknode.hpp" 32 #include "opto/machnode.hpp" 33 #include "opto/matcher.hpp" 34 #include "opto/parse.hpp" 35 #include "opto/regalloc.hpp" 36 #include "opto/regmask.hpp" 37 #include "opto/rootnode.hpp" 38 #include "opto/runtime.hpp" 39 40 // Portions of code courtesy of Clifford Click 41 42 // Optimization - Graph Style 43 44 //============================================================================= 45 uint StartNode::size_of() const { return sizeof(*this); } 46 uint StartNode::cmp( const Node &n ) const 47 { return _domain == ((StartNode&)n)._domain; } 48 const Type *StartNode::bottom_type() const { return _domain; } 49 const Type *StartNode::Value(PhaseTransform *phase) const { return _domain; } 50 #ifndef PRODUCT 51 void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);} 52 #endif 53 54 //------------------------------Ideal------------------------------------------ 55 Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){ 56 return remove_dead_region(phase, can_reshape) ? this : NULL; 57 } 58 59 //------------------------------calling_convention----------------------------- 60 void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { 61 Matcher::calling_convention( sig_bt, parm_regs, argcnt, false ); 62 } 63 64 //------------------------------Registers-------------------------------------- 65 const RegMask &StartNode::in_RegMask(uint) const { 66 return RegMask::Empty; 67 } 68 69 //------------------------------match------------------------------------------ 70 // Construct projections for incoming parameters, and their RegMask info 71 Node *StartNode::match( const ProjNode *proj, const Matcher *match ) { 72 switch (proj->_con) { 73 case TypeFunc::Control: 74 case TypeFunc::I_O: 75 case TypeFunc::Memory: 76 return new (match->C) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj); 77 case TypeFunc::FramePtr: 78 return new (match->C) MachProjNode(this,proj->_con,Matcher::c_frame_ptr_mask, Op_RegP); 79 case TypeFunc::ReturnAdr: 80 return new (match->C) MachProjNode(this,proj->_con,match->_return_addr_mask,Op_RegP); 81 case TypeFunc::Parms: 82 default: { 83 uint parm_num = proj->_con - TypeFunc::Parms; 84 const Type *t = _domain->field_at(proj->_con); 85 if (t->base() == Type::Half) // 2nd half of Longs and Doubles 86 return new (match->C) ConNode(Type::TOP); 87 uint ideal_reg = t->ideal_reg(); 88 RegMask &rm = match->_calling_convention_mask[parm_num]; 89 return new (match->C) MachProjNode(this,proj->_con,rm,ideal_reg); 90 } 91 } 92 return NULL; 93 } 94 95 //------------------------------StartOSRNode---------------------------------- 96 // The method start node for an on stack replacement adapter 97 98 //------------------------------osr_domain----------------------------- 99 const TypeTuple *StartOSRNode::osr_domain() { 100 const Type **fields = TypeTuple::fields(2); 101 fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer 102 103 return TypeTuple::make(TypeFunc::Parms+1, fields); 104 } 105 106 //============================================================================= 107 const char * const ParmNode::names[TypeFunc::Parms+1] = { 108 "Control", "I_O", "Memory", "FramePtr", "ReturnAdr", "Parms" 109 }; 110 111 #ifndef PRODUCT 112 void ParmNode::dump_spec(outputStream *st) const { 113 if( _con < TypeFunc::Parms ) { 114 st->print(names[_con]); 115 } else { 116 st->print("Parm%d: ",_con-TypeFunc::Parms); 117 // Verbose and WizardMode dump bottom_type for all nodes 118 if( !Verbose && !WizardMode ) bottom_type()->dump_on(st); 119 } 120 } 121 #endif 122 123 uint ParmNode::ideal_reg() const { 124 switch( _con ) { 125 case TypeFunc::Control : // fall through 126 case TypeFunc::I_O : // fall through 127 case TypeFunc::Memory : return 0; 128 case TypeFunc::FramePtr : // fall through 129 case TypeFunc::ReturnAdr: return Op_RegP; 130 default : assert( _con > TypeFunc::Parms, "" ); 131 // fall through 132 case TypeFunc::Parms : { 133 // Type of argument being passed 134 const Type *t = in(0)->as_Start()->_domain->field_at(_con); 135 return t->ideal_reg(); 136 } 137 } 138 ShouldNotReachHere(); 139 return 0; 140 } 141 142 //============================================================================= 143 ReturnNode::ReturnNode(uint edges, Node *cntrl, Node *i_o, Node *memory, Node *frameptr, Node *retadr ) : Node(edges) { 144 init_req(TypeFunc::Control,cntrl); 145 init_req(TypeFunc::I_O,i_o); 146 init_req(TypeFunc::Memory,memory); 147 init_req(TypeFunc::FramePtr,frameptr); 148 init_req(TypeFunc::ReturnAdr,retadr); 149 } 150 151 Node *ReturnNode::Ideal(PhaseGVN *phase, bool can_reshape){ 152 return remove_dead_region(phase, can_reshape) ? this : NULL; 153 } 154 155 const Type *ReturnNode::Value( PhaseTransform *phase ) const { 156 return ( phase->type(in(TypeFunc::Control)) == Type::TOP) 157 ? Type::TOP 158 : Type::BOTTOM; 159 } 160 161 // Do we Match on this edge index or not? No edges on return nodes 162 uint ReturnNode::match_edge(uint idx) const { 163 return 0; 164 } 165 166 167 #ifndef PRODUCT 168 void ReturnNode::dump_req(outputStream *st) const { 169 // Dump the required inputs, enclosed in '(' and ')' 170 uint i; // Exit value of loop 171 for (i = 0; i < req(); i++) { // For all required inputs 172 if (i == TypeFunc::Parms) st->print("returns"); 173 if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); 174 else st->print("_ "); 175 } 176 } 177 #endif 178 179 //============================================================================= 180 RethrowNode::RethrowNode( 181 Node* cntrl, 182 Node* i_o, 183 Node* memory, 184 Node* frameptr, 185 Node* ret_adr, 186 Node* exception 187 ) : Node(TypeFunc::Parms + 1) { 188 init_req(TypeFunc::Control , cntrl ); 189 init_req(TypeFunc::I_O , i_o ); 190 init_req(TypeFunc::Memory , memory ); 191 init_req(TypeFunc::FramePtr , frameptr ); 192 init_req(TypeFunc::ReturnAdr, ret_adr); 193 init_req(TypeFunc::Parms , exception); 194 } 195 196 Node *RethrowNode::Ideal(PhaseGVN *phase, bool can_reshape){ 197 return remove_dead_region(phase, can_reshape) ? this : NULL; 198 } 199 200 const Type *RethrowNode::Value( PhaseTransform *phase ) const { 201 return (phase->type(in(TypeFunc::Control)) == Type::TOP) 202 ? Type::TOP 203 : Type::BOTTOM; 204 } 205 206 uint RethrowNode::match_edge(uint idx) const { 207 return 0; 208 } 209 210 #ifndef PRODUCT 211 void RethrowNode::dump_req(outputStream *st) const { 212 // Dump the required inputs, enclosed in '(' and ')' 213 uint i; // Exit value of loop 214 for (i = 0; i < req(); i++) { // For all required inputs 215 if (i == TypeFunc::Parms) st->print("exception"); 216 if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); 217 else st->print("_ "); 218 } 219 } 220 #endif 221 222 //============================================================================= 223 // Do we Match on this edge index or not? Match only target address & method 224 uint TailCallNode::match_edge(uint idx) const { 225 return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1; 226 } 227 228 //============================================================================= 229 // Do we Match on this edge index or not? Match only target address & oop 230 uint TailJumpNode::match_edge(uint idx) const { 231 return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1; 232 } 233 234 //============================================================================= 235 JVMState::JVMState(ciMethod* method, JVMState* caller) : 236 _method(method) { 237 assert(method != NULL, "must be valid call site"); 238 _reexecute = Reexecute_Undefined; 239 debug_only(_bci = -99); // random garbage value 240 debug_only(_map = (SafePointNode*)-1); 241 _caller = caller; 242 _depth = 1 + (caller == NULL ? 0 : caller->depth()); 243 _locoff = TypeFunc::Parms; 244 _stkoff = _locoff + _method->max_locals(); 245 _monoff = _stkoff + _method->max_stack(); 246 _scloff = _monoff; 247 _endoff = _monoff; 248 _sp = 0; 249 } 250 JVMState::JVMState(int stack_size) : 251 _method(NULL) { 252 _bci = InvocationEntryBci; 253 _reexecute = Reexecute_Undefined; 254 debug_only(_map = (SafePointNode*)-1); 255 _caller = NULL; 256 _depth = 1; 257 _locoff = TypeFunc::Parms; 258 _stkoff = _locoff; 259 _monoff = _stkoff + stack_size; 260 _scloff = _monoff; 261 _endoff = _monoff; 262 _sp = 0; 263 } 264 265 //--------------------------------of_depth------------------------------------- 266 JVMState* JVMState::of_depth(int d) const { 267 const JVMState* jvmp = this; 268 assert(0 < d && (uint)d <= depth(), "oob"); 269 for (int skip = depth() - d; skip > 0; skip--) { 270 jvmp = jvmp->caller(); 271 } 272 assert(jvmp->depth() == (uint)d, "found the right one"); 273 return (JVMState*)jvmp; 274 } 275 276 //-----------------------------same_calls_as----------------------------------- 277 bool JVMState::same_calls_as(const JVMState* that) const { 278 if (this == that) return true; 279 if (this->depth() != that->depth()) return false; 280 const JVMState* p = this; 281 const JVMState* q = that; 282 for (;;) { 283 if (p->_method != q->_method) return false; 284 if (p->_method == NULL) return true; // bci is irrelevant 285 if (p->_bci != q->_bci) return false; 286 if (p->_reexecute != q->_reexecute) return false; 287 p = p->caller(); 288 q = q->caller(); 289 if (p == q) return true; 290 assert(p != NULL && q != NULL, "depth check ensures we don't run off end"); 291 } 292 } 293 294 //------------------------------debug_start------------------------------------ 295 uint JVMState::debug_start() const { 296 debug_only(JVMState* jvmroot = of_depth(1)); 297 assert(jvmroot->locoff() <= this->locoff(), "youngest JVMState must be last"); 298 return of_depth(1)->locoff(); 299 } 300 301 //-------------------------------debug_end------------------------------------- 302 uint JVMState::debug_end() const { 303 debug_only(JVMState* jvmroot = of_depth(1)); 304 assert(jvmroot->endoff() <= this->endoff(), "youngest JVMState must be last"); 305 return endoff(); 306 } 307 308 //------------------------------debug_depth------------------------------------ 309 uint JVMState::debug_depth() const { 310 uint total = 0; 311 for (const JVMState* jvmp = this; jvmp != NULL; jvmp = jvmp->caller()) { 312 total += jvmp->debug_size(); 313 } 314 return total; 315 } 316 317 #ifndef PRODUCT 318 319 //------------------------------format_helper---------------------------------- 320 // Given an allocation (a Chaitin object) and a Node decide if the Node carries 321 // any defined value or not. If it does, print out the register or constant. 322 static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, const char *msg, uint i, GrowableArray<SafePointScalarObjectNode*> *scobjs ) { 323 if (n == NULL) { st->print(" NULL"); return; } 324 if (n->is_SafePointScalarObject()) { 325 // Scalar replacement. 326 SafePointScalarObjectNode* spobj = n->as_SafePointScalarObject(); 327 scobjs->append_if_missing(spobj); 328 int sco_n = scobjs->find(spobj); 329 assert(sco_n >= 0, ""); 330 st->print(" %s%d]=#ScObj" INT32_FORMAT, msg, i, sco_n); 331 return; 332 } 333 if (regalloc->node_regs_max_index() > 0 && 334 OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined 335 char buf[50]; 336 regalloc->dump_register(n,buf); 337 st->print(" %s%d]=%s",msg,i,buf); 338 } else { // No register, but might be constant 339 const Type *t = n->bottom_type(); 340 switch (t->base()) { 341 case Type::Int: 342 st->print(" %s%d]=#"INT32_FORMAT,msg,i,t->is_int()->get_con()); 343 break; 344 case Type::AnyPtr: 345 assert( t == TypePtr::NULL_PTR || n->in_dump(), "" ); 346 st->print(" %s%d]=#NULL",msg,i); 347 break; 348 case Type::AryPtr: 349 case Type::InstPtr: 350 st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->isa_oopptr()->const_oop()); 351 break; 352 case Type::KlassPtr: 353 st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->make_ptr()->isa_klassptr()->klass()); 354 break; 355 case Type::MetadataPtr: 356 st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->make_ptr()->isa_metadataptr()->metadata()); 357 break; 358 case Type::NarrowOop: 359 st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->make_ptr()->isa_oopptr()->const_oop()); 360 break; 361 case Type::RawPtr: 362 st->print(" %s%d]=#Raw" INTPTR_FORMAT,msg,i,t->is_rawptr()); 363 break; 364 case Type::DoubleCon: 365 st->print(" %s%d]=#%fD",msg,i,t->is_double_constant()->_d); 366 break; 367 case Type::FloatCon: 368 st->print(" %s%d]=#%fF",msg,i,t->is_float_constant()->_f); 369 break; 370 case Type::Long: 371 st->print(" %s%d]=#"INT64_FORMAT,msg,i,t->is_long()->get_con()); 372 break; 373 case Type::Half: 374 case Type::Top: 375 st->print(" %s%d]=_",msg,i); 376 break; 377 default: ShouldNotReachHere(); 378 } 379 } 380 } 381 382 //------------------------------format----------------------------------------- 383 void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st) const { 384 st->print(" #"); 385 if (_method) { 386 _method->print_short_name(st); 387 st->print(" @ bci:%d ",_bci); 388 } else { 389 st->print_cr(" runtime stub "); 390 return; 391 } 392 if (n->is_MachSafePoint()) { 393 GrowableArray<SafePointScalarObjectNode*> scobjs; 394 MachSafePointNode *mcall = n->as_MachSafePoint(); 395 uint i; 396 // Print locals 397 for (i = 0; i < (uint)loc_size(); i++) 398 format_helper(regalloc, st, mcall->local(this, i), "L[", i, &scobjs); 399 // Print stack 400 for (i = 0; i < (uint)stk_size(); i++) { 401 if ((uint)(_stkoff + i) >= mcall->len()) 402 st->print(" oob "); 403 else 404 format_helper(regalloc, st, mcall->stack(this, i), "STK[", i, &scobjs); 405 } 406 for (i = 0; (int)i < nof_monitors(); i++) { 407 Node *box = mcall->monitor_box(this, i); 408 Node *obj = mcall->monitor_obj(this, i); 409 if (regalloc->node_regs_max_index() > 0 && 410 OptoReg::is_valid(regalloc->get_reg_first(box))) { 411 box = BoxLockNode::box_node(box); 412 format_helper(regalloc, st, box, "MON-BOX[", i, &scobjs); 413 } else { 414 OptoReg::Name box_reg = BoxLockNode::reg(box); 415 st->print(" MON-BOX%d=%s+%d", 416 i, 417 OptoReg::regname(OptoReg::c_frame_pointer), 418 regalloc->reg2offset(box_reg)); 419 } 420 const char* obj_msg = "MON-OBJ["; 421 if (EliminateLocks) { 422 if (BoxLockNode::box_node(box)->is_eliminated()) 423 obj_msg = "MON-OBJ(LOCK ELIMINATED)["; 424 } 425 format_helper(regalloc, st, obj, obj_msg, i, &scobjs); 426 } 427 428 for (i = 0; i < (uint)scobjs.length(); i++) { 429 // Scalar replaced objects. 430 st->print_cr(""); 431 st->print(" # ScObj" INT32_FORMAT " ", i); 432 SafePointScalarObjectNode* spobj = scobjs.at(i); 433 ciKlass* cik = spobj->bottom_type()->is_oopptr()->klass(); 434 assert(cik->is_instance_klass() || 435 cik->is_array_klass(), "Not supported allocation."); 436 ciInstanceKlass *iklass = NULL; 437 if (cik->is_instance_klass()) { 438 cik->print_name_on(st); 439 iklass = cik->as_instance_klass(); 440 } else if (cik->is_type_array_klass()) { 441 cik->as_array_klass()->base_element_type()->print_name_on(st); 442 st->print("[%d]", spobj->n_fields()); 443 } else if (cik->is_obj_array_klass()) { 444 ciKlass* cie = cik->as_obj_array_klass()->base_element_klass(); 445 if (cie->is_instance_klass()) { 446 cie->print_name_on(st); 447 } else if (cie->is_type_array_klass()) { 448 cie->as_array_klass()->base_element_type()->print_name_on(st); 449 } else { 450 ShouldNotReachHere(); 451 } 452 st->print("[%d]", spobj->n_fields()); 453 int ndim = cik->as_array_klass()->dimension() - 1; 454 while (ndim-- > 0) { 455 st->print("[]"); 456 } 457 } 458 st->print("={"); 459 uint nf = spobj->n_fields(); 460 if (nf > 0) { 461 uint first_ind = spobj->first_index(mcall->jvms()); 462 Node* fld_node = mcall->in(first_ind); 463 ciField* cifield; 464 if (iklass != NULL) { 465 st->print(" ["); 466 cifield = iklass->nonstatic_field_at(0); 467 cifield->print_name_on(st); 468 format_helper(regalloc, st, fld_node, ":", 0, &scobjs); 469 } else { 470 format_helper(regalloc, st, fld_node, "[", 0, &scobjs); 471 } 472 for (uint j = 1; j < nf; j++) { 473 fld_node = mcall->in(first_ind+j); 474 if (iklass != NULL) { 475 st->print(", ["); 476 cifield = iklass->nonstatic_field_at(j); 477 cifield->print_name_on(st); 478 format_helper(regalloc, st, fld_node, ":", j, &scobjs); 479 } else { 480 format_helper(regalloc, st, fld_node, ", [", j, &scobjs); 481 } 482 } 483 } 484 st->print(" }"); 485 } 486 } 487 st->print_cr(""); 488 if (caller() != NULL) caller()->format(regalloc, n, st); 489 } 490 491 492 void JVMState::dump_spec(outputStream *st) const { 493 if (_method != NULL) { 494 bool printed = false; 495 if (!Verbose) { 496 // The JVMS dumps make really, really long lines. 497 // Take out the most boring parts, which are the package prefixes. 498 char buf[500]; 499 stringStream namest(buf, sizeof(buf)); 500 _method->print_short_name(&namest); 501 if (namest.count() < sizeof(buf)) { 502 const char* name = namest.base(); 503 if (name[0] == ' ') ++name; 504 const char* endcn = strchr(name, ':'); // end of class name 505 if (endcn == NULL) endcn = strchr(name, '('); 506 if (endcn == NULL) endcn = name + strlen(name); 507 while (endcn > name && endcn[-1] != '.' && endcn[-1] != '/') 508 --endcn; 509 st->print(" %s", endcn); 510 printed = true; 511 } 512 } 513 if (!printed) 514 _method->print_short_name(st); 515 st->print(" @ bci:%d",_bci); 516 if(_reexecute == Reexecute_True) 517 st->print(" reexecute"); 518 } else { 519 st->print(" runtime stub"); 520 } 521 if (caller() != NULL) caller()->dump_spec(st); 522 } 523 524 525 void JVMState::dump_on(outputStream* st) const { 526 bool print_map = _map && !((uintptr_t)_map & 1) && 527 ((caller() == NULL) || (caller()->map() != _map)); 528 if (print_map) { 529 if (_map->len() > _map->req()) { // _map->has_exceptions() 530 Node* ex = _map->in(_map->req()); // _map->next_exception() 531 // skip the first one; it's already being printed 532 while (ex != NULL && ex->len() > ex->req()) { 533 ex = ex->in(ex->req()); // ex->next_exception() 534 ex->dump(1); 535 } 536 } 537 _map->dump(Verbose ? 2 : 1); 538 } 539 if (caller() != NULL) { 540 caller()->dump_on(st); 541 } 542 st->print("JVMS depth=%d loc=%d stk=%d arg=%d mon=%d scalar=%d end=%d mondepth=%d sp=%d bci=%d reexecute=%s method=", 543 depth(), locoff(), stkoff(), argoff(), monoff(), scloff(), endoff(), monitor_depth(), sp(), bci(), should_reexecute()?"true":"false"); 544 if (_method == NULL) { 545 st->print_cr("(none)"); 546 } else { 547 _method->print_name(st); 548 st->cr(); 549 if (bci() >= 0 && bci() < _method->code_size()) { 550 st->print(" bc: "); 551 _method->print_codes_on(bci(), bci()+1, st); 552 } 553 } 554 } 555 556 // Extra way to dump a jvms from the debugger, 557 // to avoid a bug with C++ member function calls. 558 void dump_jvms(JVMState* jvms) { 559 jvms->dump(); 560 } 561 #endif 562 563 //--------------------------clone_shallow-------------------------------------- 564 JVMState* JVMState::clone_shallow(Compile* C) const { 565 JVMState* n = has_method() ? new (C) JVMState(_method, _caller) : new (C) JVMState(0); 566 n->set_bci(_bci); 567 n->_reexecute = _reexecute; 568 n->set_locoff(_locoff); 569 n->set_stkoff(_stkoff); 570 n->set_monoff(_monoff); 571 n->set_scloff(_scloff); 572 n->set_endoff(_endoff); 573 n->set_sp(_sp); 574 n->set_map(_map); 575 return n; 576 } 577 578 //---------------------------clone_deep---------------------------------------- 579 JVMState* JVMState::clone_deep(Compile* C) const { 580 JVMState* n = clone_shallow(C); 581 for (JVMState* p = n; p->_caller != NULL; p = p->_caller) { 582 p->_caller = p->_caller->clone_shallow(C); 583 } 584 assert(n->depth() == depth(), "sanity"); 585 assert(n->debug_depth() == debug_depth(), "sanity"); 586 return n; 587 } 588 589 /** 590 * Reset map for all callers 591 */ 592 void JVMState::set_map_deep(SafePointNode* map) { 593 for (JVMState* p = this; p->_caller != NULL; p = p->_caller) { 594 p->set_map(map); 595 } 596 } 597 598 // Adapt offsets in in-array after adding or removing an edge. 599 // Prerequisite is that the JVMState is used by only one node. 600 void JVMState::adapt_position(int delta) { 601 for (JVMState* jvms = this; jvms != NULL; jvms = jvms->caller()) { 602 jvms->set_locoff(jvms->locoff() + delta); 603 jvms->set_stkoff(jvms->stkoff() + delta); 604 jvms->set_monoff(jvms->monoff() + delta); 605 jvms->set_scloff(jvms->scloff() + delta); 606 jvms->set_endoff(jvms->endoff() + delta); 607 } 608 } 609 610 // Mirror the stack size calculation in the deopt code 611 // How much stack space would we need at this point in the program in 612 // case of deoptimization? 613 int JVMState::interpreter_frame_size() const { 614 const JVMState* jvms = this; 615 int size = 0; 616 int callee_parameters = 0; 617 int callee_locals = 0; 618 int popframe_extra_args = 0; 619 620 if (JvmtiExport::can_pop_frame()) { 621 ciMethod* method = this->method(); 622 int bci = this->bci(); 623 popframe_extra_args = MAX2(-method->get_stack_effect_if_at_invoke(bci), 0); 624 } 625 626 while (jvms != NULL) { 627 int locks = jvms->nof_monitors(); 628 int temps = jvms->stk_size(); 629 bool is_top_frame = (jvms->caller() == NULL); 630 ciMethod* method = jvms->method(); 631 632 int frame_size = BytesPerWord * Interpreter::size_activation(method->max_stack(), 633 temps + callee_parameters, 634 popframe_extra_args, 635 locks, 636 callee_parameters, 637 callee_locals, 638 is_top_frame); 639 size += frame_size; 640 641 callee_parameters = method->size_of_parameters(); 642 callee_locals = method->max_locals(); 643 popframe_extra_args = 0; 644 jvms = jvms->caller(); 645 } 646 return size + Deoptimization::last_frame_adjust(0, callee_locals) * BytesPerWord; 647 } 648 649 //============================================================================= 650 uint CallNode::cmp( const Node &n ) const 651 { return _tf == ((CallNode&)n)._tf && _jvms == ((CallNode&)n)._jvms; } 652 #ifndef PRODUCT 653 void CallNode::dump_req(outputStream *st) const { 654 // Dump the required inputs, enclosed in '(' and ')' 655 uint i; // Exit value of loop 656 for (i = 0; i < req(); i++) { // For all required inputs 657 if (i == TypeFunc::Parms) st->print("("); 658 if (in(i)) st->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); 659 else st->print("_ "); 660 } 661 st->print(")"); 662 } 663 664 void CallNode::dump_spec(outputStream *st) const { 665 st->print(" "); 666 tf()->dump_on(st); 667 if (_cnt != COUNT_UNKNOWN) st->print(" C=%f",_cnt); 668 if (jvms() != NULL) jvms()->dump_spec(st); 669 } 670 #endif 671 672 const Type *CallNode::bottom_type() const { return tf()->range(); } 673 const Type *CallNode::Value(PhaseTransform *phase) const { 674 if (phase->type(in(0)) == Type::TOP) return Type::TOP; 675 return tf()->range(); 676 } 677 678 //------------------------------calling_convention----------------------------- 679 void CallNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { 680 // Use the standard compiler calling convention 681 Matcher::calling_convention( sig_bt, parm_regs, argcnt, true ); 682 } 683 684 685 //------------------------------match------------------------------------------ 686 // Construct projections for control, I/O, memory-fields, ..., and 687 // return result(s) along with their RegMask info 688 Node *CallNode::match( const ProjNode *proj, const Matcher *match ) { 689 switch (proj->_con) { 690 case TypeFunc::Control: 691 case TypeFunc::I_O: 692 case TypeFunc::Memory: 693 return new (match->C) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj); 694 695 case TypeFunc::Parms+1: // For LONG & DOUBLE returns 696 assert(tf()->_range->field_at(TypeFunc::Parms+1) == Type::HALF, ""); 697 // 2nd half of doubles and longs 698 return new (match->C) MachProjNode(this,proj->_con, RegMask::Empty, (uint)OptoReg::Bad); 699 700 case TypeFunc::Parms: { // Normal returns 701 uint ideal_reg = tf()->range()->field_at(TypeFunc::Parms)->ideal_reg(); 702 OptoRegPair regs = is_CallRuntime() 703 ? match->c_return_value(ideal_reg,true) // Calls into C runtime 704 : match-> return_value(ideal_reg,true); // Calls into compiled Java code 705 RegMask rm = RegMask(regs.first()); 706 if( OptoReg::is_valid(regs.second()) ) 707 rm.Insert( regs.second() ); 708 return new (match->C) MachProjNode(this,proj->_con,rm,ideal_reg); 709 } 710 711 case TypeFunc::ReturnAdr: 712 case TypeFunc::FramePtr: 713 default: 714 ShouldNotReachHere(); 715 } 716 return NULL; 717 } 718 719 // Do we Match on this edge index or not? Match no edges 720 uint CallNode::match_edge(uint idx) const { 721 return 0; 722 } 723 724 // 725 // Determine whether the call could modify the field of the specified 726 // instance at the specified offset. 727 // 728 bool CallNode::may_modify(const TypeOopPtr *t_oop, PhaseTransform *phase) { 729 assert((t_oop != NULL), "sanity"); 730 if (t_oop->is_known_instance()) { 731 // The instance_id is set only for scalar-replaceable allocations which 732 // are not passed as arguments according to Escape Analysis. 733 return false; 734 } 735 if (t_oop->is_ptr_to_boxed_value()) { 736 ciKlass* boxing_klass = t_oop->klass(); 737 if (is_CallStaticJava() && as_CallStaticJava()->is_boxing_method()) { 738 // Skip unrelated boxing methods. 739 Node* proj = proj_out(TypeFunc::Parms); 740 if ((proj == NULL) || (phase->type(proj)->is_instptr()->klass() != boxing_klass)) { 741 return false; 742 } 743 } 744 if (is_CallJava() && as_CallJava()->method() != NULL) { 745 ciMethod* meth = as_CallJava()->method(); 746 if (meth->is_accessor()) { 747 return false; 748 } 749 // May modify (by reflection) if an boxing object is passed 750 // as argument or returned. 751 if (returns_pointer() && (proj_out(TypeFunc::Parms) != NULL)) { 752 Node* proj = proj_out(TypeFunc::Parms); 753 const TypeInstPtr* inst_t = phase->type(proj)->isa_instptr(); 754 if ((inst_t != NULL) && (!inst_t->klass_is_exact() || 755 (inst_t->klass() == boxing_klass))) { 756 return true; 757 } 758 } 759 const TypeTuple* d = tf()->domain(); 760 for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { 761 const TypeInstPtr* inst_t = d->field_at(i)->isa_instptr(); 762 if ((inst_t != NULL) && (!inst_t->klass_is_exact() || 763 (inst_t->klass() == boxing_klass))) { 764 return true; 765 } 766 } 767 return false; 768 } 769 } 770 return true; 771 } 772 773 // Does this call have a direct reference to n other than debug information? 774 bool CallNode::has_non_debug_use(Node *n) { 775 const TypeTuple * d = tf()->domain(); 776 for (uint i = TypeFunc::Parms; i < d->cnt(); i++) { 777 Node *arg = in(i); 778 if (arg == n) { 779 return true; 780 } 781 } 782 return false; 783 } 784 785 // Returns the unique CheckCastPP of a call 786 // or 'this' if there are several CheckCastPP 787 // or returns NULL if there is no one. 788 Node *CallNode::result_cast() { 789 Node *cast = NULL; 790 791 Node *p = proj_out(TypeFunc::Parms); 792 if (p == NULL) 793 return NULL; 794 795 for (DUIterator_Fast imax, i = p->fast_outs(imax); i < imax; i++) { 796 Node *use = p->fast_out(i); 797 if (use->is_CheckCastPP()) { 798 if (cast != NULL) { 799 return this; // more than 1 CheckCastPP 800 } 801 cast = use; 802 } 803 } 804 return cast; 805 } 806 807 808 void CallNode::extract_projections(CallProjections* projs, bool separate_io_proj) { 809 projs->fallthrough_proj = NULL; 810 projs->fallthrough_catchproj = NULL; 811 projs->fallthrough_ioproj = NULL; 812 projs->catchall_ioproj = NULL; 813 projs->catchall_catchproj = NULL; 814 projs->fallthrough_memproj = NULL; 815 projs->catchall_memproj = NULL; 816 projs->resproj = NULL; 817 projs->exobj = NULL; 818 819 for (DUIterator_Fast imax, i = fast_outs(imax); i < imax; i++) { 820 ProjNode *pn = fast_out(i)->as_Proj(); 821 if (pn->outcnt() == 0) continue; 822 switch (pn->_con) { 823 case TypeFunc::Control: 824 { 825 // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj 826 projs->fallthrough_proj = pn; 827 DUIterator_Fast jmax, j = pn->fast_outs(jmax); 828 const Node *cn = pn->fast_out(j); 829 if (cn->is_Catch()) { 830 ProjNode *cpn = NULL; 831 for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) { 832 cpn = cn->fast_out(k)->as_Proj(); 833 assert(cpn->is_CatchProj(), "must be a CatchProjNode"); 834 if (cpn->_con == CatchProjNode::fall_through_index) 835 projs->fallthrough_catchproj = cpn; 836 else { 837 assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index."); 838 projs->catchall_catchproj = cpn; 839 } 840 } 841 } 842 break; 843 } 844 case TypeFunc::I_O: 845 if (pn->_is_io_use) 846 projs->catchall_ioproj = pn; 847 else 848 projs->fallthrough_ioproj = pn; 849 for (DUIterator j = pn->outs(); pn->has_out(j); j++) { 850 Node* e = pn->out(j); 851 if (e->Opcode() == Op_CreateEx && e->in(0)->is_CatchProj() && e->outcnt() > 0) { 852 assert(projs->exobj == NULL, "only one"); 853 projs->exobj = e; 854 } 855 } 856 break; 857 case TypeFunc::Memory: 858 if (pn->_is_io_use) 859 projs->catchall_memproj = pn; 860 else 861 projs->fallthrough_memproj = pn; 862 break; 863 case TypeFunc::Parms: 864 projs->resproj = pn; 865 break; 866 default: 867 assert(false, "unexpected projection from allocation node."); 868 } 869 } 870 871 // The resproj may not exist because the result couuld be ignored 872 // and the exception object may not exist if an exception handler 873 // swallows the exception but all the other must exist and be found. 874 assert(projs->fallthrough_proj != NULL, "must be found"); 875 assert(Compile::current()->inlining_incrementally() || projs->fallthrough_catchproj != NULL, "must be found"); 876 assert(Compile::current()->inlining_incrementally() || projs->fallthrough_memproj != NULL, "must be found"); 877 assert(Compile::current()->inlining_incrementally() || projs->fallthrough_ioproj != NULL, "must be found"); 878 assert(Compile::current()->inlining_incrementally() || projs->catchall_catchproj != NULL, "must be found"); 879 if (separate_io_proj) { 880 assert(Compile::current()->inlining_incrementally() || projs->catchall_memproj != NULL, "must be found"); 881 assert(Compile::current()->inlining_incrementally() || projs->catchall_ioproj != NULL, "must be found"); 882 } 883 } 884 885 Node *CallNode::Ideal(PhaseGVN *phase, bool can_reshape) { 886 CallGenerator* cg = generator(); 887 if (can_reshape && cg != NULL && cg->is_mh_late_inline() && !cg->already_attempted()) { 888 // Check whether this MH handle call becomes a candidate for inlining 889 ciMethod* callee = cg->method(); 890 vmIntrinsics::ID iid = callee->intrinsic_id(); 891 if (iid == vmIntrinsics::_invokeBasic) { 892 if (in(TypeFunc::Parms)->Opcode() == Op_ConP) { 893 phase->C->prepend_late_inline(cg); 894 set_generator(NULL); 895 } 896 } else { 897 assert(callee->has_member_arg(), "wrong type of call?"); 898 if (in(TypeFunc::Parms + callee->arg_size() - 1)->Opcode() == Op_ConP) { 899 phase->C->prepend_late_inline(cg); 900 set_generator(NULL); 901 } 902 } 903 } 904 return SafePointNode::Ideal(phase, can_reshape); 905 } 906 907 908 //============================================================================= 909 uint CallJavaNode::size_of() const { return sizeof(*this); } 910 uint CallJavaNode::cmp( const Node &n ) const { 911 CallJavaNode &call = (CallJavaNode&)n; 912 return CallNode::cmp(call) && _method == call._method; 913 } 914 #ifndef PRODUCT 915 void CallJavaNode::dump_spec(outputStream *st) const { 916 if( _method ) _method->print_short_name(st); 917 CallNode::dump_spec(st); 918 } 919 #endif 920 921 //============================================================================= 922 uint CallStaticJavaNode::size_of() const { return sizeof(*this); } 923 uint CallStaticJavaNode::cmp( const Node &n ) const { 924 CallStaticJavaNode &call = (CallStaticJavaNode&)n; 925 return CallJavaNode::cmp(call); 926 } 927 928 //----------------------------uncommon_trap_request---------------------------- 929 // If this is an uncommon trap, return the request code, else zero. 930 int CallStaticJavaNode::uncommon_trap_request() const { 931 if (_name != NULL && !strcmp(_name, "uncommon_trap")) { 932 return extract_uncommon_trap_request(this); 933 } 934 return 0; 935 } 936 int CallStaticJavaNode::extract_uncommon_trap_request(const Node* call) { 937 #ifndef PRODUCT 938 if (!(call->req() > TypeFunc::Parms && 939 call->in(TypeFunc::Parms) != NULL && 940 call->in(TypeFunc::Parms)->is_Con())) { 941 assert(in_dump() != 0, "OK if dumping"); 942 tty->print("[bad uncommon trap]"); 943 return 0; 944 } 945 #endif 946 return call->in(TypeFunc::Parms)->bottom_type()->is_int()->get_con(); 947 } 948 949 #ifndef PRODUCT 950 void CallStaticJavaNode::dump_spec(outputStream *st) const { 951 st->print("# Static "); 952 if (_name != NULL) { 953 st->print("%s", _name); 954 int trap_req = uncommon_trap_request(); 955 if (trap_req != 0) { 956 char buf[100]; 957 st->print("(%s)", 958 Deoptimization::format_trap_request(buf, sizeof(buf), 959 trap_req)); 960 } 961 st->print(" "); 962 } 963 CallJavaNode::dump_spec(st); 964 } 965 #endif 966 967 //============================================================================= 968 uint CallDynamicJavaNode::size_of() const { return sizeof(*this); } 969 uint CallDynamicJavaNode::cmp( const Node &n ) const { 970 CallDynamicJavaNode &call = (CallDynamicJavaNode&)n; 971 return CallJavaNode::cmp(call); 972 } 973 #ifndef PRODUCT 974 void CallDynamicJavaNode::dump_spec(outputStream *st) const { 975 st->print("# Dynamic "); 976 CallJavaNode::dump_spec(st); 977 } 978 #endif 979 980 //============================================================================= 981 uint CallRuntimeNode::size_of() const { return sizeof(*this); } 982 uint CallRuntimeNode::cmp( const Node &n ) const { 983 CallRuntimeNode &call = (CallRuntimeNode&)n; 984 return CallNode::cmp(call) && !strcmp(_name,call._name); 985 } 986 #ifndef PRODUCT 987 void CallRuntimeNode::dump_spec(outputStream *st) const { 988 st->print("# "); 989 st->print(_name); 990 CallNode::dump_spec(st); 991 } 992 #endif 993 994 //------------------------------calling_convention----------------------------- 995 void CallRuntimeNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { 996 Matcher::c_calling_convention( sig_bt, parm_regs, argcnt ); 997 } 998 999 //============================================================================= 1000 //------------------------------calling_convention----------------------------- 1001 1002 1003 //============================================================================= 1004 #ifndef PRODUCT 1005 void CallLeafNode::dump_spec(outputStream *st) const { 1006 st->print("# "); 1007 st->print(_name); 1008 CallNode::dump_spec(st); 1009 } 1010 #endif 1011 1012 //============================================================================= 1013 1014 void SafePointNode::set_local(JVMState* jvms, uint idx, Node *c) { 1015 assert(verify_jvms(jvms), "jvms must match"); 1016 int loc = jvms->locoff() + idx; 1017 if (in(loc)->is_top() && idx > 0 && !c->is_top() ) { 1018 // If current local idx is top then local idx - 1 could 1019 // be a long/double that needs to be killed since top could 1020 // represent the 2nd half ofthe long/double. 1021 uint ideal = in(loc -1)->ideal_reg(); 1022 if (ideal == Op_RegD || ideal == Op_RegL) { 1023 // set other (low index) half to top 1024 set_req(loc - 1, in(loc)); 1025 } 1026 } 1027 set_req(loc, c); 1028 } 1029 1030 uint SafePointNode::size_of() const { return sizeof(*this); } 1031 uint SafePointNode::cmp( const Node &n ) const { 1032 return (&n == this); // Always fail except on self 1033 } 1034 1035 //-------------------------set_next_exception---------------------------------- 1036 void SafePointNode::set_next_exception(SafePointNode* n) { 1037 assert(n == NULL || n->Opcode() == Op_SafePoint, "correct value for next_exception"); 1038 if (len() == req()) { 1039 if (n != NULL) add_prec(n); 1040 } else { 1041 set_prec(req(), n); 1042 } 1043 } 1044 1045 1046 //----------------------------next_exception----------------------------------- 1047 SafePointNode* SafePointNode::next_exception() const { 1048 if (len() == req()) { 1049 return NULL; 1050 } else { 1051 Node* n = in(req()); 1052 assert(n == NULL || n->Opcode() == Op_SafePoint, "no other uses of prec edges"); 1053 return (SafePointNode*) n; 1054 } 1055 } 1056 1057 1058 //------------------------------Ideal------------------------------------------ 1059 // Skip over any collapsed Regions 1060 Node *SafePointNode::Ideal(PhaseGVN *phase, bool can_reshape) { 1061 return remove_dead_region(phase, can_reshape) ? this : NULL; 1062 } 1063 1064 //------------------------------Identity--------------------------------------- 1065 // Remove obviously duplicate safepoints 1066 Node *SafePointNode::Identity( PhaseTransform *phase ) { 1067 1068 // If you have back to back safepoints, remove one 1069 if( in(TypeFunc::Control)->is_SafePoint() ) 1070 return in(TypeFunc::Control); 1071 1072 if( in(0)->is_Proj() ) { 1073 Node *n0 = in(0)->in(0); 1074 // Check if he is a call projection (except Leaf Call) 1075 if( n0->is_Catch() ) { 1076 n0 = n0->in(0)->in(0); 1077 assert( n0->is_Call(), "expect a call here" ); 1078 } 1079 if( n0->is_Call() && n0->as_Call()->guaranteed_safepoint() ) { 1080 // Useless Safepoint, so remove it 1081 return in(TypeFunc::Control); 1082 } 1083 } 1084 1085 return this; 1086 } 1087 1088 //------------------------------Value------------------------------------------ 1089 const Type *SafePointNode::Value( PhaseTransform *phase ) const { 1090 if( phase->type(in(0)) == Type::TOP ) return Type::TOP; 1091 if( phase->eqv( in(0), this ) ) return Type::TOP; // Dead infinite loop 1092 return Type::CONTROL; 1093 } 1094 1095 #ifndef PRODUCT 1096 void SafePointNode::dump_spec(outputStream *st) const { 1097 st->print(" SafePoint "); 1098 } 1099 #endif 1100 1101 const RegMask &SafePointNode::in_RegMask(uint idx) const { 1102 if( idx < TypeFunc::Parms ) return RegMask::Empty; 1103 // Values outside the domain represent debug info 1104 return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]); 1105 } 1106 const RegMask &SafePointNode::out_RegMask() const { 1107 return RegMask::Empty; 1108 } 1109 1110 1111 void SafePointNode::grow_stack(JVMState* jvms, uint grow_by) { 1112 assert((int)grow_by > 0, "sanity"); 1113 int monoff = jvms->monoff(); 1114 int scloff = jvms->scloff(); 1115 int endoff = jvms->endoff(); 1116 assert(endoff == (int)req(), "no other states or debug info after me"); 1117 Node* top = Compile::current()->top(); 1118 for (uint i = 0; i < grow_by; i++) { 1119 ins_req(monoff, top); 1120 } 1121 jvms->set_monoff(monoff + grow_by); 1122 jvms->set_scloff(scloff + grow_by); 1123 jvms->set_endoff(endoff + grow_by); 1124 } 1125 1126 void SafePointNode::push_monitor(const FastLockNode *lock) { 1127 // Add a LockNode, which points to both the original BoxLockNode (the 1128 // stack space for the monitor) and the Object being locked. 1129 const int MonitorEdges = 2; 1130 assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges"); 1131 assert(req() == jvms()->endoff(), "correct sizing"); 1132 int nextmon = jvms()->scloff(); 1133 if (GenerateSynchronizationCode) { 1134 ins_req(nextmon, lock->box_node()); 1135 ins_req(nextmon+1, lock->obj_node()); 1136 } else { 1137 Node* top = Compile::current()->top(); 1138 ins_req(nextmon, top); 1139 ins_req(nextmon, top); 1140 } 1141 jvms()->set_scloff(nextmon + MonitorEdges); 1142 jvms()->set_endoff(req()); 1143 } 1144 1145 void SafePointNode::pop_monitor() { 1146 // Delete last monitor from debug info 1147 debug_only(int num_before_pop = jvms()->nof_monitors()); 1148 const int MonitorEdges = 2; 1149 assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges"); 1150 int scloff = jvms()->scloff(); 1151 int endoff = jvms()->endoff(); 1152 int new_scloff = scloff - MonitorEdges; 1153 int new_endoff = endoff - MonitorEdges; 1154 jvms()->set_scloff(new_scloff); 1155 jvms()->set_endoff(new_endoff); 1156 while (scloff > new_scloff) del_req_ordered(--scloff); 1157 assert(jvms()->nof_monitors() == num_before_pop-1, ""); 1158 } 1159 1160 Node *SafePointNode::peek_monitor_box() const { 1161 int mon = jvms()->nof_monitors() - 1; 1162 assert(mon >= 0, "most have a monitor"); 1163 return monitor_box(jvms(), mon); 1164 } 1165 1166 Node *SafePointNode::peek_monitor_obj() const { 1167 int mon = jvms()->nof_monitors() - 1; 1168 assert(mon >= 0, "most have a monitor"); 1169 return monitor_obj(jvms(), mon); 1170 } 1171 1172 // Do we Match on this edge index or not? Match no edges 1173 uint SafePointNode::match_edge(uint idx) const { 1174 if( !needs_polling_address_input() ) 1175 return 0; 1176 1177 return (TypeFunc::Parms == idx); 1178 } 1179 1180 //============== SafePointScalarObjectNode ============== 1181 1182 SafePointScalarObjectNode::SafePointScalarObjectNode(const TypeOopPtr* tp, 1183 #ifdef ASSERT 1184 AllocateNode* alloc, 1185 #endif 1186 uint first_index, 1187 uint n_fields) : 1188 TypeNode(tp, 1), // 1 control input -- seems required. Get from root. 1189 #ifdef ASSERT 1190 _alloc(alloc), 1191 #endif 1192 _first_index(first_index), 1193 _n_fields(n_fields) 1194 { 1195 init_class_id(Class_SafePointScalarObject); 1196 } 1197 1198 // Do not allow value-numbering for SafePointScalarObject node. 1199 uint SafePointScalarObjectNode::hash() const { return NO_HASH; } 1200 uint SafePointScalarObjectNode::cmp( const Node &n ) const { 1201 return (&n == this); // Always fail except on self 1202 } 1203 1204 uint SafePointScalarObjectNode::ideal_reg() const { 1205 return 0; // No matching to machine instruction 1206 } 1207 1208 const RegMask &SafePointScalarObjectNode::in_RegMask(uint idx) const { 1209 return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]); 1210 } 1211 1212 const RegMask &SafePointScalarObjectNode::out_RegMask() const { 1213 return RegMask::Empty; 1214 } 1215 1216 uint SafePointScalarObjectNode::match_edge(uint idx) const { 1217 return 0; 1218 } 1219 1220 SafePointScalarObjectNode* 1221 SafePointScalarObjectNode::clone(Dict* sosn_map) const { 1222 void* cached = (*sosn_map)[(void*)this]; 1223 if (cached != NULL) { 1224 return (SafePointScalarObjectNode*)cached; 1225 } 1226 SafePointScalarObjectNode* res = (SafePointScalarObjectNode*)Node::clone(); 1227 sosn_map->Insert((void*)this, (void*)res); 1228 return res; 1229 } 1230 1231 1232 #ifndef PRODUCT 1233 void SafePointScalarObjectNode::dump_spec(outputStream *st) const { 1234 st->print(" # fields@[%d..%d]", first_index(), 1235 first_index() + n_fields() - 1); 1236 } 1237 1238 #endif 1239 1240 //============================================================================= 1241 uint AllocateNode::size_of() const { return sizeof(*this); } 1242 1243 AllocateNode::AllocateNode(Compile* C, const TypeFunc *atype, 1244 Node *ctrl, Node *mem, Node *abio, 1245 Node *size, Node *klass_node, Node *initial_test) 1246 : CallNode(atype, NULL, TypeRawPtr::BOTTOM) 1247 { 1248 init_class_id(Class_Allocate); 1249 init_flags(Flag_is_macro); 1250 _is_scalar_replaceable = false; 1251 _is_non_escaping = false; 1252 Node *topnode = C->top(); 1253 1254 init_req( TypeFunc::Control , ctrl ); 1255 init_req( TypeFunc::I_O , abio ); 1256 init_req( TypeFunc::Memory , mem ); 1257 init_req( TypeFunc::ReturnAdr, topnode ); 1258 init_req( TypeFunc::FramePtr , topnode ); 1259 init_req( AllocSize , size); 1260 init_req( KlassNode , klass_node); 1261 init_req( InitialTest , initial_test); 1262 init_req( ALength , topnode); 1263 C->add_macro_node(this); 1264 } 1265 1266 //============================================================================= 1267 Node* AllocateArrayNode::Ideal(PhaseGVN *phase, bool can_reshape) { 1268 if (remove_dead_region(phase, can_reshape)) return this; 1269 // Don't bother trying to transform a dead node 1270 if (in(0) && in(0)->is_top()) return NULL; 1271 1272 const Type* type = phase->type(Ideal_length()); 1273 if (type->isa_int() && type->is_int()->_hi < 0) { 1274 if (can_reshape) { 1275 PhaseIterGVN *igvn = phase->is_IterGVN(); 1276 // Unreachable fall through path (negative array length), 1277 // the allocation can only throw so disconnect it. 1278 Node* proj = proj_out(TypeFunc::Control); 1279 Node* catchproj = NULL; 1280 if (proj != NULL) { 1281 for (DUIterator_Fast imax, i = proj->fast_outs(imax); i < imax; i++) { 1282 Node *cn = proj->fast_out(i); 1283 if (cn->is_Catch()) { 1284 catchproj = cn->as_Multi()->proj_out(CatchProjNode::fall_through_index); 1285 break; 1286 } 1287 } 1288 } 1289 if (catchproj != NULL && catchproj->outcnt() > 0 && 1290 (catchproj->outcnt() > 1 || 1291 catchproj->unique_out()->Opcode() != Op_Halt)) { 1292 assert(catchproj->is_CatchProj(), "must be a CatchProjNode"); 1293 Node* nproj = catchproj->clone(); 1294 igvn->register_new_node_with_optimizer(nproj); 1295 1296 Node *frame = new (phase->C) ParmNode( phase->C->start(), TypeFunc::FramePtr ); 1297 frame = phase->transform(frame); 1298 // Halt & Catch Fire 1299 Node *halt = new (phase->C) HaltNode( nproj, frame ); 1300 phase->C->root()->add_req(halt); 1301 phase->transform(halt); 1302 1303 igvn->replace_node(catchproj, phase->C->top()); 1304 return this; 1305 } 1306 } else { 1307 // Can't correct it during regular GVN so register for IGVN 1308 phase->C->record_for_igvn(this); 1309 } 1310 } 1311 return NULL; 1312 } 1313 1314 // Retrieve the length from the AllocateArrayNode. Narrow the type with a 1315 // CastII, if appropriate. If we are not allowed to create new nodes, and 1316 // a CastII is appropriate, return NULL. 1317 Node *AllocateArrayNode::make_ideal_length(const TypeOopPtr* oop_type, PhaseTransform *phase, bool allow_new_nodes) { 1318 Node *length = in(AllocateNode::ALength); 1319 assert(length != NULL, "length is not null"); 1320 1321 const TypeInt* length_type = phase->find_int_type(length); 1322 const TypeAryPtr* ary_type = oop_type->isa_aryptr(); 1323 1324 if (ary_type != NULL && length_type != NULL) { 1325 const TypeInt* narrow_length_type = ary_type->narrow_size_type(length_type); 1326 if (narrow_length_type != length_type) { 1327 // Assert one of: 1328 // - the narrow_length is 0 1329 // - the narrow_length is not wider than length 1330 assert(narrow_length_type == TypeInt::ZERO || 1331 length_type->is_con() && narrow_length_type->is_con() && 1332 (narrow_length_type->_hi <= length_type->_lo) || 1333 (narrow_length_type->_hi <= length_type->_hi && 1334 narrow_length_type->_lo >= length_type->_lo), 1335 "narrow type must be narrower than length type"); 1336 1337 // Return NULL if new nodes are not allowed 1338 if (!allow_new_nodes) return NULL; 1339 // Create a cast which is control dependent on the initialization to 1340 // propagate the fact that the array length must be positive. 1341 length = new (phase->C) CastIINode(length, narrow_length_type); 1342 length->set_req(0, initialization()->proj_out(0)); 1343 } 1344 } 1345 1346 return length; 1347 } 1348 1349 //============================================================================= 1350 uint LockNode::size_of() const { return sizeof(*this); } 1351 1352 // Redundant lock elimination 1353 // 1354 // There are various patterns of locking where we release and 1355 // immediately reacquire a lock in a piece of code where no operations 1356 // occur in between that would be observable. In those cases we can 1357 // skip releasing and reacquiring the lock without violating any 1358 // fairness requirements. Doing this around a loop could cause a lock 1359 // to be held for a very long time so we concentrate on non-looping 1360 // control flow. We also require that the operations are fully 1361 // redundant meaning that we don't introduce new lock operations on 1362 // some paths so to be able to eliminate it on others ala PRE. This 1363 // would probably require some more extensive graph manipulation to 1364 // guarantee that the memory edges were all handled correctly. 1365 // 1366 // Assuming p is a simple predicate which can't trap in any way and s 1367 // is a synchronized method consider this code: 1368 // 1369 // s(); 1370 // if (p) 1371 // s(); 1372 // else 1373 // s(); 1374 // s(); 1375 // 1376 // 1. The unlocks of the first call to s can be eliminated if the 1377 // locks inside the then and else branches are eliminated. 1378 // 1379 // 2. The unlocks of the then and else branches can be eliminated if 1380 // the lock of the final call to s is eliminated. 1381 // 1382 // Either of these cases subsumes the simple case of sequential control flow 1383 // 1384 // Addtionally we can eliminate versions without the else case: 1385 // 1386 // s(); 1387 // if (p) 1388 // s(); 1389 // s(); 1390 // 1391 // 3. In this case we eliminate the unlock of the first s, the lock 1392 // and unlock in the then case and the lock in the final s. 1393 // 1394 // Note also that in all these cases the then/else pieces don't have 1395 // to be trivial as long as they begin and end with synchronization 1396 // operations. 1397 // 1398 // s(); 1399 // if (p) 1400 // s(); 1401 // f(); 1402 // s(); 1403 // s(); 1404 // 1405 // The code will work properly for this case, leaving in the unlock 1406 // before the call to f and the relock after it. 1407 // 1408 // A potentially interesting case which isn't handled here is when the 1409 // locking is partially redundant. 1410 // 1411 // s(); 1412 // if (p) 1413 // s(); 1414 // 1415 // This could be eliminated putting unlocking on the else case and 1416 // eliminating the first unlock and the lock in the then side. 1417 // Alternatively the unlock could be moved out of the then side so it 1418 // was after the merge and the first unlock and second lock 1419 // eliminated. This might require less manipulation of the memory 1420 // state to get correct. 1421 // 1422 // Additionally we might allow work between a unlock and lock before 1423 // giving up eliminating the locks. The current code disallows any 1424 // conditional control flow between these operations. A formulation 1425 // similar to partial redundancy elimination computing the 1426 // availability of unlocking and the anticipatability of locking at a 1427 // program point would allow detection of fully redundant locking with 1428 // some amount of work in between. I'm not sure how often I really 1429 // think that would occur though. Most of the cases I've seen 1430 // indicate it's likely non-trivial work would occur in between. 1431 // There may be other more complicated constructs where we could 1432 // eliminate locking but I haven't seen any others appear as hot or 1433 // interesting. 1434 // 1435 // Locking and unlocking have a canonical form in ideal that looks 1436 // roughly like this: 1437 // 1438 // <obj> 1439 // | \\------+ 1440 // | \ \ 1441 // | BoxLock \ 1442 // | | | \ 1443 // | | \ \ 1444 // | | FastLock 1445 // | | / 1446 // | | / 1447 // | | | 1448 // 1449 // Lock 1450 // | 1451 // Proj #0 1452 // | 1453 // MembarAcquire 1454 // | 1455 // Proj #0 1456 // 1457 // MembarRelease 1458 // | 1459 // Proj #0 1460 // | 1461 // Unlock 1462 // | 1463 // Proj #0 1464 // 1465 // 1466 // This code proceeds by processing Lock nodes during PhaseIterGVN 1467 // and searching back through its control for the proper code 1468 // patterns. Once it finds a set of lock and unlock operations to 1469 // eliminate they are marked as eliminatable which causes the 1470 // expansion of the Lock and Unlock macro nodes to make the operation a NOP 1471 // 1472 //============================================================================= 1473 1474 // 1475 // Utility function to skip over uninteresting control nodes. Nodes skipped are: 1476 // - copy regions. (These may not have been optimized away yet.) 1477 // - eliminated locking nodes 1478 // 1479 static Node *next_control(Node *ctrl) { 1480 if (ctrl == NULL) 1481 return NULL; 1482 while (1) { 1483 if (ctrl->is_Region()) { 1484 RegionNode *r = ctrl->as_Region(); 1485 Node *n = r->is_copy(); 1486 if (n == NULL) 1487 break; // hit a region, return it 1488 else 1489 ctrl = n; 1490 } else if (ctrl->is_Proj()) { 1491 Node *in0 = ctrl->in(0); 1492 if (in0->is_AbstractLock() && in0->as_AbstractLock()->is_eliminated()) { 1493 ctrl = in0->in(0); 1494 } else { 1495 break; 1496 } 1497 } else { 1498 break; // found an interesting control 1499 } 1500 } 1501 return ctrl; 1502 } 1503 // 1504 // Given a control, see if it's the control projection of an Unlock which 1505 // operating on the same object as lock. 1506 // 1507 bool AbstractLockNode::find_matching_unlock(const Node* ctrl, LockNode* lock, 1508 GrowableArray<AbstractLockNode*> &lock_ops) { 1509 ProjNode *ctrl_proj = (ctrl->is_Proj()) ? ctrl->as_Proj() : NULL; 1510 if (ctrl_proj != NULL && ctrl_proj->_con == TypeFunc::Control) { 1511 Node *n = ctrl_proj->in(0); 1512 if (n != NULL && n->is_Unlock()) { 1513 UnlockNode *unlock = n->as_Unlock(); 1514 if (lock->obj_node()->eqv_uncast(unlock->obj_node()) && 1515 BoxLockNode::same_slot(lock->box_node(), unlock->box_node()) && 1516 !unlock->is_eliminated()) { 1517 lock_ops.append(unlock); 1518 return true; 1519 } 1520 } 1521 } 1522 return false; 1523 } 1524 1525 // 1526 // Find the lock matching an unlock. Returns null if a safepoint 1527 // or complicated control is encountered first. 1528 LockNode *AbstractLockNode::find_matching_lock(UnlockNode* unlock) { 1529 LockNode *lock_result = NULL; 1530 // find the matching lock, or an intervening safepoint 1531 Node *ctrl = next_control(unlock->in(0)); 1532 while (1) { 1533 assert(ctrl != NULL, "invalid control graph"); 1534 assert(!ctrl->is_Start(), "missing lock for unlock"); 1535 if (ctrl->is_top()) break; // dead control path 1536 if (ctrl->is_Proj()) ctrl = ctrl->in(0); 1537 if (ctrl->is_SafePoint()) { 1538 break; // found a safepoint (may be the lock we are searching for) 1539 } else if (ctrl->is_Region()) { 1540 // Check for a simple diamond pattern. Punt on anything more complicated 1541 if (ctrl->req() == 3 && ctrl->in(1) != NULL && ctrl->in(2) != NULL) { 1542 Node *in1 = next_control(ctrl->in(1)); 1543 Node *in2 = next_control(ctrl->in(2)); 1544 if (((in1->is_IfTrue() && in2->is_IfFalse()) || 1545 (in2->is_IfTrue() && in1->is_IfFalse())) && (in1->in(0) == in2->in(0))) { 1546 ctrl = next_control(in1->in(0)->in(0)); 1547 } else { 1548 break; 1549 } 1550 } else { 1551 break; 1552 } 1553 } else { 1554 ctrl = next_control(ctrl->in(0)); // keep searching 1555 } 1556 } 1557 if (ctrl->is_Lock()) { 1558 LockNode *lock = ctrl->as_Lock(); 1559 if (lock->obj_node()->eqv_uncast(unlock->obj_node()) && 1560 BoxLockNode::same_slot(lock->box_node(), unlock->box_node())) { 1561 lock_result = lock; 1562 } 1563 } 1564 return lock_result; 1565 } 1566 1567 // This code corresponds to case 3 above. 1568 1569 bool AbstractLockNode::find_lock_and_unlock_through_if(Node* node, LockNode* lock, 1570 GrowableArray<AbstractLockNode*> &lock_ops) { 1571 Node* if_node = node->in(0); 1572 bool if_true = node->is_IfTrue(); 1573 1574 if (if_node->is_If() && if_node->outcnt() == 2 && (if_true || node->is_IfFalse())) { 1575 Node *lock_ctrl = next_control(if_node->in(0)); 1576 if (find_matching_unlock(lock_ctrl, lock, lock_ops)) { 1577 Node* lock1_node = NULL; 1578 ProjNode* proj = if_node->as_If()->proj_out(!if_true); 1579 if (if_true) { 1580 if (proj->is_IfFalse() && proj->outcnt() == 1) { 1581 lock1_node = proj->unique_out(); 1582 } 1583 } else { 1584 if (proj->is_IfTrue() && proj->outcnt() == 1) { 1585 lock1_node = proj->unique_out(); 1586 } 1587 } 1588 if (lock1_node != NULL && lock1_node->is_Lock()) { 1589 LockNode *lock1 = lock1_node->as_Lock(); 1590 if (lock->obj_node()->eqv_uncast(lock1->obj_node()) && 1591 BoxLockNode::same_slot(lock->box_node(), lock1->box_node()) && 1592 !lock1->is_eliminated()) { 1593 lock_ops.append(lock1); 1594 return true; 1595 } 1596 } 1597 } 1598 } 1599 1600 lock_ops.trunc_to(0); 1601 return false; 1602 } 1603 1604 bool AbstractLockNode::find_unlocks_for_region(const RegionNode* region, LockNode* lock, 1605 GrowableArray<AbstractLockNode*> &lock_ops) { 1606 // check each control merging at this point for a matching unlock. 1607 // in(0) should be self edge so skip it. 1608 for (int i = 1; i < (int)region->req(); i++) { 1609 Node *in_node = next_control(region->in(i)); 1610 if (in_node != NULL) { 1611 if (find_matching_unlock(in_node, lock, lock_ops)) { 1612 // found a match so keep on checking. 1613 continue; 1614 } else if (find_lock_and_unlock_through_if(in_node, lock, lock_ops)) { 1615 continue; 1616 } 1617 1618 // If we fall through to here then it was some kind of node we 1619 // don't understand or there wasn't a matching unlock, so give 1620 // up trying to merge locks. 1621 lock_ops.trunc_to(0); 1622 return false; 1623 } 1624 } 1625 return true; 1626 1627 } 1628 1629 #ifndef PRODUCT 1630 // 1631 // Create a counter which counts the number of times this lock is acquired 1632 // 1633 void AbstractLockNode::create_lock_counter(JVMState* state) { 1634 _counter = OptoRuntime::new_named_counter(state, NamedCounter::LockCounter); 1635 } 1636 1637 void AbstractLockNode::set_eliminated_lock_counter() { 1638 if (_counter) { 1639 // Update the counter to indicate that this lock was eliminated. 1640 // The counter update code will stay around even though the 1641 // optimizer will eliminate the lock operation itself. 1642 _counter->set_tag(NamedCounter::EliminatedLockCounter); 1643 } 1644 } 1645 #endif 1646 1647 //============================================================================= 1648 Node *LockNode::Ideal(PhaseGVN *phase, bool can_reshape) { 1649 1650 // perform any generic optimizations first (returns 'this' or NULL) 1651 Node *result = SafePointNode::Ideal(phase, can_reshape); 1652 if (result != NULL) return result; 1653 // Don't bother trying to transform a dead node 1654 if (in(0) && in(0)->is_top()) return NULL; 1655 1656 // Now see if we can optimize away this lock. We don't actually 1657 // remove the locking here, we simply set the _eliminate flag which 1658 // prevents macro expansion from expanding the lock. Since we don't 1659 // modify the graph, the value returned from this function is the 1660 // one computed above. 1661 if (can_reshape && EliminateLocks && !is_non_esc_obj()) { 1662 // 1663 // If we are locking an unescaped object, the lock/unlock is unnecessary 1664 // 1665 ConnectionGraph *cgr = phase->C->congraph(); 1666 if (cgr != NULL && cgr->not_global_escape(obj_node())) { 1667 assert(!is_eliminated() || is_coarsened(), "sanity"); 1668 // The lock could be marked eliminated by lock coarsening 1669 // code during first IGVN before EA. Replace coarsened flag 1670 // to eliminate all associated locks/unlocks. 1671 this->set_non_esc_obj(); 1672 return result; 1673 } 1674 1675 // 1676 // Try lock coarsening 1677 // 1678 PhaseIterGVN* iter = phase->is_IterGVN(); 1679 if (iter != NULL && !is_eliminated()) { 1680 1681 GrowableArray<AbstractLockNode*> lock_ops; 1682 1683 Node *ctrl = next_control(in(0)); 1684 1685 // now search back for a matching Unlock 1686 if (find_matching_unlock(ctrl, this, lock_ops)) { 1687 // found an unlock directly preceding this lock. This is the 1688 // case of single unlock directly control dependent on a 1689 // single lock which is the trivial version of case 1 or 2. 1690 } else if (ctrl->is_Region() ) { 1691 if (find_unlocks_for_region(ctrl->as_Region(), this, lock_ops)) { 1692 // found lock preceded by multiple unlocks along all paths 1693 // joining at this point which is case 3 in description above. 1694 } 1695 } else { 1696 // see if this lock comes from either half of an if and the 1697 // predecessors merges unlocks and the other half of the if 1698 // performs a lock. 1699 if (find_lock_and_unlock_through_if(ctrl, this, lock_ops)) { 1700 // found unlock splitting to an if with locks on both branches. 1701 } 1702 } 1703 1704 if (lock_ops.length() > 0) { 1705 // add ourselves to the list of locks to be eliminated. 1706 lock_ops.append(this); 1707 1708 #ifndef PRODUCT 1709 if (PrintEliminateLocks) { 1710 int locks = 0; 1711 int unlocks = 0; 1712 for (int i = 0; i < lock_ops.length(); i++) { 1713 AbstractLockNode* lock = lock_ops.at(i); 1714 if (lock->Opcode() == Op_Lock) 1715 locks++; 1716 else 1717 unlocks++; 1718 if (Verbose) { 1719 lock->dump(1); 1720 } 1721 } 1722 tty->print_cr("***Eliminated %d unlocks and %d locks", unlocks, locks); 1723 } 1724 #endif 1725 1726 // for each of the identified locks, mark them 1727 // as eliminatable 1728 for (int i = 0; i < lock_ops.length(); i++) { 1729 AbstractLockNode* lock = lock_ops.at(i); 1730 1731 // Mark it eliminated by coarsening and update any counters 1732 lock->set_coarsened(); 1733 } 1734 } else if (ctrl->is_Region() && 1735 iter->_worklist.member(ctrl)) { 1736 // We weren't able to find any opportunities but the region this 1737 // lock is control dependent on hasn't been processed yet so put 1738 // this lock back on the worklist so we can check again once any 1739 // region simplification has occurred. 1740 iter->_worklist.push(this); 1741 } 1742 } 1743 } 1744 1745 return result; 1746 } 1747 1748 //============================================================================= 1749 bool LockNode::is_nested_lock_region() { 1750 BoxLockNode* box = box_node()->as_BoxLock(); 1751 int stk_slot = box->stack_slot(); 1752 if (stk_slot <= 0) 1753 return false; // External lock or it is not Box (Phi node). 1754 1755 // Ignore complex cases: merged locks or multiple locks. 1756 Node* obj = obj_node(); 1757 LockNode* unique_lock = NULL; 1758 if (!box->is_simple_lock_region(&unique_lock, obj) || 1759 (unique_lock != this)) { 1760 return false; 1761 } 1762 1763 // Look for external lock for the same object. 1764 SafePointNode* sfn = this->as_SafePoint(); 1765 JVMState* youngest_jvms = sfn->jvms(); 1766 int max_depth = youngest_jvms->depth(); 1767 for (int depth = 1; depth <= max_depth; depth++) { 1768 JVMState* jvms = youngest_jvms->of_depth(depth); 1769 int num_mon = jvms->nof_monitors(); 1770 // Loop over monitors 1771 for (int idx = 0; idx < num_mon; idx++) { 1772 Node* obj_node = sfn->monitor_obj(jvms, idx); 1773 BoxLockNode* box_node = sfn->monitor_box(jvms, idx)->as_BoxLock(); 1774 if ((box_node->stack_slot() < stk_slot) && obj_node->eqv_uncast(obj)) { 1775 return true; 1776 } 1777 } 1778 } 1779 return false; 1780 } 1781 1782 //============================================================================= 1783 uint UnlockNode::size_of() const { return sizeof(*this); } 1784 1785 //============================================================================= 1786 Node *UnlockNode::Ideal(PhaseGVN *phase, bool can_reshape) { 1787 1788 // perform any generic optimizations first (returns 'this' or NULL) 1789 Node *result = SafePointNode::Ideal(phase, can_reshape); 1790 if (result != NULL) return result; 1791 // Don't bother trying to transform a dead node 1792 if (in(0) && in(0)->is_top()) return NULL; 1793 1794 // Now see if we can optimize away this unlock. We don't actually 1795 // remove the unlocking here, we simply set the _eliminate flag which 1796 // prevents macro expansion from expanding the unlock. Since we don't 1797 // modify the graph, the value returned from this function is the 1798 // one computed above. 1799 // Escape state is defined after Parse phase. 1800 if (can_reshape && EliminateLocks && !is_non_esc_obj()) { 1801 // 1802 // If we are unlocking an unescaped object, the lock/unlock is unnecessary. 1803 // 1804 ConnectionGraph *cgr = phase->C->congraph(); 1805 if (cgr != NULL && cgr->not_global_escape(obj_node())) { 1806 assert(!is_eliminated() || is_coarsened(), "sanity"); 1807 // The lock could be marked eliminated by lock coarsening 1808 // code during first IGVN before EA. Replace coarsened flag 1809 // to eliminate all associated locks/unlocks. 1810 this->set_non_esc_obj(); 1811 } 1812 } 1813 return result; 1814 }