1 /* 2 * Copyright (c) 2005, 2015, 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 "compiler/compileLog.hpp" 27 #include "libadt/vectset.hpp" 28 #include "opto/addnode.hpp" 29 #include "opto/arraycopynode.hpp" 30 #include "opto/callnode.hpp" 31 #include "opto/castnode.hpp" 32 #include "opto/cfgnode.hpp" 33 #include "opto/compile.hpp" 34 #include "opto/convertnode.hpp" 35 #include "opto/locknode.hpp" 36 #include "opto/loopnode.hpp" 37 #include "opto/macro.hpp" 38 #include "opto/memnode.hpp" 39 #include "opto/narrowptrnode.hpp" 40 #include "opto/node.hpp" 41 #include "opto/opaquenode.hpp" 42 #include "opto/phaseX.hpp" 43 #include "opto/rootnode.hpp" 44 #include "opto/runtime.hpp" 45 #include "opto/subnode.hpp" 46 #include "opto/type.hpp" 47 #include "runtime/sharedRuntime.hpp" 48 49 50 // 51 // Replace any references to "oldref" in inputs to "use" with "newref". 52 // Returns the number of replacements made. 53 // 54 int PhaseMacroExpand::replace_input(Node *use, Node *oldref, Node *newref) { 55 int nreplacements = 0; 56 uint req = use->req(); 57 for (uint j = 0; j < use->len(); j++) { 58 Node *uin = use->in(j); 59 if (uin == oldref) { 60 if (j < req) 61 use->set_req(j, newref); 62 else 63 use->set_prec(j, newref); 64 nreplacements++; 65 } else if (j >= req && uin == NULL) { 66 break; 67 } 68 } 69 return nreplacements; 70 } 71 72 void PhaseMacroExpand::copy_call_debug_info(CallNode *oldcall, CallNode * newcall) { 73 // Copy debug information and adjust JVMState information 74 uint old_dbg_start = oldcall->tf()->domain()->cnt(); 75 uint new_dbg_start = newcall->tf()->domain()->cnt(); 76 int jvms_adj = new_dbg_start - old_dbg_start; 77 assert (new_dbg_start == newcall->req(), "argument count mismatch"); 78 79 // SafePointScalarObject node could be referenced several times in debug info. 80 // Use Dict to record cloned nodes. 81 Dict* sosn_map = new Dict(cmpkey,hashkey); 82 for (uint i = old_dbg_start; i < oldcall->req(); i++) { 83 Node* old_in = oldcall->in(i); 84 // Clone old SafePointScalarObjectNodes, adjusting their field contents. 85 if (old_in != NULL && old_in->is_SafePointScalarObject()) { 86 SafePointScalarObjectNode* old_sosn = old_in->as_SafePointScalarObject(); 87 uint old_unique = C->unique(); 88 Node* new_in = old_sosn->clone(sosn_map); 89 if (old_unique != C->unique()) { // New node? 90 new_in->set_req(0, C->root()); // reset control edge 91 new_in = transform_later(new_in); // Register new node. 92 } 93 old_in = new_in; 94 } 95 newcall->add_req(old_in); 96 } 97 98 // JVMS may be shared so clone it before we modify it 99 newcall->set_jvms(oldcall->jvms() != NULL ? oldcall->jvms()->clone_deep(C) : NULL); 100 for (JVMState *jvms = newcall->jvms(); jvms != NULL; jvms = jvms->caller()) { 101 jvms->set_map(newcall); 102 jvms->set_locoff(jvms->locoff()+jvms_adj); 103 jvms->set_stkoff(jvms->stkoff()+jvms_adj); 104 jvms->set_monoff(jvms->monoff()+jvms_adj); 105 jvms->set_scloff(jvms->scloff()+jvms_adj); 106 jvms->set_endoff(jvms->endoff()+jvms_adj); 107 } 108 } 109 110 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path) { 111 Node* cmp; 112 if (mask != 0) { 113 Node* and_node = transform_later(new AndXNode(word, MakeConX(mask))); 114 cmp = transform_later(new CmpXNode(and_node, MakeConX(bits))); 115 } else { 116 cmp = word; 117 } 118 Node* bol = transform_later(new BoolNode(cmp, BoolTest::ne)); 119 IfNode* iff = new IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN ); 120 transform_later(iff); 121 122 // Fast path taken. 123 Node *fast_taken = transform_later(new IfFalseNode(iff)); 124 125 // Fast path not-taken, i.e. slow path 126 Node *slow_taken = transform_later(new IfTrueNode(iff)); 127 128 if (return_fast_path) { 129 region->init_req(edge, slow_taken); // Capture slow-control 130 return fast_taken; 131 } else { 132 region->init_req(edge, fast_taken); // Capture fast-control 133 return slow_taken; 134 } 135 } 136 137 //--------------------copy_predefined_input_for_runtime_call-------------------- 138 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) { 139 // Set fixed predefined input arguments 140 call->init_req( TypeFunc::Control, ctrl ); 141 call->init_req( TypeFunc::I_O , oldcall->in( TypeFunc::I_O) ); 142 call->init_req( TypeFunc::Memory , oldcall->in( TypeFunc::Memory ) ); // ????? 143 call->init_req( TypeFunc::ReturnAdr, oldcall->in( TypeFunc::ReturnAdr ) ); 144 call->init_req( TypeFunc::FramePtr, oldcall->in( TypeFunc::FramePtr ) ); 145 } 146 147 //------------------------------make_slow_call--------------------------------- 148 CallNode* PhaseMacroExpand::make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, 149 address slow_call, const char* leaf_name, Node* slow_path, 150 Node* parm0, Node* parm1, Node* parm2) { 151 152 // Slow-path call 153 CallNode *call = leaf_name 154 ? (CallNode*)new CallLeafNode ( slow_call_type, slow_call, leaf_name, TypeRawPtr::BOTTOM ) 155 : (CallNode*)new CallStaticJavaNode( slow_call_type, slow_call, OptoRuntime::stub_name(slow_call), oldcall->jvms()->bci(), TypeRawPtr::BOTTOM ); 156 157 // Slow path call has no side-effects, uses few values 158 copy_predefined_input_for_runtime_call(slow_path, oldcall, call ); 159 if (parm0 != NULL) call->init_req(TypeFunc::Parms+0, parm0); 160 if (parm1 != NULL) call->init_req(TypeFunc::Parms+1, parm1); 161 if (parm2 != NULL) call->init_req(TypeFunc::Parms+2, parm2); 162 copy_call_debug_info(oldcall, call); 163 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON. 164 _igvn.replace_node(oldcall, call); 165 transform_later(call); 166 167 return call; 168 } 169 170 void PhaseMacroExpand::extract_call_projections(CallNode *call) { 171 _fallthroughproj = NULL; 172 _fallthroughcatchproj = NULL; 173 _ioproj_fallthrough = NULL; 174 _ioproj_catchall = NULL; 175 _catchallcatchproj = NULL; 176 _memproj_fallthrough = NULL; 177 _memproj_catchall = NULL; 178 _resproj = NULL; 179 for (DUIterator_Fast imax, i = call->fast_outs(imax); i < imax; i++) { 180 ProjNode *pn = call->fast_out(i)->as_Proj(); 181 switch (pn->_con) { 182 case TypeFunc::Control: 183 { 184 // For Control (fallthrough) and I_O (catch_all_index) we have CatchProj -> Catch -> Proj 185 _fallthroughproj = pn; 186 DUIterator_Fast jmax, j = pn->fast_outs(jmax); 187 const Node *cn = pn->fast_out(j); 188 if (cn->is_Catch()) { 189 ProjNode *cpn = NULL; 190 for (DUIterator_Fast kmax, k = cn->fast_outs(kmax); k < kmax; k++) { 191 cpn = cn->fast_out(k)->as_Proj(); 192 assert(cpn->is_CatchProj(), "must be a CatchProjNode"); 193 if (cpn->_con == CatchProjNode::fall_through_index) 194 _fallthroughcatchproj = cpn; 195 else { 196 assert(cpn->_con == CatchProjNode::catch_all_index, "must be correct index."); 197 _catchallcatchproj = cpn; 198 } 199 } 200 } 201 break; 202 } 203 case TypeFunc::I_O: 204 if (pn->_is_io_use) 205 _ioproj_catchall = pn; 206 else 207 _ioproj_fallthrough = pn; 208 break; 209 case TypeFunc::Memory: 210 if (pn->_is_io_use) 211 _memproj_catchall = pn; 212 else 213 _memproj_fallthrough = pn; 214 break; 215 case TypeFunc::Parms: 216 _resproj = pn; 217 break; 218 default: 219 assert(false, "unexpected projection from allocation node."); 220 } 221 } 222 223 } 224 225 // Eliminate a card mark sequence. p2x is a ConvP2XNode 226 void PhaseMacroExpand::eliminate_card_mark(Node* p2x) { 227 assert(p2x->Opcode() == Op_CastP2X, "ConvP2XNode required"); 228 if (!UseG1GC) { 229 // vanilla/CMS post barrier 230 Node *shift = p2x->unique_out(); 231 Node *addp = shift->unique_out(); 232 for (DUIterator_Last jmin, j = addp->last_outs(jmin); j >= jmin; --j) { 233 Node *mem = addp->last_out(j); 234 if (UseCondCardMark && mem->is_Load()) { 235 assert(mem->Opcode() == Op_LoadB, "unexpected code shape"); 236 // The load is checking if the card has been written so 237 // replace it with zero to fold the test. 238 _igvn.replace_node(mem, intcon(0)); 239 continue; 240 } 241 assert(mem->is_Store(), "store required"); 242 _igvn.replace_node(mem, mem->in(MemNode::Memory)); 243 } 244 } else { 245 // G1 pre/post barriers 246 assert(p2x->outcnt() <= 2, "expects 1 or 2 users: Xor and URShift nodes"); 247 // It could be only one user, URShift node, in Object.clone() intrinsic 248 // but the new allocation is passed to arraycopy stub and it could not 249 // be scalar replaced. So we don't check the case. 250 251 // An other case of only one user (Xor) is when the value check for NULL 252 // in G1 post barrier is folded after CCP so the code which used URShift 253 // is removed. 254 255 // Take Region node before eliminating post barrier since it also 256 // eliminates CastP2X node when it has only one user. 257 Node* this_region = p2x->in(0); 258 assert(this_region != NULL, ""); 259 260 // Remove G1 post barrier. 261 262 // Search for CastP2X->Xor->URShift->Cmp path which 263 // checks if the store done to a different from the value's region. 264 // And replace Cmp with #0 (false) to collapse G1 post barrier. 265 Node* xorx = p2x->find_out_with(Op_XorX); 266 assert(xorx != NULL, "missing G1 post barrier"); 267 Node* shift = xorx->unique_out(); 268 Node* cmpx = shift->unique_out(); 269 assert(cmpx->is_Cmp() && cmpx->unique_out()->is_Bool() && 270 cmpx->unique_out()->as_Bool()->_test._test == BoolTest::ne, 271 "missing region check in G1 post barrier"); 272 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ)); 273 274 // Remove G1 pre barrier. 275 276 // Search "if (marking != 0)" check and set it to "false". 277 // There is no G1 pre barrier if previous stored value is NULL 278 // (for example, after initialization). 279 if (this_region->is_Region() && this_region->req() == 3) { 280 int ind = 1; 281 if (!this_region->in(ind)->is_IfFalse()) { 282 ind = 2; 283 } 284 if (this_region->in(ind)->is_IfFalse()) { 285 Node* bol = this_region->in(ind)->in(0)->in(1); 286 assert(bol->is_Bool(), ""); 287 cmpx = bol->in(1); 288 if (bol->as_Bool()->_test._test == BoolTest::ne && 289 cmpx->is_Cmp() && cmpx->in(2) == intcon(0) && 290 cmpx->in(1)->is_Load()) { 291 Node* adr = cmpx->in(1)->as_Load()->in(MemNode::Address); 292 const int marking_offset = in_bytes(JavaThread::satb_mark_queue_offset() + 293 SATBMarkQueue::byte_offset_of_active()); 294 if (adr->is_AddP() && adr->in(AddPNode::Base) == top() && 295 adr->in(AddPNode::Address)->Opcode() == Op_ThreadLocal && 296 adr->in(AddPNode::Offset) == MakeConX(marking_offset)) { 297 _igvn.replace_node(cmpx, makecon(TypeInt::CC_EQ)); 298 } 299 } 300 } 301 } 302 // Now CastP2X can be removed since it is used only on dead path 303 // which currently still alive until igvn optimize it. 304 assert(p2x->outcnt() == 0 || p2x->unique_out()->Opcode() == Op_URShiftX, ""); 305 _igvn.replace_node(p2x, top()); 306 } 307 } 308 309 // Search for a memory operation for the specified memory slice. 310 static Node *scan_mem_chain(Node *mem, int alias_idx, int offset, Node *start_mem, Node *alloc, PhaseGVN *phase) { 311 Node *orig_mem = mem; 312 Node *alloc_mem = alloc->in(TypeFunc::Memory); 313 const TypeOopPtr *tinst = phase->C->get_adr_type(alias_idx)->isa_oopptr(); 314 while (true) { 315 if (mem == alloc_mem || mem == start_mem ) { 316 return mem; // hit one of our sentinels 317 } else if (mem->is_MergeMem()) { 318 mem = mem->as_MergeMem()->memory_at(alias_idx); 319 } else if (mem->is_Proj() && mem->as_Proj()->_con == TypeFunc::Memory) { 320 Node *in = mem->in(0); 321 // we can safely skip over safepoints, calls, locks and membars because we 322 // already know that the object is safe to eliminate. 323 if (in->is_Initialize() && in->as_Initialize()->allocation() == alloc) { 324 return in; 325 } else if (in->is_Call()) { 326 CallNode *call = in->as_Call(); 327 if (call->may_modify(tinst, phase)) { 328 assert(call->is_ArrayCopy(), "ArrayCopy is the only call node that doesn't make allocation escape"); 329 330 if (call->as_ArrayCopy()->modifies(offset, offset, phase, false)) { 331 return in; 332 } 333 } 334 mem = in->in(TypeFunc::Memory); 335 } else if (in->is_MemBar()) { 336 if (ArrayCopyNode::may_modify(tinst, in->as_MemBar(), phase)) { 337 assert(in->in(0)->is_Proj() && in->in(0)->in(0)->is_ArrayCopy(), "should be arraycopy"); 338 ArrayCopyNode* ac = in->in(0)->in(0)->as_ArrayCopy(); 339 assert(ac->is_clonebasic(), "Only basic clone is a non escaping clone"); 340 return ac; 341 } 342 mem = in->in(TypeFunc::Memory); 343 } else { 344 assert(false, "unexpected projection"); 345 } 346 } else if (mem->is_Store()) { 347 const TypePtr* atype = mem->as_Store()->adr_type(); 348 int adr_idx = phase->C->get_alias_index(atype); 349 if (adr_idx == alias_idx) { 350 assert(atype->isa_oopptr(), "address type must be oopptr"); 351 int adr_offset = atype->offset(); 352 uint adr_iid = atype->is_oopptr()->instance_id(); 353 // Array elements references have the same alias_idx 354 // but different offset and different instance_id. 355 if (adr_offset == offset && adr_iid == alloc->_idx) 356 return mem; 357 } else { 358 assert(adr_idx == Compile::AliasIdxRaw, "address must match or be raw"); 359 } 360 mem = mem->in(MemNode::Memory); 361 } else if (mem->is_ClearArray()) { 362 if (!ClearArrayNode::step_through(&mem, alloc->_idx, phase)) { 363 // Can not bypass initialization of the instance 364 // we are looking. 365 debug_only(intptr_t offset;) 366 assert(alloc == AllocateNode::Ideal_allocation(mem->in(3), phase, offset), "sanity"); 367 InitializeNode* init = alloc->as_Allocate()->initialization(); 368 // We are looking for stored value, return Initialize node 369 // or memory edge from Allocate node. 370 if (init != NULL) 371 return init; 372 else 373 return alloc->in(TypeFunc::Memory); // It will produce zero value (see callers). 374 } 375 // Otherwise skip it (the call updated 'mem' value). 376 } else if (mem->Opcode() == Op_SCMemProj) { 377 mem = mem->in(0); 378 Node* adr = NULL; 379 if (mem->is_LoadStore()) { 380 adr = mem->in(MemNode::Address); 381 } else { 382 assert(mem->Opcode() == Op_EncodeISOArray || 383 mem->Opcode() == Op_StrCompressedCopy, "sanity"); 384 adr = mem->in(3); // Destination array 385 } 386 const TypePtr* atype = adr->bottom_type()->is_ptr(); 387 int adr_idx = phase->C->get_alias_index(atype); 388 if (adr_idx == alias_idx) { 389 DEBUG_ONLY(mem->dump();) 390 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field"); 391 return NULL; 392 } 393 mem = mem->in(MemNode::Memory); 394 } else if (mem->Opcode() == Op_StrInflatedCopy) { 395 Node* adr = mem->in(3); // Destination array 396 const TypePtr* atype = adr->bottom_type()->is_ptr(); 397 int adr_idx = phase->C->get_alias_index(atype); 398 if (adr_idx == alias_idx) { 399 DEBUG_ONLY(mem->dump();) 400 assert(false, "Object is not scalar replaceable if a StrInflatedCopy node accesses its field"); 401 return NULL; 402 } 403 mem = mem->in(MemNode::Memory); 404 } else { 405 return mem; 406 } 407 assert(mem != orig_mem, "dead memory loop"); 408 } 409 } 410 411 // Generate loads from source of the arraycopy for fields of 412 // destination needed at a deoptimization point 413 Node* PhaseMacroExpand::make_arraycopy_load(ArrayCopyNode* ac, intptr_t offset, Node* ctl, BasicType ft, const Type *ftype, AllocateNode *alloc) { 414 BasicType bt = ft; 415 const Type *type = ftype; 416 if (ft == T_NARROWOOP) { 417 bt = T_OBJECT; 418 type = ftype->make_oopptr(); 419 } 420 Node* res = NULL; 421 if (ac->is_clonebasic()) { 422 Node* base = ac->in(ArrayCopyNode::Src)->in(AddPNode::Base); 423 Node* adr = _igvn.transform(new AddPNode(base, base, MakeConX(offset))); 424 const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset); 425 Node* m = ac->in(TypeFunc::Memory); 426 while (m->is_MergeMem()) { 427 m = m->as_MergeMem()->memory_at(C->get_alias_index(adr_type)); 428 if (m->is_Proj() && m->in(0)->is_MemBar()) { 429 m = m->in(0)->in(TypeFunc::Memory); 430 } 431 } 432 res = LoadNode::make(_igvn, ctl, m, adr, adr_type, type, bt, MemNode::unordered, LoadNode::Pinned); 433 } else { 434 if (ac->modifies(offset, offset, &_igvn, true)) { 435 assert(ac->in(ArrayCopyNode::Dest) == alloc->result_cast(), "arraycopy destination should be allocation's result"); 436 uint shift = exact_log2(type2aelembytes(bt)); 437 Node* diff = _igvn.transform(new SubINode(ac->in(ArrayCopyNode::SrcPos), ac->in(ArrayCopyNode::DestPos))); 438 #ifdef _LP64 439 diff = _igvn.transform(new ConvI2LNode(diff)); 440 #endif 441 diff = _igvn.transform(new LShiftXNode(diff, intcon(shift))); 442 443 Node* off = _igvn.transform(new AddXNode(MakeConX(offset), diff)); 444 Node* base = ac->in(ArrayCopyNode::Src); 445 Node* adr = _igvn.transform(new AddPNode(base, base, off)); 446 const TypePtr* adr_type = _igvn.type(base)->is_ptr()->add_offset(offset); 447 Node* m = ac->in(TypeFunc::Memory); 448 res = LoadNode::make(_igvn, ctl, m, adr, adr_type, type, bt, MemNode::unordered, LoadNode::Pinned); 449 } 450 } 451 if (res != NULL) { 452 res = _igvn.transform(res); 453 if (ftype->isa_narrowoop()) { 454 // PhaseMacroExpand::scalar_replacement adds DecodeN nodes 455 res = _igvn.transform(new EncodePNode(res, ftype)); 456 } 457 return res; 458 } 459 return NULL; 460 } 461 462 // 463 // Given a Memory Phi, compute a value Phi containing the values from stores 464 // on the input paths. 465 // Note: this function is recursive, its depth is limited by the "level" argument 466 // Returns the computed Phi, or NULL if it cannot compute it. 467 Node *PhaseMacroExpand::value_from_mem_phi(Node *mem, BasicType ft, const Type *phi_type, const TypeOopPtr *adr_t, AllocateNode *alloc, Node_Stack *value_phis, int level) { 468 assert(mem->is_Phi(), "sanity"); 469 int alias_idx = C->get_alias_index(adr_t); 470 int offset = adr_t->offset(); 471 int instance_id = adr_t->instance_id(); 472 473 // Check if an appropriate value phi already exists. 474 Node* region = mem->in(0); 475 for (DUIterator_Fast kmax, k = region->fast_outs(kmax); k < kmax; k++) { 476 Node* phi = region->fast_out(k); 477 if (phi->is_Phi() && phi != mem && 478 phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) { 479 return phi; 480 } 481 } 482 // Check if an appropriate new value phi already exists. 483 Node* new_phi = value_phis->find(mem->_idx); 484 if (new_phi != NULL) 485 return new_phi; 486 487 if (level <= 0) { 488 return NULL; // Give up: phi tree too deep 489 } 490 Node *start_mem = C->start()->proj_out(TypeFunc::Memory); 491 Node *alloc_mem = alloc->in(TypeFunc::Memory); 492 493 uint length = mem->req(); 494 GrowableArray <Node *> values(length, length, NULL, false); 495 496 // create a new Phi for the value 497 PhiNode *phi = new PhiNode(mem->in(0), phi_type, NULL, instance_id, alias_idx, offset); 498 transform_later(phi); 499 value_phis->push(phi, mem->_idx); 500 501 for (uint j = 1; j < length; j++) { 502 Node *in = mem->in(j); 503 if (in == NULL || in->is_top()) { 504 values.at_put(j, in); 505 } else { 506 Node *val = scan_mem_chain(in, alias_idx, offset, start_mem, alloc, &_igvn); 507 if (val == start_mem || val == alloc_mem) { 508 // hit a sentinel, return appropriate 0 value 509 values.at_put(j, _igvn.zerocon(ft)); 510 continue; 511 } 512 if (val->is_Initialize()) { 513 val = val->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn); 514 } 515 if (val == NULL) { 516 return NULL; // can't find a value on this path 517 } 518 if (val == mem) { 519 values.at_put(j, mem); 520 } else if (val->is_Store()) { 521 values.at_put(j, val->in(MemNode::ValueIn)); 522 } else if(val->is_Proj() && val->in(0) == alloc) { 523 values.at_put(j, _igvn.zerocon(ft)); 524 } else if (val->is_Phi()) { 525 val = value_from_mem_phi(val, ft, phi_type, adr_t, alloc, value_phis, level-1); 526 if (val == NULL) { 527 return NULL; 528 } 529 values.at_put(j, val); 530 } else if (val->Opcode() == Op_SCMemProj) { 531 assert(val->in(0)->is_LoadStore() || 532 val->in(0)->Opcode() == Op_EncodeISOArray || 533 val->in(0)->Opcode() == Op_StrCompressedCopy, "sanity"); 534 assert(false, "Object is not scalar replaceable if a LoadStore node accesses its field"); 535 return NULL; 536 } else if (val->is_ArrayCopy()) { 537 Node* res = make_arraycopy_load(val->as_ArrayCopy(), offset, val->in(0), ft, phi_type, alloc); 538 if (res == NULL) { 539 return NULL; 540 } 541 values.at_put(j, res); 542 } else { 543 #ifdef ASSERT 544 val->dump(); 545 assert(false, "unknown node on this path"); 546 #endif 547 return NULL; // unknown node on this path 548 } 549 } 550 } 551 // Set Phi's inputs 552 for (uint j = 1; j < length; j++) { 553 if (values.at(j) == mem) { 554 phi->init_req(j, phi); 555 } else { 556 phi->init_req(j, values.at(j)); 557 } 558 } 559 return phi; 560 } 561 562 // Search the last value stored into the object's field. 563 Node *PhaseMacroExpand::value_from_mem(Node *sfpt_mem, Node *sfpt_ctl, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, AllocateNode *alloc) { 564 assert(adr_t->is_known_instance_field(), "instance required"); 565 int instance_id = adr_t->instance_id(); 566 assert((uint)instance_id == alloc->_idx, "wrong allocation"); 567 568 int alias_idx = C->get_alias_index(adr_t); 569 int offset = adr_t->offset(); 570 Node *start_mem = C->start()->proj_out(TypeFunc::Memory); 571 Node *alloc_ctrl = alloc->in(TypeFunc::Control); 572 Node *alloc_mem = alloc->in(TypeFunc::Memory); 573 Arena *a = Thread::current()->resource_area(); 574 VectorSet visited(a); 575 576 577 bool done = sfpt_mem == alloc_mem; 578 Node *mem = sfpt_mem; 579 while (!done) { 580 if (visited.test_set(mem->_idx)) { 581 return NULL; // found a loop, give up 582 } 583 mem = scan_mem_chain(mem, alias_idx, offset, start_mem, alloc, &_igvn); 584 if (mem == start_mem || mem == alloc_mem) { 585 done = true; // hit a sentinel, return appropriate 0 value 586 } else if (mem->is_Initialize()) { 587 mem = mem->as_Initialize()->find_captured_store(offset, type2aelembytes(ft), &_igvn); 588 if (mem == NULL) { 589 done = true; // Something go wrong. 590 } else if (mem->is_Store()) { 591 const TypePtr* atype = mem->as_Store()->adr_type(); 592 assert(C->get_alias_index(atype) == Compile::AliasIdxRaw, "store is correct memory slice"); 593 done = true; 594 } 595 } else if (mem->is_Store()) { 596 const TypeOopPtr* atype = mem->as_Store()->adr_type()->isa_oopptr(); 597 assert(atype != NULL, "address type must be oopptr"); 598 assert(C->get_alias_index(atype) == alias_idx && 599 atype->is_known_instance_field() && atype->offset() == offset && 600 atype->instance_id() == instance_id, "store is correct memory slice"); 601 done = true; 602 } else if (mem->is_Phi()) { 603 // try to find a phi's unique input 604 Node *unique_input = NULL; 605 Node *top = C->top(); 606 for (uint i = 1; i < mem->req(); i++) { 607 Node *n = scan_mem_chain(mem->in(i), alias_idx, offset, start_mem, alloc, &_igvn); 608 if (n == NULL || n == top || n == mem) { 609 continue; 610 } else if (unique_input == NULL) { 611 unique_input = n; 612 } else if (unique_input != n) { 613 unique_input = top; 614 break; 615 } 616 } 617 if (unique_input != NULL && unique_input != top) { 618 mem = unique_input; 619 } else { 620 done = true; 621 } 622 } else if (mem->is_ArrayCopy()) { 623 done = true; 624 } else { 625 assert(false, "unexpected node"); 626 } 627 } 628 if (mem != NULL) { 629 if (mem == start_mem || mem == alloc_mem) { 630 // hit a sentinel, return appropriate 0 value 631 return _igvn.zerocon(ft); 632 } else if (mem->is_Store()) { 633 return mem->in(MemNode::ValueIn); 634 } else if (mem->is_Phi()) { 635 // attempt to produce a Phi reflecting the values on the input paths of the Phi 636 Node_Stack value_phis(a, 8); 637 Node * phi = value_from_mem_phi(mem, ft, ftype, adr_t, alloc, &value_phis, ValueSearchLimit); 638 if (phi != NULL) { 639 return phi; 640 } else { 641 // Kill all new Phis 642 while(value_phis.is_nonempty()) { 643 Node* n = value_phis.node(); 644 _igvn.replace_node(n, C->top()); 645 value_phis.pop(); 646 } 647 } 648 } else if (mem->is_ArrayCopy()) { 649 Node* ctl = mem->in(0); 650 if (sfpt_ctl->is_Proj() && sfpt_ctl->as_Proj()->is_uncommon_trap_proj(Deoptimization::Reason_none)) { 651 // pin the loads in the uncommon trap path 652 ctl = sfpt_ctl; 653 } 654 return make_arraycopy_load(mem->as_ArrayCopy(), offset, ctl, ft, ftype, alloc); 655 } 656 } 657 // Something go wrong. 658 return NULL; 659 } 660 661 // Check the possibility of scalar replacement. 662 bool PhaseMacroExpand::can_eliminate_allocation(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) { 663 // Scan the uses of the allocation to check for anything that would 664 // prevent us from eliminating it. 665 NOT_PRODUCT( const char* fail_eliminate = NULL; ) 666 DEBUG_ONLY( Node* disq_node = NULL; ) 667 bool can_eliminate = true; 668 669 Node* res = alloc->result_cast(); 670 const TypeOopPtr* res_type = NULL; 671 if (res == NULL) { 672 // All users were eliminated. 673 } else if (!res->is_CheckCastPP()) { 674 NOT_PRODUCT(fail_eliminate = "Allocation does not have unique CheckCastPP";) 675 can_eliminate = false; 676 } else { 677 res_type = _igvn.type(res)->isa_oopptr(); 678 if (res_type == NULL) { 679 NOT_PRODUCT(fail_eliminate = "Neither instance or array allocation";) 680 can_eliminate = false; 681 } else if (res_type->isa_aryptr()) { 682 int length = alloc->in(AllocateNode::ALength)->find_int_con(-1); 683 if (length < 0) { 684 NOT_PRODUCT(fail_eliminate = "Array's size is not constant";) 685 can_eliminate = false; 686 } 687 } 688 } 689 690 if (can_eliminate && res != NULL) { 691 for (DUIterator_Fast jmax, j = res->fast_outs(jmax); 692 j < jmax && can_eliminate; j++) { 693 Node* use = res->fast_out(j); 694 695 if (use->is_AddP()) { 696 const TypePtr* addp_type = _igvn.type(use)->is_ptr(); 697 int offset = addp_type->offset(); 698 699 if (offset == Type::OffsetTop || offset == Type::OffsetBot) { 700 NOT_PRODUCT(fail_eliminate = "Undefined field referrence";) 701 can_eliminate = false; 702 break; 703 } 704 for (DUIterator_Fast kmax, k = use->fast_outs(kmax); 705 k < kmax && can_eliminate; k++) { 706 Node* n = use->fast_out(k); 707 if (!n->is_Store() && n->Opcode() != Op_CastP2X && 708 !(n->is_ArrayCopy() && 709 n->as_ArrayCopy()->is_clonebasic() && 710 n->in(ArrayCopyNode::Dest) == use)) { 711 DEBUG_ONLY(disq_node = n;) 712 if (n->is_Load() || n->is_LoadStore()) { 713 NOT_PRODUCT(fail_eliminate = "Field load";) 714 } else { 715 NOT_PRODUCT(fail_eliminate = "Not store field referrence";) 716 } 717 can_eliminate = false; 718 } 719 } 720 } else if (use->is_ArrayCopy() && 721 (use->as_ArrayCopy()->is_arraycopy_validated() || 722 use->as_ArrayCopy()->is_copyof_validated() || 723 use->as_ArrayCopy()->is_copyofrange_validated()) && 724 use->in(ArrayCopyNode::Dest) == res) { 725 // ok to eliminate 726 } else if (use->is_SafePoint()) { 727 SafePointNode* sfpt = use->as_SafePoint(); 728 if (sfpt->is_Call() && sfpt->as_Call()->has_non_debug_use(res)) { 729 // Object is passed as argument. 730 DEBUG_ONLY(disq_node = use;) 731 NOT_PRODUCT(fail_eliminate = "Object is passed as argument";) 732 can_eliminate = false; 733 } 734 Node* sfptMem = sfpt->memory(); 735 if (sfptMem == NULL || sfptMem->is_top()) { 736 DEBUG_ONLY(disq_node = use;) 737 NOT_PRODUCT(fail_eliminate = "NULL or TOP memory";) 738 can_eliminate = false; 739 } else { 740 safepoints.append_if_missing(sfpt); 741 } 742 } else if (use->Opcode() != Op_CastP2X) { // CastP2X is used by card mark 743 if (use->is_Phi()) { 744 if (use->outcnt() == 1 && use->unique_out()->Opcode() == Op_Return) { 745 NOT_PRODUCT(fail_eliminate = "Object is return value";) 746 } else { 747 NOT_PRODUCT(fail_eliminate = "Object is referenced by Phi";) 748 } 749 DEBUG_ONLY(disq_node = use;) 750 } else { 751 if (use->Opcode() == Op_Return) { 752 NOT_PRODUCT(fail_eliminate = "Object is return value";) 753 }else { 754 NOT_PRODUCT(fail_eliminate = "Object is referenced by node";) 755 } 756 DEBUG_ONLY(disq_node = use;) 757 } 758 can_eliminate = false; 759 } 760 } 761 } 762 763 #ifndef PRODUCT 764 if (PrintEliminateAllocations) { 765 if (can_eliminate) { 766 tty->print("Scalar "); 767 if (res == NULL) 768 alloc->dump(); 769 else 770 res->dump(); 771 } else if (alloc->_is_scalar_replaceable) { 772 tty->print("NotScalar (%s)", fail_eliminate); 773 if (res == NULL) 774 alloc->dump(); 775 else 776 res->dump(); 777 #ifdef ASSERT 778 if (disq_node != NULL) { 779 tty->print(" >>>> "); 780 disq_node->dump(); 781 } 782 #endif /*ASSERT*/ 783 } 784 } 785 #endif 786 return can_eliminate; 787 } 788 789 // Do scalar replacement. 790 bool PhaseMacroExpand::scalar_replacement(AllocateNode *alloc, GrowableArray <SafePointNode *>& safepoints) { 791 GrowableArray <SafePointNode *> safepoints_done; 792 793 ciKlass* klass = NULL; 794 ciInstanceKlass* iklass = NULL; 795 int nfields = 0; 796 int array_base = 0; 797 int element_size = 0; 798 BasicType basic_elem_type = T_ILLEGAL; 799 ciType* elem_type = NULL; 800 801 Node* res = alloc->result_cast(); 802 assert(res == NULL || res->is_CheckCastPP(), "unexpected AllocateNode result"); 803 const TypeOopPtr* res_type = NULL; 804 if (res != NULL) { // Could be NULL when there are no users 805 res_type = _igvn.type(res)->isa_oopptr(); 806 } 807 808 if (res != NULL) { 809 klass = res_type->klass(); 810 if (res_type->isa_instptr()) { 811 // find the fields of the class which will be needed for safepoint debug information 812 assert(klass->is_instance_klass(), "must be an instance klass."); 813 iklass = klass->as_instance_klass(); 814 nfields = iklass->nof_nonstatic_fields(); 815 } else { 816 // find the array's elements which will be needed for safepoint debug information 817 nfields = alloc->in(AllocateNode::ALength)->find_int_con(-1); 818 assert(klass->is_array_klass() && nfields >= 0, "must be an array klass."); 819 elem_type = klass->as_array_klass()->element_type(); 820 basic_elem_type = elem_type->basic_type(); 821 array_base = arrayOopDesc::base_offset_in_bytes(basic_elem_type); 822 element_size = type2aelembytes(basic_elem_type); 823 } 824 } 825 // 826 // Process the safepoint uses 827 // 828 while (safepoints.length() > 0) { 829 SafePointNode* sfpt = safepoints.pop(); 830 Node* mem = sfpt->memory(); 831 Node* ctl = sfpt->control(); 832 assert(sfpt->jvms() != NULL, "missed JVMS"); 833 // Fields of scalar objs are referenced only at the end 834 // of regular debuginfo at the last (youngest) JVMS. 835 // Record relative start index. 836 uint first_ind = (sfpt->req() - sfpt->jvms()->scloff()); 837 SafePointScalarObjectNode* sobj = new SafePointScalarObjectNode(res_type, 838 #ifdef ASSERT 839 alloc, 840 #endif 841 first_ind, nfields); 842 sobj->init_req(0, C->root()); 843 transform_later(sobj); 844 845 // Scan object's fields adding an input to the safepoint for each field. 846 for (int j = 0; j < nfields; j++) { 847 intptr_t offset; 848 ciField* field = NULL; 849 if (iklass != NULL) { 850 field = iklass->nonstatic_field_at(j); 851 offset = field->offset(); 852 elem_type = field->type(); 853 basic_elem_type = field->layout_type(); 854 } else { 855 offset = array_base + j * (intptr_t)element_size; 856 } 857 858 const Type *field_type; 859 // The next code is taken from Parse::do_get_xxx(). 860 if (basic_elem_type == T_OBJECT || basic_elem_type == T_ARRAY) { 861 if (!elem_type->is_loaded()) { 862 field_type = TypeInstPtr::BOTTOM; 863 } else if (field != NULL && field->is_constant() && field->is_static()) { 864 // This can happen if the constant oop is non-perm. 865 ciObject* con = field->constant_value().as_object(); 866 // Do not "join" in the previous type; it doesn't add value, 867 // and may yield a vacuous result if the field is of interface type. 868 field_type = TypeOopPtr::make_from_constant(con)->isa_oopptr(); 869 assert(field_type != NULL, "field singleton type must be consistent"); 870 } else { 871 field_type = TypeOopPtr::make_from_klass(elem_type->as_klass()); 872 } 873 if (UseCompressedOops) { 874 field_type = field_type->make_narrowoop(); 875 basic_elem_type = T_NARROWOOP; 876 } 877 } else { 878 field_type = Type::get_const_basic_type(basic_elem_type); 879 } 880 881 const TypeOopPtr *field_addr_type = res_type->add_offset(offset)->isa_oopptr(); 882 883 Node *field_val = value_from_mem(mem, ctl, basic_elem_type, field_type, field_addr_type, alloc); 884 if (field_val == NULL) { 885 // We weren't able to find a value for this field, 886 // give up on eliminating this allocation. 887 888 // Remove any extra entries we added to the safepoint. 889 uint last = sfpt->req() - 1; 890 for (int k = 0; k < j; k++) { 891 sfpt->del_req(last--); 892 } 893 _igvn._worklist.push(sfpt); 894 // rollback processed safepoints 895 while (safepoints_done.length() > 0) { 896 SafePointNode* sfpt_done = safepoints_done.pop(); 897 // remove any extra entries we added to the safepoint 898 last = sfpt_done->req() - 1; 899 for (int k = 0; k < nfields; k++) { 900 sfpt_done->del_req(last--); 901 } 902 JVMState *jvms = sfpt_done->jvms(); 903 jvms->set_endoff(sfpt_done->req()); 904 // Now make a pass over the debug information replacing any references 905 // to SafePointScalarObjectNode with the allocated object. 906 int start = jvms->debug_start(); 907 int end = jvms->debug_end(); 908 for (int i = start; i < end; i++) { 909 if (sfpt_done->in(i)->is_SafePointScalarObject()) { 910 SafePointScalarObjectNode* scobj = sfpt_done->in(i)->as_SafePointScalarObject(); 911 if (scobj->first_index(jvms) == sfpt_done->req() && 912 scobj->n_fields() == (uint)nfields) { 913 assert(scobj->alloc() == alloc, "sanity"); 914 sfpt_done->set_req(i, res); 915 } 916 } 917 } 918 _igvn._worklist.push(sfpt_done); 919 } 920 #ifndef PRODUCT 921 if (PrintEliminateAllocations) { 922 if (field != NULL) { 923 tty->print("=== At SafePoint node %d can't find value of Field: ", 924 sfpt->_idx); 925 field->print(); 926 int field_idx = C->get_alias_index(field_addr_type); 927 tty->print(" (alias_idx=%d)", field_idx); 928 } else { // Array's element 929 tty->print("=== At SafePoint node %d can't find value of array element [%d]", 930 sfpt->_idx, j); 931 } 932 tty->print(", which prevents elimination of: "); 933 if (res == NULL) 934 alloc->dump(); 935 else 936 res->dump(); 937 } 938 #endif 939 return false; 940 } 941 if (UseCompressedOops && field_type->isa_narrowoop()) { 942 // Enable "DecodeN(EncodeP(Allocate)) --> Allocate" transformation 943 // to be able scalar replace the allocation. 944 if (field_val->is_EncodeP()) { 945 field_val = field_val->in(1); 946 } else { 947 field_val = transform_later(new DecodeNNode(field_val, field_val->get_ptr_type())); 948 } 949 } 950 sfpt->add_req(field_val); 951 } 952 JVMState *jvms = sfpt->jvms(); 953 jvms->set_endoff(sfpt->req()); 954 // Now make a pass over the debug information replacing any references 955 // to the allocated object with "sobj" 956 int start = jvms->debug_start(); 957 int end = jvms->debug_end(); 958 sfpt->replace_edges_in_range(res, sobj, start, end); 959 _igvn._worklist.push(sfpt); 960 safepoints_done.append_if_missing(sfpt); // keep it for rollback 961 } 962 return true; 963 } 964 965 // Process users of eliminated allocation. 966 void PhaseMacroExpand::process_users_of_allocation(CallNode *alloc) { 967 Node* res = alloc->result_cast(); 968 if (res != NULL) { 969 for (DUIterator_Last jmin, j = res->last_outs(jmin); j >= jmin; ) { 970 Node *use = res->last_out(j); 971 uint oc1 = res->outcnt(); 972 973 if (use->is_AddP()) { 974 for (DUIterator_Last kmin, k = use->last_outs(kmin); k >= kmin; ) { 975 Node *n = use->last_out(k); 976 uint oc2 = use->outcnt(); 977 if (n->is_Store()) { 978 #ifdef ASSERT 979 // Verify that there is no dependent MemBarVolatile nodes, 980 // they should be removed during IGVN, see MemBarNode::Ideal(). 981 for (DUIterator_Fast pmax, p = n->fast_outs(pmax); 982 p < pmax; p++) { 983 Node* mb = n->fast_out(p); 984 assert(mb->is_Initialize() || !mb->is_MemBar() || 985 mb->req() <= MemBarNode::Precedent || 986 mb->in(MemBarNode::Precedent) != n, 987 "MemBarVolatile should be eliminated for non-escaping object"); 988 } 989 #endif 990 _igvn.replace_node(n, n->in(MemNode::Memory)); 991 } else if (n->is_ArrayCopy()) { 992 // Disconnect ArrayCopy node 993 ArrayCopyNode* ac = n->as_ArrayCopy(); 994 assert(ac->is_clonebasic(), "unexpected array copy kind"); 995 Node* ctl_proj = ac->proj_out(TypeFunc::Control); 996 Node* mem_proj = ac->proj_out(TypeFunc::Memory); 997 if (ctl_proj != NULL) { 998 _igvn.replace_node(ctl_proj, n->in(0)); 999 } 1000 if (mem_proj != NULL) { 1001 _igvn.replace_node(mem_proj, n->in(TypeFunc::Memory)); 1002 } 1003 } else { 1004 eliminate_card_mark(n); 1005 } 1006 k -= (oc2 - use->outcnt()); 1007 } 1008 } else if (use->is_ArrayCopy()) { 1009 // Disconnect ArrayCopy node 1010 ArrayCopyNode* ac = use->as_ArrayCopy(); 1011 assert(ac->is_arraycopy_validated() || 1012 ac->is_copyof_validated() || 1013 ac->is_copyofrange_validated(), "unsupported"); 1014 CallProjections callprojs; 1015 ac->extract_projections(&callprojs, true); 1016 1017 _igvn.replace_node(callprojs.fallthrough_ioproj, ac->in(TypeFunc::I_O)); 1018 _igvn.replace_node(callprojs.fallthrough_memproj, ac->in(TypeFunc::Memory)); 1019 _igvn.replace_node(callprojs.fallthrough_catchproj, ac->in(TypeFunc::Control)); 1020 1021 // Set control to top. IGVN will remove the remaining projections 1022 ac->set_req(0, top()); 1023 ac->replace_edge(res, top()); 1024 1025 // Disconnect src right away: it can help find new 1026 // opportunities for allocation elimination 1027 Node* src = ac->in(ArrayCopyNode::Src); 1028 ac->replace_edge(src, top()); 1029 if (src->outcnt() == 0) { 1030 _igvn.remove_dead_node(src); 1031 } 1032 1033 _igvn._worklist.push(ac); 1034 } else { 1035 eliminate_card_mark(use); 1036 } 1037 j -= (oc1 - res->outcnt()); 1038 } 1039 assert(res->outcnt() == 0, "all uses of allocated objects must be deleted"); 1040 _igvn.remove_dead_node(res); 1041 } 1042 1043 // 1044 // Process other users of allocation's projections 1045 // 1046 if (_resproj != NULL && _resproj->outcnt() != 0) { 1047 // First disconnect stores captured by Initialize node. 1048 // If Initialize node is eliminated first in the following code, 1049 // it will kill such stores and DUIterator_Last will assert. 1050 for (DUIterator_Fast jmax, j = _resproj->fast_outs(jmax); j < jmax; j++) { 1051 Node *use = _resproj->fast_out(j); 1052 if (use->is_AddP()) { 1053 // raw memory addresses used only by the initialization 1054 _igvn.replace_node(use, C->top()); 1055 --j; --jmax; 1056 } 1057 } 1058 for (DUIterator_Last jmin, j = _resproj->last_outs(jmin); j >= jmin; ) { 1059 Node *use = _resproj->last_out(j); 1060 uint oc1 = _resproj->outcnt(); 1061 if (use->is_Initialize()) { 1062 // Eliminate Initialize node. 1063 InitializeNode *init = use->as_Initialize(); 1064 assert(init->outcnt() <= 2, "only a control and memory projection expected"); 1065 Node *ctrl_proj = init->proj_out(TypeFunc::Control); 1066 if (ctrl_proj != NULL) { 1067 assert(init->in(TypeFunc::Control) == _fallthroughcatchproj, "allocation control projection"); 1068 _igvn.replace_node(ctrl_proj, _fallthroughcatchproj); 1069 } 1070 Node *mem_proj = init->proj_out(TypeFunc::Memory); 1071 if (mem_proj != NULL) { 1072 Node *mem = init->in(TypeFunc::Memory); 1073 #ifdef ASSERT 1074 if (mem->is_MergeMem()) { 1075 assert(mem->in(TypeFunc::Memory) == _memproj_fallthrough, "allocation memory projection"); 1076 } else { 1077 assert(mem == _memproj_fallthrough, "allocation memory projection"); 1078 } 1079 #endif 1080 _igvn.replace_node(mem_proj, mem); 1081 } 1082 } else { 1083 assert(false, "only Initialize or AddP expected"); 1084 } 1085 j -= (oc1 - _resproj->outcnt()); 1086 } 1087 } 1088 if (_fallthroughcatchproj != NULL) { 1089 _igvn.replace_node(_fallthroughcatchproj, alloc->in(TypeFunc::Control)); 1090 } 1091 if (_memproj_fallthrough != NULL) { 1092 _igvn.replace_node(_memproj_fallthrough, alloc->in(TypeFunc::Memory)); 1093 } 1094 if (_memproj_catchall != NULL) { 1095 _igvn.replace_node(_memproj_catchall, C->top()); 1096 } 1097 if (_ioproj_fallthrough != NULL) { 1098 _igvn.replace_node(_ioproj_fallthrough, alloc->in(TypeFunc::I_O)); 1099 } 1100 if (_ioproj_catchall != NULL) { 1101 _igvn.replace_node(_ioproj_catchall, C->top()); 1102 } 1103 if (_catchallcatchproj != NULL) { 1104 _igvn.replace_node(_catchallcatchproj, C->top()); 1105 } 1106 } 1107 1108 bool PhaseMacroExpand::eliminate_allocate_node(AllocateNode *alloc) { 1109 // Don't do scalar replacement if the frame can be popped by JVMTI: 1110 // if reallocation fails during deoptimization we'll pop all 1111 // interpreter frames for this compiled frame and that won't play 1112 // nice with JVMTI popframe. 1113 if (!EliminateAllocations || JvmtiExport::can_pop_frame() || !alloc->_is_non_escaping) { 1114 return false; 1115 } 1116 Node* klass = alloc->in(AllocateNode::KlassNode); 1117 const TypeKlassPtr* tklass = _igvn.type(klass)->is_klassptr(); 1118 Node* res = alloc->result_cast(); 1119 // Eliminate boxing allocations which are not used 1120 // regardless scalar replacable status. 1121 bool boxing_alloc = C->eliminate_boxing() && 1122 tklass->klass()->is_instance_klass() && 1123 tklass->klass()->as_instance_klass()->is_box_klass(); 1124 if (!alloc->_is_scalar_replaceable && (!boxing_alloc || (res != NULL))) { 1125 return false; 1126 } 1127 1128 extract_call_projections(alloc); 1129 1130 GrowableArray <SafePointNode *> safepoints; 1131 if (!can_eliminate_allocation(alloc, safepoints)) { 1132 return false; 1133 } 1134 1135 if (!alloc->_is_scalar_replaceable) { 1136 assert(res == NULL, "sanity"); 1137 // We can only eliminate allocation if all debug info references 1138 // are already replaced with SafePointScalarObject because 1139 // we can't search for a fields value without instance_id. 1140 if (safepoints.length() > 0) { 1141 return false; 1142 } 1143 } 1144 1145 if (!scalar_replacement(alloc, safepoints)) { 1146 return false; 1147 } 1148 1149 CompileLog* log = C->log(); 1150 if (log != NULL) { 1151 log->head("eliminate_allocation type='%d'", 1152 log->identify(tklass->klass())); 1153 JVMState* p = alloc->jvms(); 1154 while (p != NULL) { 1155 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method())); 1156 p = p->caller(); 1157 } 1158 log->tail("eliminate_allocation"); 1159 } 1160 1161 process_users_of_allocation(alloc); 1162 1163 #ifndef PRODUCT 1164 if (PrintEliminateAllocations) { 1165 if (alloc->is_AllocateArray()) 1166 tty->print_cr("++++ Eliminated: %d AllocateArray", alloc->_idx); 1167 else 1168 tty->print_cr("++++ Eliminated: %d Allocate", alloc->_idx); 1169 } 1170 #endif 1171 1172 return true; 1173 } 1174 1175 bool PhaseMacroExpand::eliminate_boxing_node(CallStaticJavaNode *boxing) { 1176 // EA should remove all uses of non-escaping boxing node. 1177 if (!C->eliminate_boxing() || boxing->proj_out(TypeFunc::Parms) != NULL) { 1178 return false; 1179 } 1180 1181 assert(boxing->result_cast() == NULL, "unexpected boxing node result"); 1182 1183 extract_call_projections(boxing); 1184 1185 const TypeTuple* r = boxing->tf()->range(); 1186 assert(r->cnt() > TypeFunc::Parms, "sanity"); 1187 const TypeInstPtr* t = r->field_at(TypeFunc::Parms)->isa_instptr(); 1188 assert(t != NULL, "sanity"); 1189 1190 CompileLog* log = C->log(); 1191 if (log != NULL) { 1192 log->head("eliminate_boxing type='%d'", 1193 log->identify(t->klass())); 1194 JVMState* p = boxing->jvms(); 1195 while (p != NULL) { 1196 log->elem("jvms bci='%d' method='%d'", p->bci(), log->identify(p->method())); 1197 p = p->caller(); 1198 } 1199 log->tail("eliminate_boxing"); 1200 } 1201 1202 process_users_of_allocation(boxing); 1203 1204 #ifndef PRODUCT 1205 if (PrintEliminateAllocations) { 1206 tty->print("++++ Eliminated: %d ", boxing->_idx); 1207 boxing->method()->print_short_name(tty); 1208 tty->cr(); 1209 } 1210 #endif 1211 1212 return true; 1213 } 1214 1215 //---------------------------set_eden_pointers------------------------- 1216 void PhaseMacroExpand::set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr) { 1217 if (UseTLAB) { // Private allocation: load from TLS 1218 Node* thread = transform_later(new ThreadLocalNode()); 1219 int tlab_top_offset = in_bytes(JavaThread::tlab_top_offset()); 1220 int tlab_end_offset = in_bytes(JavaThread::tlab_end_offset()); 1221 eden_top_adr = basic_plus_adr(top()/*not oop*/, thread, tlab_top_offset); 1222 eden_end_adr = basic_plus_adr(top()/*not oop*/, thread, tlab_end_offset); 1223 } else { // Shared allocation: load from globals 1224 CollectedHeap* ch = Universe::heap(); 1225 address top_adr = (address)ch->top_addr(); 1226 address end_adr = (address)ch->end_addr(); 1227 eden_top_adr = makecon(TypeRawPtr::make(top_adr)); 1228 eden_end_adr = basic_plus_adr(eden_top_adr, end_adr - top_adr); 1229 } 1230 } 1231 1232 1233 Node* PhaseMacroExpand::make_load(Node* ctl, Node* mem, Node* base, int offset, const Type* value_type, BasicType bt) { 1234 Node* adr = basic_plus_adr(base, offset); 1235 const TypePtr* adr_type = adr->bottom_type()->is_ptr(); 1236 Node* value = LoadNode::make(_igvn, ctl, mem, adr, adr_type, value_type, bt, MemNode::unordered); 1237 transform_later(value); 1238 return value; 1239 } 1240 1241 1242 Node* PhaseMacroExpand::make_store(Node* ctl, Node* mem, Node* base, int offset, Node* value, BasicType bt) { 1243 Node* adr = basic_plus_adr(base, offset); 1244 mem = StoreNode::make(_igvn, ctl, mem, adr, NULL, value, bt, MemNode::unordered); 1245 transform_later(mem); 1246 return mem; 1247 } 1248 1249 //============================================================================= 1250 // 1251 // A L L O C A T I O N 1252 // 1253 // Allocation attempts to be fast in the case of frequent small objects. 1254 // It breaks down like this: 1255 // 1256 // 1) Size in doublewords is computed. This is a constant for objects and 1257 // variable for most arrays. Doubleword units are used to avoid size 1258 // overflow of huge doubleword arrays. We need doublewords in the end for 1259 // rounding. 1260 // 1261 // 2) Size is checked for being 'too large'. Too-large allocations will go 1262 // the slow path into the VM. The slow path can throw any required 1263 // exceptions, and does all the special checks for very large arrays. The 1264 // size test can constant-fold away for objects. For objects with 1265 // finalizers it constant-folds the otherway: you always go slow with 1266 // finalizers. 1267 // 1268 // 3) If NOT using TLABs, this is the contended loop-back point. 1269 // Load-Locked the heap top. If using TLABs normal-load the heap top. 1270 // 1271 // 4) Check that heap top + size*8 < max. If we fail go the slow ` route. 1272 // NOTE: "top+size*8" cannot wrap the 4Gig line! Here's why: for largish 1273 // "size*8" we always enter the VM, where "largish" is a constant picked small 1274 // enough that there's always space between the eden max and 4Gig (old space is 1275 // there so it's quite large) and large enough that the cost of entering the VM 1276 // is dwarfed by the cost to initialize the space. 1277 // 1278 // 5) If NOT using TLABs, Store-Conditional the adjusted heap top back 1279 // down. If contended, repeat at step 3. If using TLABs normal-store 1280 // adjusted heap top back down; there is no contention. 1281 // 1282 // 6) If !ZeroTLAB then Bulk-clear the object/array. Fill in klass & mark 1283 // fields. 1284 // 1285 // 7) Merge with the slow-path; cast the raw memory pointer to the correct 1286 // oop flavor. 1287 // 1288 //============================================================================= 1289 // FastAllocateSizeLimit value is in DOUBLEWORDS. 1290 // Allocations bigger than this always go the slow route. 1291 // This value must be small enough that allocation attempts that need to 1292 // trigger exceptions go the slow route. Also, it must be small enough so 1293 // that heap_top + size_in_bytes does not wrap around the 4Gig limit. 1294 //=============================================================================j// 1295 // %%% Here is an old comment from parseHelper.cpp; is it outdated? 1296 // The allocator will coalesce int->oop copies away. See comment in 1297 // coalesce.cpp about how this works. It depends critically on the exact 1298 // code shape produced here, so if you are changing this code shape 1299 // make sure the GC info for the heap-top is correct in and around the 1300 // slow-path call. 1301 // 1302 1303 void PhaseMacroExpand::expand_allocate_common( 1304 AllocateNode* alloc, // allocation node to be expanded 1305 Node* length, // array length for an array allocation 1306 const TypeFunc* slow_call_type, // Type of slow call 1307 address slow_call_address // Address of slow call 1308 ) 1309 { 1310 1311 Node* ctrl = alloc->in(TypeFunc::Control); 1312 Node* mem = alloc->in(TypeFunc::Memory); 1313 Node* i_o = alloc->in(TypeFunc::I_O); 1314 Node* size_in_bytes = alloc->in(AllocateNode::AllocSize); 1315 Node* klass_node = alloc->in(AllocateNode::KlassNode); 1316 Node* initial_slow_test = alloc->in(AllocateNode::InitialTest); 1317 1318 assert(ctrl != NULL, "must have control"); 1319 // We need a Region and corresponding Phi's to merge the slow-path and fast-path results. 1320 // they will not be used if "always_slow" is set 1321 enum { slow_result_path = 1, fast_result_path = 2 }; 1322 Node *result_region = NULL; 1323 Node *result_phi_rawmem = NULL; 1324 Node *result_phi_rawoop = NULL; 1325 Node *result_phi_i_o = NULL; 1326 1327 // The initial slow comparison is a size check, the comparison 1328 // we want to do is a BoolTest::gt 1329 bool always_slow = false; 1330 int tv = _igvn.find_int_con(initial_slow_test, -1); 1331 if (tv >= 0) { 1332 always_slow = (tv == 1); 1333 initial_slow_test = NULL; 1334 } else { 1335 initial_slow_test = BoolNode::make_predicate(initial_slow_test, &_igvn); 1336 } 1337 1338 if (C->env()->dtrace_alloc_probes() || 1339 !UseTLAB && (!Universe::heap()->supports_inline_contig_alloc())) { 1340 // Force slow-path allocation 1341 always_slow = true; 1342 initial_slow_test = NULL; 1343 } 1344 1345 1346 enum { too_big_or_final_path = 1, need_gc_path = 2 }; 1347 Node *slow_region = NULL; 1348 Node *toobig_false = ctrl; 1349 1350 assert (initial_slow_test == NULL || !always_slow, "arguments must be consistent"); 1351 // generate the initial test if necessary 1352 if (initial_slow_test != NULL ) { 1353 slow_region = new RegionNode(3); 1354 1355 // Now make the initial failure test. Usually a too-big test but 1356 // might be a TRUE for finalizers or a fancy class check for 1357 // newInstance0. 1358 IfNode *toobig_iff = new IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN); 1359 transform_later(toobig_iff); 1360 // Plug the failing-too-big test into the slow-path region 1361 Node *toobig_true = new IfTrueNode( toobig_iff ); 1362 transform_later(toobig_true); 1363 slow_region ->init_req( too_big_or_final_path, toobig_true ); 1364 toobig_false = new IfFalseNode( toobig_iff ); 1365 transform_later(toobig_false); 1366 } else { // No initial test, just fall into next case 1367 toobig_false = ctrl; 1368 debug_only(slow_region = NodeSentinel); 1369 } 1370 1371 Node *slow_mem = mem; // save the current memory state for slow path 1372 // generate the fast allocation code unless we know that the initial test will always go slow 1373 if (!always_slow) { 1374 // Fast path modifies only raw memory. 1375 if (mem->is_MergeMem()) { 1376 mem = mem->as_MergeMem()->memory_at(Compile::AliasIdxRaw); 1377 } 1378 1379 Node* eden_top_adr; 1380 Node* eden_end_adr; 1381 1382 set_eden_pointers(eden_top_adr, eden_end_adr); 1383 1384 // Load Eden::end. Loop invariant and hoisted. 1385 // 1386 // Note: We set the control input on "eden_end" and "old_eden_top" when using 1387 // a TLAB to work around a bug where these values were being moved across 1388 // a safepoint. These are not oops, so they cannot be include in the oop 1389 // map, but they can be changed by a GC. The proper way to fix this would 1390 // be to set the raw memory state when generating a SafepointNode. However 1391 // this will require extensive changes to the loop optimization in order to 1392 // prevent a degradation of the optimization. 1393 // See comment in memnode.hpp, around line 227 in class LoadPNode. 1394 Node *eden_end = make_load(ctrl, mem, eden_end_adr, 0, TypeRawPtr::BOTTOM, T_ADDRESS); 1395 1396 // allocate the Region and Phi nodes for the result 1397 result_region = new RegionNode(3); 1398 result_phi_rawmem = new PhiNode(result_region, Type::MEMORY, TypeRawPtr::BOTTOM); 1399 result_phi_rawoop = new PhiNode(result_region, TypeRawPtr::BOTTOM); 1400 result_phi_i_o = new PhiNode(result_region, Type::ABIO); // I/O is used for Prefetch 1401 1402 // We need a Region for the loop-back contended case. 1403 enum { fall_in_path = 1, contended_loopback_path = 2 }; 1404 Node *contended_region; 1405 Node *contended_phi_rawmem; 1406 if (UseTLAB) { 1407 contended_region = toobig_false; 1408 contended_phi_rawmem = mem; 1409 } else { 1410 contended_region = new RegionNode(3); 1411 contended_phi_rawmem = new PhiNode(contended_region, Type::MEMORY, TypeRawPtr::BOTTOM); 1412 // Now handle the passing-too-big test. We fall into the contended 1413 // loop-back merge point. 1414 contended_region ->init_req(fall_in_path, toobig_false); 1415 contended_phi_rawmem->init_req(fall_in_path, mem); 1416 transform_later(contended_region); 1417 transform_later(contended_phi_rawmem); 1418 } 1419 1420 // Load(-locked) the heap top. 1421 // See note above concerning the control input when using a TLAB 1422 Node *old_eden_top = UseTLAB 1423 ? new LoadPNode (ctrl, contended_phi_rawmem, eden_top_adr, TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM, MemNode::unordered) 1424 : new LoadPLockedNode(contended_region, contended_phi_rawmem, eden_top_adr, MemNode::acquire); 1425 1426 transform_later(old_eden_top); 1427 // Add to heap top to get a new heap top 1428 Node *new_eden_top = new AddPNode(top(), old_eden_top, size_in_bytes); 1429 transform_later(new_eden_top); 1430 // Check for needing a GC; compare against heap end 1431 Node *needgc_cmp = new CmpPNode(new_eden_top, eden_end); 1432 transform_later(needgc_cmp); 1433 Node *needgc_bol = new BoolNode(needgc_cmp, BoolTest::ge); 1434 transform_later(needgc_bol); 1435 IfNode *needgc_iff = new IfNode(contended_region, needgc_bol, PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN); 1436 transform_later(needgc_iff); 1437 1438 // Plug the failing-heap-space-need-gc test into the slow-path region 1439 Node *needgc_true = new IfTrueNode(needgc_iff); 1440 transform_later(needgc_true); 1441 if (initial_slow_test) { 1442 slow_region->init_req(need_gc_path, needgc_true); 1443 // This completes all paths into the slow merge point 1444 transform_later(slow_region); 1445 } else { // No initial slow path needed! 1446 // Just fall from the need-GC path straight into the VM call. 1447 slow_region = needgc_true; 1448 } 1449 // No need for a GC. Setup for the Store-Conditional 1450 Node *needgc_false = new IfFalseNode(needgc_iff); 1451 transform_later(needgc_false); 1452 1453 // Grab regular I/O before optional prefetch may change it. 1454 // Slow-path does no I/O so just set it to the original I/O. 1455 result_phi_i_o->init_req(slow_result_path, i_o); 1456 1457 i_o = prefetch_allocation(i_o, needgc_false, contended_phi_rawmem, 1458 old_eden_top, new_eden_top, length); 1459 1460 // Name successful fast-path variables 1461 Node* fast_oop = old_eden_top; 1462 Node* fast_oop_ctrl; 1463 Node* fast_oop_rawmem; 1464 1465 // Store (-conditional) the modified eden top back down. 1466 // StorePConditional produces flags for a test PLUS a modified raw 1467 // memory state. 1468 if (UseTLAB) { 1469 Node* store_eden_top = 1470 new StorePNode(needgc_false, contended_phi_rawmem, eden_top_adr, 1471 TypeRawPtr::BOTTOM, new_eden_top, MemNode::unordered); 1472 transform_later(store_eden_top); 1473 fast_oop_ctrl = needgc_false; // No contention, so this is the fast path 1474 fast_oop_rawmem = store_eden_top; 1475 } else { 1476 Node* store_eden_top = 1477 new StorePConditionalNode(needgc_false, contended_phi_rawmem, eden_top_adr, 1478 new_eden_top, fast_oop/*old_eden_top*/); 1479 transform_later(store_eden_top); 1480 Node *contention_check = new BoolNode(store_eden_top, BoolTest::ne); 1481 transform_later(contention_check); 1482 store_eden_top = new SCMemProjNode(store_eden_top); 1483 transform_later(store_eden_top); 1484 1485 // If not using TLABs, check to see if there was contention. 1486 IfNode *contention_iff = new IfNode (needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN); 1487 transform_later(contention_iff); 1488 Node *contention_true = new IfTrueNode(contention_iff); 1489 transform_later(contention_true); 1490 // If contention, loopback and try again. 1491 contended_region->init_req(contended_loopback_path, contention_true); 1492 contended_phi_rawmem->init_req(contended_loopback_path, store_eden_top); 1493 1494 // Fast-path succeeded with no contention! 1495 Node *contention_false = new IfFalseNode(contention_iff); 1496 transform_later(contention_false); 1497 fast_oop_ctrl = contention_false; 1498 1499 // Bump total allocated bytes for this thread 1500 Node* thread = new ThreadLocalNode(); 1501 transform_later(thread); 1502 Node* alloc_bytes_adr = basic_plus_adr(top()/*not oop*/, thread, 1503 in_bytes(JavaThread::allocated_bytes_offset())); 1504 Node* alloc_bytes = make_load(fast_oop_ctrl, store_eden_top, alloc_bytes_adr, 1505 0, TypeLong::LONG, T_LONG); 1506 #ifdef _LP64 1507 Node* alloc_size = size_in_bytes; 1508 #else 1509 Node* alloc_size = new ConvI2LNode(size_in_bytes); 1510 transform_later(alloc_size); 1511 #endif 1512 Node* new_alloc_bytes = new AddLNode(alloc_bytes, alloc_size); 1513 transform_later(new_alloc_bytes); 1514 fast_oop_rawmem = make_store(fast_oop_ctrl, store_eden_top, alloc_bytes_adr, 1515 0, new_alloc_bytes, T_LONG); 1516 } 1517 1518 InitializeNode* init = alloc->initialization(); 1519 fast_oop_rawmem = initialize_object(alloc, 1520 fast_oop_ctrl, fast_oop_rawmem, fast_oop, 1521 klass_node, length, size_in_bytes); 1522 1523 // If initialization is performed by an array copy, any required 1524 // MemBarStoreStore was already added. If the object does not 1525 // escape no need for a MemBarStoreStore. If the object does not 1526 // escape in its initializer and memory barrier (MemBarStoreStore or 1527 // stronger) is already added at exit of initializer, also no need 1528 // for a MemBarStoreStore. Otherwise we need a MemBarStoreStore 1529 // so that stores that initialize this object can't be reordered 1530 // with a subsequent store that makes this object accessible by 1531 // other threads. 1532 // Other threads include java threads and JVM internal threads 1533 // (for example concurrent GC threads). Current concurrent GC 1534 // implementation: CMS and G1 will not scan newly created object, 1535 // so it's safe to skip storestore barrier when allocation does 1536 // not escape. 1537 if (!alloc->does_not_escape_thread() && 1538 !alloc->is_allocation_MemBar_redundant() && 1539 (init == NULL || !init->is_complete_with_arraycopy())) { 1540 if (init == NULL || init->req() < InitializeNode::RawStores) { 1541 // No InitializeNode or no stores captured by zeroing 1542 // elimination. Simply add the MemBarStoreStore after object 1543 // initialization. 1544 MemBarNode* mb = MemBarNode::make(C, Op_MemBarStoreStore, Compile::AliasIdxBot); 1545 transform_later(mb); 1546 1547 mb->init_req(TypeFunc::Memory, fast_oop_rawmem); 1548 mb->init_req(TypeFunc::Control, fast_oop_ctrl); 1549 fast_oop_ctrl = new ProjNode(mb,TypeFunc::Control); 1550 transform_later(fast_oop_ctrl); 1551 fast_oop_rawmem = new ProjNode(mb,TypeFunc::Memory); 1552 transform_later(fast_oop_rawmem); 1553 } else { 1554 // Add the MemBarStoreStore after the InitializeNode so that 1555 // all stores performing the initialization that were moved 1556 // before the InitializeNode happen before the storestore 1557 // barrier. 1558 1559 Node* init_ctrl = init->proj_out(TypeFunc::Control); 1560 Node* init_mem = init->proj_out(TypeFunc::Memory); 1561 1562 MemBarNode* mb = MemBarNode::make(C, Op_MemBarStoreStore, Compile::AliasIdxBot); 1563 transform_later(mb); 1564 1565 Node* ctrl = new ProjNode(init,TypeFunc::Control); 1566 transform_later(ctrl); 1567 Node* mem = new ProjNode(init,TypeFunc::Memory); 1568 transform_later(mem); 1569 1570 // The MemBarStoreStore depends on control and memory coming 1571 // from the InitializeNode 1572 mb->init_req(TypeFunc::Memory, mem); 1573 mb->init_req(TypeFunc::Control, ctrl); 1574 1575 ctrl = new ProjNode(mb,TypeFunc::Control); 1576 transform_later(ctrl); 1577 mem = new ProjNode(mb,TypeFunc::Memory); 1578 transform_later(mem); 1579 1580 // All nodes that depended on the InitializeNode for control 1581 // and memory must now depend on the MemBarNode that itself 1582 // depends on the InitializeNode 1583 _igvn.replace_node(init_ctrl, ctrl); 1584 _igvn.replace_node(init_mem, mem); 1585 } 1586 } 1587 1588 if (C->env()->dtrace_extended_probes()) { 1589 // Slow-path call 1590 int size = TypeFunc::Parms + 2; 1591 CallLeafNode *call = new CallLeafNode(OptoRuntime::dtrace_object_alloc_Type(), 1592 CAST_FROM_FN_PTR(address, SharedRuntime::dtrace_object_alloc_base), 1593 "dtrace_object_alloc", 1594 TypeRawPtr::BOTTOM); 1595 1596 // Get base of thread-local storage area 1597 Node* thread = new ThreadLocalNode(); 1598 transform_later(thread); 1599 1600 call->init_req(TypeFunc::Parms+0, thread); 1601 call->init_req(TypeFunc::Parms+1, fast_oop); 1602 call->init_req(TypeFunc::Control, fast_oop_ctrl); 1603 call->init_req(TypeFunc::I_O , top()); // does no i/o 1604 call->init_req(TypeFunc::Memory , fast_oop_rawmem); 1605 call->init_req(TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr)); 1606 call->init_req(TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr)); 1607 transform_later(call); 1608 fast_oop_ctrl = new ProjNode(call,TypeFunc::Control); 1609 transform_later(fast_oop_ctrl); 1610 fast_oop_rawmem = new ProjNode(call,TypeFunc::Memory); 1611 transform_later(fast_oop_rawmem); 1612 } 1613 1614 // Plug in the successful fast-path into the result merge point 1615 result_region ->init_req(fast_result_path, fast_oop_ctrl); 1616 result_phi_rawoop->init_req(fast_result_path, fast_oop); 1617 result_phi_i_o ->init_req(fast_result_path, i_o); 1618 result_phi_rawmem->init_req(fast_result_path, fast_oop_rawmem); 1619 } else { 1620 slow_region = ctrl; 1621 result_phi_i_o = i_o; // Rename it to use in the following code. 1622 } 1623 1624 // Generate slow-path call 1625 CallNode *call = new CallStaticJavaNode(slow_call_type, slow_call_address, 1626 OptoRuntime::stub_name(slow_call_address), 1627 alloc->jvms()->bci(), 1628 TypePtr::BOTTOM); 1629 call->init_req( TypeFunc::Control, slow_region ); 1630 call->init_req( TypeFunc::I_O , top() ) ; // does no i/o 1631 call->init_req( TypeFunc::Memory , slow_mem ); // may gc ptrs 1632 call->init_req( TypeFunc::ReturnAdr, alloc->in(TypeFunc::ReturnAdr) ); 1633 call->init_req( TypeFunc::FramePtr, alloc->in(TypeFunc::FramePtr) ); 1634 1635 call->init_req(TypeFunc::Parms+0, klass_node); 1636 if (length != NULL) { 1637 call->init_req(TypeFunc::Parms+1, length); 1638 } 1639 1640 // Copy debug information and adjust JVMState information, then replace 1641 // allocate node with the call 1642 copy_call_debug_info((CallNode *) alloc, call); 1643 if (!always_slow) { 1644 call->set_cnt(PROB_UNLIKELY_MAG(4)); // Same effect as RC_UNCOMMON. 1645 } else { 1646 // Hook i_o projection to avoid its elimination during allocation 1647 // replacement (when only a slow call is generated). 1648 call->set_req(TypeFunc::I_O, result_phi_i_o); 1649 } 1650 _igvn.replace_node(alloc, call); 1651 transform_later(call); 1652 1653 // Identify the output projections from the allocate node and 1654 // adjust any references to them. 1655 // The control and io projections look like: 1656 // 1657 // v---Proj(ctrl) <-----+ v---CatchProj(ctrl) 1658 // Allocate Catch 1659 // ^---Proj(io) <-------+ ^---CatchProj(io) 1660 // 1661 // We are interested in the CatchProj nodes. 1662 // 1663 extract_call_projections(call); 1664 1665 // An allocate node has separate memory projections for the uses on 1666 // the control and i_o paths. Replace the control memory projection with 1667 // result_phi_rawmem (unless we are only generating a slow call when 1668 // both memory projections are combined) 1669 if (!always_slow && _memproj_fallthrough != NULL) { 1670 for (DUIterator_Fast imax, i = _memproj_fallthrough->fast_outs(imax); i < imax; i++) { 1671 Node *use = _memproj_fallthrough->fast_out(i); 1672 _igvn.rehash_node_delayed(use); 1673 imax -= replace_input(use, _memproj_fallthrough, result_phi_rawmem); 1674 // back up iterator 1675 --i; 1676 } 1677 } 1678 // Now change uses of _memproj_catchall to use _memproj_fallthrough and delete 1679 // _memproj_catchall so we end up with a call that has only 1 memory projection. 1680 if (_memproj_catchall != NULL ) { 1681 if (_memproj_fallthrough == NULL) { 1682 _memproj_fallthrough = new ProjNode(call, TypeFunc::Memory); 1683 transform_later(_memproj_fallthrough); 1684 } 1685 for (DUIterator_Fast imax, i = _memproj_catchall->fast_outs(imax); i < imax; i++) { 1686 Node *use = _memproj_catchall->fast_out(i); 1687 _igvn.rehash_node_delayed(use); 1688 imax -= replace_input(use, _memproj_catchall, _memproj_fallthrough); 1689 // back up iterator 1690 --i; 1691 } 1692 assert(_memproj_catchall->outcnt() == 0, "all uses must be deleted"); 1693 _igvn.remove_dead_node(_memproj_catchall); 1694 } 1695 1696 // An allocate node has separate i_o projections for the uses on the control 1697 // and i_o paths. Always replace the control i_o projection with result i_o 1698 // otherwise incoming i_o become dead when only a slow call is generated 1699 // (it is different from memory projections where both projections are 1700 // combined in such case). 1701 if (_ioproj_fallthrough != NULL) { 1702 for (DUIterator_Fast imax, i = _ioproj_fallthrough->fast_outs(imax); i < imax; i++) { 1703 Node *use = _ioproj_fallthrough->fast_out(i); 1704 _igvn.rehash_node_delayed(use); 1705 imax -= replace_input(use, _ioproj_fallthrough, result_phi_i_o); 1706 // back up iterator 1707 --i; 1708 } 1709 } 1710 // Now change uses of _ioproj_catchall to use _ioproj_fallthrough and delete 1711 // _ioproj_catchall so we end up with a call that has only 1 i_o projection. 1712 if (_ioproj_catchall != NULL ) { 1713 if (_ioproj_fallthrough == NULL) { 1714 _ioproj_fallthrough = new ProjNode(call, TypeFunc::I_O); 1715 transform_later(_ioproj_fallthrough); 1716 } 1717 for (DUIterator_Fast imax, i = _ioproj_catchall->fast_outs(imax); i < imax; i++) { 1718 Node *use = _ioproj_catchall->fast_out(i); 1719 _igvn.rehash_node_delayed(use); 1720 imax -= replace_input(use, _ioproj_catchall, _ioproj_fallthrough); 1721 // back up iterator 1722 --i; 1723 } 1724 assert(_ioproj_catchall->outcnt() == 0, "all uses must be deleted"); 1725 _igvn.remove_dead_node(_ioproj_catchall); 1726 } 1727 1728 // if we generated only a slow call, we are done 1729 if (always_slow) { 1730 // Now we can unhook i_o. 1731 if (result_phi_i_o->outcnt() > 1) { 1732 call->set_req(TypeFunc::I_O, top()); 1733 } else { 1734 assert(result_phi_i_o->unique_ctrl_out() == call, ""); 1735 // Case of new array with negative size known during compilation. 1736 // AllocateArrayNode::Ideal() optimization disconnect unreachable 1737 // following code since call to runtime will throw exception. 1738 // As result there will be no users of i_o after the call. 1739 // Leave i_o attached to this call to avoid problems in preceding graph. 1740 } 1741 return; 1742 } 1743 1744 1745 if (_fallthroughcatchproj != NULL) { 1746 ctrl = _fallthroughcatchproj->clone(); 1747 transform_later(ctrl); 1748 _igvn.replace_node(_fallthroughcatchproj, result_region); 1749 } else { 1750 ctrl = top(); 1751 } 1752 Node *slow_result; 1753 if (_resproj == NULL) { 1754 // no uses of the allocation result 1755 slow_result = top(); 1756 } else { 1757 slow_result = _resproj->clone(); 1758 transform_later(slow_result); 1759 _igvn.replace_node(_resproj, result_phi_rawoop); 1760 } 1761 1762 // Plug slow-path into result merge point 1763 result_region ->init_req( slow_result_path, ctrl ); 1764 result_phi_rawoop->init_req( slow_result_path, slow_result); 1765 result_phi_rawmem->init_req( slow_result_path, _memproj_fallthrough ); 1766 transform_later(result_region); 1767 transform_later(result_phi_rawoop); 1768 transform_later(result_phi_rawmem); 1769 transform_later(result_phi_i_o); 1770 // This completes all paths into the result merge point 1771 } 1772 1773 1774 // Helper for PhaseMacroExpand::expand_allocate_common. 1775 // Initializes the newly-allocated storage. 1776 Node* 1777 PhaseMacroExpand::initialize_object(AllocateNode* alloc, 1778 Node* control, Node* rawmem, Node* object, 1779 Node* klass_node, Node* length, 1780 Node* size_in_bytes) { 1781 InitializeNode* init = alloc->initialization(); 1782 // Store the klass & mark bits 1783 Node* mark_node = NULL; 1784 // For now only enable fast locking for non-array types 1785 if (UseBiasedLocking && (length == NULL)) { 1786 mark_node = make_load(control, rawmem, klass_node, in_bytes(Klass::prototype_header_offset()), TypeRawPtr::BOTTOM, T_ADDRESS); 1787 } else { 1788 mark_node = makecon(TypeRawPtr::make((address)markOopDesc::prototype())); 1789 } 1790 rawmem = make_store(control, rawmem, object, oopDesc::mark_offset_in_bytes(), mark_node, T_ADDRESS); 1791 1792 rawmem = make_store(control, rawmem, object, oopDesc::klass_offset_in_bytes(), klass_node, T_METADATA); 1793 int header_size = alloc->minimum_header_size(); // conservatively small 1794 1795 // Array length 1796 if (length != NULL) { // Arrays need length field 1797 rawmem = make_store(control, rawmem, object, arrayOopDesc::length_offset_in_bytes(), length, T_INT); 1798 // conservatively small header size: 1799 header_size = arrayOopDesc::base_offset_in_bytes(T_BYTE); 1800 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass(); 1801 if (k->is_array_klass()) // we know the exact header size in most cases: 1802 header_size = Klass::layout_helper_header_size(k->layout_helper()); 1803 } 1804 1805 // Clear the object body, if necessary. 1806 if (init == NULL) { 1807 // The init has somehow disappeared; be cautious and clear everything. 1808 // 1809 // This can happen if a node is allocated but an uncommon trap occurs 1810 // immediately. In this case, the Initialize gets associated with the 1811 // trap, and may be placed in a different (outer) loop, if the Allocate 1812 // is in a loop. If (this is rare) the inner loop gets unrolled, then 1813 // there can be two Allocates to one Initialize. The answer in all these 1814 // edge cases is safety first. It is always safe to clear immediately 1815 // within an Allocate, and then (maybe or maybe not) clear some more later. 1816 if (!ZeroTLAB) 1817 rawmem = ClearArrayNode::clear_memory(control, rawmem, object, 1818 header_size, size_in_bytes, 1819 &_igvn); 1820 } else { 1821 if (!init->is_complete()) { 1822 // Try to win by zeroing only what the init does not store. 1823 // We can also try to do some peephole optimizations, 1824 // such as combining some adjacent subword stores. 1825 rawmem = init->complete_stores(control, rawmem, object, 1826 header_size, size_in_bytes, &_igvn); 1827 } 1828 // We have no more use for this link, since the AllocateNode goes away: 1829 init->set_req(InitializeNode::RawAddress, top()); 1830 // (If we keep the link, it just confuses the register allocator, 1831 // who thinks he sees a real use of the address by the membar.) 1832 } 1833 1834 return rawmem; 1835 } 1836 1837 // Generate prefetch instructions for next allocations. 1838 Node* PhaseMacroExpand::prefetch_allocation(Node* i_o, Node*& needgc_false, 1839 Node*& contended_phi_rawmem, 1840 Node* old_eden_top, Node* new_eden_top, 1841 Node* length) { 1842 enum { fall_in_path = 1, pf_path = 2 }; 1843 if( UseTLAB && AllocatePrefetchStyle == 2 ) { 1844 // Generate prefetch allocation with watermark check. 1845 // As an allocation hits the watermark, we will prefetch starting 1846 // at a "distance" away from watermark. 1847 1848 Node *pf_region = new RegionNode(3); 1849 Node *pf_phi_rawmem = new PhiNode( pf_region, Type::MEMORY, 1850 TypeRawPtr::BOTTOM ); 1851 // I/O is used for Prefetch 1852 Node *pf_phi_abio = new PhiNode( pf_region, Type::ABIO ); 1853 1854 Node *thread = new ThreadLocalNode(); 1855 transform_later(thread); 1856 1857 Node *eden_pf_adr = new AddPNode( top()/*not oop*/, thread, 1858 _igvn.MakeConX(in_bytes(JavaThread::tlab_pf_top_offset())) ); 1859 transform_later(eden_pf_adr); 1860 1861 Node *old_pf_wm = new LoadPNode(needgc_false, 1862 contended_phi_rawmem, eden_pf_adr, 1863 TypeRawPtr::BOTTOM, TypeRawPtr::BOTTOM, 1864 MemNode::unordered); 1865 transform_later(old_pf_wm); 1866 1867 // check against new_eden_top 1868 Node *need_pf_cmp = new CmpPNode( new_eden_top, old_pf_wm ); 1869 transform_later(need_pf_cmp); 1870 Node *need_pf_bol = new BoolNode( need_pf_cmp, BoolTest::ge ); 1871 transform_later(need_pf_bol); 1872 IfNode *need_pf_iff = new IfNode( needgc_false, need_pf_bol, 1873 PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN ); 1874 transform_later(need_pf_iff); 1875 1876 // true node, add prefetchdistance 1877 Node *need_pf_true = new IfTrueNode( need_pf_iff ); 1878 transform_later(need_pf_true); 1879 1880 Node *need_pf_false = new IfFalseNode( need_pf_iff ); 1881 transform_later(need_pf_false); 1882 1883 Node *new_pf_wmt = new AddPNode( top(), old_pf_wm, 1884 _igvn.MakeConX(AllocatePrefetchDistance) ); 1885 transform_later(new_pf_wmt ); 1886 new_pf_wmt->set_req(0, need_pf_true); 1887 1888 Node *store_new_wmt = new StorePNode(need_pf_true, 1889 contended_phi_rawmem, eden_pf_adr, 1890 TypeRawPtr::BOTTOM, new_pf_wmt, 1891 MemNode::unordered); 1892 transform_later(store_new_wmt); 1893 1894 // adding prefetches 1895 pf_phi_abio->init_req( fall_in_path, i_o ); 1896 1897 Node *prefetch_adr; 1898 Node *prefetch; 1899 uint lines = AllocatePrefetchDistance / AllocatePrefetchStepSize; 1900 uint step_size = AllocatePrefetchStepSize; 1901 uint distance = 0; 1902 1903 for ( uint i = 0; i < lines; i++ ) { 1904 prefetch_adr = new AddPNode( old_pf_wm, new_pf_wmt, 1905 _igvn.MakeConX(distance) ); 1906 transform_later(prefetch_adr); 1907 prefetch = new PrefetchAllocationNode( i_o, prefetch_adr ); 1908 transform_later(prefetch); 1909 distance += step_size; 1910 i_o = prefetch; 1911 } 1912 pf_phi_abio->set_req( pf_path, i_o ); 1913 1914 pf_region->init_req( fall_in_path, need_pf_false ); 1915 pf_region->init_req( pf_path, need_pf_true ); 1916 1917 pf_phi_rawmem->init_req( fall_in_path, contended_phi_rawmem ); 1918 pf_phi_rawmem->init_req( pf_path, store_new_wmt ); 1919 1920 transform_later(pf_region); 1921 transform_later(pf_phi_rawmem); 1922 transform_later(pf_phi_abio); 1923 1924 needgc_false = pf_region; 1925 contended_phi_rawmem = pf_phi_rawmem; 1926 i_o = pf_phi_abio; 1927 } else if( UseTLAB && AllocatePrefetchStyle == 3 ) { 1928 // Insert a prefetch for each allocation. 1929 // This code is used for Sparc with BIS. 1930 Node *pf_region = new RegionNode(3); 1931 Node *pf_phi_rawmem = new PhiNode( pf_region, Type::MEMORY, 1932 TypeRawPtr::BOTTOM ); 1933 transform_later(pf_region); 1934 1935 // Generate several prefetch instructions. 1936 uint lines = (length != NULL) ? AllocatePrefetchLines : AllocateInstancePrefetchLines; 1937 uint step_size = AllocatePrefetchStepSize; 1938 uint distance = AllocatePrefetchDistance; 1939 1940 // Next cache address. 1941 Node *cache_adr = new AddPNode(old_eden_top, old_eden_top, 1942 _igvn.MakeConX(distance)); 1943 transform_later(cache_adr); 1944 cache_adr = new CastP2XNode(needgc_false, cache_adr); 1945 transform_later(cache_adr); 1946 Node* mask = _igvn.MakeConX(~(intptr_t)(step_size-1)); 1947 cache_adr = new AndXNode(cache_adr, mask); 1948 transform_later(cache_adr); 1949 cache_adr = new CastX2PNode(cache_adr); 1950 transform_later(cache_adr); 1951 1952 // Prefetch 1953 Node *prefetch = new PrefetchAllocationNode( contended_phi_rawmem, cache_adr ); 1954 prefetch->set_req(0, needgc_false); 1955 transform_later(prefetch); 1956 contended_phi_rawmem = prefetch; 1957 Node *prefetch_adr; 1958 distance = step_size; 1959 for ( uint i = 1; i < lines; i++ ) { 1960 prefetch_adr = new AddPNode( cache_adr, cache_adr, 1961 _igvn.MakeConX(distance) ); 1962 transform_later(prefetch_adr); 1963 prefetch = new PrefetchAllocationNode( contended_phi_rawmem, prefetch_adr ); 1964 transform_later(prefetch); 1965 distance += step_size; 1966 contended_phi_rawmem = prefetch; 1967 } 1968 } else if( AllocatePrefetchStyle > 0 ) { 1969 // Insert a prefetch for each allocation only on the fast-path 1970 Node *prefetch_adr; 1971 Node *prefetch; 1972 // Generate several prefetch instructions. 1973 uint lines = (length != NULL) ? AllocatePrefetchLines : AllocateInstancePrefetchLines; 1974 uint step_size = AllocatePrefetchStepSize; 1975 uint distance = AllocatePrefetchDistance; 1976 for ( uint i = 0; i < lines; i++ ) { 1977 prefetch_adr = new AddPNode( old_eden_top, new_eden_top, 1978 _igvn.MakeConX(distance) ); 1979 transform_later(prefetch_adr); 1980 prefetch = new PrefetchAllocationNode( i_o, prefetch_adr ); 1981 // Do not let it float too high, since if eden_top == eden_end, 1982 // both might be null. 1983 if( i == 0 ) { // Set control for first prefetch, next follows it 1984 prefetch->init_req(0, needgc_false); 1985 } 1986 transform_later(prefetch); 1987 distance += step_size; 1988 i_o = prefetch; 1989 } 1990 } 1991 return i_o; 1992 } 1993 1994 1995 void PhaseMacroExpand::expand_allocate(AllocateNode *alloc) { 1996 expand_allocate_common(alloc, NULL, 1997 OptoRuntime::new_instance_Type(), 1998 OptoRuntime::new_instance_Java()); 1999 } 2000 2001 void PhaseMacroExpand::expand_allocate_array(AllocateArrayNode *alloc) { 2002 Node* length = alloc->in(AllocateNode::ALength); 2003 InitializeNode* init = alloc->initialization(); 2004 Node* klass_node = alloc->in(AllocateNode::KlassNode); 2005 ciKlass* k = _igvn.type(klass_node)->is_klassptr()->klass(); 2006 address slow_call_address; // Address of slow call 2007 if (init != NULL && init->is_complete_with_arraycopy() && 2008 k->is_type_array_klass()) { 2009 // Don't zero type array during slow allocation in VM since 2010 // it will be initialized later by arraycopy in compiled code. 2011 slow_call_address = OptoRuntime::new_array_nozero_Java(); 2012 } else { 2013 slow_call_address = OptoRuntime::new_array_Java(); 2014 } 2015 expand_allocate_common(alloc, length, 2016 OptoRuntime::new_array_Type(), 2017 slow_call_address); 2018 } 2019 2020 //-------------------mark_eliminated_box---------------------------------- 2021 // 2022 // During EA obj may point to several objects but after few ideal graph 2023 // transformations (CCP) it may point to only one non escaping object 2024 // (but still using phi), corresponding locks and unlocks will be marked 2025 // for elimination. Later obj could be replaced with a new node (new phi) 2026 // and which does not have escape information. And later after some graph 2027 // reshape other locks and unlocks (which were not marked for elimination 2028 // before) are connected to this new obj (phi) but they still will not be 2029 // marked for elimination since new obj has no escape information. 2030 // Mark all associated (same box and obj) lock and unlock nodes for 2031 // elimination if some of them marked already. 2032 void PhaseMacroExpand::mark_eliminated_box(Node* oldbox, Node* obj) { 2033 if (oldbox->as_BoxLock()->is_eliminated()) 2034 return; // This BoxLock node was processed already. 2035 2036 // New implementation (EliminateNestedLocks) has separate BoxLock 2037 // node for each locked region so mark all associated locks/unlocks as 2038 // eliminated even if different objects are referenced in one locked region 2039 // (for example, OSR compilation of nested loop inside locked scope). 2040 if (EliminateNestedLocks || 2041 oldbox->as_BoxLock()->is_simple_lock_region(NULL, obj)) { 2042 // Box is used only in one lock region. Mark this box as eliminated. 2043 _igvn.hash_delete(oldbox); 2044 oldbox->as_BoxLock()->set_eliminated(); // This changes box's hash value 2045 _igvn.hash_insert(oldbox); 2046 2047 for (uint i = 0; i < oldbox->outcnt(); i++) { 2048 Node* u = oldbox->raw_out(i); 2049 if (u->is_AbstractLock() && !u->as_AbstractLock()->is_non_esc_obj()) { 2050 AbstractLockNode* alock = u->as_AbstractLock(); 2051 // Check lock's box since box could be referenced by Lock's debug info. 2052 if (alock->box_node() == oldbox) { 2053 // Mark eliminated all related locks and unlocks. 2054 #ifdef ASSERT 2055 alock->log_lock_optimization(C, "eliminate_lock_set_non_esc4"); 2056 #endif 2057 alock->set_non_esc_obj(); 2058 } 2059 } 2060 } 2061 return; 2062 } 2063 2064 // Create new "eliminated" BoxLock node and use it in monitor debug info 2065 // instead of oldbox for the same object. 2066 BoxLockNode* newbox = oldbox->clone()->as_BoxLock(); 2067 2068 // Note: BoxLock node is marked eliminated only here and it is used 2069 // to indicate that all associated lock and unlock nodes are marked 2070 // for elimination. 2071 newbox->set_eliminated(); 2072 transform_later(newbox); 2073 2074 // Replace old box node with new box for all users of the same object. 2075 for (uint i = 0; i < oldbox->outcnt();) { 2076 bool next_edge = true; 2077 2078 Node* u = oldbox->raw_out(i); 2079 if (u->is_AbstractLock()) { 2080 AbstractLockNode* alock = u->as_AbstractLock(); 2081 if (alock->box_node() == oldbox && alock->obj_node()->eqv_uncast(obj)) { 2082 // Replace Box and mark eliminated all related locks and unlocks. 2083 #ifdef ASSERT 2084 alock->log_lock_optimization(C, "eliminate_lock_set_non_esc5"); 2085 #endif 2086 alock->set_non_esc_obj(); 2087 _igvn.rehash_node_delayed(alock); 2088 alock->set_box_node(newbox); 2089 next_edge = false; 2090 } 2091 } 2092 if (u->is_FastLock() && u->as_FastLock()->obj_node()->eqv_uncast(obj)) { 2093 FastLockNode* flock = u->as_FastLock(); 2094 assert(flock->box_node() == oldbox, "sanity"); 2095 _igvn.rehash_node_delayed(flock); 2096 flock->set_box_node(newbox); 2097 next_edge = false; 2098 } 2099 2100 // Replace old box in monitor debug info. 2101 if (u->is_SafePoint() && u->as_SafePoint()->jvms()) { 2102 SafePointNode* sfn = u->as_SafePoint(); 2103 JVMState* youngest_jvms = sfn->jvms(); 2104 int max_depth = youngest_jvms->depth(); 2105 for (int depth = 1; depth <= max_depth; depth++) { 2106 JVMState* jvms = youngest_jvms->of_depth(depth); 2107 int num_mon = jvms->nof_monitors(); 2108 // Loop over monitors 2109 for (int idx = 0; idx < num_mon; idx++) { 2110 Node* obj_node = sfn->monitor_obj(jvms, idx); 2111 Node* box_node = sfn->monitor_box(jvms, idx); 2112 if (box_node == oldbox && obj_node->eqv_uncast(obj)) { 2113 int j = jvms->monitor_box_offset(idx); 2114 _igvn.replace_input_of(u, j, newbox); 2115 next_edge = false; 2116 } 2117 } 2118 } 2119 } 2120 if (next_edge) i++; 2121 } 2122 } 2123 2124 //-----------------------mark_eliminated_locking_nodes----------------------- 2125 void PhaseMacroExpand::mark_eliminated_locking_nodes(AbstractLockNode *alock) { 2126 if (EliminateNestedLocks) { 2127 if (alock->is_nested()) { 2128 assert(alock->box_node()->as_BoxLock()->is_eliminated(), "sanity"); 2129 return; 2130 } else if (!alock->is_non_esc_obj()) { // Not eliminated or coarsened 2131 // Only Lock node has JVMState needed here. 2132 // Not that preceding claim is documented anywhere else. 2133 if (alock->jvms() != NULL) { 2134 if (alock->as_Lock()->is_nested_lock_region()) { 2135 // Mark eliminated related nested locks and unlocks. 2136 Node* obj = alock->obj_node(); 2137 BoxLockNode* box_node = alock->box_node()->as_BoxLock(); 2138 assert(!box_node->is_eliminated(), "should not be marked yet"); 2139 // Note: BoxLock node is marked eliminated only here 2140 // and it is used to indicate that all associated lock 2141 // and unlock nodes are marked for elimination. 2142 box_node->set_eliminated(); // Box's hash is always NO_HASH here 2143 for (uint i = 0; i < box_node->outcnt(); i++) { 2144 Node* u = box_node->raw_out(i); 2145 if (u->is_AbstractLock()) { 2146 alock = u->as_AbstractLock(); 2147 if (alock->box_node() == box_node) { 2148 // Verify that this Box is referenced only by related locks. 2149 assert(alock->obj_node()->eqv_uncast(obj), ""); 2150 // Mark all related locks and unlocks. 2151 #ifdef ASSERT 2152 alock->log_lock_optimization(C, "eliminate_lock_set_nested"); 2153 #endif 2154 alock->set_nested(); 2155 } 2156 } 2157 } 2158 } else { 2159 #ifdef ASSERT 2160 alock->log_lock_optimization(C, "eliminate_lock_NOT_nested_lock_region"); 2161 if (C->log() != NULL) 2162 alock->as_Lock()->is_nested_lock_region(C); // rerun for debugging output 2163 #endif 2164 } 2165 } 2166 return; 2167 } 2168 // Process locks for non escaping object 2169 assert(alock->is_non_esc_obj(), ""); 2170 } // EliminateNestedLocks 2171 2172 if (alock->is_non_esc_obj()) { // Lock is used for non escaping object 2173 // Look for all locks of this object and mark them and 2174 // corresponding BoxLock nodes as eliminated. 2175 Node* obj = alock->obj_node(); 2176 for (uint j = 0; j < obj->outcnt(); j++) { 2177 Node* o = obj->raw_out(j); 2178 if (o->is_AbstractLock() && 2179 o->as_AbstractLock()->obj_node()->eqv_uncast(obj)) { 2180 alock = o->as_AbstractLock(); 2181 Node* box = alock->box_node(); 2182 // Replace old box node with new eliminated box for all users 2183 // of the same object and mark related locks as eliminated. 2184 mark_eliminated_box(box, obj); 2185 } 2186 } 2187 } 2188 } 2189 2190 // we have determined that this lock/unlock can be eliminated, we simply 2191 // eliminate the node without expanding it. 2192 // 2193 // Note: The membar's associated with the lock/unlock are currently not 2194 // eliminated. This should be investigated as a future enhancement. 2195 // 2196 bool PhaseMacroExpand::eliminate_locking_node(AbstractLockNode *alock) { 2197 2198 if (!alock->is_eliminated()) { 2199 return false; 2200 } 2201 #ifdef ASSERT 2202 if (!alock->is_coarsened()) { 2203 // Check that new "eliminated" BoxLock node is created. 2204 BoxLockNode* oldbox = alock->box_node()->as_BoxLock(); 2205 assert(oldbox->is_eliminated(), "should be done already"); 2206 } 2207 #endif 2208 2209 alock->log_lock_optimization(C, "eliminate_lock"); 2210 2211 #ifndef PRODUCT 2212 if (PrintEliminateLocks) { 2213 if (alock->is_Lock()) { 2214 tty->print_cr("++++ Eliminated: %d Lock", alock->_idx); 2215 } else { 2216 tty->print_cr("++++ Eliminated: %d Unlock", alock->_idx); 2217 } 2218 } 2219 #endif 2220 2221 Node* mem = alock->in(TypeFunc::Memory); 2222 Node* ctrl = alock->in(TypeFunc::Control); 2223 2224 extract_call_projections(alock); 2225 // There are 2 projections from the lock. The lock node will 2226 // be deleted when its last use is subsumed below. 2227 assert(alock->outcnt() == 2 && 2228 _fallthroughproj != NULL && 2229 _memproj_fallthrough != NULL, 2230 "Unexpected projections from Lock/Unlock"); 2231 2232 Node* fallthroughproj = _fallthroughproj; 2233 Node* memproj_fallthrough = _memproj_fallthrough; 2234 2235 // The memory projection from a lock/unlock is RawMem 2236 // The input to a Lock is merged memory, so extract its RawMem input 2237 // (unless the MergeMem has been optimized away.) 2238 if (alock->is_Lock()) { 2239 // Seach for MemBarAcquireLock node and delete it also. 2240 MemBarNode* membar = fallthroughproj->unique_ctrl_out()->as_MemBar(); 2241 assert(membar != NULL && membar->Opcode() == Op_MemBarAcquireLock, ""); 2242 Node* ctrlproj = membar->proj_out(TypeFunc::Control); 2243 Node* memproj = membar->proj_out(TypeFunc::Memory); 2244 _igvn.replace_node(ctrlproj, fallthroughproj); 2245 _igvn.replace_node(memproj, memproj_fallthrough); 2246 2247 // Delete FastLock node also if this Lock node is unique user 2248 // (a loop peeling may clone a Lock node). 2249 Node* flock = alock->as_Lock()->fastlock_node(); 2250 if (flock->outcnt() == 1) { 2251 assert(flock->unique_out() == alock, "sanity"); 2252 _igvn.replace_node(flock, top()); 2253 } 2254 } 2255 2256 // Seach for MemBarReleaseLock node and delete it also. 2257 if (alock->is_Unlock() && ctrl != NULL && ctrl->is_Proj() && 2258 ctrl->in(0)->is_MemBar()) { 2259 MemBarNode* membar = ctrl->in(0)->as_MemBar(); 2260 assert(membar->Opcode() == Op_MemBarReleaseLock && 2261 mem->is_Proj() && membar == mem->in(0), ""); 2262 _igvn.replace_node(fallthroughproj, ctrl); 2263 _igvn.replace_node(memproj_fallthrough, mem); 2264 fallthroughproj = ctrl; 2265 memproj_fallthrough = mem; 2266 ctrl = membar->in(TypeFunc::Control); 2267 mem = membar->in(TypeFunc::Memory); 2268 } 2269 2270 _igvn.replace_node(fallthroughproj, ctrl); 2271 _igvn.replace_node(memproj_fallthrough, mem); 2272 return true; 2273 } 2274 2275 2276 //------------------------------expand_lock_node---------------------- 2277 void PhaseMacroExpand::expand_lock_node(LockNode *lock) { 2278 2279 Node* ctrl = lock->in(TypeFunc::Control); 2280 Node* mem = lock->in(TypeFunc::Memory); 2281 Node* obj = lock->obj_node(); 2282 Node* box = lock->box_node(); 2283 Node* flock = lock->fastlock_node(); 2284 2285 assert(!box->as_BoxLock()->is_eliminated(), "sanity"); 2286 2287 // Make the merge point 2288 Node *region; 2289 Node *mem_phi; 2290 Node *slow_path; 2291 2292 if (UseOptoBiasInlining) { 2293 /* 2294 * See the full description in MacroAssembler::biased_locking_enter(). 2295 * 2296 * if( (mark_word & biased_lock_mask) == biased_lock_pattern ) { 2297 * // The object is biased. 2298 * proto_node = klass->prototype_header; 2299 * o_node = thread | proto_node; 2300 * x_node = o_node ^ mark_word; 2301 * if( (x_node & ~age_mask) == 0 ) { // Biased to the current thread ? 2302 * // Done. 2303 * } else { 2304 * if( (x_node & biased_lock_mask) != 0 ) { 2305 * // The klass's prototype header is no longer biased. 2306 * cas(&mark_word, mark_word, proto_node) 2307 * goto cas_lock; 2308 * } else { 2309 * // The klass's prototype header is still biased. 2310 * if( (x_node & epoch_mask) != 0 ) { // Expired epoch? 2311 * old = mark_word; 2312 * new = o_node; 2313 * } else { 2314 * // Different thread or anonymous biased. 2315 * old = mark_word & (epoch_mask | age_mask | biased_lock_mask); 2316 * new = thread | old; 2317 * } 2318 * // Try to rebias. 2319 * if( cas(&mark_word, old, new) == 0 ) { 2320 * // Done. 2321 * } else { 2322 * goto slow_path; // Failed. 2323 * } 2324 * } 2325 * } 2326 * } else { 2327 * // The object is not biased. 2328 * cas_lock: 2329 * if( FastLock(obj) == 0 ) { 2330 * // Done. 2331 * } else { 2332 * slow_path: 2333 * OptoRuntime::complete_monitor_locking_Java(obj); 2334 * } 2335 * } 2336 */ 2337 2338 region = new RegionNode(5); 2339 // create a Phi for the memory state 2340 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM); 2341 2342 Node* fast_lock_region = new RegionNode(3); 2343 Node* fast_lock_mem_phi = new PhiNode( fast_lock_region, Type::MEMORY, TypeRawPtr::BOTTOM); 2344 2345 // First, check mark word for the biased lock pattern. 2346 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type()); 2347 2348 // Get fast path - mark word has the biased lock pattern. 2349 ctrl = opt_bits_test(ctrl, fast_lock_region, 1, mark_node, 2350 markOopDesc::biased_lock_mask_in_place, 2351 markOopDesc::biased_lock_pattern, true); 2352 // fast_lock_region->in(1) is set to slow path. 2353 fast_lock_mem_phi->init_req(1, mem); 2354 2355 // Now check that the lock is biased to the current thread and has 2356 // the same epoch and bias as Klass::_prototype_header. 2357 2358 // Special-case a fresh allocation to avoid building nodes: 2359 Node* klass_node = AllocateNode::Ideal_klass(obj, &_igvn); 2360 if (klass_node == NULL) { 2361 Node* k_adr = basic_plus_adr(obj, oopDesc::klass_offset_in_bytes()); 2362 klass_node = transform_later(LoadKlassNode::make(_igvn, NULL, mem, k_adr, _igvn.type(k_adr)->is_ptr())); 2363 #ifdef _LP64 2364 if (UseCompressedClassPointers && klass_node->is_DecodeNKlass()) { 2365 assert(klass_node->in(1)->Opcode() == Op_LoadNKlass, "sanity"); 2366 klass_node->in(1)->init_req(0, ctrl); 2367 } else 2368 #endif 2369 klass_node->init_req(0, ctrl); 2370 } 2371 Node *proto_node = make_load(ctrl, mem, klass_node, in_bytes(Klass::prototype_header_offset()), TypeX_X, TypeX_X->basic_type()); 2372 2373 Node* thread = transform_later(new ThreadLocalNode()); 2374 Node* cast_thread = transform_later(new CastP2XNode(ctrl, thread)); 2375 Node* o_node = transform_later(new OrXNode(cast_thread, proto_node)); 2376 Node* x_node = transform_later(new XorXNode(o_node, mark_node)); 2377 2378 // Get slow path - mark word does NOT match the value. 2379 Node* not_biased_ctrl = opt_bits_test(ctrl, region, 3, x_node, 2380 (~markOopDesc::age_mask_in_place), 0); 2381 // region->in(3) is set to fast path - the object is biased to the current thread. 2382 mem_phi->init_req(3, mem); 2383 2384 2385 // Mark word does NOT match the value (thread | Klass::_prototype_header). 2386 2387 2388 // First, check biased pattern. 2389 // Get fast path - _prototype_header has the same biased lock pattern. 2390 ctrl = opt_bits_test(not_biased_ctrl, fast_lock_region, 2, x_node, 2391 markOopDesc::biased_lock_mask_in_place, 0, true); 2392 2393 not_biased_ctrl = fast_lock_region->in(2); // Slow path 2394 // fast_lock_region->in(2) - the prototype header is no longer biased 2395 // and we have to revoke the bias on this object. 2396 // We are going to try to reset the mark of this object to the prototype 2397 // value and fall through to the CAS-based locking scheme. 2398 Node* adr = basic_plus_adr(obj, oopDesc::mark_offset_in_bytes()); 2399 Node* cas = new StoreXConditionalNode(not_biased_ctrl, mem, adr, 2400 proto_node, mark_node); 2401 transform_later(cas); 2402 Node* proj = transform_later(new SCMemProjNode(cas)); 2403 fast_lock_mem_phi->init_req(2, proj); 2404 2405 2406 // Second, check epoch bits. 2407 Node* rebiased_region = new RegionNode(3); 2408 Node* old_phi = new PhiNode( rebiased_region, TypeX_X); 2409 Node* new_phi = new PhiNode( rebiased_region, TypeX_X); 2410 2411 // Get slow path - mark word does NOT match epoch bits. 2412 Node* epoch_ctrl = opt_bits_test(ctrl, rebiased_region, 1, x_node, 2413 markOopDesc::epoch_mask_in_place, 0); 2414 // The epoch of the current bias is not valid, attempt to rebias the object 2415 // toward the current thread. 2416 rebiased_region->init_req(2, epoch_ctrl); 2417 old_phi->init_req(2, mark_node); 2418 new_phi->init_req(2, o_node); 2419 2420 // rebiased_region->in(1) is set to fast path. 2421 // The epoch of the current bias is still valid but we know 2422 // nothing about the owner; it might be set or it might be clear. 2423 Node* cmask = MakeConX(markOopDesc::biased_lock_mask_in_place | 2424 markOopDesc::age_mask_in_place | 2425 markOopDesc::epoch_mask_in_place); 2426 Node* old = transform_later(new AndXNode(mark_node, cmask)); 2427 cast_thread = transform_later(new CastP2XNode(ctrl, thread)); 2428 Node* new_mark = transform_later(new OrXNode(cast_thread, old)); 2429 old_phi->init_req(1, old); 2430 new_phi->init_req(1, new_mark); 2431 2432 transform_later(rebiased_region); 2433 transform_later(old_phi); 2434 transform_later(new_phi); 2435 2436 // Try to acquire the bias of the object using an atomic operation. 2437 // If this fails we will go in to the runtime to revoke the object's bias. 2438 cas = new StoreXConditionalNode(rebiased_region, mem, adr, new_phi, old_phi); 2439 transform_later(cas); 2440 proj = transform_later(new SCMemProjNode(cas)); 2441 2442 // Get slow path - Failed to CAS. 2443 not_biased_ctrl = opt_bits_test(rebiased_region, region, 4, cas, 0, 0); 2444 mem_phi->init_req(4, proj); 2445 // region->in(4) is set to fast path - the object is rebiased to the current thread. 2446 2447 // Failed to CAS. 2448 slow_path = new RegionNode(3); 2449 Node *slow_mem = new PhiNode( slow_path, Type::MEMORY, TypeRawPtr::BOTTOM); 2450 2451 slow_path->init_req(1, not_biased_ctrl); // Capture slow-control 2452 slow_mem->init_req(1, proj); 2453 2454 // Call CAS-based locking scheme (FastLock node). 2455 2456 transform_later(fast_lock_region); 2457 transform_later(fast_lock_mem_phi); 2458 2459 // Get slow path - FastLock failed to lock the object. 2460 ctrl = opt_bits_test(fast_lock_region, region, 2, flock, 0, 0); 2461 mem_phi->init_req(2, fast_lock_mem_phi); 2462 // region->in(2) is set to fast path - the object is locked to the current thread. 2463 2464 slow_path->init_req(2, ctrl); // Capture slow-control 2465 slow_mem->init_req(2, fast_lock_mem_phi); 2466 2467 transform_later(slow_path); 2468 transform_later(slow_mem); 2469 // Reset lock's memory edge. 2470 lock->set_req(TypeFunc::Memory, slow_mem); 2471 2472 } else { 2473 region = new RegionNode(3); 2474 // create a Phi for the memory state 2475 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM); 2476 2477 // Optimize test; set region slot 2 2478 slow_path = opt_bits_test(ctrl, region, 2, flock, 0, 0); 2479 mem_phi->init_req(2, mem); 2480 } 2481 2482 // Make slow path call 2483 CallNode *call = make_slow_call((CallNode *) lock, OptoRuntime::complete_monitor_enter_Type(), 2484 OptoRuntime::complete_monitor_locking_Java(), NULL, slow_path, 2485 obj, box, NULL); 2486 2487 extract_call_projections(call); 2488 2489 // Slow path can only throw asynchronous exceptions, which are always 2490 // de-opted. So the compiler thinks the slow-call can never throw an 2491 // exception. If it DOES throw an exception we would need the debug 2492 // info removed first (since if it throws there is no monitor). 2493 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL && 2494 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock"); 2495 2496 // Capture slow path 2497 // disconnect fall-through projection from call and create a new one 2498 // hook up users of fall-through projection to region 2499 Node *slow_ctrl = _fallthroughproj->clone(); 2500 transform_later(slow_ctrl); 2501 _igvn.hash_delete(_fallthroughproj); 2502 _fallthroughproj->disconnect_inputs(NULL, C); 2503 region->init_req(1, slow_ctrl); 2504 // region inputs are now complete 2505 transform_later(region); 2506 _igvn.replace_node(_fallthroughproj, region); 2507 2508 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory)); 2509 mem_phi->init_req(1, memproj ); 2510 transform_later(mem_phi); 2511 _igvn.replace_node(_memproj_fallthrough, mem_phi); 2512 } 2513 2514 //------------------------------expand_unlock_node---------------------- 2515 void PhaseMacroExpand::expand_unlock_node(UnlockNode *unlock) { 2516 2517 Node* ctrl = unlock->in(TypeFunc::Control); 2518 Node* mem = unlock->in(TypeFunc::Memory); 2519 Node* obj = unlock->obj_node(); 2520 Node* box = unlock->box_node(); 2521 2522 assert(!box->as_BoxLock()->is_eliminated(), "sanity"); 2523 2524 // No need for a null check on unlock 2525 2526 // Make the merge point 2527 Node *region; 2528 Node *mem_phi; 2529 2530 if (UseOptoBiasInlining) { 2531 // Check for biased locking unlock case, which is a no-op. 2532 // See the full description in MacroAssembler::biased_locking_exit(). 2533 region = new RegionNode(4); 2534 // create a Phi for the memory state 2535 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM); 2536 mem_phi->init_req(3, mem); 2537 2538 Node* mark_node = make_load(ctrl, mem, obj, oopDesc::mark_offset_in_bytes(), TypeX_X, TypeX_X->basic_type()); 2539 ctrl = opt_bits_test(ctrl, region, 3, mark_node, 2540 markOopDesc::biased_lock_mask_in_place, 2541 markOopDesc::biased_lock_pattern); 2542 } else { 2543 region = new RegionNode(3); 2544 // create a Phi for the memory state 2545 mem_phi = new PhiNode( region, Type::MEMORY, TypeRawPtr::BOTTOM); 2546 } 2547 2548 FastUnlockNode *funlock = new FastUnlockNode( ctrl, obj, box ); 2549 funlock = transform_later( funlock )->as_FastUnlock(); 2550 // Optimize test; set region slot 2 2551 Node *slow_path = opt_bits_test(ctrl, region, 2, funlock, 0, 0); 2552 Node *thread = transform_later(new ThreadLocalNode()); 2553 2554 CallNode *call = make_slow_call((CallNode *) unlock, OptoRuntime::complete_monitor_exit_Type(), 2555 CAST_FROM_FN_PTR(address, SharedRuntime::complete_monitor_unlocking_C), 2556 "complete_monitor_unlocking_C", slow_path, obj, box, thread); 2557 2558 extract_call_projections(call); 2559 2560 assert ( _ioproj_fallthrough == NULL && _ioproj_catchall == NULL && 2561 _memproj_catchall == NULL && _catchallcatchproj == NULL, "Unexpected projection from Lock"); 2562 2563 // No exceptions for unlocking 2564 // Capture slow path 2565 // disconnect fall-through projection from call and create a new one 2566 // hook up users of fall-through projection to region 2567 Node *slow_ctrl = _fallthroughproj->clone(); 2568 transform_later(slow_ctrl); 2569 _igvn.hash_delete(_fallthroughproj); 2570 _fallthroughproj->disconnect_inputs(NULL, C); 2571 region->init_req(1, slow_ctrl); 2572 // region inputs are now complete 2573 transform_later(region); 2574 _igvn.replace_node(_fallthroughproj, region); 2575 2576 Node *memproj = transform_later(new ProjNode(call, TypeFunc::Memory) ); 2577 mem_phi->init_req(1, memproj ); 2578 mem_phi->init_req(2, mem); 2579 transform_later(mem_phi); 2580 _igvn.replace_node(_memproj_fallthrough, mem_phi); 2581 } 2582 2583 //---------------------------eliminate_macro_nodes---------------------- 2584 // Eliminate scalar replaced allocations and associated locks. 2585 void PhaseMacroExpand::eliminate_macro_nodes() { 2586 if (C->macro_count() == 0) 2587 return; 2588 2589 // First, attempt to eliminate locks 2590 int cnt = C->macro_count(); 2591 for (int i=0; i < cnt; i++) { 2592 Node *n = C->macro_node(i); 2593 if (n->is_AbstractLock()) { // Lock and Unlock nodes 2594 // Before elimination mark all associated (same box and obj) 2595 // lock and unlock nodes. 2596 mark_eliminated_locking_nodes(n->as_AbstractLock()); 2597 } 2598 } 2599 bool progress = true; 2600 while (progress) { 2601 progress = false; 2602 for (int i = C->macro_count(); i > 0; i--) { 2603 Node * n = C->macro_node(i-1); 2604 bool success = false; 2605 debug_only(int old_macro_count = C->macro_count();); 2606 if (n->is_AbstractLock()) { 2607 success = eliminate_locking_node(n->as_AbstractLock()); 2608 } 2609 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count"); 2610 progress = progress || success; 2611 } 2612 } 2613 // Next, attempt to eliminate allocations 2614 _has_locks = false; 2615 progress = true; 2616 while (progress) { 2617 progress = false; 2618 for (int i = C->macro_count(); i > 0; i--) { 2619 Node * n = C->macro_node(i-1); 2620 bool success = false; 2621 debug_only(int old_macro_count = C->macro_count();); 2622 switch (n->class_id()) { 2623 case Node::Class_Allocate: 2624 case Node::Class_AllocateArray: 2625 success = eliminate_allocate_node(n->as_Allocate()); 2626 break; 2627 case Node::Class_CallStaticJava: 2628 success = eliminate_boxing_node(n->as_CallStaticJava()); 2629 break; 2630 case Node::Class_Lock: 2631 case Node::Class_Unlock: 2632 assert(!n->as_AbstractLock()->is_eliminated(), "sanity"); 2633 _has_locks = true; 2634 break; 2635 case Node::Class_ArrayCopy: 2636 break; 2637 default: 2638 assert(n->Opcode() == Op_LoopLimit || 2639 n->Opcode() == Op_Opaque1 || 2640 n->Opcode() == Op_Opaque2 || 2641 n->Opcode() == Op_Opaque3, "unknown node type in macro list"); 2642 } 2643 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count"); 2644 progress = progress || success; 2645 } 2646 } 2647 } 2648 2649 //------------------------------expand_macro_nodes---------------------- 2650 // Returns true if a failure occurred. 2651 bool PhaseMacroExpand::expand_macro_nodes() { 2652 // Last attempt to eliminate macro nodes. 2653 eliminate_macro_nodes(); 2654 2655 // Make sure expansion will not cause node limit to be exceeded. 2656 // Worst case is a macro node gets expanded into about 50 nodes. 2657 // Allow 50% more for optimization. 2658 if (C->check_node_count(C->macro_count() * 75, "out of nodes before macro expansion" ) ) 2659 return true; 2660 2661 // Eliminate Opaque and LoopLimit nodes. Do it after all loop optimizations. 2662 bool progress = true; 2663 while (progress) { 2664 progress = false; 2665 for (int i = C->macro_count(); i > 0; i--) { 2666 Node * n = C->macro_node(i-1); 2667 bool success = false; 2668 debug_only(int old_macro_count = C->macro_count();); 2669 if (n->Opcode() == Op_LoopLimit) { 2670 // Remove it from macro list and put on IGVN worklist to optimize. 2671 C->remove_macro_node(n); 2672 _igvn._worklist.push(n); 2673 success = true; 2674 } else if (n->Opcode() == Op_CallStaticJava) { 2675 // Remove it from macro list and put on IGVN worklist to optimize. 2676 C->remove_macro_node(n); 2677 _igvn._worklist.push(n); 2678 success = true; 2679 } else if (n->Opcode() == Op_Opaque1 || n->Opcode() == Op_Opaque2) { 2680 _igvn.replace_node(n, n->in(1)); 2681 success = true; 2682 #if INCLUDE_RTM_OPT 2683 } else if ((n->Opcode() == Op_Opaque3) && ((Opaque3Node*)n)->rtm_opt()) { 2684 assert(C->profile_rtm(), "should be used only in rtm deoptimization code"); 2685 assert((n->outcnt() == 1) && n->unique_out()->is_Cmp(), ""); 2686 Node* cmp = n->unique_out(); 2687 #ifdef ASSERT 2688 // Validate graph. 2689 assert((cmp->outcnt() == 1) && cmp->unique_out()->is_Bool(), ""); 2690 BoolNode* bol = cmp->unique_out()->as_Bool(); 2691 assert((bol->outcnt() == 1) && bol->unique_out()->is_If() && 2692 (bol->_test._test == BoolTest::ne), ""); 2693 IfNode* ifn = bol->unique_out()->as_If(); 2694 assert((ifn->outcnt() == 2) && 2695 ifn->proj_out(1)->is_uncommon_trap_proj(Deoptimization::Reason_rtm_state_change) != NULL, ""); 2696 #endif 2697 Node* repl = n->in(1); 2698 if (!_has_locks) { 2699 // Remove RTM state check if there are no locks in the code. 2700 // Replace input to compare the same value. 2701 repl = (cmp->in(1) == n) ? cmp->in(2) : cmp->in(1); 2702 } 2703 _igvn.replace_node(n, repl); 2704 success = true; 2705 #endif 2706 } 2707 assert(success == (C->macro_count() < old_macro_count), "elimination reduces macro count"); 2708 progress = progress || success; 2709 } 2710 } 2711 2712 // expand arraycopy "macro" nodes first 2713 // For ReduceBulkZeroing, we must first process all arraycopy nodes 2714 // before the allocate nodes are expanded. 2715 int macro_idx = C->macro_count() - 1; 2716 while (macro_idx >= 0) { 2717 Node * n = C->macro_node(macro_idx); 2718 assert(n->is_macro(), "only macro nodes expected here"); 2719 if (_igvn.type(n) == Type::TOP || n->in(0)->is_top() ) { 2720 // node is unreachable, so don't try to expand it 2721 C->remove_macro_node(n); 2722 } else if (n->is_ArrayCopy()){ 2723 int macro_count = C->macro_count(); 2724 expand_arraycopy_node(n->as_ArrayCopy()); 2725 assert(C->macro_count() < macro_count, "must have deleted a node from macro list"); 2726 } 2727 if (C->failing()) return true; 2728 macro_idx --; 2729 } 2730 2731 // expand "macro" nodes 2732 // nodes are removed from the macro list as they are processed 2733 while (C->macro_count() > 0) { 2734 int macro_count = C->macro_count(); 2735 Node * n = C->macro_node(macro_count-1); 2736 assert(n->is_macro(), "only macro nodes expected here"); 2737 if (_igvn.type(n) == Type::TOP || n->in(0)->is_top() ) { 2738 // node is unreachable, so don't try to expand it 2739 C->remove_macro_node(n); 2740 continue; 2741 } 2742 switch (n->class_id()) { 2743 case Node::Class_Allocate: 2744 expand_allocate(n->as_Allocate()); 2745 break; 2746 case Node::Class_AllocateArray: 2747 expand_allocate_array(n->as_AllocateArray()); 2748 break; 2749 case Node::Class_Lock: 2750 expand_lock_node(n->as_Lock()); 2751 break; 2752 case Node::Class_Unlock: 2753 expand_unlock_node(n->as_Unlock()); 2754 break; 2755 default: 2756 assert(false, "unknown node type in macro list"); 2757 } 2758 assert(C->macro_count() < macro_count, "must have deleted a node from macro list"); 2759 if (C->failing()) return true; 2760 } 2761 2762 _igvn.set_delay_transform(false); 2763 _igvn.optimize(); 2764 if (C->failing()) return true; 2765 return false; 2766 }