Thu, 06 Mar 2008 10:30:17 -0800
6667610: (Escape Analysis) retry compilation without EA if it fails
Summary: During split unique types EA could exceed nodes limit and fail the method compilation.
Reviewed-by: rasbold
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved. |
duke@435 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
duke@435 | 4 | * |
duke@435 | 5 | * This code is free software; you can redistribute it and/or modify it |
duke@435 | 6 | * under the terms of the GNU General Public License version 2 only, as |
duke@435 | 7 | * published by the Free Software Foundation. |
duke@435 | 8 | * |
duke@435 | 9 | * This code is distributed in the hope that it will be useful, but WITHOUT |
duke@435 | 10 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
duke@435 | 11 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
duke@435 | 12 | * version 2 for more details (a copy is included in the LICENSE file that |
duke@435 | 13 | * accompanied this code). |
duke@435 | 14 | * |
duke@435 | 15 | * You should have received a copy of the GNU General Public License version |
duke@435 | 16 | * 2 along with this work; if not, write to the Free Software Foundation, |
duke@435 | 17 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
duke@435 | 18 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | // Portions of code courtesy of Clifford Click |
duke@435 | 26 | |
duke@435 | 27 | // Optimization - Graph Style |
duke@435 | 28 | |
duke@435 | 29 | #include "incls/_precompiled.incl" |
duke@435 | 30 | #include "incls/_callnode.cpp.incl" |
duke@435 | 31 | |
duke@435 | 32 | //============================================================================= |
duke@435 | 33 | uint StartNode::size_of() const { return sizeof(*this); } |
duke@435 | 34 | uint StartNode::cmp( const Node &n ) const |
duke@435 | 35 | { return _domain == ((StartNode&)n)._domain; } |
duke@435 | 36 | const Type *StartNode::bottom_type() const { return _domain; } |
duke@435 | 37 | const Type *StartNode::Value(PhaseTransform *phase) const { return _domain; } |
duke@435 | 38 | #ifndef PRODUCT |
duke@435 | 39 | void StartNode::dump_spec(outputStream *st) const { st->print(" #"); _domain->dump_on(st);} |
duke@435 | 40 | #endif |
duke@435 | 41 | |
duke@435 | 42 | //------------------------------Ideal------------------------------------------ |
duke@435 | 43 | Node *StartNode::Ideal(PhaseGVN *phase, bool can_reshape){ |
duke@435 | 44 | return remove_dead_region(phase, can_reshape) ? this : NULL; |
duke@435 | 45 | } |
duke@435 | 46 | |
duke@435 | 47 | //------------------------------calling_convention----------------------------- |
duke@435 | 48 | void StartNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { |
duke@435 | 49 | Matcher::calling_convention( sig_bt, parm_regs, argcnt, false ); |
duke@435 | 50 | } |
duke@435 | 51 | |
duke@435 | 52 | //------------------------------Registers-------------------------------------- |
duke@435 | 53 | const RegMask &StartNode::in_RegMask(uint) const { |
duke@435 | 54 | return RegMask::Empty; |
duke@435 | 55 | } |
duke@435 | 56 | |
duke@435 | 57 | //------------------------------match------------------------------------------ |
duke@435 | 58 | // Construct projections for incoming parameters, and their RegMask info |
duke@435 | 59 | Node *StartNode::match( const ProjNode *proj, const Matcher *match ) { |
duke@435 | 60 | switch (proj->_con) { |
duke@435 | 61 | case TypeFunc::Control: |
duke@435 | 62 | case TypeFunc::I_O: |
duke@435 | 63 | case TypeFunc::Memory: |
duke@435 | 64 | return new (match->C, 1) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj); |
duke@435 | 65 | case TypeFunc::FramePtr: |
duke@435 | 66 | return new (match->C, 1) MachProjNode(this,proj->_con,Matcher::c_frame_ptr_mask, Op_RegP); |
duke@435 | 67 | case TypeFunc::ReturnAdr: |
duke@435 | 68 | return new (match->C, 1) MachProjNode(this,proj->_con,match->_return_addr_mask,Op_RegP); |
duke@435 | 69 | case TypeFunc::Parms: |
duke@435 | 70 | default: { |
duke@435 | 71 | uint parm_num = proj->_con - TypeFunc::Parms; |
duke@435 | 72 | const Type *t = _domain->field_at(proj->_con); |
duke@435 | 73 | if (t->base() == Type::Half) // 2nd half of Longs and Doubles |
duke@435 | 74 | return new (match->C, 1) ConNode(Type::TOP); |
duke@435 | 75 | uint ideal_reg = Matcher::base2reg[t->base()]; |
duke@435 | 76 | RegMask &rm = match->_calling_convention_mask[parm_num]; |
duke@435 | 77 | return new (match->C, 1) MachProjNode(this,proj->_con,rm,ideal_reg); |
duke@435 | 78 | } |
duke@435 | 79 | } |
duke@435 | 80 | return NULL; |
duke@435 | 81 | } |
duke@435 | 82 | |
duke@435 | 83 | //------------------------------StartOSRNode---------------------------------- |
duke@435 | 84 | // The method start node for an on stack replacement adapter |
duke@435 | 85 | |
duke@435 | 86 | //------------------------------osr_domain----------------------------- |
duke@435 | 87 | const TypeTuple *StartOSRNode::osr_domain() { |
duke@435 | 88 | const Type **fields = TypeTuple::fields(2); |
duke@435 | 89 | fields[TypeFunc::Parms+0] = TypeRawPtr::BOTTOM; // address of osr buffer |
duke@435 | 90 | |
duke@435 | 91 | return TypeTuple::make(TypeFunc::Parms+1, fields); |
duke@435 | 92 | } |
duke@435 | 93 | |
duke@435 | 94 | //============================================================================= |
duke@435 | 95 | const char * const ParmNode::names[TypeFunc::Parms+1] = { |
duke@435 | 96 | "Control", "I_O", "Memory", "FramePtr", "ReturnAdr", "Parms" |
duke@435 | 97 | }; |
duke@435 | 98 | |
duke@435 | 99 | #ifndef PRODUCT |
duke@435 | 100 | void ParmNode::dump_spec(outputStream *st) const { |
duke@435 | 101 | if( _con < TypeFunc::Parms ) { |
duke@435 | 102 | st->print(names[_con]); |
duke@435 | 103 | } else { |
duke@435 | 104 | st->print("Parm%d: ",_con-TypeFunc::Parms); |
duke@435 | 105 | // Verbose and WizardMode dump bottom_type for all nodes |
duke@435 | 106 | if( !Verbose && !WizardMode ) bottom_type()->dump_on(st); |
duke@435 | 107 | } |
duke@435 | 108 | } |
duke@435 | 109 | #endif |
duke@435 | 110 | |
duke@435 | 111 | uint ParmNode::ideal_reg() const { |
duke@435 | 112 | switch( _con ) { |
duke@435 | 113 | case TypeFunc::Control : // fall through |
duke@435 | 114 | case TypeFunc::I_O : // fall through |
duke@435 | 115 | case TypeFunc::Memory : return 0; |
duke@435 | 116 | case TypeFunc::FramePtr : // fall through |
duke@435 | 117 | case TypeFunc::ReturnAdr: return Op_RegP; |
duke@435 | 118 | default : assert( _con > TypeFunc::Parms, "" ); |
duke@435 | 119 | // fall through |
duke@435 | 120 | case TypeFunc::Parms : { |
duke@435 | 121 | // Type of argument being passed |
duke@435 | 122 | const Type *t = in(0)->as_Start()->_domain->field_at(_con); |
duke@435 | 123 | return Matcher::base2reg[t->base()]; |
duke@435 | 124 | } |
duke@435 | 125 | } |
duke@435 | 126 | ShouldNotReachHere(); |
duke@435 | 127 | return 0; |
duke@435 | 128 | } |
duke@435 | 129 | |
duke@435 | 130 | //============================================================================= |
duke@435 | 131 | ReturnNode::ReturnNode(uint edges, Node *cntrl, Node *i_o, Node *memory, Node *frameptr, Node *retadr ) : Node(edges) { |
duke@435 | 132 | init_req(TypeFunc::Control,cntrl); |
duke@435 | 133 | init_req(TypeFunc::I_O,i_o); |
duke@435 | 134 | init_req(TypeFunc::Memory,memory); |
duke@435 | 135 | init_req(TypeFunc::FramePtr,frameptr); |
duke@435 | 136 | init_req(TypeFunc::ReturnAdr,retadr); |
duke@435 | 137 | } |
duke@435 | 138 | |
duke@435 | 139 | Node *ReturnNode::Ideal(PhaseGVN *phase, bool can_reshape){ |
duke@435 | 140 | return remove_dead_region(phase, can_reshape) ? this : NULL; |
duke@435 | 141 | } |
duke@435 | 142 | |
duke@435 | 143 | const Type *ReturnNode::Value( PhaseTransform *phase ) const { |
duke@435 | 144 | return ( phase->type(in(TypeFunc::Control)) == Type::TOP) |
duke@435 | 145 | ? Type::TOP |
duke@435 | 146 | : Type::BOTTOM; |
duke@435 | 147 | } |
duke@435 | 148 | |
duke@435 | 149 | // Do we Match on this edge index or not? No edges on return nodes |
duke@435 | 150 | uint ReturnNode::match_edge(uint idx) const { |
duke@435 | 151 | return 0; |
duke@435 | 152 | } |
duke@435 | 153 | |
duke@435 | 154 | |
duke@435 | 155 | #ifndef PRODUCT |
duke@435 | 156 | void ReturnNode::dump_req() const { |
duke@435 | 157 | // Dump the required inputs, enclosed in '(' and ')' |
duke@435 | 158 | uint i; // Exit value of loop |
duke@435 | 159 | for( i=0; i<req(); i++ ) { // For all required inputs |
duke@435 | 160 | if( i == TypeFunc::Parms ) tty->print("returns"); |
duke@435 | 161 | if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); |
duke@435 | 162 | else tty->print("_ "); |
duke@435 | 163 | } |
duke@435 | 164 | } |
duke@435 | 165 | #endif |
duke@435 | 166 | |
duke@435 | 167 | //============================================================================= |
duke@435 | 168 | RethrowNode::RethrowNode( |
duke@435 | 169 | Node* cntrl, |
duke@435 | 170 | Node* i_o, |
duke@435 | 171 | Node* memory, |
duke@435 | 172 | Node* frameptr, |
duke@435 | 173 | Node* ret_adr, |
duke@435 | 174 | Node* exception |
duke@435 | 175 | ) : Node(TypeFunc::Parms + 1) { |
duke@435 | 176 | init_req(TypeFunc::Control , cntrl ); |
duke@435 | 177 | init_req(TypeFunc::I_O , i_o ); |
duke@435 | 178 | init_req(TypeFunc::Memory , memory ); |
duke@435 | 179 | init_req(TypeFunc::FramePtr , frameptr ); |
duke@435 | 180 | init_req(TypeFunc::ReturnAdr, ret_adr); |
duke@435 | 181 | init_req(TypeFunc::Parms , exception); |
duke@435 | 182 | } |
duke@435 | 183 | |
duke@435 | 184 | Node *RethrowNode::Ideal(PhaseGVN *phase, bool can_reshape){ |
duke@435 | 185 | return remove_dead_region(phase, can_reshape) ? this : NULL; |
duke@435 | 186 | } |
duke@435 | 187 | |
duke@435 | 188 | const Type *RethrowNode::Value( PhaseTransform *phase ) const { |
duke@435 | 189 | return (phase->type(in(TypeFunc::Control)) == Type::TOP) |
duke@435 | 190 | ? Type::TOP |
duke@435 | 191 | : Type::BOTTOM; |
duke@435 | 192 | } |
duke@435 | 193 | |
duke@435 | 194 | uint RethrowNode::match_edge(uint idx) const { |
duke@435 | 195 | return 0; |
duke@435 | 196 | } |
duke@435 | 197 | |
duke@435 | 198 | #ifndef PRODUCT |
duke@435 | 199 | void RethrowNode::dump_req() const { |
duke@435 | 200 | // Dump the required inputs, enclosed in '(' and ')' |
duke@435 | 201 | uint i; // Exit value of loop |
duke@435 | 202 | for( i=0; i<req(); i++ ) { // For all required inputs |
duke@435 | 203 | if( i == TypeFunc::Parms ) tty->print("exception"); |
duke@435 | 204 | if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); |
duke@435 | 205 | else tty->print("_ "); |
duke@435 | 206 | } |
duke@435 | 207 | } |
duke@435 | 208 | #endif |
duke@435 | 209 | |
duke@435 | 210 | //============================================================================= |
duke@435 | 211 | // Do we Match on this edge index or not? Match only target address & method |
duke@435 | 212 | uint TailCallNode::match_edge(uint idx) const { |
duke@435 | 213 | return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1; |
duke@435 | 214 | } |
duke@435 | 215 | |
duke@435 | 216 | //============================================================================= |
duke@435 | 217 | // Do we Match on this edge index or not? Match only target address & oop |
duke@435 | 218 | uint TailJumpNode::match_edge(uint idx) const { |
duke@435 | 219 | return TypeFunc::Parms <= idx && idx <= TypeFunc::Parms+1; |
duke@435 | 220 | } |
duke@435 | 221 | |
duke@435 | 222 | //============================================================================= |
duke@435 | 223 | JVMState::JVMState(ciMethod* method, JVMState* caller) { |
duke@435 | 224 | assert(method != NULL, "must be valid call site"); |
duke@435 | 225 | _method = method; |
duke@435 | 226 | debug_only(_bci = -99); // random garbage value |
duke@435 | 227 | debug_only(_map = (SafePointNode*)-1); |
duke@435 | 228 | _caller = caller; |
duke@435 | 229 | _depth = 1 + (caller == NULL ? 0 : caller->depth()); |
duke@435 | 230 | _locoff = TypeFunc::Parms; |
duke@435 | 231 | _stkoff = _locoff + _method->max_locals(); |
duke@435 | 232 | _monoff = _stkoff + _method->max_stack(); |
duke@435 | 233 | _endoff = _monoff; |
duke@435 | 234 | _sp = 0; |
duke@435 | 235 | } |
duke@435 | 236 | JVMState::JVMState(int stack_size) { |
duke@435 | 237 | _method = NULL; |
duke@435 | 238 | _bci = InvocationEntryBci; |
duke@435 | 239 | debug_only(_map = (SafePointNode*)-1); |
duke@435 | 240 | _caller = NULL; |
duke@435 | 241 | _depth = 1; |
duke@435 | 242 | _locoff = TypeFunc::Parms; |
duke@435 | 243 | _stkoff = _locoff; |
duke@435 | 244 | _monoff = _stkoff + stack_size; |
duke@435 | 245 | _endoff = _monoff; |
duke@435 | 246 | _sp = 0; |
duke@435 | 247 | } |
duke@435 | 248 | |
duke@435 | 249 | //--------------------------------of_depth------------------------------------- |
duke@435 | 250 | JVMState* JVMState::of_depth(int d) const { |
duke@435 | 251 | const JVMState* jvmp = this; |
duke@435 | 252 | assert(0 < d && (uint)d <= depth(), "oob"); |
duke@435 | 253 | for (int skip = depth() - d; skip > 0; skip--) { |
duke@435 | 254 | jvmp = jvmp->caller(); |
duke@435 | 255 | } |
duke@435 | 256 | assert(jvmp->depth() == (uint)d, "found the right one"); |
duke@435 | 257 | return (JVMState*)jvmp; |
duke@435 | 258 | } |
duke@435 | 259 | |
duke@435 | 260 | //-----------------------------same_calls_as----------------------------------- |
duke@435 | 261 | bool JVMState::same_calls_as(const JVMState* that) const { |
duke@435 | 262 | if (this == that) return true; |
duke@435 | 263 | if (this->depth() != that->depth()) return false; |
duke@435 | 264 | const JVMState* p = this; |
duke@435 | 265 | const JVMState* q = that; |
duke@435 | 266 | for (;;) { |
duke@435 | 267 | if (p->_method != q->_method) return false; |
duke@435 | 268 | if (p->_method == NULL) return true; // bci is irrelevant |
duke@435 | 269 | if (p->_bci != q->_bci) return false; |
duke@435 | 270 | p = p->caller(); |
duke@435 | 271 | q = q->caller(); |
duke@435 | 272 | if (p == q) return true; |
duke@435 | 273 | assert(p != NULL && q != NULL, "depth check ensures we don't run off end"); |
duke@435 | 274 | } |
duke@435 | 275 | } |
duke@435 | 276 | |
duke@435 | 277 | //------------------------------debug_start------------------------------------ |
duke@435 | 278 | uint JVMState::debug_start() const { |
duke@435 | 279 | debug_only(JVMState* jvmroot = of_depth(1)); |
duke@435 | 280 | assert(jvmroot->locoff() <= this->locoff(), "youngest JVMState must be last"); |
duke@435 | 281 | return of_depth(1)->locoff(); |
duke@435 | 282 | } |
duke@435 | 283 | |
duke@435 | 284 | //-------------------------------debug_end------------------------------------- |
duke@435 | 285 | uint JVMState::debug_end() const { |
duke@435 | 286 | debug_only(JVMState* jvmroot = of_depth(1)); |
duke@435 | 287 | assert(jvmroot->endoff() <= this->endoff(), "youngest JVMState must be last"); |
duke@435 | 288 | return endoff(); |
duke@435 | 289 | } |
duke@435 | 290 | |
duke@435 | 291 | //------------------------------debug_depth------------------------------------ |
duke@435 | 292 | uint JVMState::debug_depth() const { |
duke@435 | 293 | uint total = 0; |
duke@435 | 294 | for (const JVMState* jvmp = this; jvmp != NULL; jvmp = jvmp->caller()) { |
duke@435 | 295 | total += jvmp->debug_size(); |
duke@435 | 296 | } |
duke@435 | 297 | return total; |
duke@435 | 298 | } |
duke@435 | 299 | |
duke@435 | 300 | //------------------------------format_helper---------------------------------- |
duke@435 | 301 | // Given an allocation (a Chaitin object) and a Node decide if the Node carries |
duke@435 | 302 | // any defined value or not. If it does, print out the register or constant. |
duke@435 | 303 | #ifndef PRODUCT |
duke@435 | 304 | static void format_helper( PhaseRegAlloc *regalloc, outputStream* st, Node *n, const char *msg, uint i ) { |
duke@435 | 305 | if (n == NULL) { st->print(" NULL"); return; } |
duke@435 | 306 | if( OptoReg::is_valid(regalloc->get_reg_first(n))) { // Check for undefined |
duke@435 | 307 | char buf[50]; |
duke@435 | 308 | regalloc->dump_register(n,buf); |
duke@435 | 309 | st->print(" %s%d]=%s",msg,i,buf); |
duke@435 | 310 | } else { // No register, but might be constant |
duke@435 | 311 | const Type *t = n->bottom_type(); |
duke@435 | 312 | switch (t->base()) { |
duke@435 | 313 | case Type::Int: |
duke@435 | 314 | st->print(" %s%d]=#"INT32_FORMAT,msg,i,t->is_int()->get_con()); |
duke@435 | 315 | break; |
duke@435 | 316 | case Type::AnyPtr: |
duke@435 | 317 | assert( t == TypePtr::NULL_PTR, "" ); |
duke@435 | 318 | st->print(" %s%d]=#NULL",msg,i); |
duke@435 | 319 | break; |
duke@435 | 320 | case Type::AryPtr: |
duke@435 | 321 | case Type::KlassPtr: |
duke@435 | 322 | case Type::InstPtr: |
duke@435 | 323 | st->print(" %s%d]=#Ptr" INTPTR_FORMAT,msg,i,t->isa_oopptr()->const_oop()); |
duke@435 | 324 | break; |
duke@435 | 325 | case Type::RawPtr: |
duke@435 | 326 | st->print(" %s%d]=#Raw" INTPTR_FORMAT,msg,i,t->is_rawptr()); |
duke@435 | 327 | break; |
duke@435 | 328 | case Type::DoubleCon: |
duke@435 | 329 | st->print(" %s%d]=#%fD",msg,i,t->is_double_constant()->_d); |
duke@435 | 330 | break; |
duke@435 | 331 | case Type::FloatCon: |
duke@435 | 332 | st->print(" %s%d]=#%fF",msg,i,t->is_float_constant()->_f); |
duke@435 | 333 | break; |
duke@435 | 334 | case Type::Long: |
duke@435 | 335 | st->print(" %s%d]=#"INT64_FORMAT,msg,i,t->is_long()->get_con()); |
duke@435 | 336 | break; |
duke@435 | 337 | case Type::Half: |
duke@435 | 338 | case Type::Top: |
duke@435 | 339 | st->print(" %s%d]=_",msg,i); |
duke@435 | 340 | break; |
duke@435 | 341 | default: ShouldNotReachHere(); |
duke@435 | 342 | } |
duke@435 | 343 | } |
duke@435 | 344 | } |
duke@435 | 345 | #endif |
duke@435 | 346 | |
duke@435 | 347 | //------------------------------format----------------------------------------- |
duke@435 | 348 | #ifndef PRODUCT |
duke@435 | 349 | void JVMState::format(PhaseRegAlloc *regalloc, const Node *n, outputStream* st) const { |
duke@435 | 350 | st->print(" #"); |
duke@435 | 351 | if( _method ) { |
duke@435 | 352 | _method->print_short_name(st); |
duke@435 | 353 | st->print(" @ bci:%d ",_bci); |
duke@435 | 354 | } else { |
duke@435 | 355 | st->print_cr(" runtime stub "); |
duke@435 | 356 | return; |
duke@435 | 357 | } |
duke@435 | 358 | if (n->is_MachSafePoint()) { |
duke@435 | 359 | MachSafePointNode *mcall = n->as_MachSafePoint(); |
duke@435 | 360 | uint i; |
duke@435 | 361 | // Print locals |
duke@435 | 362 | for( i = 0; i < (uint)loc_size(); i++ ) |
duke@435 | 363 | format_helper( regalloc, st, mcall->local(this, i), "L[", i ); |
duke@435 | 364 | // Print stack |
duke@435 | 365 | for (i = 0; i < (uint)stk_size(); i++) { |
duke@435 | 366 | if ((uint)(_stkoff + i) >= mcall->len()) |
duke@435 | 367 | st->print(" oob "); |
duke@435 | 368 | else |
duke@435 | 369 | format_helper( regalloc, st, mcall->stack(this, i), "STK[", i ); |
duke@435 | 370 | } |
duke@435 | 371 | for (i = 0; (int)i < nof_monitors(); i++) { |
duke@435 | 372 | Node *box = mcall->monitor_box(this, i); |
duke@435 | 373 | Node *obj = mcall->monitor_obj(this, i); |
duke@435 | 374 | if ( OptoReg::is_valid(regalloc->get_reg_first(box)) ) { |
duke@435 | 375 | while( !box->is_BoxLock() ) box = box->in(1); |
duke@435 | 376 | format_helper( regalloc, st, box, "MON-BOX[", i ); |
duke@435 | 377 | } else { |
duke@435 | 378 | OptoReg::Name box_reg = BoxLockNode::stack_slot(box); |
duke@435 | 379 | st->print(" MON-BOX%d=%s+%d", |
duke@435 | 380 | i, |
duke@435 | 381 | OptoReg::regname(OptoReg::c_frame_pointer), |
duke@435 | 382 | regalloc->reg2offset(box_reg)); |
duke@435 | 383 | } |
duke@435 | 384 | format_helper( regalloc, st, obj, "MON-OBJ[", i ); |
duke@435 | 385 | } |
duke@435 | 386 | } |
duke@435 | 387 | st->print_cr(""); |
duke@435 | 388 | if (caller() != NULL) caller()->format(regalloc, n, st); |
duke@435 | 389 | } |
duke@435 | 390 | #endif |
duke@435 | 391 | |
duke@435 | 392 | #ifndef PRODUCT |
duke@435 | 393 | void JVMState::dump_spec(outputStream *st) const { |
duke@435 | 394 | if (_method != NULL) { |
duke@435 | 395 | bool printed = false; |
duke@435 | 396 | if (!Verbose) { |
duke@435 | 397 | // The JVMS dumps make really, really long lines. |
duke@435 | 398 | // Take out the most boring parts, which are the package prefixes. |
duke@435 | 399 | char buf[500]; |
duke@435 | 400 | stringStream namest(buf, sizeof(buf)); |
duke@435 | 401 | _method->print_short_name(&namest); |
duke@435 | 402 | if (namest.count() < sizeof(buf)) { |
duke@435 | 403 | const char* name = namest.base(); |
duke@435 | 404 | if (name[0] == ' ') ++name; |
duke@435 | 405 | const char* endcn = strchr(name, ':'); // end of class name |
duke@435 | 406 | if (endcn == NULL) endcn = strchr(name, '('); |
duke@435 | 407 | if (endcn == NULL) endcn = name + strlen(name); |
duke@435 | 408 | while (endcn > name && endcn[-1] != '.' && endcn[-1] != '/') |
duke@435 | 409 | --endcn; |
duke@435 | 410 | st->print(" %s", endcn); |
duke@435 | 411 | printed = true; |
duke@435 | 412 | } |
duke@435 | 413 | } |
duke@435 | 414 | if (!printed) |
duke@435 | 415 | _method->print_short_name(st); |
duke@435 | 416 | st->print(" @ bci:%d",_bci); |
duke@435 | 417 | } else { |
duke@435 | 418 | st->print(" runtime stub"); |
duke@435 | 419 | } |
duke@435 | 420 | if (caller() != NULL) caller()->dump_spec(st); |
duke@435 | 421 | } |
duke@435 | 422 | #endif |
duke@435 | 423 | |
duke@435 | 424 | #ifndef PRODUCT |
duke@435 | 425 | void JVMState::dump_on(outputStream* st) const { |
duke@435 | 426 | if (_map && !((uintptr_t)_map & 1)) { |
duke@435 | 427 | if (_map->len() > _map->req()) { // _map->has_exceptions() |
duke@435 | 428 | Node* ex = _map->in(_map->req()); // _map->next_exception() |
duke@435 | 429 | // skip the first one; it's already being printed |
duke@435 | 430 | while (ex != NULL && ex->len() > ex->req()) { |
duke@435 | 431 | ex = ex->in(ex->req()); // ex->next_exception() |
duke@435 | 432 | ex->dump(1); |
duke@435 | 433 | } |
duke@435 | 434 | } |
duke@435 | 435 | _map->dump(2); |
duke@435 | 436 | } |
duke@435 | 437 | st->print("JVMS depth=%d loc=%d stk=%d mon=%d end=%d mondepth=%d sp=%d bci=%d method=", |
duke@435 | 438 | depth(), locoff(), stkoff(), monoff(), endoff(), monitor_depth(), sp(), bci()); |
duke@435 | 439 | if (_method == NULL) { |
duke@435 | 440 | st->print_cr("(none)"); |
duke@435 | 441 | } else { |
duke@435 | 442 | _method->print_name(st); |
duke@435 | 443 | st->cr(); |
duke@435 | 444 | if (bci() >= 0 && bci() < _method->code_size()) { |
duke@435 | 445 | st->print(" bc: "); |
duke@435 | 446 | _method->print_codes_on(bci(), bci()+1, st); |
duke@435 | 447 | } |
duke@435 | 448 | } |
duke@435 | 449 | if (caller() != NULL) { |
duke@435 | 450 | caller()->dump_on(st); |
duke@435 | 451 | } |
duke@435 | 452 | } |
duke@435 | 453 | |
duke@435 | 454 | // Extra way to dump a jvms from the debugger, |
duke@435 | 455 | // to avoid a bug with C++ member function calls. |
duke@435 | 456 | void dump_jvms(JVMState* jvms) { |
duke@435 | 457 | jvms->dump(); |
duke@435 | 458 | } |
duke@435 | 459 | #endif |
duke@435 | 460 | |
duke@435 | 461 | //--------------------------clone_shallow-------------------------------------- |
duke@435 | 462 | JVMState* JVMState::clone_shallow(Compile* C) const { |
duke@435 | 463 | JVMState* n = has_method() ? new (C) JVMState(_method, _caller) : new (C) JVMState(0); |
duke@435 | 464 | n->set_bci(_bci); |
duke@435 | 465 | n->set_locoff(_locoff); |
duke@435 | 466 | n->set_stkoff(_stkoff); |
duke@435 | 467 | n->set_monoff(_monoff); |
duke@435 | 468 | n->set_endoff(_endoff); |
duke@435 | 469 | n->set_sp(_sp); |
duke@435 | 470 | n->set_map(_map); |
duke@435 | 471 | return n; |
duke@435 | 472 | } |
duke@435 | 473 | |
duke@435 | 474 | //---------------------------clone_deep---------------------------------------- |
duke@435 | 475 | JVMState* JVMState::clone_deep(Compile* C) const { |
duke@435 | 476 | JVMState* n = clone_shallow(C); |
duke@435 | 477 | for (JVMState* p = n; p->_caller != NULL; p = p->_caller) { |
duke@435 | 478 | p->_caller = p->_caller->clone_shallow(C); |
duke@435 | 479 | } |
duke@435 | 480 | assert(n->depth() == depth(), "sanity"); |
duke@435 | 481 | assert(n->debug_depth() == debug_depth(), "sanity"); |
duke@435 | 482 | return n; |
duke@435 | 483 | } |
duke@435 | 484 | |
duke@435 | 485 | //============================================================================= |
duke@435 | 486 | uint CallNode::cmp( const Node &n ) const |
duke@435 | 487 | { return _tf == ((CallNode&)n)._tf && _jvms == ((CallNode&)n)._jvms; } |
duke@435 | 488 | #ifndef PRODUCT |
duke@435 | 489 | void CallNode::dump_req() const { |
duke@435 | 490 | // Dump the required inputs, enclosed in '(' and ')' |
duke@435 | 491 | uint i; // Exit value of loop |
duke@435 | 492 | for( i=0; i<req(); i++ ) { // For all required inputs |
duke@435 | 493 | if( i == TypeFunc::Parms ) tty->print("("); |
duke@435 | 494 | if( in(i) ) tty->print("%c%d ", Compile::current()->node_arena()->contains(in(i)) ? ' ' : 'o', in(i)->_idx); |
duke@435 | 495 | else tty->print("_ "); |
duke@435 | 496 | } |
duke@435 | 497 | tty->print(")"); |
duke@435 | 498 | } |
duke@435 | 499 | |
duke@435 | 500 | void CallNode::dump_spec(outputStream *st) const { |
duke@435 | 501 | st->print(" "); |
duke@435 | 502 | tf()->dump_on(st); |
duke@435 | 503 | if (_cnt != COUNT_UNKNOWN) st->print(" C=%f",_cnt); |
duke@435 | 504 | if (jvms() != NULL) jvms()->dump_spec(st); |
duke@435 | 505 | } |
duke@435 | 506 | #endif |
duke@435 | 507 | |
duke@435 | 508 | const Type *CallNode::bottom_type() const { return tf()->range(); } |
duke@435 | 509 | const Type *CallNode::Value(PhaseTransform *phase) const { |
duke@435 | 510 | if (phase->type(in(0)) == Type::TOP) return Type::TOP; |
duke@435 | 511 | return tf()->range(); |
duke@435 | 512 | } |
duke@435 | 513 | |
duke@435 | 514 | //------------------------------calling_convention----------------------------- |
duke@435 | 515 | void CallNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { |
duke@435 | 516 | // Use the standard compiler calling convention |
duke@435 | 517 | Matcher::calling_convention( sig_bt, parm_regs, argcnt, true ); |
duke@435 | 518 | } |
duke@435 | 519 | |
duke@435 | 520 | |
duke@435 | 521 | //------------------------------match------------------------------------------ |
duke@435 | 522 | // Construct projections for control, I/O, memory-fields, ..., and |
duke@435 | 523 | // return result(s) along with their RegMask info |
duke@435 | 524 | Node *CallNode::match( const ProjNode *proj, const Matcher *match ) { |
duke@435 | 525 | switch (proj->_con) { |
duke@435 | 526 | case TypeFunc::Control: |
duke@435 | 527 | case TypeFunc::I_O: |
duke@435 | 528 | case TypeFunc::Memory: |
duke@435 | 529 | return new (match->C, 1) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj); |
duke@435 | 530 | |
duke@435 | 531 | case TypeFunc::Parms+1: // For LONG & DOUBLE returns |
duke@435 | 532 | assert(tf()->_range->field_at(TypeFunc::Parms+1) == Type::HALF, ""); |
duke@435 | 533 | // 2nd half of doubles and longs |
duke@435 | 534 | return new (match->C, 1) MachProjNode(this,proj->_con, RegMask::Empty, (uint)OptoReg::Bad); |
duke@435 | 535 | |
duke@435 | 536 | case TypeFunc::Parms: { // Normal returns |
duke@435 | 537 | uint ideal_reg = Matcher::base2reg[tf()->range()->field_at(TypeFunc::Parms)->base()]; |
duke@435 | 538 | OptoRegPair regs = is_CallRuntime() |
duke@435 | 539 | ? match->c_return_value(ideal_reg,true) // Calls into C runtime |
duke@435 | 540 | : match-> return_value(ideal_reg,true); // Calls into compiled Java code |
duke@435 | 541 | RegMask rm = RegMask(regs.first()); |
duke@435 | 542 | if( OptoReg::is_valid(regs.second()) ) |
duke@435 | 543 | rm.Insert( regs.second() ); |
duke@435 | 544 | return new (match->C, 1) MachProjNode(this,proj->_con,rm,ideal_reg); |
duke@435 | 545 | } |
duke@435 | 546 | |
duke@435 | 547 | case TypeFunc::ReturnAdr: |
duke@435 | 548 | case TypeFunc::FramePtr: |
duke@435 | 549 | default: |
duke@435 | 550 | ShouldNotReachHere(); |
duke@435 | 551 | } |
duke@435 | 552 | return NULL; |
duke@435 | 553 | } |
duke@435 | 554 | |
duke@435 | 555 | // Do we Match on this edge index or not? Match no edges |
duke@435 | 556 | uint CallNode::match_edge(uint idx) const { |
duke@435 | 557 | return 0; |
duke@435 | 558 | } |
duke@435 | 559 | |
duke@435 | 560 | //============================================================================= |
duke@435 | 561 | uint CallJavaNode::size_of() const { return sizeof(*this); } |
duke@435 | 562 | uint CallJavaNode::cmp( const Node &n ) const { |
duke@435 | 563 | CallJavaNode &call = (CallJavaNode&)n; |
duke@435 | 564 | return CallNode::cmp(call) && _method == call._method; |
duke@435 | 565 | } |
duke@435 | 566 | #ifndef PRODUCT |
duke@435 | 567 | void CallJavaNode::dump_spec(outputStream *st) const { |
duke@435 | 568 | if( _method ) _method->print_short_name(st); |
duke@435 | 569 | CallNode::dump_spec(st); |
duke@435 | 570 | } |
duke@435 | 571 | #endif |
duke@435 | 572 | |
duke@435 | 573 | //============================================================================= |
duke@435 | 574 | uint CallStaticJavaNode::size_of() const { return sizeof(*this); } |
duke@435 | 575 | uint CallStaticJavaNode::cmp( const Node &n ) const { |
duke@435 | 576 | CallStaticJavaNode &call = (CallStaticJavaNode&)n; |
duke@435 | 577 | return CallJavaNode::cmp(call); |
duke@435 | 578 | } |
duke@435 | 579 | |
duke@435 | 580 | //----------------------------uncommon_trap_request---------------------------- |
duke@435 | 581 | // If this is an uncommon trap, return the request code, else zero. |
duke@435 | 582 | int CallStaticJavaNode::uncommon_trap_request() const { |
duke@435 | 583 | if (_name != NULL && !strcmp(_name, "uncommon_trap")) { |
duke@435 | 584 | return extract_uncommon_trap_request(this); |
duke@435 | 585 | } |
duke@435 | 586 | return 0; |
duke@435 | 587 | } |
duke@435 | 588 | int CallStaticJavaNode::extract_uncommon_trap_request(const Node* call) { |
duke@435 | 589 | #ifndef PRODUCT |
duke@435 | 590 | if (!(call->req() > TypeFunc::Parms && |
duke@435 | 591 | call->in(TypeFunc::Parms) != NULL && |
duke@435 | 592 | call->in(TypeFunc::Parms)->is_Con())) { |
duke@435 | 593 | assert(_in_dump_cnt != 0, "OK if dumping"); |
duke@435 | 594 | tty->print("[bad uncommon trap]"); |
duke@435 | 595 | return 0; |
duke@435 | 596 | } |
duke@435 | 597 | #endif |
duke@435 | 598 | return call->in(TypeFunc::Parms)->bottom_type()->is_int()->get_con(); |
duke@435 | 599 | } |
duke@435 | 600 | |
duke@435 | 601 | #ifndef PRODUCT |
duke@435 | 602 | void CallStaticJavaNode::dump_spec(outputStream *st) const { |
duke@435 | 603 | st->print("# Static "); |
duke@435 | 604 | if (_name != NULL) { |
duke@435 | 605 | st->print("%s", _name); |
duke@435 | 606 | int trap_req = uncommon_trap_request(); |
duke@435 | 607 | if (trap_req != 0) { |
duke@435 | 608 | char buf[100]; |
duke@435 | 609 | st->print("(%s)", |
duke@435 | 610 | Deoptimization::format_trap_request(buf, sizeof(buf), |
duke@435 | 611 | trap_req)); |
duke@435 | 612 | } |
duke@435 | 613 | st->print(" "); |
duke@435 | 614 | } |
duke@435 | 615 | CallJavaNode::dump_spec(st); |
duke@435 | 616 | } |
duke@435 | 617 | #endif |
duke@435 | 618 | |
duke@435 | 619 | //============================================================================= |
duke@435 | 620 | uint CallDynamicJavaNode::size_of() const { return sizeof(*this); } |
duke@435 | 621 | uint CallDynamicJavaNode::cmp( const Node &n ) const { |
duke@435 | 622 | CallDynamicJavaNode &call = (CallDynamicJavaNode&)n; |
duke@435 | 623 | return CallJavaNode::cmp(call); |
duke@435 | 624 | } |
duke@435 | 625 | #ifndef PRODUCT |
duke@435 | 626 | void CallDynamicJavaNode::dump_spec(outputStream *st) const { |
duke@435 | 627 | st->print("# Dynamic "); |
duke@435 | 628 | CallJavaNode::dump_spec(st); |
duke@435 | 629 | } |
duke@435 | 630 | #endif |
duke@435 | 631 | |
duke@435 | 632 | //============================================================================= |
duke@435 | 633 | uint CallRuntimeNode::size_of() const { return sizeof(*this); } |
duke@435 | 634 | uint CallRuntimeNode::cmp( const Node &n ) const { |
duke@435 | 635 | CallRuntimeNode &call = (CallRuntimeNode&)n; |
duke@435 | 636 | return CallNode::cmp(call) && !strcmp(_name,call._name); |
duke@435 | 637 | } |
duke@435 | 638 | #ifndef PRODUCT |
duke@435 | 639 | void CallRuntimeNode::dump_spec(outputStream *st) const { |
duke@435 | 640 | st->print("# "); |
duke@435 | 641 | st->print(_name); |
duke@435 | 642 | CallNode::dump_spec(st); |
duke@435 | 643 | } |
duke@435 | 644 | #endif |
duke@435 | 645 | |
duke@435 | 646 | //------------------------------calling_convention----------------------------- |
duke@435 | 647 | void CallRuntimeNode::calling_convention( BasicType* sig_bt, VMRegPair *parm_regs, uint argcnt ) const { |
duke@435 | 648 | Matcher::c_calling_convention( sig_bt, parm_regs, argcnt ); |
duke@435 | 649 | } |
duke@435 | 650 | |
duke@435 | 651 | //============================================================================= |
duke@435 | 652 | //------------------------------calling_convention----------------------------- |
duke@435 | 653 | |
duke@435 | 654 | |
duke@435 | 655 | //============================================================================= |
duke@435 | 656 | #ifndef PRODUCT |
duke@435 | 657 | void CallLeafNode::dump_spec(outputStream *st) const { |
duke@435 | 658 | st->print("# "); |
duke@435 | 659 | st->print(_name); |
duke@435 | 660 | CallNode::dump_spec(st); |
duke@435 | 661 | } |
duke@435 | 662 | #endif |
duke@435 | 663 | |
duke@435 | 664 | //============================================================================= |
duke@435 | 665 | |
duke@435 | 666 | void SafePointNode::set_local(JVMState* jvms, uint idx, Node *c) { |
duke@435 | 667 | assert(verify_jvms(jvms), "jvms must match"); |
duke@435 | 668 | int loc = jvms->locoff() + idx; |
duke@435 | 669 | if (in(loc)->is_top() && idx > 0 && !c->is_top() ) { |
duke@435 | 670 | // If current local idx is top then local idx - 1 could |
duke@435 | 671 | // be a long/double that needs to be killed since top could |
duke@435 | 672 | // represent the 2nd half ofthe long/double. |
duke@435 | 673 | uint ideal = in(loc -1)->ideal_reg(); |
duke@435 | 674 | if (ideal == Op_RegD || ideal == Op_RegL) { |
duke@435 | 675 | // set other (low index) half to top |
duke@435 | 676 | set_req(loc - 1, in(loc)); |
duke@435 | 677 | } |
duke@435 | 678 | } |
duke@435 | 679 | set_req(loc, c); |
duke@435 | 680 | } |
duke@435 | 681 | |
duke@435 | 682 | uint SafePointNode::size_of() const { return sizeof(*this); } |
duke@435 | 683 | uint SafePointNode::cmp( const Node &n ) const { |
duke@435 | 684 | return (&n == this); // Always fail except on self |
duke@435 | 685 | } |
duke@435 | 686 | |
duke@435 | 687 | //-------------------------set_next_exception---------------------------------- |
duke@435 | 688 | void SafePointNode::set_next_exception(SafePointNode* n) { |
duke@435 | 689 | assert(n == NULL || n->Opcode() == Op_SafePoint, "correct value for next_exception"); |
duke@435 | 690 | if (len() == req()) { |
duke@435 | 691 | if (n != NULL) add_prec(n); |
duke@435 | 692 | } else { |
duke@435 | 693 | set_prec(req(), n); |
duke@435 | 694 | } |
duke@435 | 695 | } |
duke@435 | 696 | |
duke@435 | 697 | |
duke@435 | 698 | //----------------------------next_exception----------------------------------- |
duke@435 | 699 | SafePointNode* SafePointNode::next_exception() const { |
duke@435 | 700 | if (len() == req()) { |
duke@435 | 701 | return NULL; |
duke@435 | 702 | } else { |
duke@435 | 703 | Node* n = in(req()); |
duke@435 | 704 | assert(n == NULL || n->Opcode() == Op_SafePoint, "no other uses of prec edges"); |
duke@435 | 705 | return (SafePointNode*) n; |
duke@435 | 706 | } |
duke@435 | 707 | } |
duke@435 | 708 | |
duke@435 | 709 | |
duke@435 | 710 | //------------------------------Ideal------------------------------------------ |
duke@435 | 711 | // Skip over any collapsed Regions |
duke@435 | 712 | Node *SafePointNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 713 | if (remove_dead_region(phase, can_reshape)) return this; |
duke@435 | 714 | |
duke@435 | 715 | return NULL; |
duke@435 | 716 | } |
duke@435 | 717 | |
duke@435 | 718 | //------------------------------Identity--------------------------------------- |
duke@435 | 719 | // Remove obviously duplicate safepoints |
duke@435 | 720 | Node *SafePointNode::Identity( PhaseTransform *phase ) { |
duke@435 | 721 | |
duke@435 | 722 | // If you have back to back safepoints, remove one |
duke@435 | 723 | if( in(TypeFunc::Control)->is_SafePoint() ) |
duke@435 | 724 | return in(TypeFunc::Control); |
duke@435 | 725 | |
duke@435 | 726 | if( in(0)->is_Proj() ) { |
duke@435 | 727 | Node *n0 = in(0)->in(0); |
duke@435 | 728 | // Check if he is a call projection (except Leaf Call) |
duke@435 | 729 | if( n0->is_Catch() ) { |
duke@435 | 730 | n0 = n0->in(0)->in(0); |
duke@435 | 731 | assert( n0->is_Call(), "expect a call here" ); |
duke@435 | 732 | } |
duke@435 | 733 | if( n0->is_Call() && n0->as_Call()->guaranteed_safepoint() ) { |
duke@435 | 734 | // Useless Safepoint, so remove it |
duke@435 | 735 | return in(TypeFunc::Control); |
duke@435 | 736 | } |
duke@435 | 737 | } |
duke@435 | 738 | |
duke@435 | 739 | return this; |
duke@435 | 740 | } |
duke@435 | 741 | |
duke@435 | 742 | //------------------------------Value------------------------------------------ |
duke@435 | 743 | const Type *SafePointNode::Value( PhaseTransform *phase ) const { |
duke@435 | 744 | if( phase->type(in(0)) == Type::TOP ) return Type::TOP; |
duke@435 | 745 | if( phase->eqv( in(0), this ) ) return Type::TOP; // Dead infinite loop |
duke@435 | 746 | return Type::CONTROL; |
duke@435 | 747 | } |
duke@435 | 748 | |
duke@435 | 749 | #ifndef PRODUCT |
duke@435 | 750 | void SafePointNode::dump_spec(outputStream *st) const { |
duke@435 | 751 | st->print(" SafePoint "); |
duke@435 | 752 | } |
duke@435 | 753 | #endif |
duke@435 | 754 | |
duke@435 | 755 | const RegMask &SafePointNode::in_RegMask(uint idx) const { |
duke@435 | 756 | if( idx < TypeFunc::Parms ) return RegMask::Empty; |
duke@435 | 757 | // Values outside the domain represent debug info |
duke@435 | 758 | return *(Compile::current()->matcher()->idealreg2debugmask[in(idx)->ideal_reg()]); |
duke@435 | 759 | } |
duke@435 | 760 | const RegMask &SafePointNode::out_RegMask() const { |
duke@435 | 761 | return RegMask::Empty; |
duke@435 | 762 | } |
duke@435 | 763 | |
duke@435 | 764 | |
duke@435 | 765 | void SafePointNode::grow_stack(JVMState* jvms, uint grow_by) { |
duke@435 | 766 | assert((int)grow_by > 0, "sanity"); |
duke@435 | 767 | int monoff = jvms->monoff(); |
duke@435 | 768 | int endoff = jvms->endoff(); |
duke@435 | 769 | assert(endoff == (int)req(), "no other states or debug info after me"); |
duke@435 | 770 | Node* top = Compile::current()->top(); |
duke@435 | 771 | for (uint i = 0; i < grow_by; i++) { |
duke@435 | 772 | ins_req(monoff, top); |
duke@435 | 773 | } |
duke@435 | 774 | jvms->set_monoff(monoff + grow_by); |
duke@435 | 775 | jvms->set_endoff(endoff + grow_by); |
duke@435 | 776 | } |
duke@435 | 777 | |
duke@435 | 778 | void SafePointNode::push_monitor(const FastLockNode *lock) { |
duke@435 | 779 | // Add a LockNode, which points to both the original BoxLockNode (the |
duke@435 | 780 | // stack space for the monitor) and the Object being locked. |
duke@435 | 781 | const int MonitorEdges = 2; |
duke@435 | 782 | assert(JVMState::logMonitorEdges == exact_log2(MonitorEdges), "correct MonitorEdges"); |
duke@435 | 783 | assert(req() == jvms()->endoff(), "correct sizing"); |
duke@435 | 784 | if (GenerateSynchronizationCode) { |
duke@435 | 785 | add_req(lock->box_node()); |
duke@435 | 786 | add_req(lock->obj_node()); |
duke@435 | 787 | } else { |
duke@435 | 788 | add_req(NULL); |
duke@435 | 789 | add_req(NULL); |
duke@435 | 790 | } |
duke@435 | 791 | jvms()->set_endoff(req()); |
duke@435 | 792 | } |
duke@435 | 793 | |
duke@435 | 794 | void SafePointNode::pop_monitor() { |
duke@435 | 795 | // Delete last monitor from debug info |
duke@435 | 796 | debug_only(int num_before_pop = jvms()->nof_monitors()); |
duke@435 | 797 | const int MonitorEdges = (1<<JVMState::logMonitorEdges); |
duke@435 | 798 | int endoff = jvms()->endoff(); |
duke@435 | 799 | int new_endoff = endoff - MonitorEdges; |
duke@435 | 800 | jvms()->set_endoff(new_endoff); |
duke@435 | 801 | while (endoff > new_endoff) del_req(--endoff); |
duke@435 | 802 | assert(jvms()->nof_monitors() == num_before_pop-1, ""); |
duke@435 | 803 | } |
duke@435 | 804 | |
duke@435 | 805 | Node *SafePointNode::peek_monitor_box() const { |
duke@435 | 806 | int mon = jvms()->nof_monitors() - 1; |
duke@435 | 807 | assert(mon >= 0, "most have a monitor"); |
duke@435 | 808 | return monitor_box(jvms(), mon); |
duke@435 | 809 | } |
duke@435 | 810 | |
duke@435 | 811 | Node *SafePointNode::peek_monitor_obj() const { |
duke@435 | 812 | int mon = jvms()->nof_monitors() - 1; |
duke@435 | 813 | assert(mon >= 0, "most have a monitor"); |
duke@435 | 814 | return monitor_obj(jvms(), mon); |
duke@435 | 815 | } |
duke@435 | 816 | |
duke@435 | 817 | // Do we Match on this edge index or not? Match no edges |
duke@435 | 818 | uint SafePointNode::match_edge(uint idx) const { |
duke@435 | 819 | if( !needs_polling_address_input() ) |
duke@435 | 820 | return 0; |
duke@435 | 821 | |
duke@435 | 822 | return (TypeFunc::Parms == idx); |
duke@435 | 823 | } |
duke@435 | 824 | |
duke@435 | 825 | //============================================================================= |
duke@435 | 826 | uint AllocateNode::size_of() const { return sizeof(*this); } |
duke@435 | 827 | |
duke@435 | 828 | AllocateNode::AllocateNode(Compile* C, const TypeFunc *atype, |
duke@435 | 829 | Node *ctrl, Node *mem, Node *abio, |
duke@435 | 830 | Node *size, Node *klass_node, Node *initial_test) |
duke@435 | 831 | : CallNode(atype, NULL, TypeRawPtr::BOTTOM) |
duke@435 | 832 | { |
duke@435 | 833 | init_class_id(Class_Allocate); |
duke@435 | 834 | init_flags(Flag_is_macro); |
duke@435 | 835 | Node *topnode = C->top(); |
duke@435 | 836 | |
duke@435 | 837 | init_req( TypeFunc::Control , ctrl ); |
duke@435 | 838 | init_req( TypeFunc::I_O , abio ); |
duke@435 | 839 | init_req( TypeFunc::Memory , mem ); |
duke@435 | 840 | init_req( TypeFunc::ReturnAdr, topnode ); |
duke@435 | 841 | init_req( TypeFunc::FramePtr , topnode ); |
duke@435 | 842 | init_req( AllocSize , size); |
duke@435 | 843 | init_req( KlassNode , klass_node); |
duke@435 | 844 | init_req( InitialTest , initial_test); |
duke@435 | 845 | init_req( ALength , topnode); |
duke@435 | 846 | C->add_macro_node(this); |
duke@435 | 847 | } |
duke@435 | 848 | |
duke@435 | 849 | //============================================================================= |
duke@435 | 850 | uint AllocateArrayNode::size_of() const { return sizeof(*this); } |
duke@435 | 851 | |
duke@435 | 852 | //============================================================================= |
duke@435 | 853 | uint LockNode::size_of() const { return sizeof(*this); } |
duke@435 | 854 | |
duke@435 | 855 | // Redundant lock elimination |
duke@435 | 856 | // |
duke@435 | 857 | // There are various patterns of locking where we release and |
duke@435 | 858 | // immediately reacquire a lock in a piece of code where no operations |
duke@435 | 859 | // occur in between that would be observable. In those cases we can |
duke@435 | 860 | // skip releasing and reacquiring the lock without violating any |
duke@435 | 861 | // fairness requirements. Doing this around a loop could cause a lock |
duke@435 | 862 | // to be held for a very long time so we concentrate on non-looping |
duke@435 | 863 | // control flow. We also require that the operations are fully |
duke@435 | 864 | // redundant meaning that we don't introduce new lock operations on |
duke@435 | 865 | // some paths so to be able to eliminate it on others ala PRE. This |
duke@435 | 866 | // would probably require some more extensive graph manipulation to |
duke@435 | 867 | // guarantee that the memory edges were all handled correctly. |
duke@435 | 868 | // |
duke@435 | 869 | // Assuming p is a simple predicate which can't trap in any way and s |
duke@435 | 870 | // is a synchronized method consider this code: |
duke@435 | 871 | // |
duke@435 | 872 | // s(); |
duke@435 | 873 | // if (p) |
duke@435 | 874 | // s(); |
duke@435 | 875 | // else |
duke@435 | 876 | // s(); |
duke@435 | 877 | // s(); |
duke@435 | 878 | // |
duke@435 | 879 | // 1. The unlocks of the first call to s can be eliminated if the |
duke@435 | 880 | // locks inside the then and else branches are eliminated. |
duke@435 | 881 | // |
duke@435 | 882 | // 2. The unlocks of the then and else branches can be eliminated if |
duke@435 | 883 | // the lock of the final call to s is eliminated. |
duke@435 | 884 | // |
duke@435 | 885 | // Either of these cases subsumes the simple case of sequential control flow |
duke@435 | 886 | // |
duke@435 | 887 | // Addtionally we can eliminate versions without the else case: |
duke@435 | 888 | // |
duke@435 | 889 | // s(); |
duke@435 | 890 | // if (p) |
duke@435 | 891 | // s(); |
duke@435 | 892 | // s(); |
duke@435 | 893 | // |
duke@435 | 894 | // 3. In this case we eliminate the unlock of the first s, the lock |
duke@435 | 895 | // and unlock in the then case and the lock in the final s. |
duke@435 | 896 | // |
duke@435 | 897 | // Note also that in all these cases the then/else pieces don't have |
duke@435 | 898 | // to be trivial as long as they begin and end with synchronization |
duke@435 | 899 | // operations. |
duke@435 | 900 | // |
duke@435 | 901 | // s(); |
duke@435 | 902 | // if (p) |
duke@435 | 903 | // s(); |
duke@435 | 904 | // f(); |
duke@435 | 905 | // s(); |
duke@435 | 906 | // s(); |
duke@435 | 907 | // |
duke@435 | 908 | // The code will work properly for this case, leaving in the unlock |
duke@435 | 909 | // before the call to f and the relock after it. |
duke@435 | 910 | // |
duke@435 | 911 | // A potentially interesting case which isn't handled here is when the |
duke@435 | 912 | // locking is partially redundant. |
duke@435 | 913 | // |
duke@435 | 914 | // s(); |
duke@435 | 915 | // if (p) |
duke@435 | 916 | // s(); |
duke@435 | 917 | // |
duke@435 | 918 | // This could be eliminated putting unlocking on the else case and |
duke@435 | 919 | // eliminating the first unlock and the lock in the then side. |
duke@435 | 920 | // Alternatively the unlock could be moved out of the then side so it |
duke@435 | 921 | // was after the merge and the first unlock and second lock |
duke@435 | 922 | // eliminated. This might require less manipulation of the memory |
duke@435 | 923 | // state to get correct. |
duke@435 | 924 | // |
duke@435 | 925 | // Additionally we might allow work between a unlock and lock before |
duke@435 | 926 | // giving up eliminating the locks. The current code disallows any |
duke@435 | 927 | // conditional control flow between these operations. A formulation |
duke@435 | 928 | // similar to partial redundancy elimination computing the |
duke@435 | 929 | // availability of unlocking and the anticipatability of locking at a |
duke@435 | 930 | // program point would allow detection of fully redundant locking with |
duke@435 | 931 | // some amount of work in between. I'm not sure how often I really |
duke@435 | 932 | // think that would occur though. Most of the cases I've seen |
duke@435 | 933 | // indicate it's likely non-trivial work would occur in between. |
duke@435 | 934 | // There may be other more complicated constructs where we could |
duke@435 | 935 | // eliminate locking but I haven't seen any others appear as hot or |
duke@435 | 936 | // interesting. |
duke@435 | 937 | // |
duke@435 | 938 | // Locking and unlocking have a canonical form in ideal that looks |
duke@435 | 939 | // roughly like this: |
duke@435 | 940 | // |
duke@435 | 941 | // <obj> |
duke@435 | 942 | // | \\------+ |
duke@435 | 943 | // | \ \ |
duke@435 | 944 | // | BoxLock \ |
duke@435 | 945 | // | | | \ |
duke@435 | 946 | // | | \ \ |
duke@435 | 947 | // | | FastLock |
duke@435 | 948 | // | | / |
duke@435 | 949 | // | | / |
duke@435 | 950 | // | | | |
duke@435 | 951 | // |
duke@435 | 952 | // Lock |
duke@435 | 953 | // | |
duke@435 | 954 | // Proj #0 |
duke@435 | 955 | // | |
duke@435 | 956 | // MembarAcquire |
duke@435 | 957 | // | |
duke@435 | 958 | // Proj #0 |
duke@435 | 959 | // |
duke@435 | 960 | // MembarRelease |
duke@435 | 961 | // | |
duke@435 | 962 | // Proj #0 |
duke@435 | 963 | // | |
duke@435 | 964 | // Unlock |
duke@435 | 965 | // | |
duke@435 | 966 | // Proj #0 |
duke@435 | 967 | // |
duke@435 | 968 | // |
duke@435 | 969 | // This code proceeds by processing Lock nodes during PhaseIterGVN |
duke@435 | 970 | // and searching back through its control for the proper code |
duke@435 | 971 | // patterns. Once it finds a set of lock and unlock operations to |
duke@435 | 972 | // eliminate they are marked as eliminatable which causes the |
duke@435 | 973 | // expansion of the Lock and Unlock macro nodes to make the operation a NOP |
duke@435 | 974 | // |
duke@435 | 975 | //============================================================================= |
duke@435 | 976 | |
duke@435 | 977 | // |
duke@435 | 978 | // Utility function to skip over uninteresting control nodes. Nodes skipped are: |
duke@435 | 979 | // - copy regions. (These may not have been optimized away yet.) |
duke@435 | 980 | // - eliminated locking nodes |
duke@435 | 981 | // |
duke@435 | 982 | static Node *next_control(Node *ctrl) { |
duke@435 | 983 | if (ctrl == NULL) |
duke@435 | 984 | return NULL; |
duke@435 | 985 | while (1) { |
duke@435 | 986 | if (ctrl->is_Region()) { |
duke@435 | 987 | RegionNode *r = ctrl->as_Region(); |
duke@435 | 988 | Node *n = r->is_copy(); |
duke@435 | 989 | if (n == NULL) |
duke@435 | 990 | break; // hit a region, return it |
duke@435 | 991 | else |
duke@435 | 992 | ctrl = n; |
duke@435 | 993 | } else if (ctrl->is_Proj()) { |
duke@435 | 994 | Node *in0 = ctrl->in(0); |
duke@435 | 995 | if (in0->is_AbstractLock() && in0->as_AbstractLock()->is_eliminated()) { |
duke@435 | 996 | ctrl = in0->in(0); |
duke@435 | 997 | } else { |
duke@435 | 998 | break; |
duke@435 | 999 | } |
duke@435 | 1000 | } else { |
duke@435 | 1001 | break; // found an interesting control |
duke@435 | 1002 | } |
duke@435 | 1003 | } |
duke@435 | 1004 | return ctrl; |
duke@435 | 1005 | } |
duke@435 | 1006 | // |
duke@435 | 1007 | // Given a control, see if it's the control projection of an Unlock which |
duke@435 | 1008 | // operating on the same object as lock. |
duke@435 | 1009 | // |
duke@435 | 1010 | bool AbstractLockNode::find_matching_unlock(const Node* ctrl, LockNode* lock, |
duke@435 | 1011 | GrowableArray<AbstractLockNode*> &lock_ops) { |
duke@435 | 1012 | ProjNode *ctrl_proj = (ctrl->is_Proj()) ? ctrl->as_Proj() : NULL; |
duke@435 | 1013 | if (ctrl_proj != NULL && ctrl_proj->_con == TypeFunc::Control) { |
duke@435 | 1014 | Node *n = ctrl_proj->in(0); |
duke@435 | 1015 | if (n != NULL && n->is_Unlock()) { |
duke@435 | 1016 | UnlockNode *unlock = n->as_Unlock(); |
duke@435 | 1017 | if ((lock->obj_node() == unlock->obj_node()) && |
duke@435 | 1018 | (lock->box_node() == unlock->box_node()) && !unlock->is_eliminated()) { |
duke@435 | 1019 | lock_ops.append(unlock); |
duke@435 | 1020 | return true; |
duke@435 | 1021 | } |
duke@435 | 1022 | } |
duke@435 | 1023 | } |
duke@435 | 1024 | return false; |
duke@435 | 1025 | } |
duke@435 | 1026 | |
duke@435 | 1027 | // |
duke@435 | 1028 | // Find the lock matching an unlock. Returns null if a safepoint |
duke@435 | 1029 | // or complicated control is encountered first. |
duke@435 | 1030 | LockNode *AbstractLockNode::find_matching_lock(UnlockNode* unlock) { |
duke@435 | 1031 | LockNode *lock_result = NULL; |
duke@435 | 1032 | // find the matching lock, or an intervening safepoint |
duke@435 | 1033 | Node *ctrl = next_control(unlock->in(0)); |
duke@435 | 1034 | while (1) { |
duke@435 | 1035 | assert(ctrl != NULL, "invalid control graph"); |
duke@435 | 1036 | assert(!ctrl->is_Start(), "missing lock for unlock"); |
duke@435 | 1037 | if (ctrl->is_top()) break; // dead control path |
duke@435 | 1038 | if (ctrl->is_Proj()) ctrl = ctrl->in(0); |
duke@435 | 1039 | if (ctrl->is_SafePoint()) { |
duke@435 | 1040 | break; // found a safepoint (may be the lock we are searching for) |
duke@435 | 1041 | } else if (ctrl->is_Region()) { |
duke@435 | 1042 | // Check for a simple diamond pattern. Punt on anything more complicated |
duke@435 | 1043 | if (ctrl->req() == 3 && ctrl->in(1) != NULL && ctrl->in(2) != NULL) { |
duke@435 | 1044 | Node *in1 = next_control(ctrl->in(1)); |
duke@435 | 1045 | Node *in2 = next_control(ctrl->in(2)); |
duke@435 | 1046 | if (((in1->is_IfTrue() && in2->is_IfFalse()) || |
duke@435 | 1047 | (in2->is_IfTrue() && in1->is_IfFalse())) && (in1->in(0) == in2->in(0))) { |
duke@435 | 1048 | ctrl = next_control(in1->in(0)->in(0)); |
duke@435 | 1049 | } else { |
duke@435 | 1050 | break; |
duke@435 | 1051 | } |
duke@435 | 1052 | } else { |
duke@435 | 1053 | break; |
duke@435 | 1054 | } |
duke@435 | 1055 | } else { |
duke@435 | 1056 | ctrl = next_control(ctrl->in(0)); // keep searching |
duke@435 | 1057 | } |
duke@435 | 1058 | } |
duke@435 | 1059 | if (ctrl->is_Lock()) { |
duke@435 | 1060 | LockNode *lock = ctrl->as_Lock(); |
duke@435 | 1061 | if ((lock->obj_node() == unlock->obj_node()) && |
duke@435 | 1062 | (lock->box_node() == unlock->box_node())) { |
duke@435 | 1063 | lock_result = lock; |
duke@435 | 1064 | } |
duke@435 | 1065 | } |
duke@435 | 1066 | return lock_result; |
duke@435 | 1067 | } |
duke@435 | 1068 | |
duke@435 | 1069 | // This code corresponds to case 3 above. |
duke@435 | 1070 | |
duke@435 | 1071 | bool AbstractLockNode::find_lock_and_unlock_through_if(Node* node, LockNode* lock, |
duke@435 | 1072 | GrowableArray<AbstractLockNode*> &lock_ops) { |
duke@435 | 1073 | Node* if_node = node->in(0); |
duke@435 | 1074 | bool if_true = node->is_IfTrue(); |
duke@435 | 1075 | |
duke@435 | 1076 | if (if_node->is_If() && if_node->outcnt() == 2 && (if_true || node->is_IfFalse())) { |
duke@435 | 1077 | Node *lock_ctrl = next_control(if_node->in(0)); |
duke@435 | 1078 | if (find_matching_unlock(lock_ctrl, lock, lock_ops)) { |
duke@435 | 1079 | Node* lock1_node = NULL; |
duke@435 | 1080 | ProjNode* proj = if_node->as_If()->proj_out(!if_true); |
duke@435 | 1081 | if (if_true) { |
duke@435 | 1082 | if (proj->is_IfFalse() && proj->outcnt() == 1) { |
duke@435 | 1083 | lock1_node = proj->unique_out(); |
duke@435 | 1084 | } |
duke@435 | 1085 | } else { |
duke@435 | 1086 | if (proj->is_IfTrue() && proj->outcnt() == 1) { |
duke@435 | 1087 | lock1_node = proj->unique_out(); |
duke@435 | 1088 | } |
duke@435 | 1089 | } |
duke@435 | 1090 | if (lock1_node != NULL && lock1_node->is_Lock()) { |
duke@435 | 1091 | LockNode *lock1 = lock1_node->as_Lock(); |
duke@435 | 1092 | if ((lock->obj_node() == lock1->obj_node()) && |
duke@435 | 1093 | (lock->box_node() == lock1->box_node()) && !lock1->is_eliminated()) { |
duke@435 | 1094 | lock_ops.append(lock1); |
duke@435 | 1095 | return true; |
duke@435 | 1096 | } |
duke@435 | 1097 | } |
duke@435 | 1098 | } |
duke@435 | 1099 | } |
duke@435 | 1100 | |
duke@435 | 1101 | lock_ops.trunc_to(0); |
duke@435 | 1102 | return false; |
duke@435 | 1103 | } |
duke@435 | 1104 | |
duke@435 | 1105 | bool AbstractLockNode::find_unlocks_for_region(const RegionNode* region, LockNode* lock, |
duke@435 | 1106 | GrowableArray<AbstractLockNode*> &lock_ops) { |
duke@435 | 1107 | // check each control merging at this point for a matching unlock. |
duke@435 | 1108 | // in(0) should be self edge so skip it. |
duke@435 | 1109 | for (int i = 1; i < (int)region->req(); i++) { |
duke@435 | 1110 | Node *in_node = next_control(region->in(i)); |
duke@435 | 1111 | if (in_node != NULL) { |
duke@435 | 1112 | if (find_matching_unlock(in_node, lock, lock_ops)) { |
duke@435 | 1113 | // found a match so keep on checking. |
duke@435 | 1114 | continue; |
duke@435 | 1115 | } else if (find_lock_and_unlock_through_if(in_node, lock, lock_ops)) { |
duke@435 | 1116 | continue; |
duke@435 | 1117 | } |
duke@435 | 1118 | |
duke@435 | 1119 | // If we fall through to here then it was some kind of node we |
duke@435 | 1120 | // don't understand or there wasn't a matching unlock, so give |
duke@435 | 1121 | // up trying to merge locks. |
duke@435 | 1122 | lock_ops.trunc_to(0); |
duke@435 | 1123 | return false; |
duke@435 | 1124 | } |
duke@435 | 1125 | } |
duke@435 | 1126 | return true; |
duke@435 | 1127 | |
duke@435 | 1128 | } |
duke@435 | 1129 | |
duke@435 | 1130 | #ifndef PRODUCT |
duke@435 | 1131 | // |
duke@435 | 1132 | // Create a counter which counts the number of times this lock is acquired |
duke@435 | 1133 | // |
duke@435 | 1134 | void AbstractLockNode::create_lock_counter(JVMState* state) { |
duke@435 | 1135 | _counter = OptoRuntime::new_named_counter(state, NamedCounter::LockCounter); |
duke@435 | 1136 | } |
duke@435 | 1137 | #endif |
duke@435 | 1138 | |
duke@435 | 1139 | void AbstractLockNode::set_eliminated() { |
duke@435 | 1140 | _eliminate = true; |
duke@435 | 1141 | #ifndef PRODUCT |
duke@435 | 1142 | if (_counter) { |
duke@435 | 1143 | // Update the counter to indicate that this lock was eliminated. |
duke@435 | 1144 | // The counter update code will stay around even though the |
duke@435 | 1145 | // optimizer will eliminate the lock operation itself. |
duke@435 | 1146 | _counter->set_tag(NamedCounter::EliminatedLockCounter); |
duke@435 | 1147 | } |
duke@435 | 1148 | #endif |
duke@435 | 1149 | } |
duke@435 | 1150 | |
duke@435 | 1151 | //============================================================================= |
duke@435 | 1152 | Node *LockNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 1153 | |
duke@435 | 1154 | // perform any generic optimizations first |
duke@435 | 1155 | Node *result = SafePointNode::Ideal(phase, can_reshape); |
duke@435 | 1156 | |
duke@435 | 1157 | // Now see if we can optimize away this lock. We don't actually |
duke@435 | 1158 | // remove the locking here, we simply set the _eliminate flag which |
duke@435 | 1159 | // prevents macro expansion from expanding the lock. Since we don't |
duke@435 | 1160 | // modify the graph, the value returned from this function is the |
duke@435 | 1161 | // one computed above. |
duke@435 | 1162 | if (EliminateLocks && !is_eliminated()) { |
duke@435 | 1163 | // |
duke@435 | 1164 | // Try lock coarsening |
duke@435 | 1165 | // |
duke@435 | 1166 | PhaseIterGVN* iter = phase->is_IterGVN(); |
duke@435 | 1167 | if (iter != NULL) { |
duke@435 | 1168 | |
duke@435 | 1169 | GrowableArray<AbstractLockNode*> lock_ops; |
duke@435 | 1170 | |
duke@435 | 1171 | Node *ctrl = next_control(in(0)); |
duke@435 | 1172 | |
duke@435 | 1173 | // now search back for a matching Unlock |
duke@435 | 1174 | if (find_matching_unlock(ctrl, this, lock_ops)) { |
duke@435 | 1175 | // found an unlock directly preceding this lock. This is the |
duke@435 | 1176 | // case of single unlock directly control dependent on a |
duke@435 | 1177 | // single lock which is the trivial version of case 1 or 2. |
duke@435 | 1178 | } else if (ctrl->is_Region() ) { |
duke@435 | 1179 | if (find_unlocks_for_region(ctrl->as_Region(), this, lock_ops)) { |
duke@435 | 1180 | // found lock preceded by multiple unlocks along all paths |
duke@435 | 1181 | // joining at this point which is case 3 in description above. |
duke@435 | 1182 | } |
duke@435 | 1183 | } else { |
duke@435 | 1184 | // see if this lock comes from either half of an if and the |
duke@435 | 1185 | // predecessors merges unlocks and the other half of the if |
duke@435 | 1186 | // performs a lock. |
duke@435 | 1187 | if (find_lock_and_unlock_through_if(ctrl, this, lock_ops)) { |
duke@435 | 1188 | // found unlock splitting to an if with locks on both branches. |
duke@435 | 1189 | } |
duke@435 | 1190 | } |
duke@435 | 1191 | |
duke@435 | 1192 | if (lock_ops.length() > 0) { |
duke@435 | 1193 | // add ourselves to the list of locks to be eliminated. |
duke@435 | 1194 | lock_ops.append(this); |
duke@435 | 1195 | |
duke@435 | 1196 | #ifndef PRODUCT |
duke@435 | 1197 | if (PrintEliminateLocks) { |
duke@435 | 1198 | int locks = 0; |
duke@435 | 1199 | int unlocks = 0; |
duke@435 | 1200 | for (int i = 0; i < lock_ops.length(); i++) { |
duke@435 | 1201 | AbstractLockNode* lock = lock_ops.at(i); |
duke@435 | 1202 | if (lock->Opcode() == Op_Lock) locks++; |
duke@435 | 1203 | else unlocks++; |
duke@435 | 1204 | if (Verbose) { |
duke@435 | 1205 | lock->dump(1); |
duke@435 | 1206 | } |
duke@435 | 1207 | } |
duke@435 | 1208 | tty->print_cr("***Eliminated %d unlocks and %d locks", unlocks, locks); |
duke@435 | 1209 | } |
duke@435 | 1210 | #endif |
duke@435 | 1211 | |
duke@435 | 1212 | // for each of the identified locks, mark them |
duke@435 | 1213 | // as eliminatable |
duke@435 | 1214 | for (int i = 0; i < lock_ops.length(); i++) { |
duke@435 | 1215 | AbstractLockNode* lock = lock_ops.at(i); |
duke@435 | 1216 | |
duke@435 | 1217 | // Mark it eliminated to update any counters |
duke@435 | 1218 | lock->set_eliminated(); |
duke@435 | 1219 | } |
duke@435 | 1220 | } else if (result != NULL && ctrl->is_Region() && |
duke@435 | 1221 | iter->_worklist.member(ctrl)) { |
duke@435 | 1222 | // We weren't able to find any opportunities but the region this |
duke@435 | 1223 | // lock is control dependent on hasn't been processed yet so put |
duke@435 | 1224 | // this lock back on the worklist so we can check again once any |
duke@435 | 1225 | // region simplification has occurred. |
duke@435 | 1226 | iter->_worklist.push(this); |
duke@435 | 1227 | } |
duke@435 | 1228 | } |
duke@435 | 1229 | } |
duke@435 | 1230 | |
duke@435 | 1231 | return result; |
duke@435 | 1232 | } |
duke@435 | 1233 | |
duke@435 | 1234 | //============================================================================= |
duke@435 | 1235 | uint UnlockNode::size_of() const { return sizeof(*this); } |
duke@435 | 1236 | |
duke@435 | 1237 | //============================================================================= |
duke@435 | 1238 | Node *UnlockNode::Ideal(PhaseGVN *phase, bool can_reshape) { |
duke@435 | 1239 | |
duke@435 | 1240 | // perform any generic optimizations first |
duke@435 | 1241 | Node * result = SafePointNode::Ideal(phase, can_reshape); |
duke@435 | 1242 | |
duke@435 | 1243 | // Now see if we can optimize away this unlock. We don't actually |
duke@435 | 1244 | // remove the unlocking here, we simply set the _eliminate flag which |
duke@435 | 1245 | // prevents macro expansion from expanding the unlock. Since we don't |
duke@435 | 1246 | // modify the graph, the value returned from this function is the |
duke@435 | 1247 | // one computed above. |
duke@435 | 1248 | if (EliminateLocks && !is_eliminated()) { |
duke@435 | 1249 | // |
duke@435 | 1250 | // If we are unlocking an unescaped object, the lock/unlock is unnecessary |
duke@435 | 1251 | // We can eliminate them if there are no safepoints in the locked region. |
duke@435 | 1252 | // |
duke@435 | 1253 | ConnectionGraph *cgr = Compile::current()->congraph(); |
duke@435 | 1254 | if (cgr != NULL && cgr->escape_state(obj_node(), phase) == PointsToNode::NoEscape) { |
duke@435 | 1255 | GrowableArray<AbstractLockNode*> lock_ops; |
duke@435 | 1256 | LockNode *lock = find_matching_lock(this); |
duke@435 | 1257 | if (lock != NULL) { |
duke@435 | 1258 | lock_ops.append(this); |
duke@435 | 1259 | lock_ops.append(lock); |
duke@435 | 1260 | // find other unlocks which pair with the lock we found and add them |
duke@435 | 1261 | // to the list |
duke@435 | 1262 | Node * box = box_node(); |
duke@435 | 1263 | |
duke@435 | 1264 | for (DUIterator_Fast imax, i = box->fast_outs(imax); i < imax; i++) { |
duke@435 | 1265 | Node *use = box->fast_out(i); |
duke@435 | 1266 | if (use->is_Unlock() && use != this) { |
duke@435 | 1267 | UnlockNode *unlock1 = use->as_Unlock(); |
duke@435 | 1268 | if (!unlock1->is_eliminated()) { |
duke@435 | 1269 | LockNode *lock1 = find_matching_lock(unlock1); |
duke@435 | 1270 | if (lock == lock1) |
duke@435 | 1271 | lock_ops.append(unlock1); |
duke@435 | 1272 | else if (lock1 == NULL) { |
duke@435 | 1273 | // we can't find a matching lock, we must assume the worst |
duke@435 | 1274 | lock_ops.trunc_to(0); |
duke@435 | 1275 | break; |
duke@435 | 1276 | } |
duke@435 | 1277 | } |
duke@435 | 1278 | } |
duke@435 | 1279 | } |
duke@435 | 1280 | if (lock_ops.length() > 0) { |
duke@435 | 1281 | |
duke@435 | 1282 | #ifndef PRODUCT |
duke@435 | 1283 | if (PrintEliminateLocks) { |
duke@435 | 1284 | int locks = 0; |
duke@435 | 1285 | int unlocks = 0; |
duke@435 | 1286 | for (int i = 0; i < lock_ops.length(); i++) { |
duke@435 | 1287 | AbstractLockNode* lock = lock_ops.at(i); |
duke@435 | 1288 | if (lock->Opcode() == Op_Lock) locks++; |
duke@435 | 1289 | else unlocks++; |
duke@435 | 1290 | if (Verbose) { |
duke@435 | 1291 | lock->dump(1); |
duke@435 | 1292 | } |
duke@435 | 1293 | } |
duke@435 | 1294 | tty->print_cr("***Eliminated %d unescaped unlocks and %d unescaped locks", unlocks, locks); |
duke@435 | 1295 | } |
duke@435 | 1296 | #endif |
duke@435 | 1297 | |
duke@435 | 1298 | // for each of the identified locks, mark them |
duke@435 | 1299 | // as eliminatable |
duke@435 | 1300 | for (int i = 0; i < lock_ops.length(); i++) { |
duke@435 | 1301 | AbstractLockNode* lock = lock_ops.at(i); |
duke@435 | 1302 | |
duke@435 | 1303 | // Mark it eliminated to update any counters |
duke@435 | 1304 | lock->set_eliminated(); |
duke@435 | 1305 | } |
duke@435 | 1306 | } |
duke@435 | 1307 | } |
duke@435 | 1308 | } |
duke@435 | 1309 | } |
duke@435 | 1310 | return result; |
duke@435 | 1311 | } |