matcher.cpp revision 647:bd441136a5ce
1/* 2 * Copyright 1997-2009 Sun Microsystems, Inc. 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 Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, 20 * CA 95054 USA or visit www.sun.com if you need additional information or 21 * have any questions. 22 * 23 */ 24 25#include "incls/_precompiled.incl" 26#include "incls/_matcher.cpp.incl" 27 28OptoReg::Name OptoReg::c_frame_pointer; 29 30 31 32const int Matcher::base2reg[Type::lastype] = { 33 Node::NotAMachineReg,0,0, Op_RegI, Op_RegL, 0, Op_RegN, 34 Node::NotAMachineReg, Node::NotAMachineReg, /* tuple, array */ 35 Op_RegP, Op_RegP, Op_RegP, Op_RegP, Op_RegP, Op_RegP, /* the pointers */ 36 0, 0/*abio*/, 37 Op_RegP /* Return address */, 0, /* the memories */ 38 Op_RegF, Op_RegF, Op_RegF, Op_RegD, Op_RegD, Op_RegD, 39 0 /*bottom*/ 40}; 41 42const RegMask *Matcher::idealreg2regmask[_last_machine_leaf]; 43RegMask Matcher::mreg2regmask[_last_Mach_Reg]; 44RegMask Matcher::STACK_ONLY_mask; 45RegMask Matcher::c_frame_ptr_mask; 46const uint Matcher::_begin_rematerialize = _BEGIN_REMATERIALIZE; 47const uint Matcher::_end_rematerialize = _END_REMATERIALIZE; 48 49//---------------------------Matcher------------------------------------------- 50Matcher::Matcher( Node_List &proj_list ) : 51 PhaseTransform( Phase::Ins_Select ), 52#ifdef ASSERT 53 _old2new_map(C->comp_arena()), 54 _new2old_map(C->comp_arena()), 55#endif 56 _shared_nodes(C->comp_arena()), 57 _reduceOp(reduceOp), _leftOp(leftOp), _rightOp(rightOp), 58 _swallowed(swallowed), 59 _begin_inst_chain_rule(_BEGIN_INST_CHAIN_RULE), 60 _end_inst_chain_rule(_END_INST_CHAIN_RULE), 61 _must_clone(must_clone), _proj_list(proj_list), 62 _register_save_policy(register_save_policy), 63 _c_reg_save_policy(c_reg_save_policy), 64 _register_save_type(register_save_type), 65 _ruleName(ruleName), 66 _allocation_started(false), 67 _states_arena(Chunk::medium_size), 68 _visited(&_states_arena), 69 _shared(&_states_arena), 70 _dontcare(&_states_arena) { 71 C->set_matcher(this); 72 73 idealreg2spillmask[Op_RegI] = NULL; 74 idealreg2spillmask[Op_RegN] = NULL; 75 idealreg2spillmask[Op_RegL] = NULL; 76 idealreg2spillmask[Op_RegF] = NULL; 77 idealreg2spillmask[Op_RegD] = NULL; 78 idealreg2spillmask[Op_RegP] = NULL; 79 80 idealreg2debugmask[Op_RegI] = NULL; 81 idealreg2debugmask[Op_RegN] = NULL; 82 idealreg2debugmask[Op_RegL] = NULL; 83 idealreg2debugmask[Op_RegF] = NULL; 84 idealreg2debugmask[Op_RegD] = NULL; 85 idealreg2debugmask[Op_RegP] = NULL; 86 debug_only(_mem_node = NULL;) // Ideal memory node consumed by mach node 87} 88 89//------------------------------warp_incoming_stk_arg------------------------ 90// This warps a VMReg into an OptoReg::Name 91OptoReg::Name Matcher::warp_incoming_stk_arg( VMReg reg ) { 92 OptoReg::Name warped; 93 if( reg->is_stack() ) { // Stack slot argument? 94 warped = OptoReg::add(_old_SP, reg->reg2stack() ); 95 warped = OptoReg::add(warped, C->out_preserve_stack_slots()); 96 if( warped >= _in_arg_limit ) 97 _in_arg_limit = OptoReg::add(warped, 1); // Bump max stack slot seen 98 if (!RegMask::can_represent(warped)) { 99 // the compiler cannot represent this method's calling sequence 100 C->record_method_not_compilable_all_tiers("unsupported incoming calling sequence"); 101 return OptoReg::Bad; 102 } 103 return warped; 104 } 105 return OptoReg::as_OptoReg(reg); 106} 107 108//---------------------------compute_old_SP------------------------------------ 109OptoReg::Name Compile::compute_old_SP() { 110 int fixed = fixed_slots(); 111 int preserve = in_preserve_stack_slots(); 112 return OptoReg::stack2reg(round_to(fixed + preserve, Matcher::stack_alignment_in_slots())); 113} 114 115 116 117#ifdef ASSERT 118void Matcher::verify_new_nodes_only(Node* xroot) { 119 // Make sure that the new graph only references new nodes 120 ResourceMark rm; 121 Unique_Node_List worklist; 122 VectorSet visited(Thread::current()->resource_area()); 123 worklist.push(xroot); 124 while (worklist.size() > 0) { 125 Node* n = worklist.pop(); 126 visited <<= n->_idx; 127 assert(C->node_arena()->contains(n), "dead node"); 128 for (uint j = 0; j < n->req(); j++) { 129 Node* in = n->in(j); 130 if (in != NULL) { 131 assert(C->node_arena()->contains(in), "dead node"); 132 if (!visited.test(in->_idx)) { 133 worklist.push(in); 134 } 135 } 136 } 137 } 138} 139#endif 140 141 142//---------------------------match--------------------------------------------- 143void Matcher::match( ) { 144 // One-time initialization of some register masks. 145 init_spill_mask( C->root()->in(1) ); 146 _return_addr_mask = return_addr(); 147#ifdef _LP64 148 // Pointers take 2 slots in 64-bit land 149 _return_addr_mask.Insert(OptoReg::add(return_addr(),1)); 150#endif 151 152 // Map a Java-signature return type into return register-value 153 // machine registers for 0, 1 and 2 returned values. 154 const TypeTuple *range = C->tf()->range(); 155 if( range->cnt() > TypeFunc::Parms ) { // If not a void function 156 // Get ideal-register return type 157 int ireg = base2reg[range->field_at(TypeFunc::Parms)->base()]; 158 // Get machine return register 159 uint sop = C->start()->Opcode(); 160 OptoRegPair regs = return_value(ireg, false); 161 162 // And mask for same 163 _return_value_mask = RegMask(regs.first()); 164 if( OptoReg::is_valid(regs.second()) ) 165 _return_value_mask.Insert(regs.second()); 166 } 167 168 // --------------- 169 // Frame Layout 170 171 // Need the method signature to determine the incoming argument types, 172 // because the types determine which registers the incoming arguments are 173 // in, and this affects the matched code. 174 const TypeTuple *domain = C->tf()->domain(); 175 uint argcnt = domain->cnt() - TypeFunc::Parms; 176 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, argcnt ); 177 VMRegPair *vm_parm_regs = NEW_RESOURCE_ARRAY( VMRegPair, argcnt ); 178 _parm_regs = NEW_RESOURCE_ARRAY( OptoRegPair, argcnt ); 179 _calling_convention_mask = NEW_RESOURCE_ARRAY( RegMask, argcnt ); 180 uint i; 181 for( i = 0; i<argcnt; i++ ) { 182 sig_bt[i] = domain->field_at(i+TypeFunc::Parms)->basic_type(); 183 } 184 185 // Pass array of ideal registers and length to USER code (from the AD file) 186 // that will convert this to an array of register numbers. 187 const StartNode *start = C->start(); 188 start->calling_convention( sig_bt, vm_parm_regs, argcnt ); 189#ifdef ASSERT 190 // Sanity check users' calling convention. Real handy while trying to 191 // get the initial port correct. 192 { for (uint i = 0; i<argcnt; i++) { 193 if( !vm_parm_regs[i].first()->is_valid() && !vm_parm_regs[i].second()->is_valid() ) { 194 assert(domain->field_at(i+TypeFunc::Parms)==Type::HALF, "only allowed on halve" ); 195 _parm_regs[i].set_bad(); 196 continue; 197 } 198 VMReg parm_reg = vm_parm_regs[i].first(); 199 assert(parm_reg->is_valid(), "invalid arg?"); 200 if (parm_reg->is_reg()) { 201 OptoReg::Name opto_parm_reg = OptoReg::as_OptoReg(parm_reg); 202 assert(can_be_java_arg(opto_parm_reg) || 203 C->stub_function() == CAST_FROM_FN_PTR(address, OptoRuntime::rethrow_C) || 204 opto_parm_reg == inline_cache_reg(), 205 "parameters in register must be preserved by runtime stubs"); 206 } 207 for (uint j = 0; j < i; j++) { 208 assert(parm_reg != vm_parm_regs[j].first(), 209 "calling conv. must produce distinct regs"); 210 } 211 } 212 } 213#endif 214 215 // Do some initial frame layout. 216 217 // Compute the old incoming SP (may be called FP) as 218 // OptoReg::stack0() + locks + in_preserve_stack_slots + pad2. 219 _old_SP = C->compute_old_SP(); 220 assert( is_even(_old_SP), "must be even" ); 221 222 // Compute highest incoming stack argument as 223 // _old_SP + out_preserve_stack_slots + incoming argument size. 224 _in_arg_limit = OptoReg::add(_old_SP, C->out_preserve_stack_slots()); 225 assert( is_even(_in_arg_limit), "out_preserve must be even" ); 226 for( i = 0; i < argcnt; i++ ) { 227 // Permit args to have no register 228 _calling_convention_mask[i].Clear(); 229 if( !vm_parm_regs[i].first()->is_valid() && !vm_parm_regs[i].second()->is_valid() ) { 230 continue; 231 } 232 // calling_convention returns stack arguments as a count of 233 // slots beyond OptoReg::stack0()/VMRegImpl::stack0. We need to convert this to 234 // the allocators point of view, taking into account all the 235 // preserve area, locks & pad2. 236 237 OptoReg::Name reg1 = warp_incoming_stk_arg(vm_parm_regs[i].first()); 238 if( OptoReg::is_valid(reg1)) 239 _calling_convention_mask[i].Insert(reg1); 240 241 OptoReg::Name reg2 = warp_incoming_stk_arg(vm_parm_regs[i].second()); 242 if( OptoReg::is_valid(reg2)) 243 _calling_convention_mask[i].Insert(reg2); 244 245 // Saved biased stack-slot register number 246 _parm_regs[i].set_pair(reg2, reg1); 247 } 248 249 // Finally, make sure the incoming arguments take up an even number of 250 // words, in case the arguments or locals need to contain doubleword stack 251 // slots. The rest of the system assumes that stack slot pairs (in 252 // particular, in the spill area) which look aligned will in fact be 253 // aligned relative to the stack pointer in the target machine. Double 254 // stack slots will always be allocated aligned. 255 _new_SP = OptoReg::Name(round_to(_in_arg_limit, RegMask::SlotsPerLong)); 256 257 // Compute highest outgoing stack argument as 258 // _new_SP + out_preserve_stack_slots + max(outgoing argument size). 259 _out_arg_limit = OptoReg::add(_new_SP, C->out_preserve_stack_slots()); 260 assert( is_even(_out_arg_limit), "out_preserve must be even" ); 261 262 if (!RegMask::can_represent(OptoReg::add(_out_arg_limit,-1))) { 263 // the compiler cannot represent this method's calling sequence 264 C->record_method_not_compilable("must be able to represent all call arguments in reg mask"); 265 } 266 267 if (C->failing()) return; // bailed out on incoming arg failure 268 269 // --------------- 270 // Collect roots of matcher trees. Every node for which 271 // _shared[_idx] is cleared is guaranteed to not be shared, and thus 272 // can be a valid interior of some tree. 273 find_shared( C->root() ); 274 find_shared( C->top() ); 275 276 C->print_method("Before Matching"); 277 278 // Swap out to old-space; emptying new-space 279 Arena *old = C->node_arena()->move_contents(C->old_arena()); 280 281 // Save debug and profile information for nodes in old space: 282 _old_node_note_array = C->node_note_array(); 283 if (_old_node_note_array != NULL) { 284 C->set_node_note_array(new(C->comp_arena()) GrowableArray<Node_Notes*> 285 (C->comp_arena(), _old_node_note_array->length(), 286 0, NULL)); 287 } 288 289 // Pre-size the new_node table to avoid the need for range checks. 290 grow_new_node_array(C->unique()); 291 292 // Reset node counter so MachNodes start with _idx at 0 293 int nodes = C->unique(); // save value 294 C->set_unique(0); 295 296 // Recursively match trees from old space into new space. 297 // Correct leaves of new-space Nodes; they point to old-space. 298 _visited.Clear(); // Clear visit bits for xform call 299 C->set_cached_top_node(xform( C->top(), nodes )); 300 if (!C->failing()) { 301 Node* xroot = xform( C->root(), 1 ); 302 if (xroot == NULL) { 303 Matcher::soft_match_failure(); // recursive matching process failed 304 C->record_method_not_compilable("instruction match failed"); 305 } else { 306 // During matching shared constants were attached to C->root() 307 // because xroot wasn't available yet, so transfer the uses to 308 // the xroot. 309 for( DUIterator_Fast jmax, j = C->root()->fast_outs(jmax); j < jmax; j++ ) { 310 Node* n = C->root()->fast_out(j); 311 if (C->node_arena()->contains(n)) { 312 assert(n->in(0) == C->root(), "should be control user"); 313 n->set_req(0, xroot); 314 --j; 315 --jmax; 316 } 317 } 318 319 C->set_root(xroot->is_Root() ? xroot->as_Root() : NULL); 320#ifdef ASSERT 321 verify_new_nodes_only(xroot); 322#endif 323 } 324 } 325 if (C->top() == NULL || C->root() == NULL) { 326 C->record_method_not_compilable("graph lost"); // %%% cannot happen? 327 } 328 if (C->failing()) { 329 // delete old; 330 old->destruct_contents(); 331 return; 332 } 333 assert( C->top(), "" ); 334 assert( C->root(), "" ); 335 validate_null_checks(); 336 337 // Now smoke old-space 338 NOT_DEBUG( old->destruct_contents() ); 339 340 // ------------------------ 341 // Set up save-on-entry registers 342 Fixup_Save_On_Entry( ); 343} 344 345 346//------------------------------Fixup_Save_On_Entry---------------------------- 347// The stated purpose of this routine is to take care of save-on-entry 348// registers. However, the overall goal of the Match phase is to convert into 349// machine-specific instructions which have RegMasks to guide allocation. 350// So what this procedure really does is put a valid RegMask on each input 351// to the machine-specific variations of all Return, TailCall and Halt 352// instructions. It also adds edgs to define the save-on-entry values (and of 353// course gives them a mask). 354 355static RegMask *init_input_masks( uint size, RegMask &ret_adr, RegMask &fp ) { 356 RegMask *rms = NEW_RESOURCE_ARRAY( RegMask, size ); 357 // Do all the pre-defined register masks 358 rms[TypeFunc::Control ] = RegMask::Empty; 359 rms[TypeFunc::I_O ] = RegMask::Empty; 360 rms[TypeFunc::Memory ] = RegMask::Empty; 361 rms[TypeFunc::ReturnAdr] = ret_adr; 362 rms[TypeFunc::FramePtr ] = fp; 363 return rms; 364} 365 366//---------------------------init_first_stack_mask----------------------------- 367// Create the initial stack mask used by values spilling to the stack. 368// Disallow any debug info in outgoing argument areas by setting the 369// initial mask accordingly. 370void Matcher::init_first_stack_mask() { 371 372 // Allocate storage for spill masks as masks for the appropriate load type. 373 RegMask *rms = (RegMask*)C->comp_arena()->Amalloc_D(sizeof(RegMask)*12); 374 idealreg2spillmask[Op_RegN] = &rms[0]; 375 idealreg2spillmask[Op_RegI] = &rms[1]; 376 idealreg2spillmask[Op_RegL] = &rms[2]; 377 idealreg2spillmask[Op_RegF] = &rms[3]; 378 idealreg2spillmask[Op_RegD] = &rms[4]; 379 idealreg2spillmask[Op_RegP] = &rms[5]; 380 idealreg2debugmask[Op_RegN] = &rms[6]; 381 idealreg2debugmask[Op_RegI] = &rms[7]; 382 idealreg2debugmask[Op_RegL] = &rms[8]; 383 idealreg2debugmask[Op_RegF] = &rms[9]; 384 idealreg2debugmask[Op_RegD] = &rms[10]; 385 idealreg2debugmask[Op_RegP] = &rms[11]; 386 387 OptoReg::Name i; 388 389 // At first, start with the empty mask 390 C->FIRST_STACK_mask().Clear(); 391 392 // Add in the incoming argument area 393 OptoReg::Name init = OptoReg::add(_old_SP, C->out_preserve_stack_slots()); 394 for (i = init; i < _in_arg_limit; i = OptoReg::add(i,1)) 395 C->FIRST_STACK_mask().Insert(i); 396 397 // Add in all bits past the outgoing argument area 398 guarantee(RegMask::can_represent(OptoReg::add(_out_arg_limit,-1)), 399 "must be able to represent all call arguments in reg mask"); 400 init = _out_arg_limit; 401 for (i = init; RegMask::can_represent(i); i = OptoReg::add(i,1)) 402 C->FIRST_STACK_mask().Insert(i); 403 404 // Finally, set the "infinite stack" bit. 405 C->FIRST_STACK_mask().set_AllStack(); 406 407 // Make spill masks. Registers for their class, plus FIRST_STACK_mask. 408#ifdef _LP64 409 *idealreg2spillmask[Op_RegN] = *idealreg2regmask[Op_RegN]; 410 idealreg2spillmask[Op_RegN]->OR(C->FIRST_STACK_mask()); 411#endif 412 *idealreg2spillmask[Op_RegI] = *idealreg2regmask[Op_RegI]; 413 idealreg2spillmask[Op_RegI]->OR(C->FIRST_STACK_mask()); 414 *idealreg2spillmask[Op_RegL] = *idealreg2regmask[Op_RegL]; 415 idealreg2spillmask[Op_RegL]->OR(C->FIRST_STACK_mask()); 416 *idealreg2spillmask[Op_RegF] = *idealreg2regmask[Op_RegF]; 417 idealreg2spillmask[Op_RegF]->OR(C->FIRST_STACK_mask()); 418 *idealreg2spillmask[Op_RegD] = *idealreg2regmask[Op_RegD]; 419 idealreg2spillmask[Op_RegD]->OR(C->FIRST_STACK_mask()); 420 *idealreg2spillmask[Op_RegP] = *idealreg2regmask[Op_RegP]; 421 idealreg2spillmask[Op_RegP]->OR(C->FIRST_STACK_mask()); 422 423 // Make up debug masks. Any spill slot plus callee-save registers. 424 // Caller-save registers are assumed to be trashable by the various 425 // inline-cache fixup routines. 426 *idealreg2debugmask[Op_RegN]= *idealreg2spillmask[Op_RegN]; 427 *idealreg2debugmask[Op_RegI]= *idealreg2spillmask[Op_RegI]; 428 *idealreg2debugmask[Op_RegL]= *idealreg2spillmask[Op_RegL]; 429 *idealreg2debugmask[Op_RegF]= *idealreg2spillmask[Op_RegF]; 430 *idealreg2debugmask[Op_RegD]= *idealreg2spillmask[Op_RegD]; 431 *idealreg2debugmask[Op_RegP]= *idealreg2spillmask[Op_RegP]; 432 433 // Prevent stub compilations from attempting to reference 434 // callee-saved registers from debug info 435 bool exclude_soe = !Compile::current()->is_method_compilation(); 436 437 for( i=OptoReg::Name(0); i<OptoReg::Name(_last_Mach_Reg); i = OptoReg::add(i,1) ) { 438 // registers the caller has to save do not work 439 if( _register_save_policy[i] == 'C' || 440 _register_save_policy[i] == 'A' || 441 (_register_save_policy[i] == 'E' && exclude_soe) ) { 442 idealreg2debugmask[Op_RegN]->Remove(i); 443 idealreg2debugmask[Op_RegI]->Remove(i); // Exclude save-on-call 444 idealreg2debugmask[Op_RegL]->Remove(i); // registers from debug 445 idealreg2debugmask[Op_RegF]->Remove(i); // masks 446 idealreg2debugmask[Op_RegD]->Remove(i); 447 idealreg2debugmask[Op_RegP]->Remove(i); 448 } 449 } 450} 451 452//---------------------------is_save_on_entry---------------------------------- 453bool Matcher::is_save_on_entry( int reg ) { 454 return 455 _register_save_policy[reg] == 'E' || 456 _register_save_policy[reg] == 'A' || // Save-on-entry register? 457 // Also save argument registers in the trampolining stubs 458 (C->save_argument_registers() && is_spillable_arg(reg)); 459} 460 461//---------------------------Fixup_Save_On_Entry------------------------------- 462void Matcher::Fixup_Save_On_Entry( ) { 463 init_first_stack_mask(); 464 465 Node *root = C->root(); // Short name for root 466 // Count number of save-on-entry registers. 467 uint soe_cnt = number_of_saved_registers(); 468 uint i; 469 470 // Find the procedure Start Node 471 StartNode *start = C->start(); 472 assert( start, "Expect a start node" ); 473 474 // Save argument registers in the trampolining stubs 475 if( C->save_argument_registers() ) 476 for( i = 0; i < _last_Mach_Reg; i++ ) 477 if( is_spillable_arg(i) ) 478 soe_cnt++; 479 480 // Input RegMask array shared by all Returns. 481 // The type for doubles and longs has a count of 2, but 482 // there is only 1 returned value 483 uint ret_edge_cnt = TypeFunc::Parms + ((C->tf()->range()->cnt() == TypeFunc::Parms) ? 0 : 1); 484 RegMask *ret_rms = init_input_masks( ret_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask ); 485 // Returns have 0 or 1 returned values depending on call signature. 486 // Return register is specified by return_value in the AD file. 487 if (ret_edge_cnt > TypeFunc::Parms) 488 ret_rms[TypeFunc::Parms+0] = _return_value_mask; 489 490 // Input RegMask array shared by all Rethrows. 491 uint reth_edge_cnt = TypeFunc::Parms+1; 492 RegMask *reth_rms = init_input_masks( reth_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask ); 493 // Rethrow takes exception oop only, but in the argument 0 slot. 494 reth_rms[TypeFunc::Parms] = mreg2regmask[find_receiver(false)]; 495#ifdef _LP64 496 // Need two slots for ptrs in 64-bit land 497 reth_rms[TypeFunc::Parms].Insert(OptoReg::add(OptoReg::Name(find_receiver(false)),1)); 498#endif 499 500 // Input RegMask array shared by all TailCalls 501 uint tail_call_edge_cnt = TypeFunc::Parms+2; 502 RegMask *tail_call_rms = init_input_masks( tail_call_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask ); 503 504 // Input RegMask array shared by all TailJumps 505 uint tail_jump_edge_cnt = TypeFunc::Parms+2; 506 RegMask *tail_jump_rms = init_input_masks( tail_jump_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask ); 507 508 // TailCalls have 2 returned values (target & moop), whose masks come 509 // from the usual MachNode/MachOper mechanism. Find a sample 510 // TailCall to extract these masks and put the correct masks into 511 // the tail_call_rms array. 512 for( i=1; i < root->req(); i++ ) { 513 MachReturnNode *m = root->in(i)->as_MachReturn(); 514 if( m->ideal_Opcode() == Op_TailCall ) { 515 tail_call_rms[TypeFunc::Parms+0] = m->MachNode::in_RegMask(TypeFunc::Parms+0); 516 tail_call_rms[TypeFunc::Parms+1] = m->MachNode::in_RegMask(TypeFunc::Parms+1); 517 break; 518 } 519 } 520 521 // TailJumps have 2 returned values (target & ex_oop), whose masks come 522 // from the usual MachNode/MachOper mechanism. Find a sample 523 // TailJump to extract these masks and put the correct masks into 524 // the tail_jump_rms array. 525 for( i=1; i < root->req(); i++ ) { 526 MachReturnNode *m = root->in(i)->as_MachReturn(); 527 if( m->ideal_Opcode() == Op_TailJump ) { 528 tail_jump_rms[TypeFunc::Parms+0] = m->MachNode::in_RegMask(TypeFunc::Parms+0); 529 tail_jump_rms[TypeFunc::Parms+1] = m->MachNode::in_RegMask(TypeFunc::Parms+1); 530 break; 531 } 532 } 533 534 // Input RegMask array shared by all Halts 535 uint halt_edge_cnt = TypeFunc::Parms; 536 RegMask *halt_rms = init_input_masks( halt_edge_cnt + soe_cnt, _return_addr_mask, c_frame_ptr_mask ); 537 538 // Capture the return input masks into each exit flavor 539 for( i=1; i < root->req(); i++ ) { 540 MachReturnNode *exit = root->in(i)->as_MachReturn(); 541 switch( exit->ideal_Opcode() ) { 542 case Op_Return : exit->_in_rms = ret_rms; break; 543 case Op_Rethrow : exit->_in_rms = reth_rms; break; 544 case Op_TailCall : exit->_in_rms = tail_call_rms; break; 545 case Op_TailJump : exit->_in_rms = tail_jump_rms; break; 546 case Op_Halt : exit->_in_rms = halt_rms; break; 547 default : ShouldNotReachHere(); 548 } 549 } 550 551 // Next unused projection number from Start. 552 int proj_cnt = C->tf()->domain()->cnt(); 553 554 // Do all the save-on-entry registers. Make projections from Start for 555 // them, and give them a use at the exit points. To the allocator, they 556 // look like incoming register arguments. 557 for( i = 0; i < _last_Mach_Reg; i++ ) { 558 if( is_save_on_entry(i) ) { 559 560 // Add the save-on-entry to the mask array 561 ret_rms [ ret_edge_cnt] = mreg2regmask[i]; 562 reth_rms [ reth_edge_cnt] = mreg2regmask[i]; 563 tail_call_rms[tail_call_edge_cnt] = mreg2regmask[i]; 564 tail_jump_rms[tail_jump_edge_cnt] = mreg2regmask[i]; 565 // Halts need the SOE registers, but only in the stack as debug info. 566 // A just-prior uncommon-trap or deoptimization will use the SOE regs. 567 halt_rms [ halt_edge_cnt] = *idealreg2spillmask[_register_save_type[i]]; 568 569 Node *mproj; 570 571 // Is this a RegF low half of a RegD? Double up 2 adjacent RegF's 572 // into a single RegD. 573 if( (i&1) == 0 && 574 _register_save_type[i ] == Op_RegF && 575 _register_save_type[i+1] == Op_RegF && 576 is_save_on_entry(i+1) ) { 577 // Add other bit for double 578 ret_rms [ ret_edge_cnt].Insert(OptoReg::Name(i+1)); 579 reth_rms [ reth_edge_cnt].Insert(OptoReg::Name(i+1)); 580 tail_call_rms[tail_call_edge_cnt].Insert(OptoReg::Name(i+1)); 581 tail_jump_rms[tail_jump_edge_cnt].Insert(OptoReg::Name(i+1)); 582 halt_rms [ halt_edge_cnt].Insert(OptoReg::Name(i+1)); 583 mproj = new (C, 1) MachProjNode( start, proj_cnt, ret_rms[ret_edge_cnt], Op_RegD ); 584 proj_cnt += 2; // Skip 2 for doubles 585 } 586 else if( (i&1) == 1 && // Else check for high half of double 587 _register_save_type[i-1] == Op_RegF && 588 _register_save_type[i ] == Op_RegF && 589 is_save_on_entry(i-1) ) { 590 ret_rms [ ret_edge_cnt] = RegMask::Empty; 591 reth_rms [ reth_edge_cnt] = RegMask::Empty; 592 tail_call_rms[tail_call_edge_cnt] = RegMask::Empty; 593 tail_jump_rms[tail_jump_edge_cnt] = RegMask::Empty; 594 halt_rms [ halt_edge_cnt] = RegMask::Empty; 595 mproj = C->top(); 596 } 597 // Is this a RegI low half of a RegL? Double up 2 adjacent RegI's 598 // into a single RegL. 599 else if( (i&1) == 0 && 600 _register_save_type[i ] == Op_RegI && 601 _register_save_type[i+1] == Op_RegI && 602 is_save_on_entry(i+1) ) { 603 // Add other bit for long 604 ret_rms [ ret_edge_cnt].Insert(OptoReg::Name(i+1)); 605 reth_rms [ reth_edge_cnt].Insert(OptoReg::Name(i+1)); 606 tail_call_rms[tail_call_edge_cnt].Insert(OptoReg::Name(i+1)); 607 tail_jump_rms[tail_jump_edge_cnt].Insert(OptoReg::Name(i+1)); 608 halt_rms [ halt_edge_cnt].Insert(OptoReg::Name(i+1)); 609 mproj = new (C, 1) MachProjNode( start, proj_cnt, ret_rms[ret_edge_cnt], Op_RegL ); 610 proj_cnt += 2; // Skip 2 for longs 611 } 612 else if( (i&1) == 1 && // Else check for high half of long 613 _register_save_type[i-1] == Op_RegI && 614 _register_save_type[i ] == Op_RegI && 615 is_save_on_entry(i-1) ) { 616 ret_rms [ ret_edge_cnt] = RegMask::Empty; 617 reth_rms [ reth_edge_cnt] = RegMask::Empty; 618 tail_call_rms[tail_call_edge_cnt] = RegMask::Empty; 619 tail_jump_rms[tail_jump_edge_cnt] = RegMask::Empty; 620 halt_rms [ halt_edge_cnt] = RegMask::Empty; 621 mproj = C->top(); 622 } else { 623 // Make a projection for it off the Start 624 mproj = new (C, 1) MachProjNode( start, proj_cnt++, ret_rms[ret_edge_cnt], _register_save_type[i] ); 625 } 626 627 ret_edge_cnt ++; 628 reth_edge_cnt ++; 629 tail_call_edge_cnt ++; 630 tail_jump_edge_cnt ++; 631 halt_edge_cnt ++; 632 633 // Add a use of the SOE register to all exit paths 634 for( uint j=1; j < root->req(); j++ ) 635 root->in(j)->add_req(mproj); 636 } // End of if a save-on-entry register 637 } // End of for all machine registers 638} 639 640//------------------------------init_spill_mask-------------------------------- 641void Matcher::init_spill_mask( Node *ret ) { 642 if( idealreg2regmask[Op_RegI] ) return; // One time only init 643 644 OptoReg::c_frame_pointer = c_frame_pointer(); 645 c_frame_ptr_mask = c_frame_pointer(); 646#ifdef _LP64 647 // pointers are twice as big 648 c_frame_ptr_mask.Insert(OptoReg::add(c_frame_pointer(),1)); 649#endif 650 651 // Start at OptoReg::stack0() 652 STACK_ONLY_mask.Clear(); 653 OptoReg::Name init = OptoReg::stack2reg(0); 654 // STACK_ONLY_mask is all stack bits 655 OptoReg::Name i; 656 for (i = init; RegMask::can_represent(i); i = OptoReg::add(i,1)) 657 STACK_ONLY_mask.Insert(i); 658 // Also set the "infinite stack" bit. 659 STACK_ONLY_mask.set_AllStack(); 660 661 // Copy the register names over into the shared world 662 for( i=OptoReg::Name(0); i<OptoReg::Name(_last_Mach_Reg); i = OptoReg::add(i,1) ) { 663 // SharedInfo::regName[i] = regName[i]; 664 // Handy RegMasks per machine register 665 mreg2regmask[i].Insert(i); 666 } 667 668 // Grab the Frame Pointer 669 Node *fp = ret->in(TypeFunc::FramePtr); 670 Node *mem = ret->in(TypeFunc::Memory); 671 const TypePtr* atp = TypePtr::BOTTOM; 672 // Share frame pointer while making spill ops 673 set_shared(fp); 674 675 // Compute generic short-offset Loads 676#ifdef _LP64 677 MachNode *spillCP = match_tree(new (C, 3) LoadNNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM)); 678#endif 679 MachNode *spillI = match_tree(new (C, 3) LoadINode(NULL,mem,fp,atp)); 680 MachNode *spillL = match_tree(new (C, 3) LoadLNode(NULL,mem,fp,atp)); 681 MachNode *spillF = match_tree(new (C, 3) LoadFNode(NULL,mem,fp,atp)); 682 MachNode *spillD = match_tree(new (C, 3) LoadDNode(NULL,mem,fp,atp)); 683 MachNode *spillP = match_tree(new (C, 3) LoadPNode(NULL,mem,fp,atp,TypeInstPtr::BOTTOM)); 684 assert(spillI != NULL && spillL != NULL && spillF != NULL && 685 spillD != NULL && spillP != NULL, ""); 686 687 // Get the ADLC notion of the right regmask, for each basic type. 688#ifdef _LP64 689 idealreg2regmask[Op_RegN] = &spillCP->out_RegMask(); 690#endif 691 idealreg2regmask[Op_RegI] = &spillI->out_RegMask(); 692 idealreg2regmask[Op_RegL] = &spillL->out_RegMask(); 693 idealreg2regmask[Op_RegF] = &spillF->out_RegMask(); 694 idealreg2regmask[Op_RegD] = &spillD->out_RegMask(); 695 idealreg2regmask[Op_RegP] = &spillP->out_RegMask(); 696} 697 698#ifdef ASSERT 699static void match_alias_type(Compile* C, Node* n, Node* m) { 700 if (!VerifyAliases) return; // do not go looking for trouble by default 701 const TypePtr* nat = n->adr_type(); 702 const TypePtr* mat = m->adr_type(); 703 int nidx = C->get_alias_index(nat); 704 int midx = C->get_alias_index(mat); 705 // Detune the assert for cases like (AndI 0xFF (LoadB p)). 706 if (nidx == Compile::AliasIdxTop && midx >= Compile::AliasIdxRaw) { 707 for (uint i = 1; i < n->req(); i++) { 708 Node* n1 = n->in(i); 709 const TypePtr* n1at = n1->adr_type(); 710 if (n1at != NULL) { 711 nat = n1at; 712 nidx = C->get_alias_index(n1at); 713 } 714 } 715 } 716 // %%% Kludgery. Instead, fix ideal adr_type methods for all these cases: 717 if (nidx == Compile::AliasIdxTop && midx == Compile::AliasIdxRaw) { 718 switch (n->Opcode()) { 719 case Op_PrefetchRead: 720 case Op_PrefetchWrite: 721 nidx = Compile::AliasIdxRaw; 722 nat = TypeRawPtr::BOTTOM; 723 break; 724 } 725 } 726 if (nidx == Compile::AliasIdxRaw && midx == Compile::AliasIdxTop) { 727 switch (n->Opcode()) { 728 case Op_ClearArray: 729 midx = Compile::AliasIdxRaw; 730 mat = TypeRawPtr::BOTTOM; 731 break; 732 } 733 } 734 if (nidx == Compile::AliasIdxTop && midx == Compile::AliasIdxBot) { 735 switch (n->Opcode()) { 736 case Op_Return: 737 case Op_Rethrow: 738 case Op_Halt: 739 case Op_TailCall: 740 case Op_TailJump: 741 nidx = Compile::AliasIdxBot; 742 nat = TypePtr::BOTTOM; 743 break; 744 } 745 } 746 if (nidx == Compile::AliasIdxBot && midx == Compile::AliasIdxTop) { 747 switch (n->Opcode()) { 748 case Op_StrComp: 749 case Op_AryEq: 750 case Op_MemBarVolatile: 751 case Op_MemBarCPUOrder: // %%% these ideals should have narrower adr_type? 752 nidx = Compile::AliasIdxTop; 753 nat = NULL; 754 break; 755 } 756 } 757 if (nidx != midx) { 758 if (PrintOpto || (PrintMiscellaneous && (WizardMode || Verbose))) { 759 tty->print_cr("==== Matcher alias shift %d => %d", nidx, midx); 760 n->dump(); 761 m->dump(); 762 } 763 assert(C->subsume_loads() && C->must_alias(nat, midx), 764 "must not lose alias info when matching"); 765 } 766} 767#endif 768 769 770//------------------------------MStack----------------------------------------- 771// State and MStack class used in xform() and find_shared() iterative methods. 772enum Node_State { Pre_Visit, // node has to be pre-visited 773 Visit, // visit node 774 Post_Visit, // post-visit node 775 Alt_Post_Visit // alternative post-visit path 776 }; 777 778class MStack: public Node_Stack { 779 public: 780 MStack(int size) : Node_Stack(size) { } 781 782 void push(Node *n, Node_State ns) { 783 Node_Stack::push(n, (uint)ns); 784 } 785 void push(Node *n, Node_State ns, Node *parent, int indx) { 786 ++_inode_top; 787 if ((_inode_top + 1) >= _inode_max) grow(); 788 _inode_top->node = parent; 789 _inode_top->indx = (uint)indx; 790 ++_inode_top; 791 _inode_top->node = n; 792 _inode_top->indx = (uint)ns; 793 } 794 Node *parent() { 795 pop(); 796 return node(); 797 } 798 Node_State state() const { 799 return (Node_State)index(); 800 } 801 void set_state(Node_State ns) { 802 set_index((uint)ns); 803 } 804}; 805 806 807//------------------------------xform------------------------------------------ 808// Given a Node in old-space, Match him (Label/Reduce) to produce a machine 809// Node in new-space. Given a new-space Node, recursively walk his children. 810Node *Matcher::transform( Node *n ) { ShouldNotCallThis(); return n; } 811Node *Matcher::xform( Node *n, int max_stack ) { 812 // Use one stack to keep both: child's node/state and parent's node/index 813 MStack mstack(max_stack * 2 * 2); // C->unique() * 2 * 2 814 mstack.push(n, Visit, NULL, -1); // set NULL as parent to indicate root 815 816 while (mstack.is_nonempty()) { 817 n = mstack.node(); // Leave node on stack 818 Node_State nstate = mstack.state(); 819 if (nstate == Visit) { 820 mstack.set_state(Post_Visit); 821 Node *oldn = n; 822 // Old-space or new-space check 823 if (!C->node_arena()->contains(n)) { 824 // Old space! 825 Node* m; 826 if (has_new_node(n)) { // Not yet Label/Reduced 827 m = new_node(n); 828 } else { 829 if (!is_dontcare(n)) { // Matcher can match this guy 830 // Calls match special. They match alone with no children. 831 // Their children, the incoming arguments, match normally. 832 m = n->is_SafePoint() ? match_sfpt(n->as_SafePoint()):match_tree(n); 833 if (C->failing()) return NULL; 834 if (m == NULL) { Matcher::soft_match_failure(); return NULL; } 835 } else { // Nothing the matcher cares about 836 if( n->is_Proj() && n->in(0)->is_Multi()) { // Projections? 837 // Convert to machine-dependent projection 838 m = n->in(0)->as_Multi()->match( n->as_Proj(), this ); 839#ifdef ASSERT 840 _new2old_map.map(m->_idx, n); 841#endif 842 if (m->in(0) != NULL) // m might be top 843 collect_null_checks(m, n); 844 } else { // Else just a regular 'ol guy 845 m = n->clone(); // So just clone into new-space 846#ifdef ASSERT 847 _new2old_map.map(m->_idx, n); 848#endif 849 // Def-Use edges will be added incrementally as Uses 850 // of this node are matched. 851 assert(m->outcnt() == 0, "no Uses of this clone yet"); 852 } 853 } 854 855 set_new_node(n, m); // Map old to new 856 if (_old_node_note_array != NULL) { 857 Node_Notes* nn = C->locate_node_notes(_old_node_note_array, 858 n->_idx); 859 C->set_node_notes_at(m->_idx, nn); 860 } 861 debug_only(match_alias_type(C, n, m)); 862 } 863 n = m; // n is now a new-space node 864 mstack.set_node(n); 865 } 866 867 // New space! 868 if (_visited.test_set(n->_idx)) continue; // while(mstack.is_nonempty()) 869 870 int i; 871 // Put precedence edges on stack first (match them last). 872 for (i = oldn->req(); (uint)i < oldn->len(); i++) { 873 Node *m = oldn->in(i); 874 if (m == NULL) break; 875 // set -1 to call add_prec() instead of set_req() during Step1 876 mstack.push(m, Visit, n, -1); 877 } 878 879 // For constant debug info, I'd rather have unmatched constants. 880 int cnt = n->req(); 881 JVMState* jvms = n->jvms(); 882 int debug_cnt = jvms ? jvms->debug_start() : cnt; 883 884 // Now do only debug info. Clone constants rather than matching. 885 // Constants are represented directly in the debug info without 886 // the need for executable machine instructions. 887 // Monitor boxes are also represented directly. 888 for (i = cnt - 1; i >= debug_cnt; --i) { // For all debug inputs do 889 Node *m = n->in(i); // Get input 890 int op = m->Opcode(); 891 assert((op == Op_BoxLock) == jvms->is_monitor_use(i), "boxes only at monitor sites"); 892 if( op == Op_ConI || op == Op_ConP || op == Op_ConN || 893 op == Op_ConF || op == Op_ConD || op == Op_ConL 894 // || op == Op_BoxLock // %%%% enable this and remove (+++) in chaitin.cpp 895 ) { 896 m = m->clone(); 897#ifdef ASSERT 898 _new2old_map.map(m->_idx, n); 899#endif 900 mstack.push(m, Post_Visit, n, i); // Don't need to visit 901 mstack.push(m->in(0), Visit, m, 0); 902 } else { 903 mstack.push(m, Visit, n, i); 904 } 905 } 906 907 // And now walk his children, and convert his inputs to new-space. 908 for( ; i >= 0; --i ) { // For all normal inputs do 909 Node *m = n->in(i); // Get input 910 if(m != NULL) 911 mstack.push(m, Visit, n, i); 912 } 913 914 } 915 else if (nstate == Post_Visit) { 916 // Set xformed input 917 Node *p = mstack.parent(); 918 if (p != NULL) { // root doesn't have parent 919 int i = (int)mstack.index(); 920 if (i >= 0) 921 p->set_req(i, n); // required input 922 else if (i == -1) 923 p->add_prec(n); // precedence input 924 else 925 ShouldNotReachHere(); 926 } 927 mstack.pop(); // remove processed node from stack 928 } 929 else { 930 ShouldNotReachHere(); 931 } 932 } // while (mstack.is_nonempty()) 933 return n; // Return new-space Node 934} 935 936//------------------------------warp_outgoing_stk_arg------------------------ 937OptoReg::Name Matcher::warp_outgoing_stk_arg( VMReg reg, OptoReg::Name begin_out_arg_area, OptoReg::Name &out_arg_limit_per_call ) { 938 // Convert outgoing argument location to a pre-biased stack offset 939 if (reg->is_stack()) { 940 OptoReg::Name warped = reg->reg2stack(); 941 // Adjust the stack slot offset to be the register number used 942 // by the allocator. 943 warped = OptoReg::add(begin_out_arg_area, warped); 944 // Keep track of the largest numbered stack slot used for an arg. 945 // Largest used slot per call-site indicates the amount of stack 946 // that is killed by the call. 947 if( warped >= out_arg_limit_per_call ) 948 out_arg_limit_per_call = OptoReg::add(warped,1); 949 if (!RegMask::can_represent(warped)) { 950 C->record_method_not_compilable_all_tiers("unsupported calling sequence"); 951 return OptoReg::Bad; 952 } 953 return warped; 954 } 955 return OptoReg::as_OptoReg(reg); 956} 957 958 959//------------------------------match_sfpt------------------------------------- 960// Helper function to match call instructions. Calls match special. 961// They match alone with no children. Their children, the incoming 962// arguments, match normally. 963MachNode *Matcher::match_sfpt( SafePointNode *sfpt ) { 964 MachSafePointNode *msfpt = NULL; 965 MachCallNode *mcall = NULL; 966 uint cnt; 967 // Split out case for SafePoint vs Call 968 CallNode *call; 969 const TypeTuple *domain; 970 ciMethod* method = NULL; 971 if( sfpt->is_Call() ) { 972 call = sfpt->as_Call(); 973 domain = call->tf()->domain(); 974 cnt = domain->cnt(); 975 976 // Match just the call, nothing else 977 MachNode *m = match_tree(call); 978 if (C->failing()) return NULL; 979 if( m == NULL ) { Matcher::soft_match_failure(); return NULL; } 980 981 // Copy data from the Ideal SafePoint to the machine version 982 mcall = m->as_MachCall(); 983 984 mcall->set_tf( call->tf()); 985 mcall->set_entry_point(call->entry_point()); 986 mcall->set_cnt( call->cnt()); 987 988 if( mcall->is_MachCallJava() ) { 989 MachCallJavaNode *mcall_java = mcall->as_MachCallJava(); 990 const CallJavaNode *call_java = call->as_CallJava(); 991 method = call_java->method(); 992 mcall_java->_method = method; 993 mcall_java->_bci = call_java->_bci; 994 mcall_java->_optimized_virtual = call_java->is_optimized_virtual(); 995 if( mcall_java->is_MachCallStaticJava() ) 996 mcall_java->as_MachCallStaticJava()->_name = 997 call_java->as_CallStaticJava()->_name; 998 if( mcall_java->is_MachCallDynamicJava() ) 999 mcall_java->as_MachCallDynamicJava()->_vtable_index = 1000 call_java->as_CallDynamicJava()->_vtable_index; 1001 } 1002 else if( mcall->is_MachCallRuntime() ) { 1003 mcall->as_MachCallRuntime()->_name = call->as_CallRuntime()->_name; 1004 } 1005 msfpt = mcall; 1006 } 1007 // This is a non-call safepoint 1008 else { 1009 call = NULL; 1010 domain = NULL; 1011 MachNode *mn = match_tree(sfpt); 1012 if (C->failing()) return NULL; 1013 msfpt = mn->as_MachSafePoint(); 1014 cnt = TypeFunc::Parms; 1015 } 1016 1017 // Advertise the correct memory effects (for anti-dependence computation). 1018 msfpt->set_adr_type(sfpt->adr_type()); 1019 1020 // Allocate a private array of RegMasks. These RegMasks are not shared. 1021 msfpt->_in_rms = NEW_RESOURCE_ARRAY( RegMask, cnt ); 1022 // Empty them all. 1023 memset( msfpt->_in_rms, 0, sizeof(RegMask)*cnt ); 1024 1025 // Do all the pre-defined non-Empty register masks 1026 msfpt->_in_rms[TypeFunc::ReturnAdr] = _return_addr_mask; 1027 msfpt->_in_rms[TypeFunc::FramePtr ] = c_frame_ptr_mask; 1028 1029 // Place first outgoing argument can possibly be put. 1030 OptoReg::Name begin_out_arg_area = OptoReg::add(_new_SP, C->out_preserve_stack_slots()); 1031 assert( is_even(begin_out_arg_area), "" ); 1032 // Compute max outgoing register number per call site. 1033 OptoReg::Name out_arg_limit_per_call = begin_out_arg_area; 1034 // Calls to C may hammer extra stack slots above and beyond any arguments. 1035 // These are usually backing store for register arguments for varargs. 1036 if( call != NULL && call->is_CallRuntime() ) 1037 out_arg_limit_per_call = OptoReg::add(out_arg_limit_per_call,C->varargs_C_out_slots_killed()); 1038 1039 1040 // Do the normal argument list (parameters) register masks 1041 int argcnt = cnt - TypeFunc::Parms; 1042 if( argcnt > 0 ) { // Skip it all if we have no args 1043 BasicType *sig_bt = NEW_RESOURCE_ARRAY( BasicType, argcnt ); 1044 VMRegPair *parm_regs = NEW_RESOURCE_ARRAY( VMRegPair, argcnt ); 1045 int i; 1046 for( i = 0; i < argcnt; i++ ) { 1047 sig_bt[i] = domain->field_at(i+TypeFunc::Parms)->basic_type(); 1048 } 1049 // V-call to pick proper calling convention 1050 call->calling_convention( sig_bt, parm_regs, argcnt ); 1051 1052#ifdef ASSERT 1053 // Sanity check users' calling convention. Really handy during 1054 // the initial porting effort. Fairly expensive otherwise. 1055 { for (int i = 0; i<argcnt; i++) { 1056 if( !parm_regs[i].first()->is_valid() && 1057 !parm_regs[i].second()->is_valid() ) continue; 1058 VMReg reg1 = parm_regs[i].first(); 1059 VMReg reg2 = parm_regs[i].second(); 1060 for (int j = 0; j < i; j++) { 1061 if( !parm_regs[j].first()->is_valid() && 1062 !parm_regs[j].second()->is_valid() ) continue; 1063 VMReg reg3 = parm_regs[j].first(); 1064 VMReg reg4 = parm_regs[j].second(); 1065 if( !reg1->is_valid() ) { 1066 assert( !reg2->is_valid(), "valid halvsies" ); 1067 } else if( !reg3->is_valid() ) { 1068 assert( !reg4->is_valid(), "valid halvsies" ); 1069 } else { 1070 assert( reg1 != reg2, "calling conv. must produce distinct regs"); 1071 assert( reg1 != reg3, "calling conv. must produce distinct regs"); 1072 assert( reg1 != reg4, "calling conv. must produce distinct regs"); 1073 assert( reg2 != reg3, "calling conv. must produce distinct regs"); 1074 assert( reg2 != reg4 || !reg2->is_valid(), "calling conv. must produce distinct regs"); 1075 assert( reg3 != reg4, "calling conv. must produce distinct regs"); 1076 } 1077 } 1078 } 1079 } 1080#endif 1081 1082 // Visit each argument. Compute its outgoing register mask. 1083 // Return results now can have 2 bits returned. 1084 // Compute max over all outgoing arguments both per call-site 1085 // and over the entire method. 1086 for( i = 0; i < argcnt; i++ ) { 1087 // Address of incoming argument mask to fill in 1088 RegMask *rm = &mcall->_in_rms[i+TypeFunc::Parms]; 1089 if( !parm_regs[i].first()->is_valid() && 1090 !parm_regs[i].second()->is_valid() ) { 1091 continue; // Avoid Halves 1092 } 1093 // Grab first register, adjust stack slots and insert in mask. 1094 OptoReg::Name reg1 = warp_outgoing_stk_arg(parm_regs[i].first(), begin_out_arg_area, out_arg_limit_per_call ); 1095 if (OptoReg::is_valid(reg1)) 1096 rm->Insert( reg1 ); 1097 // Grab second register (if any), adjust stack slots and insert in mask. 1098 OptoReg::Name reg2 = warp_outgoing_stk_arg(parm_regs[i].second(), begin_out_arg_area, out_arg_limit_per_call ); 1099 if (OptoReg::is_valid(reg2)) 1100 rm->Insert( reg2 ); 1101 } // End of for all arguments 1102 1103 // Compute number of stack slots needed to restore stack in case of 1104 // Pascal-style argument popping. 1105 mcall->_argsize = out_arg_limit_per_call - begin_out_arg_area; 1106 } 1107 1108 // Compute the max stack slot killed by any call. These will not be 1109 // available for debug info, and will be used to adjust FIRST_STACK_mask 1110 // after all call sites have been visited. 1111 if( _out_arg_limit < out_arg_limit_per_call) 1112 _out_arg_limit = out_arg_limit_per_call; 1113 1114 if (mcall) { 1115 // Kill the outgoing argument area, including any non-argument holes and 1116 // any legacy C-killed slots. Use Fat-Projections to do the killing. 1117 // Since the max-per-method covers the max-per-call-site and debug info 1118 // is excluded on the max-per-method basis, debug info cannot land in 1119 // this killed area. 1120 uint r_cnt = mcall->tf()->range()->cnt(); 1121 MachProjNode *proj = new (C, 1) MachProjNode( mcall, r_cnt+10000, RegMask::Empty, MachProjNode::fat_proj ); 1122 if (!RegMask::can_represent(OptoReg::Name(out_arg_limit_per_call-1))) { 1123 C->record_method_not_compilable_all_tiers("unsupported outgoing calling sequence"); 1124 } else { 1125 for (int i = begin_out_arg_area; i < out_arg_limit_per_call; i++) 1126 proj->_rout.Insert(OptoReg::Name(i)); 1127 } 1128 if( proj->_rout.is_NotEmpty() ) 1129 _proj_list.push(proj); 1130 } 1131 // Transfer the safepoint information from the call to the mcall 1132 // Move the JVMState list 1133 msfpt->set_jvms(sfpt->jvms()); 1134 for (JVMState* jvms = msfpt->jvms(); jvms; jvms = jvms->caller()) { 1135 jvms->set_map(sfpt); 1136 } 1137 1138 // Debug inputs begin just after the last incoming parameter 1139 assert( (mcall == NULL) || (mcall->jvms() == NULL) || 1140 (mcall->jvms()->debug_start() + mcall->_jvmadj == mcall->tf()->domain()->cnt()), "" ); 1141 1142 // Move the OopMap 1143 msfpt->_oop_map = sfpt->_oop_map; 1144 1145 // Registers killed by the call are set in the local scheduling pass 1146 // of Global Code Motion. 1147 return msfpt; 1148} 1149 1150//---------------------------match_tree---------------------------------------- 1151// Match a Ideal Node DAG - turn it into a tree; Label & Reduce. Used as part 1152// of the whole-sale conversion from Ideal to Mach Nodes. Also used for 1153// making GotoNodes while building the CFG and in init_spill_mask() to identify 1154// a Load's result RegMask for memoization in idealreg2regmask[] 1155MachNode *Matcher::match_tree( const Node *n ) { 1156 assert( n->Opcode() != Op_Phi, "cannot match" ); 1157 assert( !n->is_block_start(), "cannot match" ); 1158 // Set the mark for all locally allocated State objects. 1159 // When this call returns, the _states_arena arena will be reset 1160 // freeing all State objects. 1161 ResourceMark rm( &_states_arena ); 1162 1163 LabelRootDepth = 0; 1164 1165 // StoreNodes require their Memory input to match any LoadNodes 1166 Node *mem = n->is_Store() ? n->in(MemNode::Memory) : (Node*)1 ; 1167#ifdef ASSERT 1168 Node* save_mem_node = _mem_node; 1169 _mem_node = n->is_Store() ? (Node*)n : NULL; 1170#endif 1171 // State object for root node of match tree 1172 // Allocate it on _states_arena - stack allocation can cause stack overflow. 1173 State *s = new (&_states_arena) State; 1174 s->_kids[0] = NULL; 1175 s->_kids[1] = NULL; 1176 s->_leaf = (Node*)n; 1177 // Label the input tree, allocating labels from top-level arena 1178 Label_Root( n, s, n->in(0), mem ); 1179 if (C->failing()) return NULL; 1180 1181 // The minimum cost match for the whole tree is found at the root State 1182 uint mincost = max_juint; 1183 uint cost = max_juint; 1184 uint i; 1185 for( i = 0; i < NUM_OPERANDS; i++ ) { 1186 if( s->valid(i) && // valid entry and 1187 s->_cost[i] < cost && // low cost and 1188 s->_rule[i] >= NUM_OPERANDS ) // not an operand 1189 cost = s->_cost[mincost=i]; 1190 } 1191 if (mincost == max_juint) { 1192#ifndef PRODUCT 1193 tty->print("No matching rule for:"); 1194 s->dump(); 1195#endif 1196 Matcher::soft_match_failure(); 1197 return NULL; 1198 } 1199 // Reduce input tree based upon the state labels to machine Nodes 1200 MachNode *m = ReduceInst( s, s->_rule[mincost], mem ); 1201#ifdef ASSERT 1202 _old2new_map.map(n->_idx, m); 1203 _new2old_map.map(m->_idx, (Node*)n); 1204#endif 1205 1206 // Add any Matcher-ignored edges 1207 uint cnt = n->req(); 1208 uint start = 1; 1209 if( mem != (Node*)1 ) start = MemNode::Memory+1; 1210 if( n->is_AddP() ) { 1211 assert( mem == (Node*)1, "" ); 1212 start = AddPNode::Base+1; 1213 } 1214 for( i = start; i < cnt; i++ ) { 1215 if( !n->match_edge(i) ) { 1216 if( i < m->req() ) 1217 m->ins_req( i, n->in(i) ); 1218 else 1219 m->add_req( n->in(i) ); 1220 } 1221 } 1222 1223 debug_only( _mem_node = save_mem_node; ) 1224 return m; 1225} 1226 1227 1228//------------------------------match_into_reg--------------------------------- 1229// Choose to either match this Node in a register or part of the current 1230// match tree. Return true for requiring a register and false for matching 1231// as part of the current match tree. 1232static bool match_into_reg( const Node *n, Node *m, Node *control, int i, bool shared ) { 1233 1234 const Type *t = m->bottom_type(); 1235 1236 if( t->singleton() ) { 1237 // Never force constants into registers. Allow them to match as 1238 // constants or registers. Copies of the same value will share 1239 // the same register. See find_shared_node. 1240 return false; 1241 } else { // Not a constant 1242 // Stop recursion if they have different Controls. 1243 // Slot 0 of constants is not really a Control. 1244 if( control && m->in(0) && control != m->in(0) ) { 1245 1246 // Actually, we can live with the most conservative control we 1247 // find, if it post-dominates the others. This allows us to 1248 // pick up load/op/store trees where the load can float a little 1249 // above the store. 1250 Node *x = control; 1251 const uint max_scan = 6; // Arbitrary scan cutoff 1252 uint j; 1253 for( j=0; j<max_scan; j++ ) { 1254 if( x->is_Region() ) // Bail out at merge points 1255 return true; 1256 x = x->in(0); 1257 if( x == m->in(0) ) // Does 'control' post-dominate 1258 break; // m->in(0)? If so, we can use it 1259 } 1260 if( j == max_scan ) // No post-domination before scan end? 1261 return true; // Then break the match tree up 1262 } 1263 if (m->is_DecodeN() && Matcher::clone_shift_expressions) { 1264 // These are commonly used in address expressions and can 1265 // efficiently fold into them on X64 in some cases. 1266 return false; 1267 } 1268 } 1269 1270 // Not forceable cloning. If shared, put it into a register. 1271 return shared; 1272} 1273 1274 1275//------------------------------Instruction Selection-------------------------- 1276// Label method walks a "tree" of nodes, using the ADLC generated DFA to match 1277// ideal nodes to machine instructions. Trees are delimited by shared Nodes, 1278// things the Matcher does not match (e.g., Memory), and things with different 1279// Controls (hence forced into different blocks). We pass in the Control 1280// selected for this entire State tree. 1281 1282// The Matcher works on Trees, but an Intel add-to-memory requires a DAG: the 1283// Store and the Load must have identical Memories (as well as identical 1284// pointers). Since the Matcher does not have anything for Memory (and 1285// does not handle DAGs), I have to match the Memory input myself. If the 1286// Tree root is a Store, I require all Loads to have the identical memory. 1287Node *Matcher::Label_Root( const Node *n, State *svec, Node *control, const Node *mem){ 1288 // Since Label_Root is a recursive function, its possible that we might run 1289 // out of stack space. See bugs 6272980 & 6227033 for more info. 1290 LabelRootDepth++; 1291 if (LabelRootDepth > MaxLabelRootDepth) { 1292 C->record_method_not_compilable_all_tiers("Out of stack space, increase MaxLabelRootDepth"); 1293 return NULL; 1294 } 1295 uint care = 0; // Edges matcher cares about 1296 uint cnt = n->req(); 1297 uint i = 0; 1298 1299 // Examine children for memory state 1300 // Can only subsume a child into your match-tree if that child's memory state 1301 // is not modified along the path to another input. 1302 // It is unsafe even if the other inputs are separate roots. 1303 Node *input_mem = NULL; 1304 for( i = 1; i < cnt; i++ ) { 1305 if( !n->match_edge(i) ) continue; 1306 Node *m = n->in(i); // Get ith input 1307 assert( m, "expect non-null children" ); 1308 if( m->is_Load() ) { 1309 if( input_mem == NULL ) { 1310 input_mem = m->in(MemNode::Memory); 1311 } else if( input_mem != m->in(MemNode::Memory) ) { 1312 input_mem = NodeSentinel; 1313 } 1314 } 1315 } 1316 1317 for( i = 1; i < cnt; i++ ){// For my children 1318 if( !n->match_edge(i) ) continue; 1319 Node *m = n->in(i); // Get ith input 1320 // Allocate states out of a private arena 1321 State *s = new (&_states_arena) State; 1322 svec->_kids[care++] = s; 1323 assert( care <= 2, "binary only for now" ); 1324 1325 // Recursively label the State tree. 1326 s->_kids[0] = NULL; 1327 s->_kids[1] = NULL; 1328 s->_leaf = m; 1329 1330 // Check for leaves of the State Tree; things that cannot be a part of 1331 // the current tree. If it finds any, that value is matched as a 1332 // register operand. If not, then the normal matching is used. 1333 if( match_into_reg(n, m, control, i, is_shared(m)) || 1334 // 1335 // Stop recursion if this is LoadNode and the root of this tree is a 1336 // StoreNode and the load & store have different memories. 1337 ((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) || 1338 // Can NOT include the match of a subtree when its memory state 1339 // is used by any of the other subtrees 1340 (input_mem == NodeSentinel) ) { 1341#ifndef PRODUCT 1342 // Print when we exclude matching due to different memory states at input-loads 1343 if( PrintOpto && (Verbose && WizardMode) && (input_mem == NodeSentinel) 1344 && !((mem!=(Node*)1) && m->is_Load() && m->in(MemNode::Memory) != mem) ) { 1345 tty->print_cr("invalid input_mem"); 1346 } 1347#endif 1348 // Switch to a register-only opcode; this value must be in a register 1349 // and cannot be subsumed as part of a larger instruction. 1350 s->DFA( m->ideal_reg(), m ); 1351 1352 } else { 1353 // If match tree has no control and we do, adopt it for entire tree 1354 if( control == NULL && m->in(0) != NULL && m->req() > 1 ) 1355 control = m->in(0); // Pick up control 1356 // Else match as a normal part of the match tree. 1357 control = Label_Root(m,s,control,mem); 1358 if (C->failing()) return NULL; 1359 } 1360 } 1361 1362 1363 // Call DFA to match this node, and return 1364 svec->DFA( n->Opcode(), n ); 1365 1366#ifdef ASSERT 1367 uint x; 1368 for( x = 0; x < _LAST_MACH_OPER; x++ ) 1369 if( svec->valid(x) ) 1370 break; 1371 1372 if (x >= _LAST_MACH_OPER) { 1373 n->dump(); 1374 svec->dump(); 1375 assert( false, "bad AD file" ); 1376 } 1377#endif 1378 return control; 1379} 1380 1381 1382// Con nodes reduced using the same rule can share their MachNode 1383// which reduces the number of copies of a constant in the final 1384// program. The register allocator is free to split uses later to 1385// split live ranges. 1386MachNode* Matcher::find_shared_node(Node* leaf, uint rule) { 1387 if (!leaf->is_Con() && !leaf->is_DecodeN()) return NULL; 1388 1389 // See if this Con has already been reduced using this rule. 1390 if (_shared_nodes.Size() <= leaf->_idx) return NULL; 1391 MachNode* last = (MachNode*)_shared_nodes.at(leaf->_idx); 1392 if (last != NULL && rule == last->rule()) { 1393 // Don't expect control change for DecodeN 1394 if (leaf->is_DecodeN()) 1395 return last; 1396 // Get the new space root. 1397 Node* xroot = new_node(C->root()); 1398 if (xroot == NULL) { 1399 // This shouldn't happen give the order of matching. 1400 return NULL; 1401 } 1402 1403 // Shared constants need to have their control be root so they 1404 // can be scheduled properly. 1405 Node* control = last->in(0); 1406 if (control != xroot) { 1407 if (control == NULL || control == C->root()) { 1408 last->set_req(0, xroot); 1409 } else { 1410 assert(false, "unexpected control"); 1411 return NULL; 1412 } 1413 } 1414 return last; 1415 } 1416 return NULL; 1417} 1418 1419 1420//------------------------------ReduceInst------------------------------------- 1421// Reduce a State tree (with given Control) into a tree of MachNodes. 1422// This routine (and it's cohort ReduceOper) convert Ideal Nodes into 1423// complicated machine Nodes. Each MachNode covers some tree of Ideal Nodes. 1424// Each MachNode has a number of complicated MachOper operands; each 1425// MachOper also covers a further tree of Ideal Nodes. 1426 1427// The root of the Ideal match tree is always an instruction, so we enter 1428// the recursion here. After building the MachNode, we need to recurse 1429// the tree checking for these cases: 1430// (1) Child is an instruction - 1431// Build the instruction (recursively), add it as an edge. 1432// Build a simple operand (register) to hold the result of the instruction. 1433// (2) Child is an interior part of an instruction - 1434// Skip over it (do nothing) 1435// (3) Child is the start of a operand - 1436// Build the operand, place it inside the instruction 1437// Call ReduceOper. 1438MachNode *Matcher::ReduceInst( State *s, int rule, Node *&mem ) { 1439 assert( rule >= NUM_OPERANDS, "called with operand rule" ); 1440 1441 MachNode* shared_node = find_shared_node(s->_leaf, rule); 1442 if (shared_node != NULL) { 1443 return shared_node; 1444 } 1445 1446 // Build the object to represent this state & prepare for recursive calls 1447 MachNode *mach = s->MachNodeGenerator( rule, C ); 1448 mach->_opnds[0] = s->MachOperGenerator( _reduceOp[rule], C ); 1449 assert( mach->_opnds[0] != NULL, "Missing result operand" ); 1450 Node *leaf = s->_leaf; 1451 // Check for instruction or instruction chain rule 1452 if( rule >= _END_INST_CHAIN_RULE || rule < _BEGIN_INST_CHAIN_RULE ) { 1453 assert(C->node_arena()->contains(s->_leaf) || !has_new_node(s->_leaf), 1454 "duplicating node that's already been matched"); 1455 // Instruction 1456 mach->add_req( leaf->in(0) ); // Set initial control 1457 // Reduce interior of complex instruction 1458 ReduceInst_Interior( s, rule, mem, mach, 1 ); 1459 } else { 1460 // Instruction chain rules are data-dependent on their inputs 1461 mach->add_req(0); // Set initial control to none 1462 ReduceInst_Chain_Rule( s, rule, mem, mach ); 1463 } 1464 1465 // If a Memory was used, insert a Memory edge 1466 if( mem != (Node*)1 ) { 1467 mach->ins_req(MemNode::Memory,mem); 1468#ifdef ASSERT 1469 // Verify adr type after matching memory operation 1470 const MachOper* oper = mach->memory_operand(); 1471 if (oper != NULL && oper != (MachOper*)-1 && 1472 mach->adr_type() != TypeRawPtr::BOTTOM) { // non-direct addressing mode 1473 // It has a unique memory operand. Find corresponding ideal mem node. 1474 Node* m = NULL; 1475 if (leaf->is_Mem()) { 1476 m = leaf; 1477 } else { 1478 m = _mem_node; 1479 assert(m != NULL && m->is_Mem(), "expecting memory node"); 1480 } 1481 const Type* mach_at = mach->adr_type(); 1482 // DecodeN node consumed by an address may have different type 1483 // then its input. Don't compare types for such case. 1484 if (m->adr_type() != mach_at && 1485 (m->in(MemNode::Address)->is_DecodeN() || 1486 m->in(MemNode::Address)->is_AddP() && 1487 m->in(MemNode::Address)->in(AddPNode::Address)->is_DecodeN() || 1488 m->in(MemNode::Address)->is_AddP() && 1489 m->in(MemNode::Address)->in(AddPNode::Address)->is_AddP() && 1490 m->in(MemNode::Address)->in(AddPNode::Address)->in(AddPNode::Address)->is_DecodeN())) { 1491 mach_at = m->adr_type(); 1492 } 1493 if (m->adr_type() != mach_at) { 1494 m->dump(); 1495 tty->print_cr("mach:"); 1496 mach->dump(1); 1497 } 1498 assert(m->adr_type() == mach_at, "matcher should not change adr type"); 1499 } 1500#endif 1501 } 1502 1503 // If the _leaf is an AddP, insert the base edge 1504 if( leaf->is_AddP() ) 1505 mach->ins_req(AddPNode::Base,leaf->in(AddPNode::Base)); 1506 1507 uint num_proj = _proj_list.size(); 1508 1509 // Perform any 1-to-many expansions required 1510 MachNode *ex = mach->Expand(s,_proj_list); 1511 if( ex != mach ) { 1512 assert(ex->ideal_reg() == mach->ideal_reg(), "ideal types should match"); 1513 if( ex->in(1)->is_Con() ) 1514 ex->in(1)->set_req(0, C->root()); 1515 // Remove old node from the graph 1516 for( uint i=0; i<mach->req(); i++ ) { 1517 mach->set_req(i,NULL); 1518 } 1519#ifdef ASSERT 1520 _new2old_map.map(ex->_idx, s->_leaf); 1521#endif 1522 } 1523 1524 // PhaseChaitin::fixup_spills will sometimes generate spill code 1525 // via the matcher. By the time, nodes have been wired into the CFG, 1526 // and any further nodes generated by expand rules will be left hanging 1527 // in space, and will not get emitted as output code. Catch this. 1528 // Also, catch any new register allocation constraints ("projections") 1529 // generated belatedly during spill code generation. 1530 if (_allocation_started) { 1531 guarantee(ex == mach, "no expand rules during spill generation"); 1532 guarantee(_proj_list.size() == num_proj, "no allocation during spill generation"); 1533 } 1534 1535 if (leaf->is_Con() || leaf->is_DecodeN()) { 1536 // Record the con for sharing 1537 _shared_nodes.map(leaf->_idx, ex); 1538 } 1539 1540 return ex; 1541} 1542 1543void Matcher::ReduceInst_Chain_Rule( State *s, int rule, Node *&mem, MachNode *mach ) { 1544 // 'op' is what I am expecting to receive 1545 int op = _leftOp[rule]; 1546 // Operand type to catch childs result 1547 // This is what my child will give me. 1548 int opnd_class_instance = s->_rule[op]; 1549 // Choose between operand class or not. 1550 // This is what I will receive. 1551 int catch_op = (FIRST_OPERAND_CLASS <= op && op < NUM_OPERANDS) ? opnd_class_instance : op; 1552 // New rule for child. Chase operand classes to get the actual rule. 1553 int newrule = s->_rule[catch_op]; 1554 1555 if( newrule < NUM_OPERANDS ) { 1556 // Chain from operand or operand class, may be output of shared node 1557 assert( 0 <= opnd_class_instance && opnd_class_instance < NUM_OPERANDS, 1558 "Bad AD file: Instruction chain rule must chain from operand"); 1559 // Insert operand into array of operands for this instruction 1560 mach->_opnds[1] = s->MachOperGenerator( opnd_class_instance, C ); 1561 1562 ReduceOper( s, newrule, mem, mach ); 1563 } else { 1564 // Chain from the result of an instruction 1565 assert( newrule >= _LAST_MACH_OPER, "Do NOT chain from internal operand"); 1566 mach->_opnds[1] = s->MachOperGenerator( _reduceOp[catch_op], C ); 1567 Node *mem1 = (Node*)1; 1568 debug_only(Node *save_mem_node = _mem_node;) 1569 mach->add_req( ReduceInst(s, newrule, mem1) ); 1570 debug_only(_mem_node = save_mem_node;) 1571 } 1572 return; 1573} 1574 1575 1576uint Matcher::ReduceInst_Interior( State *s, int rule, Node *&mem, MachNode *mach, uint num_opnds ) { 1577 if( s->_leaf->is_Load() ) { 1578 Node *mem2 = s->_leaf->in(MemNode::Memory); 1579 assert( mem == (Node*)1 || mem == mem2, "multiple Memories being matched at once?" ); 1580 debug_only( if( mem == (Node*)1 ) _mem_node = s->_leaf;) 1581 mem = mem2; 1582 } 1583 if( s->_leaf->in(0) != NULL && s->_leaf->req() > 1) { 1584 if( mach->in(0) == NULL ) 1585 mach->set_req(0, s->_leaf->in(0)); 1586 } 1587 1588 // Now recursively walk the state tree & add operand list. 1589 for( uint i=0; i<2; i++ ) { // binary tree 1590 State *newstate = s->_kids[i]; 1591 if( newstate == NULL ) break; // Might only have 1 child 1592 // 'op' is what I am expecting to receive 1593 int op; 1594 if( i == 0 ) { 1595 op = _leftOp[rule]; 1596 } else { 1597 op = _rightOp[rule]; 1598 } 1599 // Operand type to catch childs result 1600 // This is what my child will give me. 1601 int opnd_class_instance = newstate->_rule[op]; 1602 // Choose between operand class or not. 1603 // This is what I will receive. 1604 int catch_op = (op >= FIRST_OPERAND_CLASS && op < NUM_OPERANDS) ? opnd_class_instance : op; 1605 // New rule for child. Chase operand classes to get the actual rule. 1606 int newrule = newstate->_rule[catch_op]; 1607 1608 if( newrule < NUM_OPERANDS ) { // Operand/operandClass or internalOp/instruction? 1609 // Operand/operandClass 1610 // Insert operand into array of operands for this instruction 1611 mach->_opnds[num_opnds++] = newstate->MachOperGenerator( opnd_class_instance, C ); 1612 ReduceOper( newstate, newrule, mem, mach ); 1613 1614 } else { // Child is internal operand or new instruction 1615 if( newrule < _LAST_MACH_OPER ) { // internal operand or instruction? 1616 // internal operand --> call ReduceInst_Interior 1617 // Interior of complex instruction. Do nothing but recurse. 1618 num_opnds = ReduceInst_Interior( newstate, newrule, mem, mach, num_opnds ); 1619 } else { 1620 // instruction --> call build operand( ) to catch result 1621 // --> ReduceInst( newrule ) 1622 mach->_opnds[num_opnds++] = s->MachOperGenerator( _reduceOp[catch_op], C ); 1623 Node *mem1 = (Node*)1; 1624 debug_only(Node *save_mem_node = _mem_node;) 1625 mach->add_req( ReduceInst( newstate, newrule, mem1 ) ); 1626 debug_only(_mem_node = save_mem_node;) 1627 } 1628 } 1629 assert( mach->_opnds[num_opnds-1], "" ); 1630 } 1631 return num_opnds; 1632} 1633 1634// This routine walks the interior of possible complex operands. 1635// At each point we check our children in the match tree: 1636// (1) No children - 1637// We are a leaf; add _leaf field as an input to the MachNode 1638// (2) Child is an internal operand - 1639// Skip over it ( do nothing ) 1640// (3) Child is an instruction - 1641// Call ReduceInst recursively and 1642// and instruction as an input to the MachNode 1643void Matcher::ReduceOper( State *s, int rule, Node *&mem, MachNode *mach ) { 1644 assert( rule < _LAST_MACH_OPER, "called with operand rule" ); 1645 State *kid = s->_kids[0]; 1646 assert( kid == NULL || s->_leaf->in(0) == NULL, "internal operands have no control" ); 1647 1648 // Leaf? And not subsumed? 1649 if( kid == NULL && !_swallowed[rule] ) { 1650 mach->add_req( s->_leaf ); // Add leaf pointer 1651 return; // Bail out 1652 } 1653 1654 if( s->_leaf->is_Load() ) { 1655 assert( mem == (Node*)1, "multiple Memories being matched at once?" ); 1656 mem = s->_leaf->in(MemNode::Memory); 1657 debug_only(_mem_node = s->_leaf;) 1658 } 1659 if( s->_leaf->in(0) && s->_leaf->req() > 1) { 1660 if( !mach->in(0) ) 1661 mach->set_req(0,s->_leaf->in(0)); 1662 else { 1663 assert( s->_leaf->in(0) == mach->in(0), "same instruction, differing controls?" ); 1664 } 1665 } 1666 1667 for( uint i=0; kid != NULL && i<2; kid = s->_kids[1], i++ ) { // binary tree 1668 int newrule; 1669 if( i == 0 ) 1670 newrule = kid->_rule[_leftOp[rule]]; 1671 else 1672 newrule = kid->_rule[_rightOp[rule]]; 1673 1674 if( newrule < _LAST_MACH_OPER ) { // Operand or instruction? 1675 // Internal operand; recurse but do nothing else 1676 ReduceOper( kid, newrule, mem, mach ); 1677 1678 } else { // Child is a new instruction 1679 // Reduce the instruction, and add a direct pointer from this 1680 // machine instruction to the newly reduced one. 1681 Node *mem1 = (Node*)1; 1682 debug_only(Node *save_mem_node = _mem_node;) 1683 mach->add_req( ReduceInst( kid, newrule, mem1 ) ); 1684 debug_only(_mem_node = save_mem_node;) 1685 } 1686 } 1687} 1688 1689 1690// ------------------------------------------------------------------------- 1691// Java-Java calling convention 1692// (what you use when Java calls Java) 1693 1694//------------------------------find_receiver---------------------------------- 1695// For a given signature, return the OptoReg for parameter 0. 1696OptoReg::Name Matcher::find_receiver( bool is_outgoing ) { 1697 VMRegPair regs; 1698 BasicType sig_bt = T_OBJECT; 1699 calling_convention(&sig_bt, ®s, 1, is_outgoing); 1700 // Return argument 0 register. In the LP64 build pointers 1701 // take 2 registers, but the VM wants only the 'main' name. 1702 return OptoReg::as_OptoReg(regs.first()); 1703} 1704 1705// A method-klass-holder may be passed in the inline_cache_reg 1706// and then expanded into the inline_cache_reg and a method_oop register 1707// defined in ad_<arch>.cpp 1708 1709 1710//------------------------------find_shared------------------------------------ 1711// Set bits if Node is shared or otherwise a root 1712void Matcher::find_shared( Node *n ) { 1713 // Allocate stack of size C->unique() * 2 to avoid frequent realloc 1714 MStack mstack(C->unique() * 2); 1715 // Mark nodes as address_visited if they are inputs to an address expression 1716 VectorSet address_visited(Thread::current()->resource_area()); 1717 mstack.push(n, Visit); // Don't need to pre-visit root node 1718 while (mstack.is_nonempty()) { 1719 n = mstack.node(); // Leave node on stack 1720 Node_State nstate = mstack.state(); 1721 uint nop = n->Opcode(); 1722 if (nstate == Pre_Visit) { 1723 if (address_visited.test(n->_idx)) { // Visited in address already? 1724 // Flag as visited and shared now. 1725 set_visited(n); 1726 } 1727 if (is_visited(n)) { // Visited already? 1728 // Node is shared and has no reason to clone. Flag it as shared. 1729 // This causes it to match into a register for the sharing. 1730 set_shared(n); // Flag as shared and 1731 mstack.pop(); // remove node from stack 1732 continue; 1733 } 1734 nstate = Visit; // Not already visited; so visit now 1735 } 1736 if (nstate == Visit) { 1737 mstack.set_state(Post_Visit); 1738 set_visited(n); // Flag as visited now 1739 bool mem_op = false; 1740 1741 switch( nop ) { // Handle some opcodes special 1742 case Op_Phi: // Treat Phis as shared roots 1743 case Op_Parm: 1744 case Op_Proj: // All handled specially during matching 1745 case Op_SafePointScalarObject: 1746 set_shared(n); 1747 set_dontcare(n); 1748 break; 1749 case Op_If: 1750 case Op_CountedLoopEnd: 1751 mstack.set_state(Alt_Post_Visit); // Alternative way 1752 // Convert (If (Bool (CmpX A B))) into (If (Bool) (CmpX A B)). Helps 1753 // with matching cmp/branch in 1 instruction. The Matcher needs the 1754 // Bool and CmpX side-by-side, because it can only get at constants 1755 // that are at the leaves of Match trees, and the Bool's condition acts 1756 // as a constant here. 1757 mstack.push(n->in(1), Visit); // Clone the Bool 1758 mstack.push(n->in(0), Pre_Visit); // Visit control input 1759 continue; // while (mstack.is_nonempty()) 1760 case Op_ConvI2D: // These forms efficiently match with a prior 1761 case Op_ConvI2F: // Load but not a following Store 1762 if( n->in(1)->is_Load() && // Prior load 1763 n->outcnt() == 1 && // Not already shared 1764 n->unique_out()->is_Store() ) // Following store 1765 set_shared(n); // Force it to be a root 1766 break; 1767 case Op_ReverseBytesI: 1768 case Op_ReverseBytesL: 1769 if( n->in(1)->is_Load() && // Prior load 1770 n->outcnt() == 1 ) // Not already shared 1771 set_shared(n); // Force it to be a root 1772 break; 1773 case Op_BoxLock: // Cant match until we get stack-regs in ADLC 1774 case Op_IfFalse: 1775 case Op_IfTrue: 1776 case Op_MachProj: 1777 case Op_MergeMem: 1778 case Op_Catch: 1779 case Op_CatchProj: 1780 case Op_CProj: 1781 case Op_JumpProj: 1782 case Op_JProj: 1783 case Op_NeverBranch: 1784 set_dontcare(n); 1785 break; 1786 case Op_Jump: 1787 mstack.push(n->in(1), Visit); // Switch Value 1788 mstack.push(n->in(0), Pre_Visit); // Visit Control input 1789 continue; // while (mstack.is_nonempty()) 1790 case Op_StrComp: 1791 case Op_AryEq: 1792 set_shared(n); // Force result into register (it will be anyways) 1793 break; 1794 case Op_ConP: { // Convert pointers above the centerline to NUL 1795 TypeNode *tn = n->as_Type(); // Constants derive from type nodes 1796 const TypePtr* tp = tn->type()->is_ptr(); 1797 if (tp->_ptr == TypePtr::AnyNull) { 1798 tn->set_type(TypePtr::NULL_PTR); 1799 } 1800 break; 1801 } 1802 case Op_ConN: { // Convert narrow pointers above the centerline to NUL 1803 TypeNode *tn = n->as_Type(); // Constants derive from type nodes 1804 const TypePtr* tp = tn->type()->make_ptr(); 1805 if (tp && tp->_ptr == TypePtr::AnyNull) { 1806 tn->set_type(TypeNarrowOop::NULL_PTR); 1807 } 1808 break; 1809 } 1810 case Op_Binary: // These are introduced in the Post_Visit state. 1811 ShouldNotReachHere(); 1812 break; 1813 case Op_StoreB: // Do match these, despite no ideal reg 1814 case Op_StoreC: 1815 case Op_StoreCM: 1816 case Op_StoreD: 1817 case Op_StoreF: 1818 case Op_StoreI: 1819 case Op_StoreL: 1820 case Op_StoreP: 1821 case Op_StoreN: 1822 case Op_Store16B: 1823 case Op_Store8B: 1824 case Op_Store4B: 1825 case Op_Store8C: 1826 case Op_Store4C: 1827 case Op_Store2C: 1828 case Op_Store4I: 1829 case Op_Store2I: 1830 case Op_Store2L: 1831 case Op_Store4F: 1832 case Op_Store2F: 1833 case Op_Store2D: 1834 case Op_ClearArray: 1835 case Op_SafePoint: 1836 mem_op = true; 1837 break; 1838 case Op_LoadB: 1839 case Op_LoadUS: 1840 case Op_LoadD: 1841 case Op_LoadF: 1842 case Op_LoadI: 1843 case Op_LoadKlass: 1844 case Op_LoadNKlass: 1845 case Op_LoadL: 1846 case Op_LoadS: 1847 case Op_LoadP: 1848 case Op_LoadN: 1849 case Op_LoadRange: 1850 case Op_LoadD_unaligned: 1851 case Op_LoadL_unaligned: 1852 case Op_Load16B: 1853 case Op_Load8B: 1854 case Op_Load4B: 1855 case Op_Load4C: 1856 case Op_Load2C: 1857 case Op_Load8C: 1858 case Op_Load8S: 1859 case Op_Load4S: 1860 case Op_Load2S: 1861 case Op_Load4I: 1862 case Op_Load2I: 1863 case Op_Load2L: 1864 case Op_Load4F: 1865 case Op_Load2F: 1866 case Op_Load2D: 1867 mem_op = true; 1868 // Must be root of match tree due to prior load conflict 1869 if( C->subsume_loads() == false ) { 1870 set_shared(n); 1871 } 1872 // Fall into default case 1873 default: 1874 if( !n->ideal_reg() ) 1875 set_dontcare(n); // Unmatchable Nodes 1876 } // end_switch 1877 1878 for(int i = n->req() - 1; i >= 0; --i) { // For my children 1879 Node *m = n->in(i); // Get ith input 1880 if (m == NULL) continue; // Ignore NULLs 1881 uint mop = m->Opcode(); 1882 1883 // Must clone all producers of flags, or we will not match correctly. 1884 // Suppose a compare setting int-flags is shared (e.g., a switch-tree) 1885 // then it will match into an ideal Op_RegFlags. Alas, the fp-flags 1886 // are also there, so we may match a float-branch to int-flags and 1887 // expect the allocator to haul the flags from the int-side to the 1888 // fp-side. No can do. 1889 if( _must_clone[mop] ) { 1890 mstack.push(m, Visit); 1891 continue; // for(int i = ...) 1892 } 1893 1894 // Clone addressing expressions as they are "free" in most instructions 1895 if( mem_op && i == MemNode::Address && mop == Op_AddP ) { 1896 if (m->in(AddPNode::Base)->Opcode() == Op_DecodeN) { 1897 // Bases used in addresses must be shared but since 1898 // they are shared through a DecodeN they may appear 1899 // to have a single use so force sharing here. 1900 set_shared(m->in(AddPNode::Base)->in(1)); 1901 } 1902 1903 // Some inputs for address expression are not put on stack 1904 // to avoid marking them as shared and forcing them into register 1905 // if they are used only in address expressions. 1906 // But they should be marked as shared if there are other uses 1907 // besides address expressions. 1908 1909 Node *off = m->in(AddPNode::Offset); 1910 if( off->is_Con() && 1911 // When there are other uses besides address expressions 1912 // put it on stack and mark as shared. 1913 !is_visited(m) ) { 1914 address_visited.test_set(m->_idx); // Flag as address_visited 1915 Node *adr = m->in(AddPNode::Address); 1916 1917 // Intel, ARM and friends can handle 2 adds in addressing mode 1918 if( clone_shift_expressions && adr->is_AddP() && 1919 // AtomicAdd is not an addressing expression. 1920 // Cheap to find it by looking for screwy base. 1921 !adr->in(AddPNode::Base)->is_top() && 1922 // Are there other uses besides address expressions? 1923 !is_visited(adr) ) { 1924 address_visited.set(adr->_idx); // Flag as address_visited 1925 Node *shift = adr->in(AddPNode::Offset); 1926 // Check for shift by small constant as well 1927 if( shift->Opcode() == Op_LShiftX && shift->in(2)->is_Con() && 1928 shift->in(2)->get_int() <= 3 && 1929 // Are there other uses besides address expressions? 1930 !is_visited(shift) ) { 1931 address_visited.set(shift->_idx); // Flag as address_visited 1932 mstack.push(shift->in(2), Visit); 1933 Node *conv = shift->in(1); 1934#ifdef _LP64 1935 // Allow Matcher to match the rule which bypass 1936 // ConvI2L operation for an array index on LP64 1937 // if the index value is positive. 1938 if( conv->Opcode() == Op_ConvI2L && 1939 conv->as_Type()->type()->is_long()->_lo >= 0 && 1940 // Are there other uses besides address expressions? 1941 !is_visited(conv) ) { 1942 address_visited.set(conv->_idx); // Flag as address_visited 1943 mstack.push(conv->in(1), Pre_Visit); 1944 } else 1945#endif 1946 mstack.push(conv, Pre_Visit); 1947 } else { 1948 mstack.push(shift, Pre_Visit); 1949 } 1950 mstack.push(adr->in(AddPNode::Address), Pre_Visit); 1951 mstack.push(adr->in(AddPNode::Base), Pre_Visit); 1952 } else { // Sparc, Alpha, PPC and friends 1953 mstack.push(adr, Pre_Visit); 1954 } 1955 1956 // Clone X+offset as it also folds into most addressing expressions 1957 mstack.push(off, Visit); 1958 mstack.push(m->in(AddPNode::Base), Pre_Visit); 1959 continue; // for(int i = ...) 1960 } // if( off->is_Con() ) 1961 } // if( mem_op && 1962 mstack.push(m, Pre_Visit); 1963 } // for(int i = ...) 1964 } 1965 else if (nstate == Alt_Post_Visit) { 1966 mstack.pop(); // Remove node from stack 1967 // We cannot remove the Cmp input from the Bool here, as the Bool may be 1968 // shared and all users of the Bool need to move the Cmp in parallel. 1969 // This leaves both the Bool and the If pointing at the Cmp. To 1970 // prevent the Matcher from trying to Match the Cmp along both paths 1971 // BoolNode::match_edge always returns a zero. 1972 1973 // We reorder the Op_If in a pre-order manner, so we can visit without 1974 // accidentally sharing the Cmp (the Bool and the If make 2 users). 1975 n->add_req( n->in(1)->in(1) ); // Add the Cmp next to the Bool 1976 } 1977 else if (nstate == Post_Visit) { 1978 mstack.pop(); // Remove node from stack 1979 1980 // Now hack a few special opcodes 1981 switch( n->Opcode() ) { // Handle some opcodes special 1982 case Op_StorePConditional: 1983 case Op_StoreIConditional: 1984 case Op_StoreLConditional: 1985 case Op_CompareAndSwapI: 1986 case Op_CompareAndSwapL: 1987 case Op_CompareAndSwapP: 1988 case Op_CompareAndSwapN: { // Convert trinary to binary-tree 1989 Node *newval = n->in(MemNode::ValueIn ); 1990 Node *oldval = n->in(LoadStoreNode::ExpectedIn); 1991 Node *pair = new (C, 3) BinaryNode( oldval, newval ); 1992 n->set_req(MemNode::ValueIn,pair); 1993 n->del_req(LoadStoreNode::ExpectedIn); 1994 break; 1995 } 1996 case Op_CMoveD: // Convert trinary to binary-tree 1997 case Op_CMoveF: 1998 case Op_CMoveI: 1999 case Op_CMoveL: 2000 case Op_CMoveN: 2001 case Op_CMoveP: { 2002 // Restructure into a binary tree for Matching. It's possible that 2003 // we could move this code up next to the graph reshaping for IfNodes 2004 // or vice-versa, but I do not want to debug this for Ladybird. 2005 // 10/2/2000 CNC. 2006 Node *pair1 = new (C, 3) BinaryNode(n->in(1),n->in(1)->in(1)); 2007 n->set_req(1,pair1); 2008 Node *pair2 = new (C, 3) BinaryNode(n->in(2),n->in(3)); 2009 n->set_req(2,pair2); 2010 n->del_req(3); 2011 break; 2012 } 2013 default: 2014 break; 2015 } 2016 } 2017 else { 2018 ShouldNotReachHere(); 2019 } 2020 } // end of while (mstack.is_nonempty()) 2021} 2022 2023#ifdef ASSERT 2024// machine-independent root to machine-dependent root 2025void Matcher::dump_old2new_map() { 2026 _old2new_map.dump(); 2027} 2028#endif 2029 2030//---------------------------collect_null_checks------------------------------- 2031// Find null checks in the ideal graph; write a machine-specific node for 2032// it. Used by later implicit-null-check handling. Actually collects 2033// either an IfTrue or IfFalse for the common NOT-null path, AND the ideal 2034// value being tested. 2035void Matcher::collect_null_checks( Node *proj, Node *orig_proj ) { 2036 Node *iff = proj->in(0); 2037 if( iff->Opcode() == Op_If ) { 2038 // During matching If's have Bool & Cmp side-by-side 2039 BoolNode *b = iff->in(1)->as_Bool(); 2040 Node *cmp = iff->in(2); 2041 int opc = cmp->Opcode(); 2042 if (opc != Op_CmpP && opc != Op_CmpN) return; 2043 2044 const Type* ct = cmp->in(2)->bottom_type(); 2045 if (ct == TypePtr::NULL_PTR || 2046 (opc == Op_CmpN && ct == TypeNarrowOop::NULL_PTR)) { 2047 2048 bool push_it = false; 2049 if( proj->Opcode() == Op_IfTrue ) { 2050 extern int all_null_checks_found; 2051 all_null_checks_found++; 2052 if( b->_test._test == BoolTest::ne ) { 2053 push_it = true; 2054 } 2055 } else { 2056 assert( proj->Opcode() == Op_IfFalse, "" ); 2057 if( b->_test._test == BoolTest::eq ) { 2058 push_it = true; 2059 } 2060 } 2061 if( push_it ) { 2062 _null_check_tests.push(proj); 2063 Node* val = cmp->in(1); 2064#ifdef _LP64 2065 if (UseCompressedOops && !Matcher::clone_shift_expressions && 2066 val->bottom_type()->isa_narrowoop()) { 2067 // 2068 // Look for DecodeN node which should be pinned to orig_proj. 2069 // On platforms (Sparc) which can not handle 2 adds 2070 // in addressing mode we have to keep a DecodeN node and 2071 // use it to do implicit NULL check in address. 2072 // 2073 // DecodeN node was pinned to non-null path (orig_proj) during 2074 // CastPP transformation in final_graph_reshaping_impl(). 2075 // 2076 uint cnt = orig_proj->outcnt(); 2077 for (uint i = 0; i < orig_proj->outcnt(); i++) { 2078 Node* d = orig_proj->raw_out(i); 2079 if (d->is_DecodeN() && d->in(1) == val) { 2080 val = d; 2081 val->set_req(0, NULL); // Unpin now. 2082 break; 2083 } 2084 } 2085 } 2086#endif 2087 _null_check_tests.push(val); 2088 } 2089 } 2090 } 2091} 2092 2093//---------------------------validate_null_checks------------------------------ 2094// Its possible that the value being NULL checked is not the root of a match 2095// tree. If so, I cannot use the value in an implicit null check. 2096void Matcher::validate_null_checks( ) { 2097 uint cnt = _null_check_tests.size(); 2098 for( uint i=0; i < cnt; i+=2 ) { 2099 Node *test = _null_check_tests[i]; 2100 Node *val = _null_check_tests[i+1]; 2101 if (has_new_node(val)) { 2102 // Is a match-tree root, so replace with the matched value 2103 _null_check_tests.map(i+1, new_node(val)); 2104 } else { 2105 // Yank from candidate list 2106 _null_check_tests.map(i+1,_null_check_tests[--cnt]); 2107 _null_check_tests.map(i,_null_check_tests[--cnt]); 2108 _null_check_tests.pop(); 2109 _null_check_tests.pop(); 2110 i-=2; 2111 } 2112 } 2113} 2114 2115 2116// Used by the DFA in dfa_sparc.cpp. Check for a prior FastLock 2117// acting as an Acquire and thus we don't need an Acquire here. We 2118// retain the Node to act as a compiler ordering barrier. 2119bool Matcher::prior_fast_lock( const Node *acq ) { 2120 Node *r = acq->in(0); 2121 if( !r->is_Region() || r->req() <= 1 ) return false; 2122 Node *proj = r->in(1); 2123 if( !proj->is_Proj() ) return false; 2124 Node *call = proj->in(0); 2125 if( !call->is_Call() || call->as_Call()->entry_point() != OptoRuntime::complete_monitor_locking_Java() ) 2126 return false; 2127 2128 return true; 2129} 2130 2131// Used by the DFA in dfa_sparc.cpp. Check for a following FastUnLock 2132// acting as a Release and thus we don't need a Release here. We 2133// retain the Node to act as a compiler ordering barrier. 2134bool Matcher::post_fast_unlock( const Node *rel ) { 2135 Compile *C = Compile::current(); 2136 assert( rel->Opcode() == Op_MemBarRelease, "" ); 2137 const MemBarReleaseNode *mem = (const MemBarReleaseNode*)rel; 2138 DUIterator_Fast imax, i = mem->fast_outs(imax); 2139 Node *ctrl = NULL; 2140 while( true ) { 2141 ctrl = mem->fast_out(i); // Throw out-of-bounds if proj not found 2142 assert( ctrl->is_Proj(), "only projections here" ); 2143 ProjNode *proj = (ProjNode*)ctrl; 2144 if( proj->_con == TypeFunc::Control && 2145 !C->node_arena()->contains(ctrl) ) // Unmatched old-space only 2146 break; 2147 i++; 2148 } 2149 Node *iff = NULL; 2150 for( DUIterator_Fast jmax, j = ctrl->fast_outs(jmax); j < jmax; j++ ) { 2151 Node *x = ctrl->fast_out(j); 2152 if( x->is_If() && x->req() > 1 && 2153 !C->node_arena()->contains(x) ) { // Unmatched old-space only 2154 iff = x; 2155 break; 2156 } 2157 } 2158 if( !iff ) return false; 2159 Node *bol = iff->in(1); 2160 // The iff might be some random subclass of If or bol might be Con-Top 2161 if (!bol->is_Bool()) return false; 2162 assert( bol->req() > 1, "" ); 2163 return (bol->in(1)->Opcode() == Op_FastUnlock); 2164} 2165 2166// Used by the DFA in dfa_xxx.cpp. Check for a following barrier or 2167// atomic instruction acting as a store_load barrier without any 2168// intervening volatile load, and thus we don't need a barrier here. 2169// We retain the Node to act as a compiler ordering barrier. 2170bool Matcher::post_store_load_barrier(const Node *vmb) { 2171 Compile *C = Compile::current(); 2172 assert( vmb->is_MemBar(), "" ); 2173 assert( vmb->Opcode() != Op_MemBarAcquire, "" ); 2174 const MemBarNode *mem = (const MemBarNode*)vmb; 2175 2176 // Get the Proj node, ctrl, that can be used to iterate forward 2177 Node *ctrl = NULL; 2178 DUIterator_Fast imax, i = mem->fast_outs(imax); 2179 while( true ) { 2180 ctrl = mem->fast_out(i); // Throw out-of-bounds if proj not found 2181 assert( ctrl->is_Proj(), "only projections here" ); 2182 ProjNode *proj = (ProjNode*)ctrl; 2183 if( proj->_con == TypeFunc::Control && 2184 !C->node_arena()->contains(ctrl) ) // Unmatched old-space only 2185 break; 2186 i++; 2187 } 2188 2189 for( DUIterator_Fast jmax, j = ctrl->fast_outs(jmax); j < jmax; j++ ) { 2190 Node *x = ctrl->fast_out(j); 2191 int xop = x->Opcode(); 2192 2193 // We don't need current barrier if we see another or a lock 2194 // before seeing volatile load. 2195 // 2196 // Op_Fastunlock previously appeared in the Op_* list below. 2197 // With the advent of 1-0 lock operations we're no longer guaranteed 2198 // that a monitor exit operation contains a serializing instruction. 2199 2200 if (xop == Op_MemBarVolatile || 2201 xop == Op_FastLock || 2202 xop == Op_CompareAndSwapL || 2203 xop == Op_CompareAndSwapP || 2204 xop == Op_CompareAndSwapN || 2205 xop == Op_CompareAndSwapI) 2206 return true; 2207 2208 if (x->is_MemBar()) { 2209 // We must retain this membar if there is an upcoming volatile 2210 // load, which will be preceded by acquire membar. 2211 if (xop == Op_MemBarAcquire) 2212 return false; 2213 // For other kinds of barriers, check by pretending we 2214 // are them, and seeing if we can be removed. 2215 else 2216 return post_store_load_barrier((const MemBarNode*)x); 2217 } 2218 2219 // Delicate code to detect case of an upcoming fastlock block 2220 if( x->is_If() && x->req() > 1 && 2221 !C->node_arena()->contains(x) ) { // Unmatched old-space only 2222 Node *iff = x; 2223 Node *bol = iff->in(1); 2224 // The iff might be some random subclass of If or bol might be Con-Top 2225 if (!bol->is_Bool()) return false; 2226 assert( bol->req() > 1, "" ); 2227 return (bol->in(1)->Opcode() == Op_FastUnlock); 2228 } 2229 // probably not necessary to check for these 2230 if (x->is_Call() || x->is_SafePoint() || x->is_block_proj()) 2231 return false; 2232 } 2233 return false; 2234} 2235 2236//============================================================================= 2237//---------------------------State--------------------------------------------- 2238State::State(void) { 2239#ifdef ASSERT 2240 _id = 0; 2241 _kids[0] = _kids[1] = (State*)(intptr_t) CONST64(0xcafebabecafebabe); 2242 _leaf = (Node*)(intptr_t) CONST64(0xbaadf00dbaadf00d); 2243 //memset(_cost, -1, sizeof(_cost)); 2244 //memset(_rule, -1, sizeof(_rule)); 2245#endif 2246 memset(_valid, 0, sizeof(_valid)); 2247} 2248 2249#ifdef ASSERT 2250State::~State() { 2251 _id = 99; 2252 _kids[0] = _kids[1] = (State*)(intptr_t) CONST64(0xcafebabecafebabe); 2253 _leaf = (Node*)(intptr_t) CONST64(0xbaadf00dbaadf00d); 2254 memset(_cost, -3, sizeof(_cost)); 2255 memset(_rule, -3, sizeof(_rule)); 2256} 2257#endif 2258 2259#ifndef PRODUCT 2260//---------------------------dump---------------------------------------------- 2261void State::dump() { 2262 tty->print("\n"); 2263 dump(0); 2264} 2265 2266void State::dump(int depth) { 2267 for( int j = 0; j < depth; j++ ) 2268 tty->print(" "); 2269 tty->print("--N: "); 2270 _leaf->dump(); 2271 uint i; 2272 for( i = 0; i < _LAST_MACH_OPER; i++ ) 2273 // Check for valid entry 2274 if( valid(i) ) { 2275 for( int j = 0; j < depth; j++ ) 2276 tty->print(" "); 2277 assert(_cost[i] != max_juint, "cost must be a valid value"); 2278 assert(_rule[i] < _last_Mach_Node, "rule[i] must be valid rule"); 2279 tty->print_cr("%s %d %s", 2280 ruleName[i], _cost[i], ruleName[_rule[i]] ); 2281 } 2282 tty->print_cr(""); 2283 2284 for( i=0; i<2; i++ ) 2285 if( _kids[i] ) 2286 _kids[i]->dump(depth+1); 2287} 2288#endif 2289