Thu, 16 Feb 2012 17:12:49 -0800
7145346: VerifyStackAtCalls is broken
Summary: Replace call_epilog() encoding with macroassembler use. Moved duplicated code to x86.ad. Fixed return_addr() definition.
Reviewed-by: never
duke@435 | 1 | /* |
stefank@2314 | 2 | * Copyright (c) 2000, 2010, Oracle and/or its affiliates. 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 | * |
trims@1907 | 19 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
trims@1907 | 20 | * or visit www.oracle.com if you need additional information or have any |
trims@1907 | 21 | * questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
stefank@2314 | 25 | #include "precompiled.hpp" |
stefank@2314 | 26 | #include "libadt/vectset.hpp" |
stefank@2314 | 27 | #include "memory/allocation.inline.hpp" |
stefank@2314 | 28 | #include "opto/addnode.hpp" |
stefank@2314 | 29 | #include "opto/c2compiler.hpp" |
stefank@2314 | 30 | #include "opto/callnode.hpp" |
stefank@2314 | 31 | #include "opto/cfgnode.hpp" |
stefank@2314 | 32 | #include "opto/chaitin.hpp" |
stefank@2314 | 33 | #include "opto/loopnode.hpp" |
stefank@2314 | 34 | #include "opto/machnode.hpp" |
duke@435 | 35 | |
duke@435 | 36 | //------------------------------Split-------------------------------------- |
twisti@1040 | 37 | // Walk the graph in RPO and for each lrg which spills, propagate reaching |
twisti@1040 | 38 | // definitions. During propagation, split the live range around regions of |
duke@435 | 39 | // High Register Pressure (HRP). If a Def is in a region of Low Register |
duke@435 | 40 | // Pressure (LRP), it will not get spilled until we encounter a region of |
duke@435 | 41 | // HRP between it and one of its uses. We will spill at the transition |
duke@435 | 42 | // point between LRP and HRP. Uses in the HRP region will use the spilled |
duke@435 | 43 | // Def. The first Use outside the HRP region will generate a SpillCopy to |
duke@435 | 44 | // hoist the live range back up into a register, and all subsequent uses |
duke@435 | 45 | // will use that new Def until another HRP region is encountered. Defs in |
duke@435 | 46 | // HRP regions will get trailing SpillCopies to push the LRG down into the |
duke@435 | 47 | // stack immediately. |
duke@435 | 48 | // |
duke@435 | 49 | // As a side effect, unlink from (hence make dead) coalesced copies. |
duke@435 | 50 | // |
duke@435 | 51 | |
duke@435 | 52 | static const char out_of_nodes[] = "out of nodes during split"; |
duke@435 | 53 | |
duke@435 | 54 | //------------------------------get_spillcopy_wide----------------------------- |
duke@435 | 55 | // Get a SpillCopy node with wide-enough masks. Use the 'wide-mask', the |
duke@435 | 56 | // wide ideal-register spill-mask if possible. If the 'wide-mask' does |
duke@435 | 57 | // not cover the input (or output), use the input (or output) mask instead. |
duke@435 | 58 | Node *PhaseChaitin::get_spillcopy_wide( Node *def, Node *use, uint uidx ) { |
duke@435 | 59 | // If ideal reg doesn't exist we've got a bad schedule happening |
duke@435 | 60 | // that is forcing us to spill something that isn't spillable. |
duke@435 | 61 | // Bail rather than abort |
duke@435 | 62 | int ireg = def->ideal_reg(); |
duke@435 | 63 | if( ireg == 0 || ireg == Op_RegFlags ) { |
never@850 | 64 | assert(false, "attempted to spill a non-spillable item"); |
duke@435 | 65 | C->record_method_not_compilable("attempted to spill a non-spillable item"); |
duke@435 | 66 | return NULL; |
duke@435 | 67 | } |
duke@435 | 68 | if (C->check_node_count(NodeLimitFudgeFactor, out_of_nodes)) { |
duke@435 | 69 | return NULL; |
duke@435 | 70 | } |
duke@435 | 71 | const RegMask *i_mask = &def->out_RegMask(); |
duke@435 | 72 | const RegMask *w_mask = C->matcher()->idealreg2spillmask[ireg]; |
duke@435 | 73 | const RegMask *o_mask = use ? &use->in_RegMask(uidx) : w_mask; |
duke@435 | 74 | const RegMask *w_i_mask = w_mask->overlap( *i_mask ) ? w_mask : i_mask; |
duke@435 | 75 | const RegMask *w_o_mask; |
duke@435 | 76 | |
duke@435 | 77 | if( w_mask->overlap( *o_mask ) && // Overlap AND |
duke@435 | 78 | ((ireg != Op_RegL && ireg != Op_RegD // Single use or aligned |
duke@435 | 79 | #ifdef _LP64 |
duke@435 | 80 | && ireg != Op_RegP |
duke@435 | 81 | #endif |
duke@435 | 82 | ) || o_mask->is_aligned_Pairs()) ) { |
duke@435 | 83 | // Don't come here for mis-aligned doubles |
duke@435 | 84 | w_o_mask = w_mask; |
duke@435 | 85 | } else { // wide ideal mask does not overlap with o_mask |
duke@435 | 86 | // Mis-aligned doubles come here and XMM->FPR moves on x86. |
duke@435 | 87 | w_o_mask = o_mask; // Must target desired registers |
duke@435 | 88 | // Does the ideal-reg-mask overlap with o_mask? I.e., can I use |
duke@435 | 89 | // a reg-reg move or do I need a trip across register classes |
duke@435 | 90 | // (and thus through memory)? |
duke@435 | 91 | if( !C->matcher()->idealreg2regmask[ireg]->overlap( *o_mask) && o_mask->is_UP() ) |
duke@435 | 92 | // Here we assume a trip through memory is required. |
duke@435 | 93 | w_i_mask = &C->FIRST_STACK_mask(); |
duke@435 | 94 | } |
duke@435 | 95 | return new (C) MachSpillCopyNode( def, *w_i_mask, *w_o_mask ); |
duke@435 | 96 | } |
duke@435 | 97 | |
duke@435 | 98 | //------------------------------insert_proj------------------------------------ |
twisti@1040 | 99 | // Insert the spill at chosen location. Skip over any intervening Proj's or |
duke@435 | 100 | // Phis. Skip over a CatchNode and projs, inserting in the fall-through block |
duke@435 | 101 | // instead. Update high-pressure indices. Create a new live range. |
duke@435 | 102 | void PhaseChaitin::insert_proj( Block *b, uint i, Node *spill, uint maxlrg ) { |
duke@435 | 103 | // Skip intervening ProjNodes. Do not insert between a ProjNode and |
duke@435 | 104 | // its definer. |
duke@435 | 105 | while( i < b->_nodes.size() && |
duke@435 | 106 | (b->_nodes[i]->is_Proj() || |
kvn@1001 | 107 | b->_nodes[i]->is_Phi() ) ) |
duke@435 | 108 | i++; |
duke@435 | 109 | |
duke@435 | 110 | // Do not insert between a call and his Catch |
duke@435 | 111 | if( b->_nodes[i]->is_Catch() ) { |
duke@435 | 112 | // Put the instruction at the top of the fall-thru block. |
duke@435 | 113 | // Find the fall-thru projection |
duke@435 | 114 | while( 1 ) { |
duke@435 | 115 | const CatchProjNode *cp = b->_nodes[++i]->as_CatchProj(); |
duke@435 | 116 | if( cp->_con == CatchProjNode::fall_through_index ) |
duke@435 | 117 | break; |
duke@435 | 118 | } |
duke@435 | 119 | int sidx = i - b->end_idx()-1; |
duke@435 | 120 | b = b->_succs[sidx]; // Switch to successor block |
duke@435 | 121 | i = 1; // Right at start of block |
duke@435 | 122 | } |
duke@435 | 123 | |
duke@435 | 124 | b->_nodes.insert(i,spill); // Insert node in block |
duke@435 | 125 | _cfg._bbs.map(spill->_idx,b); // Update node->block mapping to reflect |
duke@435 | 126 | // Adjust the point where we go hi-pressure |
duke@435 | 127 | if( i <= b->_ihrp_index ) b->_ihrp_index++; |
duke@435 | 128 | if( i <= b->_fhrp_index ) b->_fhrp_index++; |
duke@435 | 129 | |
duke@435 | 130 | // Assign a new Live Range Number to the SpillCopy and grow |
duke@435 | 131 | // the node->live range mapping. |
duke@435 | 132 | new_lrg(spill,maxlrg); |
duke@435 | 133 | } |
duke@435 | 134 | |
duke@435 | 135 | //------------------------------split_DEF-------------------------------------- |
twisti@1040 | 136 | // There are four categories of Split; UP/DOWN x DEF/USE |
duke@435 | 137 | // Only three of these really occur as DOWN/USE will always color |
duke@435 | 138 | // Any Split with a DEF cannot CISC-Spill now. Thus we need |
duke@435 | 139 | // two helper routines, one for Split DEFS (insert after instruction), |
duke@435 | 140 | // one for Split USES (insert before instruction). DEF insertion |
duke@435 | 141 | // happens inside Split, where the Leaveblock array is updated. |
duke@435 | 142 | uint PhaseChaitin::split_DEF( Node *def, Block *b, int loc, uint maxlrg, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx ) { |
duke@435 | 143 | #ifdef ASSERT |
duke@435 | 144 | // Increment the counter for this lrg |
duke@435 | 145 | splits.at_put(slidx, splits.at(slidx)+1); |
duke@435 | 146 | #endif |
duke@435 | 147 | // If we are spilling the memory op for an implicit null check, at the |
duke@435 | 148 | // null check location (ie - null check is in HRP block) we need to do |
duke@435 | 149 | // the null-check first, then spill-down in the following block. |
duke@435 | 150 | // (The implicit_null_check function ensures the use is also dominated |
duke@435 | 151 | // by the branch-not-taken block.) |
duke@435 | 152 | Node *be = b->end(); |
duke@435 | 153 | if( be->is_MachNullCheck() && be->in(1) == def && def == b->_nodes[loc] ) { |
duke@435 | 154 | // Spill goes in the branch-not-taken block |
duke@435 | 155 | b = b->_succs[b->_nodes[b->end_idx()+1]->Opcode() == Op_IfTrue]; |
duke@435 | 156 | loc = 0; // Just past the Region |
duke@435 | 157 | } |
duke@435 | 158 | assert( loc >= 0, "must insert past block head" ); |
duke@435 | 159 | |
duke@435 | 160 | // Get a def-side SpillCopy |
duke@435 | 161 | Node *spill = get_spillcopy_wide(def,NULL,0); |
duke@435 | 162 | // Did we fail to split?, then bail |
duke@435 | 163 | if (!spill) { |
duke@435 | 164 | return 0; |
duke@435 | 165 | } |
duke@435 | 166 | |
duke@435 | 167 | // Insert the spill at chosen location |
duke@435 | 168 | insert_proj( b, loc+1, spill, maxlrg++); |
duke@435 | 169 | |
duke@435 | 170 | // Insert new node into Reaches array |
duke@435 | 171 | Reachblock[slidx] = spill; |
duke@435 | 172 | // Update debug list of reaching down definitions by adding this one |
duke@435 | 173 | debug_defs[slidx] = spill; |
duke@435 | 174 | |
duke@435 | 175 | // return updated count of live ranges |
duke@435 | 176 | return maxlrg; |
duke@435 | 177 | } |
duke@435 | 178 | |
duke@435 | 179 | //------------------------------split_USE-------------------------------------- |
duke@435 | 180 | // Splits at uses can involve redeffing the LRG, so no CISC Spilling there. |
duke@435 | 181 | // Debug uses want to know if def is already stack enabled. |
duke@435 | 182 | uint PhaseChaitin::split_USE( Node *def, Block *b, Node *use, uint useidx, uint maxlrg, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx ) { |
duke@435 | 183 | #ifdef ASSERT |
duke@435 | 184 | // Increment the counter for this lrg |
duke@435 | 185 | splits.at_put(slidx, splits.at(slidx)+1); |
duke@435 | 186 | #endif |
duke@435 | 187 | |
duke@435 | 188 | // Some setup stuff for handling debug node uses |
duke@435 | 189 | JVMState* jvms = use->jvms(); |
duke@435 | 190 | uint debug_start = jvms ? jvms->debug_start() : 999999; |
duke@435 | 191 | uint debug_end = jvms ? jvms->debug_end() : 999999; |
duke@435 | 192 | |
duke@435 | 193 | //------------------------------------------- |
duke@435 | 194 | // Check for use of debug info |
duke@435 | 195 | if (useidx >= debug_start && useidx < debug_end) { |
duke@435 | 196 | // Actually it's perfectly legal for constant debug info to appear |
duke@435 | 197 | // just unlikely. In this case the optimizer left a ConI of a 4 |
duke@435 | 198 | // as both inputs to a Phi with only a debug use. It's a single-def |
duke@435 | 199 | // live range of a rematerializable value. The live range spills, |
duke@435 | 200 | // rematerializes and now the ConI directly feeds into the debug info. |
duke@435 | 201 | // assert(!def->is_Con(), "constant debug info already constructed directly"); |
duke@435 | 202 | |
duke@435 | 203 | // Special split handling for Debug Info |
duke@435 | 204 | // If DEF is DOWN, just hook the edge and return |
duke@435 | 205 | // If DEF is UP, Split it DOWN for this USE. |
duke@435 | 206 | if( def->is_Mach() ) { |
duke@435 | 207 | if( def_down ) { |
duke@435 | 208 | // DEF is DOWN, so connect USE directly to the DEF |
duke@435 | 209 | use->set_req(useidx, def); |
duke@435 | 210 | } else { |
duke@435 | 211 | // Block and index where the use occurs. |
duke@435 | 212 | Block *b = _cfg._bbs[use->_idx]; |
duke@435 | 213 | // Put the clone just prior to use |
duke@435 | 214 | int bindex = b->find_node(use); |
duke@435 | 215 | // DEF is UP, so must copy it DOWN and hook in USE |
duke@435 | 216 | // Insert SpillCopy before the USE, which uses DEF as its input, |
duke@435 | 217 | // and defs a new live range, which is used by this node. |
duke@435 | 218 | Node *spill = get_spillcopy_wide(def,use,useidx); |
duke@435 | 219 | // did we fail to split? |
duke@435 | 220 | if (!spill) { |
duke@435 | 221 | // Bail |
duke@435 | 222 | return 0; |
duke@435 | 223 | } |
duke@435 | 224 | // insert into basic block |
duke@435 | 225 | insert_proj( b, bindex, spill, maxlrg++ ); |
duke@435 | 226 | // Use the new split |
duke@435 | 227 | use->set_req(useidx,spill); |
duke@435 | 228 | } |
duke@435 | 229 | // No further split handling needed for this use |
duke@435 | 230 | return maxlrg; |
duke@435 | 231 | } // End special splitting for debug info live range |
duke@435 | 232 | } // If debug info |
duke@435 | 233 | |
duke@435 | 234 | // CISC-SPILLING |
duke@435 | 235 | // Finally, check to see if USE is CISC-Spillable, and if so, |
duke@435 | 236 | // gather_lrg_masks will add the flags bit to its mask, and |
duke@435 | 237 | // no use side copy is needed. This frees up the live range |
duke@435 | 238 | // register choices without causing copy coalescing, etc. |
duke@435 | 239 | if( UseCISCSpill && cisc_sp ) { |
duke@435 | 240 | int inp = use->cisc_operand(); |
duke@435 | 241 | if( inp != AdlcVMDeps::Not_cisc_spillable ) |
duke@435 | 242 | // Convert operand number to edge index number |
duke@435 | 243 | inp = use->as_Mach()->operand_index(inp); |
duke@435 | 244 | if( inp == (int)useidx ) { |
duke@435 | 245 | use->set_req(useidx, def); |
duke@435 | 246 | #ifndef PRODUCT |
duke@435 | 247 | if( TraceCISCSpill ) { |
duke@435 | 248 | tty->print(" set_split: "); |
duke@435 | 249 | use->dump(); |
duke@435 | 250 | } |
duke@435 | 251 | #endif |
duke@435 | 252 | return maxlrg; |
duke@435 | 253 | } |
duke@435 | 254 | } |
duke@435 | 255 | |
duke@435 | 256 | //------------------------------------------- |
duke@435 | 257 | // Insert a Copy before the use |
duke@435 | 258 | |
duke@435 | 259 | // Block and index where the use occurs. |
duke@435 | 260 | int bindex; |
duke@435 | 261 | // Phi input spill-copys belong at the end of the prior block |
duke@435 | 262 | if( use->is_Phi() ) { |
duke@435 | 263 | b = _cfg._bbs[b->pred(useidx)->_idx]; |
duke@435 | 264 | bindex = b->end_idx(); |
duke@435 | 265 | } else { |
duke@435 | 266 | // Put the clone just prior to use |
duke@435 | 267 | bindex = b->find_node(use); |
duke@435 | 268 | } |
duke@435 | 269 | |
duke@435 | 270 | Node *spill = get_spillcopy_wide( def, use, useidx ); |
duke@435 | 271 | if( !spill ) return 0; // Bailed out |
duke@435 | 272 | // Insert SpillCopy before the USE, which uses the reaching DEF as |
duke@435 | 273 | // its input, and defs a new live range, which is used by this node. |
duke@435 | 274 | insert_proj( b, bindex, spill, maxlrg++ ); |
duke@435 | 275 | // Use the spill/clone |
duke@435 | 276 | use->set_req(useidx,spill); |
duke@435 | 277 | |
duke@435 | 278 | // return updated live range count |
duke@435 | 279 | return maxlrg; |
duke@435 | 280 | } |
duke@435 | 281 | |
kvn@2048 | 282 | //------------------------------clone_node---------------------------- |
kvn@2048 | 283 | // Clone node with anti dependence check. |
kvn@2048 | 284 | Node* clone_node(Node* def, Block *b, Compile* C) { |
kvn@2048 | 285 | if (def->needs_anti_dependence_check()) { |
kvn@2048 | 286 | #ifdef ASSERT |
kvn@2048 | 287 | if (Verbose) { |
kvn@2048 | 288 | tty->print_cr("RA attempts to clone node with anti_dependence:"); |
kvn@2048 | 289 | def->dump(-1); tty->cr(); |
kvn@2048 | 290 | tty->print_cr("into block:"); |
kvn@2048 | 291 | b->dump(); |
kvn@2048 | 292 | } |
kvn@2048 | 293 | #endif |
kvn@2048 | 294 | if (C->subsume_loads() == true && !C->failing()) { |
kvn@2048 | 295 | // Retry with subsume_loads == false |
kvn@2048 | 296 | // If this is the first failure, the sentinel string will "stick" |
kvn@2048 | 297 | // to the Compile object, and the C2Compiler will see it and retry. |
kvn@2048 | 298 | C->record_failure(C2Compiler::retry_no_subsuming_loads()); |
kvn@2048 | 299 | } else { |
kvn@2048 | 300 | // Bailout without retry |
kvn@2048 | 301 | C->record_method_not_compilable("RA Split failed: attempt to clone node with anti_dependence"); |
kvn@2048 | 302 | } |
kvn@2048 | 303 | return 0; |
kvn@2048 | 304 | } |
kvn@2048 | 305 | return def->clone(); |
kvn@2048 | 306 | } |
kvn@2048 | 307 | |
duke@435 | 308 | //------------------------------split_Rematerialize---------------------------- |
duke@435 | 309 | // Clone a local copy of the def. |
duke@435 | 310 | Node *PhaseChaitin::split_Rematerialize( Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits, int slidx, uint *lrg2reach, Node **Reachblock, bool walkThru ) { |
duke@435 | 311 | // The input live ranges will be stretched to the site of the new |
duke@435 | 312 | // instruction. They might be stretched past a def and will thus |
duke@435 | 313 | // have the old and new values of the same live range alive at the |
duke@435 | 314 | // same time - a definite no-no. Split out private copies of |
duke@435 | 315 | // the inputs. |
duke@435 | 316 | if( def->req() > 1 ) { |
duke@435 | 317 | for( uint i = 1; i < def->req(); i++ ) { |
duke@435 | 318 | Node *in = def->in(i); |
duke@435 | 319 | // Check for single-def (LRG cannot redefined) |
duke@435 | 320 | uint lidx = n2lidx(in); |
duke@435 | 321 | if( lidx >= _maxlrg ) continue; // Value is a recent spill-copy |
never@730 | 322 | if (lrgs(lidx).is_singledef()) continue; |
duke@435 | 323 | |
duke@435 | 324 | Block *b_def = _cfg._bbs[def->_idx]; |
duke@435 | 325 | int idx_def = b_def->find_node(def); |
duke@435 | 326 | Node *in_spill = get_spillcopy_wide( in, def, i ); |
duke@435 | 327 | if( !in_spill ) return 0; // Bailed out |
duke@435 | 328 | insert_proj(b_def,idx_def,in_spill,maxlrg++); |
duke@435 | 329 | if( b_def == b ) |
duke@435 | 330 | insidx++; |
duke@435 | 331 | def->set_req(i,in_spill); |
duke@435 | 332 | } |
duke@435 | 333 | } |
duke@435 | 334 | |
kvn@2048 | 335 | Node *spill = clone_node(def, b, C); |
kvn@2048 | 336 | if (spill == NULL || C->check_node_count(NodeLimitFudgeFactor, out_of_nodes)) { |
duke@435 | 337 | // Check when generating nodes |
duke@435 | 338 | return 0; |
duke@435 | 339 | } |
duke@435 | 340 | |
duke@435 | 341 | // See if any inputs are currently being spilled, and take the |
duke@435 | 342 | // latest copy of spilled inputs. |
duke@435 | 343 | if( spill->req() > 1 ) { |
duke@435 | 344 | for( uint i = 1; i < spill->req(); i++ ) { |
duke@435 | 345 | Node *in = spill->in(i); |
duke@435 | 346 | uint lidx = Find_id(in); |
duke@435 | 347 | |
duke@435 | 348 | // Walk backwards thru spill copy node intermediates |
never@730 | 349 | if (walkThru) { |
duke@435 | 350 | while ( in->is_SpillCopy() && lidx >= _maxlrg ) { |
duke@435 | 351 | in = in->in(1); |
duke@435 | 352 | lidx = Find_id(in); |
duke@435 | 353 | } |
duke@435 | 354 | |
never@730 | 355 | if (lidx < _maxlrg && lrgs(lidx).is_multidef()) { |
never@730 | 356 | // walkThru found a multidef LRG, which is unsafe to use, so |
never@730 | 357 | // just keep the original def used in the clone. |
never@730 | 358 | in = spill->in(i); |
never@730 | 359 | lidx = Find_id(in); |
never@730 | 360 | } |
never@730 | 361 | } |
never@730 | 362 | |
duke@435 | 363 | if( lidx < _maxlrg && lrgs(lidx).reg() >= LRG::SPILL_REG ) { |
duke@435 | 364 | Node *rdef = Reachblock[lrg2reach[lidx]]; |
duke@435 | 365 | if( rdef ) spill->set_req(i,rdef); |
duke@435 | 366 | } |
duke@435 | 367 | } |
duke@435 | 368 | } |
duke@435 | 369 | |
duke@435 | 370 | |
duke@435 | 371 | assert( spill->out_RegMask().is_UP(), "rematerialize to a reg" ); |
duke@435 | 372 | // Rematerialized op is def->spilled+1 |
duke@435 | 373 | set_was_spilled(spill); |
duke@435 | 374 | if( _spilled_once.test(def->_idx) ) |
duke@435 | 375 | set_was_spilled(spill); |
duke@435 | 376 | |
duke@435 | 377 | insert_proj( b, insidx, spill, maxlrg++ ); |
duke@435 | 378 | #ifdef ASSERT |
duke@435 | 379 | // Increment the counter for this lrg |
duke@435 | 380 | splits.at_put(slidx, splits.at(slidx)+1); |
duke@435 | 381 | #endif |
duke@435 | 382 | // See if the cloned def kills any flags, and copy those kills as well |
duke@435 | 383 | uint i = insidx+1; |
duke@435 | 384 | if( clone_projs( b, i, def, spill, maxlrg ) ) { |
duke@435 | 385 | // Adjust the point where we go hi-pressure |
duke@435 | 386 | if( i <= b->_ihrp_index ) b->_ihrp_index++; |
duke@435 | 387 | if( i <= b->_fhrp_index ) b->_fhrp_index++; |
duke@435 | 388 | } |
duke@435 | 389 | |
duke@435 | 390 | return spill; |
duke@435 | 391 | } |
duke@435 | 392 | |
duke@435 | 393 | //------------------------------is_high_pressure------------------------------- |
duke@435 | 394 | // Function to compute whether or not this live range is "high pressure" |
duke@435 | 395 | // in this block - whether it spills eagerly or not. |
duke@435 | 396 | bool PhaseChaitin::is_high_pressure( Block *b, LRG *lrg, uint insidx ) { |
duke@435 | 397 | if( lrg->_was_spilled1 ) return true; |
duke@435 | 398 | // Forced spilling due to conflict? Then split only at binding uses |
duke@435 | 399 | // or defs, not for supposed capacity problems. |
duke@435 | 400 | // CNC - Turned off 7/8/99, causes too much spilling |
duke@435 | 401 | // if( lrg->_is_bound ) return false; |
duke@435 | 402 | |
duke@435 | 403 | // Not yet reached the high-pressure cutoff point, so low pressure |
duke@435 | 404 | uint hrp_idx = lrg->_is_float ? b->_fhrp_index : b->_ihrp_index; |
duke@435 | 405 | if( insidx < hrp_idx ) return false; |
duke@435 | 406 | // Register pressure for the block as a whole depends on reg class |
duke@435 | 407 | int block_pres = lrg->_is_float ? b->_freg_pressure : b->_reg_pressure; |
duke@435 | 408 | // Bound live ranges will split at the binding points first; |
duke@435 | 409 | // Intermediate splits should assume the live range's register set |
duke@435 | 410 | // got "freed up" and that num_regs will become INT_PRESSURE. |
duke@435 | 411 | int bound_pres = lrg->_is_float ? FLOATPRESSURE : INTPRESSURE; |
duke@435 | 412 | // Effective register pressure limit. |
duke@435 | 413 | int lrg_pres = (lrg->get_invalid_mask_size() > lrg->num_regs()) |
duke@435 | 414 | ? (lrg->get_invalid_mask_size() >> (lrg->num_regs()-1)) : bound_pres; |
duke@435 | 415 | // High pressure if block pressure requires more register freedom |
duke@435 | 416 | // than live range has. |
duke@435 | 417 | return block_pres >= lrg_pres; |
duke@435 | 418 | } |
duke@435 | 419 | |
duke@435 | 420 | |
duke@435 | 421 | //------------------------------prompt_use--------------------------------- |
duke@435 | 422 | // True if lidx is used before any real register is def'd in the block |
duke@435 | 423 | bool PhaseChaitin::prompt_use( Block *b, uint lidx ) { |
duke@435 | 424 | if( lrgs(lidx)._was_spilled2 ) return false; |
duke@435 | 425 | |
duke@435 | 426 | // Scan block for 1st use. |
duke@435 | 427 | for( uint i = 1; i <= b->end_idx(); i++ ) { |
duke@435 | 428 | Node *n = b->_nodes[i]; |
duke@435 | 429 | // Ignore PHI use, these can be up or down |
duke@435 | 430 | if( n->is_Phi() ) continue; |
duke@435 | 431 | for( uint j = 1; j < n->req(); j++ ) |
duke@435 | 432 | if( Find_id(n->in(j)) == lidx ) |
duke@435 | 433 | return true; // Found 1st use! |
duke@435 | 434 | if( n->out_RegMask().is_NotEmpty() ) return false; |
duke@435 | 435 | } |
duke@435 | 436 | return false; |
duke@435 | 437 | } |
duke@435 | 438 | |
duke@435 | 439 | //------------------------------Split-------------------------------------- |
duke@435 | 440 | //----------Split Routine---------- |
duke@435 | 441 | // ***** NEW SPLITTING HEURISTIC ***** |
duke@435 | 442 | // DEFS: If the DEF is in a High Register Pressure(HRP) Block, split there. |
duke@435 | 443 | // Else, no split unless there is a HRP block between a DEF and |
duke@435 | 444 | // one of its uses, and then split at the HRP block. |
duke@435 | 445 | // |
duke@435 | 446 | // USES: If USE is in HRP, split at use to leave main LRG on stack. |
duke@435 | 447 | // Else, hoist LRG back up to register only (ie - split is also DEF) |
duke@435 | 448 | // We will compute a new maxlrg as we go |
duke@435 | 449 | uint PhaseChaitin::Split( uint maxlrg ) { |
duke@435 | 450 | NOT_PRODUCT( Compile::TracePhase t3("regAllocSplit", &_t_regAllocSplit, TimeCompiler); ) |
duke@435 | 451 | |
duke@435 | 452 | uint bidx, pidx, slidx, insidx, inpidx, twoidx; |
duke@435 | 453 | uint non_phi = 1, spill_cnt = 0; |
duke@435 | 454 | Node **Reachblock; |
duke@435 | 455 | Node *n1, *n2, *n3; |
duke@435 | 456 | Node_List *defs,*phis; |
duke@435 | 457 | bool *UPblock; |
duke@435 | 458 | bool u1, u2, u3; |
duke@435 | 459 | Block *b, *pred; |
duke@435 | 460 | PhiNode *phi; |
duke@435 | 461 | GrowableArray<uint> lidxs; |
duke@435 | 462 | |
duke@435 | 463 | // Array of counters to count splits per live range |
duke@435 | 464 | GrowableArray<uint> splits; |
duke@435 | 465 | |
duke@435 | 466 | //----------Setup Code---------- |
duke@435 | 467 | // Create a convenient mapping from lrg numbers to reaches/leaves indices |
duke@435 | 468 | uint *lrg2reach = NEW_RESOURCE_ARRAY( uint, _maxlrg ); |
duke@435 | 469 | // Keep track of DEFS & Phis for later passes |
duke@435 | 470 | defs = new Node_List(); |
duke@435 | 471 | phis = new Node_List(); |
duke@435 | 472 | // Gather info on which LRG's are spilling, and build maps |
duke@435 | 473 | for( bidx = 1; bidx < _maxlrg; bidx++ ) { |
duke@435 | 474 | if( lrgs(bidx).alive() && lrgs(bidx).reg() >= LRG::SPILL_REG ) { |
duke@435 | 475 | assert(!lrgs(bidx).mask().is_AllStack(),"AllStack should color"); |
duke@435 | 476 | lrg2reach[bidx] = spill_cnt; |
duke@435 | 477 | spill_cnt++; |
duke@435 | 478 | lidxs.append(bidx); |
duke@435 | 479 | #ifdef ASSERT |
duke@435 | 480 | // Initialize the split counts to zero |
duke@435 | 481 | splits.append(0); |
duke@435 | 482 | #endif |
duke@435 | 483 | #ifndef PRODUCT |
duke@435 | 484 | if( PrintOpto && WizardMode && lrgs(bidx)._was_spilled1 ) |
duke@435 | 485 | tty->print_cr("Warning, 2nd spill of L%d",bidx); |
duke@435 | 486 | #endif |
duke@435 | 487 | } |
duke@435 | 488 | } |
duke@435 | 489 | |
duke@435 | 490 | // Create side arrays for propagating reaching defs info. |
duke@435 | 491 | // Each block needs a node pointer for each spilling live range for the |
duke@435 | 492 | // Def which is live into the block. Phi nodes handle multiple input |
duke@435 | 493 | // Defs by querying the output of their predecessor blocks and resolving |
duke@435 | 494 | // them to a single Def at the phi. The pointer is updated for each |
duke@435 | 495 | // Def in the block, and then becomes the output for the block when |
duke@435 | 496 | // processing of the block is complete. We also need to track whether |
duke@435 | 497 | // a Def is UP or DOWN. UP means that it should get a register (ie - |
duke@435 | 498 | // it is always in LRP regions), and DOWN means that it is probably |
duke@435 | 499 | // on the stack (ie - it crosses HRP regions). |
duke@435 | 500 | Node ***Reaches = NEW_RESOURCE_ARRAY( Node**, _cfg._num_blocks+1 ); |
duke@435 | 501 | bool **UP = NEW_RESOURCE_ARRAY( bool*, _cfg._num_blocks+1 ); |
duke@435 | 502 | Node **debug_defs = NEW_RESOURCE_ARRAY( Node*, spill_cnt ); |
duke@435 | 503 | VectorSet **UP_entry= NEW_RESOURCE_ARRAY( VectorSet*, spill_cnt ); |
duke@435 | 504 | |
duke@435 | 505 | // Initialize Reaches & UP |
duke@435 | 506 | for( bidx = 0; bidx < _cfg._num_blocks+1; bidx++ ) { |
duke@435 | 507 | Reaches[bidx] = NEW_RESOURCE_ARRAY( Node*, spill_cnt ); |
duke@435 | 508 | UP[bidx] = NEW_RESOURCE_ARRAY( bool, spill_cnt ); |
duke@435 | 509 | Node **Reachblock = Reaches[bidx]; |
duke@435 | 510 | bool *UPblock = UP[bidx]; |
duke@435 | 511 | for( slidx = 0; slidx < spill_cnt; slidx++ ) { |
duke@435 | 512 | UPblock[slidx] = true; // Assume they start in registers |
duke@435 | 513 | Reachblock[slidx] = NULL; // Assume that no def is present |
duke@435 | 514 | } |
duke@435 | 515 | } |
duke@435 | 516 | |
duke@435 | 517 | // Initialize to array of empty vectorsets |
duke@435 | 518 | for( slidx = 0; slidx < spill_cnt; slidx++ ) |
duke@435 | 519 | UP_entry[slidx] = new VectorSet(Thread::current()->resource_area()); |
duke@435 | 520 | |
duke@435 | 521 | //----------PASS 1---------- |
duke@435 | 522 | //----------Propagation & Node Insertion Code---------- |
duke@435 | 523 | // Walk the Blocks in RPO for DEF & USE info |
duke@435 | 524 | for( bidx = 0; bidx < _cfg._num_blocks; bidx++ ) { |
duke@435 | 525 | |
duke@435 | 526 | if (C->check_node_count(spill_cnt, out_of_nodes)) { |
duke@435 | 527 | return 0; |
duke@435 | 528 | } |
duke@435 | 529 | |
duke@435 | 530 | b = _cfg._blocks[bidx]; |
duke@435 | 531 | // Reaches & UP arrays for this block |
duke@435 | 532 | Reachblock = Reaches[b->_pre_order]; |
duke@435 | 533 | UPblock = UP[b->_pre_order]; |
duke@435 | 534 | // Reset counter of start of non-Phi nodes in block |
duke@435 | 535 | non_phi = 1; |
duke@435 | 536 | //----------Block Entry Handling---------- |
duke@435 | 537 | // Check for need to insert a new phi |
duke@435 | 538 | // Cycle through this block's predecessors, collecting Reaches |
duke@435 | 539 | // info for each spilled LRG. If they are identical, no phi is |
duke@435 | 540 | // needed. If they differ, check for a phi, and insert if missing, |
duke@435 | 541 | // or update edges if present. Set current block's Reaches set to |
duke@435 | 542 | // be either the phi's or the reaching def, as appropriate. |
duke@435 | 543 | // If no Phi is needed, check if the LRG needs to spill on entry |
duke@435 | 544 | // to the block due to HRP. |
duke@435 | 545 | for( slidx = 0; slidx < spill_cnt; slidx++ ) { |
duke@435 | 546 | // Grab the live range number |
duke@435 | 547 | uint lidx = lidxs.at(slidx); |
duke@435 | 548 | // Do not bother splitting or putting in Phis for single-def |
duke@435 | 549 | // rematerialized live ranges. This happens alot to constants |
duke@435 | 550 | // with long live ranges. |
never@730 | 551 | if( lrgs(lidx).is_singledef() && |
duke@435 | 552 | lrgs(lidx)._def->rematerialize() ) { |
duke@435 | 553 | // reset the Reaches & UP entries |
duke@435 | 554 | Reachblock[slidx] = lrgs(lidx)._def; |
duke@435 | 555 | UPblock[slidx] = true; |
duke@435 | 556 | // Record following instruction in case 'n' rematerializes and |
duke@435 | 557 | // kills flags |
duke@435 | 558 | Block *pred1 = _cfg._bbs[b->pred(1)->_idx]; |
duke@435 | 559 | continue; |
duke@435 | 560 | } |
duke@435 | 561 | |
duke@435 | 562 | // Initialize needs_phi and needs_split |
duke@435 | 563 | bool needs_phi = false; |
duke@435 | 564 | bool needs_split = false; |
kvn@765 | 565 | bool has_phi = false; |
duke@435 | 566 | // Walk the predecessor blocks to check inputs for that live range |
duke@435 | 567 | // Grab predecessor block header |
duke@435 | 568 | n1 = b->pred(1); |
duke@435 | 569 | // Grab the appropriate reaching def info for inpidx |
duke@435 | 570 | pred = _cfg._bbs[n1->_idx]; |
duke@435 | 571 | pidx = pred->_pre_order; |
duke@435 | 572 | Node **Ltmp = Reaches[pidx]; |
duke@435 | 573 | bool *Utmp = UP[pidx]; |
duke@435 | 574 | n1 = Ltmp[slidx]; |
duke@435 | 575 | u1 = Utmp[slidx]; |
duke@435 | 576 | // Initialize node for saving type info |
duke@435 | 577 | n3 = n1; |
duke@435 | 578 | u3 = u1; |
duke@435 | 579 | |
duke@435 | 580 | // Compare inputs to see if a Phi is needed |
duke@435 | 581 | for( inpidx = 2; inpidx < b->num_preds(); inpidx++ ) { |
duke@435 | 582 | // Grab predecessor block headers |
duke@435 | 583 | n2 = b->pred(inpidx); |
duke@435 | 584 | // Grab the appropriate reaching def info for inpidx |
duke@435 | 585 | pred = _cfg._bbs[n2->_idx]; |
duke@435 | 586 | pidx = pred->_pre_order; |
duke@435 | 587 | Ltmp = Reaches[pidx]; |
duke@435 | 588 | Utmp = UP[pidx]; |
duke@435 | 589 | n2 = Ltmp[slidx]; |
duke@435 | 590 | u2 = Utmp[slidx]; |
duke@435 | 591 | // For each LRG, decide if a phi is necessary |
duke@435 | 592 | if( n1 != n2 ) { |
duke@435 | 593 | needs_phi = true; |
duke@435 | 594 | } |
duke@435 | 595 | // See if the phi has mismatched inputs, UP vs. DOWN |
duke@435 | 596 | if( n1 && n2 && (u1 != u2) ) { |
duke@435 | 597 | needs_split = true; |
duke@435 | 598 | } |
duke@435 | 599 | // Move n2/u2 to n1/u1 for next iteration |
duke@435 | 600 | n1 = n2; |
duke@435 | 601 | u1 = u2; |
duke@435 | 602 | // Preserve a non-NULL predecessor for later type referencing |
duke@435 | 603 | if( (n3 == NULL) && (n2 != NULL) ){ |
duke@435 | 604 | n3 = n2; |
duke@435 | 605 | u3 = u2; |
duke@435 | 606 | } |
duke@435 | 607 | } // End for all potential Phi inputs |
duke@435 | 608 | |
kvn@765 | 609 | // check block for appropriate phinode & update edges |
kvn@765 | 610 | for( insidx = 1; insidx <= b->end_idx(); insidx++ ) { |
kvn@765 | 611 | n1 = b->_nodes[insidx]; |
kvn@765 | 612 | // bail if this is not a phi |
kvn@765 | 613 | phi = n1->is_Phi() ? n1->as_Phi() : NULL; |
kvn@765 | 614 | if( phi == NULL ) { |
kvn@765 | 615 | // Keep track of index of first non-PhiNode instruction in block |
kvn@765 | 616 | non_phi = insidx; |
kvn@765 | 617 | // break out of the for loop as we have handled all phi nodes |
kvn@765 | 618 | break; |
kvn@765 | 619 | } |
kvn@765 | 620 | // must be looking at a phi |
kvn@765 | 621 | if( Find_id(n1) == lidxs.at(slidx) ) { |
kvn@765 | 622 | // found the necessary phi |
kvn@765 | 623 | needs_phi = false; |
kvn@765 | 624 | has_phi = true; |
kvn@765 | 625 | // initialize the Reaches entry for this LRG |
kvn@765 | 626 | Reachblock[slidx] = phi; |
kvn@765 | 627 | break; |
kvn@765 | 628 | } // end if found correct phi |
kvn@765 | 629 | } // end for all phi's |
kvn@765 | 630 | |
kvn@765 | 631 | // If a phi is needed or exist, check for it |
kvn@765 | 632 | if( needs_phi || has_phi ) { |
duke@435 | 633 | // add new phinode if one not already found |
duke@435 | 634 | if( needs_phi ) { |
duke@435 | 635 | // create a new phi node and insert it into the block |
duke@435 | 636 | // type is taken from left over pointer to a predecessor |
duke@435 | 637 | assert(n3,"No non-NULL reaching DEF for a Phi"); |
duke@435 | 638 | phi = new (C, b->num_preds()) PhiNode(b->head(), n3->bottom_type()); |
duke@435 | 639 | // initialize the Reaches entry for this LRG |
duke@435 | 640 | Reachblock[slidx] = phi; |
duke@435 | 641 | |
duke@435 | 642 | // add node to block & node_to_block mapping |
duke@435 | 643 | insert_proj( b, insidx++, phi, maxlrg++ ); |
duke@435 | 644 | non_phi++; |
duke@435 | 645 | // Reset new phi's mapping to be the spilling live range |
duke@435 | 646 | _names.map(phi->_idx, lidx); |
duke@435 | 647 | assert(Find_id(phi) == lidx,"Bad update on Union-Find mapping"); |
duke@435 | 648 | } // end if not found correct phi |
duke@435 | 649 | // Here you have either found or created the Phi, so record it |
duke@435 | 650 | assert(phi != NULL,"Must have a Phi Node here"); |
duke@435 | 651 | phis->push(phi); |
duke@435 | 652 | // PhiNodes should either force the LRG UP or DOWN depending |
duke@435 | 653 | // on its inputs and the register pressure in the Phi's block. |
duke@435 | 654 | UPblock[slidx] = true; // Assume new DEF is UP |
duke@435 | 655 | // If entering a high-pressure area with no immediate use, |
duke@435 | 656 | // assume Phi is DOWN |
duke@435 | 657 | if( is_high_pressure( b, &lrgs(lidx), b->end_idx()) && !prompt_use(b,lidx) ) |
duke@435 | 658 | UPblock[slidx] = false; |
duke@435 | 659 | // If we are not split up/down and all inputs are down, then we |
duke@435 | 660 | // are down |
duke@435 | 661 | if( !needs_split && !u3 ) |
duke@435 | 662 | UPblock[slidx] = false; |
duke@435 | 663 | } // end if phi is needed |
duke@435 | 664 | |
duke@435 | 665 | // Do not need a phi, so grab the reaching DEF |
duke@435 | 666 | else { |
duke@435 | 667 | // Grab predecessor block header |
duke@435 | 668 | n1 = b->pred(1); |
duke@435 | 669 | // Grab the appropriate reaching def info for k |
duke@435 | 670 | pred = _cfg._bbs[n1->_idx]; |
duke@435 | 671 | pidx = pred->_pre_order; |
duke@435 | 672 | Node **Ltmp = Reaches[pidx]; |
duke@435 | 673 | bool *Utmp = UP[pidx]; |
duke@435 | 674 | // reset the Reaches & UP entries |
duke@435 | 675 | Reachblock[slidx] = Ltmp[slidx]; |
duke@435 | 676 | UPblock[slidx] = Utmp[slidx]; |
duke@435 | 677 | } // end else no Phi is needed |
duke@435 | 678 | } // end for all spilling live ranges |
duke@435 | 679 | // DEBUG |
duke@435 | 680 | #ifndef PRODUCT |
duke@435 | 681 | if(trace_spilling()) { |
duke@435 | 682 | tty->print("/`\nBlock %d: ", b->_pre_order); |
duke@435 | 683 | tty->print("Reaching Definitions after Phi handling\n"); |
duke@435 | 684 | for( uint x = 0; x < spill_cnt; x++ ) { |
duke@435 | 685 | tty->print("Spill Idx %d: UP %d: Node\n",x,UPblock[x]); |
duke@435 | 686 | if( Reachblock[x] ) |
duke@435 | 687 | Reachblock[x]->dump(); |
duke@435 | 688 | else |
duke@435 | 689 | tty->print("Undefined\n"); |
duke@435 | 690 | } |
duke@435 | 691 | } |
duke@435 | 692 | #endif |
duke@435 | 693 | |
duke@435 | 694 | //----------Non-Phi Node Splitting---------- |
duke@435 | 695 | // Since phi-nodes have now been handled, the Reachblock array for this |
duke@435 | 696 | // block is initialized with the correct starting value for the defs which |
duke@435 | 697 | // reach non-phi instructions in this block. Thus, process non-phi |
duke@435 | 698 | // instructions normally, inserting SpillCopy nodes for all spill |
duke@435 | 699 | // locations. |
duke@435 | 700 | |
duke@435 | 701 | // Memoize any DOWN reaching definitions for use as DEBUG info |
duke@435 | 702 | for( insidx = 0; insidx < spill_cnt; insidx++ ) { |
duke@435 | 703 | debug_defs[insidx] = (UPblock[insidx]) ? NULL : Reachblock[insidx]; |
duke@435 | 704 | if( UPblock[insidx] ) // Memoize UP decision at block start |
duke@435 | 705 | UP_entry[insidx]->set( b->_pre_order ); |
duke@435 | 706 | } |
duke@435 | 707 | |
duke@435 | 708 | //----------Walk Instructions in the Block and Split---------- |
duke@435 | 709 | // For all non-phi instructions in the block |
duke@435 | 710 | for( insidx = 1; insidx <= b->end_idx(); insidx++ ) { |
duke@435 | 711 | Node *n = b->_nodes[insidx]; |
duke@435 | 712 | // Find the defining Node's live range index |
duke@435 | 713 | uint defidx = Find_id(n); |
duke@435 | 714 | uint cnt = n->req(); |
duke@435 | 715 | |
duke@435 | 716 | if( n->is_Phi() ) { |
duke@435 | 717 | // Skip phi nodes after removing dead copies. |
duke@435 | 718 | if( defidx < _maxlrg ) { |
duke@435 | 719 | // Check for useless Phis. These appear if we spill, then |
duke@435 | 720 | // coalesce away copies. Dont touch Phis in spilling live |
duke@435 | 721 | // ranges; they are busy getting modifed in this pass. |
duke@435 | 722 | if( lrgs(defidx).reg() < LRG::SPILL_REG ) { |
duke@435 | 723 | uint i; |
duke@435 | 724 | Node *u = NULL; |
duke@435 | 725 | // Look for the Phi merging 2 unique inputs |
duke@435 | 726 | for( i = 1; i < cnt; i++ ) { |
duke@435 | 727 | // Ignore repeats and self |
duke@435 | 728 | if( n->in(i) != u && n->in(i) != n ) { |
duke@435 | 729 | // Found a unique input |
duke@435 | 730 | if( u != NULL ) // If it's the 2nd, bail out |
duke@435 | 731 | break; |
duke@435 | 732 | u = n->in(i); // Else record it |
duke@435 | 733 | } |
duke@435 | 734 | } |
duke@435 | 735 | assert( u, "at least 1 valid input expected" ); |
kvn@765 | 736 | if( i >= cnt ) { // Found one unique input |
kvn@765 | 737 | assert(Find_id(n) == Find_id(u), "should be the same lrg"); |
duke@435 | 738 | n->replace_by(u); // Then replace with unique input |
duke@435 | 739 | n->disconnect_inputs(NULL); |
duke@435 | 740 | b->_nodes.remove(insidx); |
duke@435 | 741 | insidx--; |
duke@435 | 742 | b->_ihrp_index--; |
duke@435 | 743 | b->_fhrp_index--; |
duke@435 | 744 | } |
duke@435 | 745 | } |
duke@435 | 746 | } |
duke@435 | 747 | continue; |
duke@435 | 748 | } |
duke@435 | 749 | assert( insidx > b->_ihrp_index || |
duke@435 | 750 | (b->_reg_pressure < (uint)INTPRESSURE) || |
duke@435 | 751 | b->_ihrp_index > 4000000 || |
duke@435 | 752 | b->_ihrp_index >= b->end_idx() || |
duke@435 | 753 | !b->_nodes[b->_ihrp_index]->is_Proj(), "" ); |
duke@435 | 754 | assert( insidx > b->_fhrp_index || |
duke@435 | 755 | (b->_freg_pressure < (uint)FLOATPRESSURE) || |
duke@435 | 756 | b->_fhrp_index > 4000000 || |
duke@435 | 757 | b->_fhrp_index >= b->end_idx() || |
duke@435 | 758 | !b->_nodes[b->_fhrp_index]->is_Proj(), "" ); |
duke@435 | 759 | |
duke@435 | 760 | // ********** Handle Crossing HRP Boundry ********** |
duke@435 | 761 | if( (insidx == b->_ihrp_index) || (insidx == b->_fhrp_index) ) { |
duke@435 | 762 | for( slidx = 0; slidx < spill_cnt; slidx++ ) { |
twisti@1040 | 763 | // Check for need to split at HRP boundary - split if UP |
duke@435 | 764 | n1 = Reachblock[slidx]; |
duke@435 | 765 | // bail out if no reaching DEF |
duke@435 | 766 | if( n1 == NULL ) continue; |
duke@435 | 767 | // bail out if live range is 'isolated' around inner loop |
duke@435 | 768 | uint lidx = lidxs.at(slidx); |
duke@435 | 769 | // If live range is currently UP |
duke@435 | 770 | if( UPblock[slidx] ) { |
duke@435 | 771 | // set location to insert spills at |
duke@435 | 772 | // SPLIT DOWN HERE - NO CISC SPILL |
duke@435 | 773 | if( is_high_pressure( b, &lrgs(lidx), insidx ) && |
duke@435 | 774 | !n1->rematerialize() ) { |
duke@435 | 775 | // If there is already a valid stack definition available, use it |
duke@435 | 776 | if( debug_defs[slidx] != NULL ) { |
duke@435 | 777 | Reachblock[slidx] = debug_defs[slidx]; |
duke@435 | 778 | } |
duke@435 | 779 | else { |
duke@435 | 780 | // Insert point is just past last use or def in the block |
duke@435 | 781 | int insert_point = insidx-1; |
duke@435 | 782 | while( insert_point > 0 ) { |
duke@435 | 783 | Node *n = b->_nodes[insert_point]; |
duke@435 | 784 | // Hit top of block? Quit going backwards |
duke@435 | 785 | if( n->is_Phi() ) break; |
duke@435 | 786 | // Found a def? Better split after it. |
duke@435 | 787 | if( n2lidx(n) == lidx ) break; |
duke@435 | 788 | // Look for a use |
duke@435 | 789 | uint i; |
duke@435 | 790 | for( i = 1; i < n->req(); i++ ) |
duke@435 | 791 | if( n2lidx(n->in(i)) == lidx ) |
duke@435 | 792 | break; |
duke@435 | 793 | // Found a use? Better split after it. |
duke@435 | 794 | if( i < n->req() ) break; |
duke@435 | 795 | insert_point--; |
duke@435 | 796 | } |
duke@435 | 797 | maxlrg = split_DEF( n1, b, insert_point, maxlrg, Reachblock, debug_defs, splits, slidx); |
duke@435 | 798 | // If it wasn't split bail |
duke@435 | 799 | if (!maxlrg) { |
duke@435 | 800 | return 0; |
duke@435 | 801 | } |
duke@435 | 802 | insidx++; |
duke@435 | 803 | } |
duke@435 | 804 | // This is a new DEF, so update UP |
duke@435 | 805 | UPblock[slidx] = false; |
duke@435 | 806 | #ifndef PRODUCT |
duke@435 | 807 | // DEBUG |
duke@435 | 808 | if( trace_spilling() ) { |
duke@435 | 809 | tty->print("\nNew Split DOWN DEF of Spill Idx "); |
duke@435 | 810 | tty->print("%d, UP %d:\n",slidx,false); |
duke@435 | 811 | n1->dump(); |
duke@435 | 812 | } |
duke@435 | 813 | #endif |
duke@435 | 814 | } |
duke@435 | 815 | } // end if LRG is UP |
duke@435 | 816 | } // end for all spilling live ranges |
duke@435 | 817 | assert( b->_nodes[insidx] == n, "got insidx set incorrectly" ); |
duke@435 | 818 | } // end if crossing HRP Boundry |
duke@435 | 819 | |
duke@435 | 820 | // If the LRG index is oob, then this is a new spillcopy, skip it. |
duke@435 | 821 | if( defidx >= _maxlrg ) { |
duke@435 | 822 | continue; |
duke@435 | 823 | } |
duke@435 | 824 | LRG &deflrg = lrgs(defidx); |
duke@435 | 825 | uint copyidx = n->is_Copy(); |
duke@435 | 826 | // Remove coalesced copy from CFG |
duke@435 | 827 | if( copyidx && defidx == n2lidx(n->in(copyidx)) ) { |
duke@435 | 828 | n->replace_by( n->in(copyidx) ); |
duke@435 | 829 | n->set_req( copyidx, NULL ); |
duke@435 | 830 | b->_nodes.remove(insidx--); |
duke@435 | 831 | b->_ihrp_index--; // Adjust the point where we go hi-pressure |
duke@435 | 832 | b->_fhrp_index--; |
duke@435 | 833 | continue; |
duke@435 | 834 | } |
duke@435 | 835 | |
duke@435 | 836 | #define DERIVED 0 |
duke@435 | 837 | |
duke@435 | 838 | // ********** Handle USES ********** |
duke@435 | 839 | bool nullcheck = false; |
duke@435 | 840 | // Implicit null checks never use the spilled value |
duke@435 | 841 | if( n->is_MachNullCheck() ) |
duke@435 | 842 | nullcheck = true; |
duke@435 | 843 | if( !nullcheck ) { |
duke@435 | 844 | // Search all inputs for a Spill-USE |
duke@435 | 845 | JVMState* jvms = n->jvms(); |
duke@435 | 846 | uint oopoff = jvms ? jvms->oopoff() : cnt; |
duke@435 | 847 | uint old_last = cnt - 1; |
duke@435 | 848 | for( inpidx = 1; inpidx < cnt; inpidx++ ) { |
duke@435 | 849 | // Derived/base pairs may be added to our inputs during this loop. |
duke@435 | 850 | // If inpidx > old_last, then one of these new inputs is being |
duke@435 | 851 | // handled. Skip the derived part of the pair, but process |
duke@435 | 852 | // the base like any other input. |
duke@435 | 853 | if( inpidx > old_last && ((inpidx - oopoff) & 1) == DERIVED ) { |
duke@435 | 854 | continue; // skip derived_debug added below |
duke@435 | 855 | } |
duke@435 | 856 | // Get lidx of input |
duke@435 | 857 | uint useidx = Find_id(n->in(inpidx)); |
duke@435 | 858 | // Not a brand-new split, and it is a spill use |
duke@435 | 859 | if( useidx < _maxlrg && lrgs(useidx).reg() >= LRG::SPILL_REG ) { |
duke@435 | 860 | // Check for valid reaching DEF |
duke@435 | 861 | slidx = lrg2reach[useidx]; |
duke@435 | 862 | Node *def = Reachblock[slidx]; |
duke@435 | 863 | assert( def != NULL, "Using Undefined Value in Split()\n"); |
duke@435 | 864 | |
duke@435 | 865 | // (+++) %%%% remove this in favor of pre-pass in matcher.cpp |
duke@435 | 866 | // monitor references do not care where they live, so just hook |
duke@435 | 867 | if ( jvms && jvms->is_monitor_use(inpidx) ) { |
duke@435 | 868 | // The effect of this clone is to drop the node out of the block, |
duke@435 | 869 | // so that the allocator does not see it anymore, and therefore |
duke@435 | 870 | // does not attempt to assign it a register. |
kvn@2048 | 871 | def = clone_node(def, b, C); |
kvn@2048 | 872 | if (def == NULL || C->check_node_count(NodeLimitFudgeFactor, out_of_nodes)) { |
kvn@2048 | 873 | return 0; |
kvn@2048 | 874 | } |
duke@435 | 875 | _names.extend(def->_idx,0); |
duke@435 | 876 | _cfg._bbs.map(def->_idx,b); |
duke@435 | 877 | n->set_req(inpidx, def); |
duke@435 | 878 | continue; |
duke@435 | 879 | } |
duke@435 | 880 | |
duke@435 | 881 | // Rematerializable? Then clone def at use site instead |
duke@435 | 882 | // of store/load |
duke@435 | 883 | if( def->rematerialize() ) { |
duke@435 | 884 | int old_size = b->_nodes.size(); |
duke@435 | 885 | def = split_Rematerialize( def, b, insidx, maxlrg, splits, slidx, lrg2reach, Reachblock, true ); |
duke@435 | 886 | if( !def ) return 0; // Bail out |
duke@435 | 887 | insidx += b->_nodes.size()-old_size; |
duke@435 | 888 | } |
duke@435 | 889 | |
duke@435 | 890 | MachNode *mach = n->is_Mach() ? n->as_Mach() : NULL; |
duke@435 | 891 | // Base pointers and oopmap references do not care where they live. |
duke@435 | 892 | if ((inpidx >= oopoff) || |
duke@435 | 893 | (mach && mach->ideal_Opcode() == Op_AddP && inpidx == AddPNode::Base)) { |
duke@435 | 894 | if (def->rematerialize() && lrgs(useidx)._was_spilled2) { |
duke@435 | 895 | // This def has been rematerialized a couple of times without |
duke@435 | 896 | // progress. It doesn't care if it lives UP or DOWN, so |
duke@435 | 897 | // spill it down now. |
duke@435 | 898 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,false,false,splits,slidx); |
duke@435 | 899 | // If it wasn't split bail |
duke@435 | 900 | if (!maxlrg) { |
duke@435 | 901 | return 0; |
duke@435 | 902 | } |
duke@435 | 903 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 904 | } else { |
duke@435 | 905 | // Just hook the def edge |
duke@435 | 906 | n->set_req(inpidx, def); |
duke@435 | 907 | } |
duke@435 | 908 | |
duke@435 | 909 | if (inpidx >= oopoff) { |
duke@435 | 910 | // After oopoff, we have derived/base pairs. We must mention all |
duke@435 | 911 | // derived pointers here as derived/base pairs for GC. If the |
duke@435 | 912 | // derived value is spilling and we have a copy both in Reachblock |
duke@435 | 913 | // (called here 'def') and debug_defs[slidx] we need to mention |
duke@435 | 914 | // both in derived/base pairs or kill one. |
duke@435 | 915 | Node *derived_debug = debug_defs[slidx]; |
duke@435 | 916 | if( ((inpidx - oopoff) & 1) == DERIVED && // derived vs base? |
duke@435 | 917 | mach && mach->ideal_Opcode() != Op_Halt && |
duke@435 | 918 | derived_debug != NULL && |
duke@435 | 919 | derived_debug != def ) { // Actual 2nd value appears |
duke@435 | 920 | // We have already set 'def' as a derived value. |
duke@435 | 921 | // Also set debug_defs[slidx] as a derived value. |
duke@435 | 922 | uint k; |
duke@435 | 923 | for( k = oopoff; k < cnt; k += 2 ) |
duke@435 | 924 | if( n->in(k) == derived_debug ) |
duke@435 | 925 | break; // Found an instance of debug derived |
duke@435 | 926 | if( k == cnt ) {// No instance of debug_defs[slidx] |
duke@435 | 927 | // Add a derived/base pair to cover the debug info. |
duke@435 | 928 | // We have to process the added base later since it is not |
duke@435 | 929 | // handled yet at this point but skip derived part. |
duke@435 | 930 | assert(((n->req() - oopoff) & 1) == DERIVED, |
duke@435 | 931 | "must match skip condition above"); |
duke@435 | 932 | n->add_req( derived_debug ); // this will be skipped above |
duke@435 | 933 | n->add_req( n->in(inpidx+1) ); // this will be processed |
duke@435 | 934 | // Increment cnt to handle added input edges on |
duke@435 | 935 | // subsequent iterations. |
duke@435 | 936 | cnt += 2; |
duke@435 | 937 | } |
duke@435 | 938 | } |
duke@435 | 939 | } |
duke@435 | 940 | continue; |
duke@435 | 941 | } |
duke@435 | 942 | // Special logic for DEBUG info |
duke@435 | 943 | if( jvms && b->_freq > BLOCK_FREQUENCY(0.5) ) { |
duke@435 | 944 | uint debug_start = jvms->debug_start(); |
duke@435 | 945 | // If this is debug info use & there is a reaching DOWN def |
duke@435 | 946 | if ((debug_start <= inpidx) && (debug_defs[slidx] != NULL)) { |
duke@435 | 947 | assert(inpidx < oopoff, "handle only debug info here"); |
duke@435 | 948 | // Just hook it in & move on |
duke@435 | 949 | n->set_req(inpidx, debug_defs[slidx]); |
duke@435 | 950 | // (Note that this can make two sides of a split live at the |
duke@435 | 951 | // same time: The debug def on stack, and another def in a |
duke@435 | 952 | // register. The GC needs to know about both of them, but any |
duke@435 | 953 | // derived pointers after oopoff will refer to only one of the |
duke@435 | 954 | // two defs and the GC would therefore miss the other. Thus |
duke@435 | 955 | // this hack is only allowed for debug info which is Java state |
duke@435 | 956 | // and therefore never a derived pointer.) |
duke@435 | 957 | continue; |
duke@435 | 958 | } |
duke@435 | 959 | } |
duke@435 | 960 | // Grab register mask info |
duke@435 | 961 | const RegMask &dmask = def->out_RegMask(); |
duke@435 | 962 | const RegMask &umask = n->in_RegMask(inpidx); |
duke@435 | 963 | |
duke@435 | 964 | assert(inpidx < oopoff, "cannot use-split oop map info"); |
duke@435 | 965 | |
duke@435 | 966 | bool dup = UPblock[slidx]; |
duke@435 | 967 | bool uup = umask.is_UP(); |
duke@435 | 968 | |
duke@435 | 969 | // Need special logic to handle bound USES. Insert a split at this |
duke@435 | 970 | // bound use if we can't rematerialize the def, or if we need the |
duke@435 | 971 | // split to form a misaligned pair. |
duke@435 | 972 | if( !umask.is_AllStack() && |
duke@435 | 973 | (int)umask.Size() <= lrgs(useidx).num_regs() && |
duke@435 | 974 | (!def->rematerialize() || |
duke@435 | 975 | umask.is_misaligned_Pair())) { |
duke@435 | 976 | // These need a Split regardless of overlap or pressure |
duke@435 | 977 | // SPLIT - NO DEF - NO CISC SPILL |
duke@435 | 978 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,dup,false, splits,slidx); |
duke@435 | 979 | // If it wasn't split bail |
duke@435 | 980 | if (!maxlrg) { |
duke@435 | 981 | return 0; |
duke@435 | 982 | } |
duke@435 | 983 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 984 | continue; |
duke@435 | 985 | } |
never@2085 | 986 | |
kvn@3040 | 987 | if (UseFPUForSpilling && n->is_MachCall() && !uup && !dup ) { |
never@2085 | 988 | // The use at the call can force the def down so insert |
never@2085 | 989 | // a split before the use to allow the def more freedom. |
never@2085 | 990 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,dup,false, splits,slidx); |
never@2085 | 991 | // If it wasn't split bail |
never@2085 | 992 | if (!maxlrg) { |
never@2085 | 993 | return 0; |
never@2085 | 994 | } |
never@2085 | 995 | insidx++; // Reset iterator to skip USE side split |
never@2085 | 996 | continue; |
never@2085 | 997 | } |
never@2085 | 998 | |
duke@435 | 999 | // Here is the logic chart which describes USE Splitting: |
duke@435 | 1000 | // 0 = false or DOWN, 1 = true or UP |
duke@435 | 1001 | // |
duke@435 | 1002 | // Overlap | DEF | USE | Action |
duke@435 | 1003 | //------------------------------------------------------- |
duke@435 | 1004 | // 0 | 0 | 0 | Copy - mem -> mem |
duke@435 | 1005 | // 0 | 0 | 1 | Split-UP - Check HRP |
duke@435 | 1006 | // 0 | 1 | 0 | Split-DOWN - Debug Info? |
duke@435 | 1007 | // 0 | 1 | 1 | Copy - reg -> reg |
duke@435 | 1008 | // 1 | 0 | 0 | Reset Input Edge (no Split) |
duke@435 | 1009 | // 1 | 0 | 1 | Split-UP - Check HRP |
duke@435 | 1010 | // 1 | 1 | 0 | Split-DOWN - Debug Info? |
duke@435 | 1011 | // 1 | 1 | 1 | Reset Input Edge (no Split) |
duke@435 | 1012 | // |
duke@435 | 1013 | // So, if (dup == uup), then overlap test determines action, |
duke@435 | 1014 | // with true being no split, and false being copy. Else, |
duke@435 | 1015 | // if DEF is DOWN, Split-UP, and check HRP to decide on |
duke@435 | 1016 | // resetting DEF. Finally if DEF is UP, Split-DOWN, with |
duke@435 | 1017 | // special handling for Debug Info. |
duke@435 | 1018 | if( dup == uup ) { |
duke@435 | 1019 | if( dmask.overlap(umask) ) { |
duke@435 | 1020 | // Both are either up or down, and there is overlap, No Split |
duke@435 | 1021 | n->set_req(inpidx, def); |
duke@435 | 1022 | } |
duke@435 | 1023 | else { // Both are either up or down, and there is no overlap |
duke@435 | 1024 | if( dup ) { // If UP, reg->reg copy |
duke@435 | 1025 | // COPY ACROSS HERE - NO DEF - NO CISC SPILL |
duke@435 | 1026 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,false,false, splits,slidx); |
duke@435 | 1027 | // If it wasn't split bail |
duke@435 | 1028 | if (!maxlrg) { |
duke@435 | 1029 | return 0; |
duke@435 | 1030 | } |
duke@435 | 1031 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 1032 | } |
duke@435 | 1033 | else { // DOWN, mem->mem copy |
duke@435 | 1034 | // COPY UP & DOWN HERE - NO DEF - NO CISC SPILL |
duke@435 | 1035 | // First Split-UP to move value into Register |
duke@435 | 1036 | uint def_ideal = def->ideal_reg(); |
duke@435 | 1037 | const RegMask* tmp_rm = Matcher::idealreg2regmask[def_ideal]; |
duke@435 | 1038 | Node *spill = new (C) MachSpillCopyNode(def, dmask, *tmp_rm); |
duke@435 | 1039 | insert_proj( b, insidx, spill, maxlrg ); |
duke@435 | 1040 | // Then Split-DOWN as if previous Split was DEF |
duke@435 | 1041 | maxlrg = split_USE(spill,b,n,inpidx,maxlrg,false,false, splits,slidx); |
duke@435 | 1042 | // If it wasn't split bail |
duke@435 | 1043 | if (!maxlrg) { |
duke@435 | 1044 | return 0; |
duke@435 | 1045 | } |
duke@435 | 1046 | insidx += 2; // Reset iterator to skip USE side splits |
duke@435 | 1047 | } |
duke@435 | 1048 | } // End else no overlap |
duke@435 | 1049 | } // End if dup == uup |
duke@435 | 1050 | // dup != uup, so check dup for direction of Split |
duke@435 | 1051 | else { |
duke@435 | 1052 | if( dup ) { // If UP, Split-DOWN and check Debug Info |
duke@435 | 1053 | // If this node is already a SpillCopy, just patch the edge |
duke@435 | 1054 | // except the case of spilling to stack. |
duke@435 | 1055 | if( n->is_SpillCopy() ) { |
duke@435 | 1056 | RegMask tmp_rm(umask); |
duke@435 | 1057 | tmp_rm.SUBTRACT(Matcher::STACK_ONLY_mask); |
duke@435 | 1058 | if( dmask.overlap(tmp_rm) ) { |
duke@435 | 1059 | if( def != n->in(inpidx) ) { |
duke@435 | 1060 | n->set_req(inpidx, def); |
duke@435 | 1061 | } |
duke@435 | 1062 | continue; |
duke@435 | 1063 | } |
duke@435 | 1064 | } |
duke@435 | 1065 | // COPY DOWN HERE - NO DEF - NO CISC SPILL |
duke@435 | 1066 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,false,false, splits,slidx); |
duke@435 | 1067 | // If it wasn't split bail |
duke@435 | 1068 | if (!maxlrg) { |
duke@435 | 1069 | return 0; |
duke@435 | 1070 | } |
duke@435 | 1071 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 1072 | // Check for debug-info split. Capture it for later |
duke@435 | 1073 | // debug splits of the same value |
duke@435 | 1074 | if (jvms && jvms->debug_start() <= inpidx && inpidx < oopoff) |
duke@435 | 1075 | debug_defs[slidx] = n->in(inpidx); |
duke@435 | 1076 | |
duke@435 | 1077 | } |
duke@435 | 1078 | else { // DOWN, Split-UP and check register pressure |
duke@435 | 1079 | if( is_high_pressure( b, &lrgs(useidx), insidx ) ) { |
duke@435 | 1080 | // COPY UP HERE - NO DEF - CISC SPILL |
duke@435 | 1081 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,true,true, splits,slidx); |
duke@435 | 1082 | // If it wasn't split bail |
duke@435 | 1083 | if (!maxlrg) { |
duke@435 | 1084 | return 0; |
duke@435 | 1085 | } |
duke@435 | 1086 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 1087 | } else { // LRP |
duke@435 | 1088 | // COPY UP HERE - WITH DEF - NO CISC SPILL |
duke@435 | 1089 | maxlrg = split_USE(def,b,n,inpidx,maxlrg,true,false, splits,slidx); |
duke@435 | 1090 | // If it wasn't split bail |
duke@435 | 1091 | if (!maxlrg) { |
duke@435 | 1092 | return 0; |
duke@435 | 1093 | } |
duke@435 | 1094 | // Flag this lift-up in a low-pressure block as |
duke@435 | 1095 | // already-spilled, so if it spills again it will |
duke@435 | 1096 | // spill hard (instead of not spilling hard and |
duke@435 | 1097 | // coalescing away). |
duke@435 | 1098 | set_was_spilled(n->in(inpidx)); |
duke@435 | 1099 | // Since this is a new DEF, update Reachblock & UP |
duke@435 | 1100 | Reachblock[slidx] = n->in(inpidx); |
duke@435 | 1101 | UPblock[slidx] = true; |
duke@435 | 1102 | insidx++; // Reset iterator to skip USE side split |
duke@435 | 1103 | } |
duke@435 | 1104 | } // End else DOWN |
duke@435 | 1105 | } // End dup != uup |
duke@435 | 1106 | } // End if Spill USE |
duke@435 | 1107 | } // End For All Inputs |
duke@435 | 1108 | } // End If not nullcheck |
duke@435 | 1109 | |
duke@435 | 1110 | // ********** Handle DEFS ********** |
duke@435 | 1111 | // DEFS either Split DOWN in HRP regions or when the LRG is bound, or |
duke@435 | 1112 | // just reset the Reaches info in LRP regions. DEFS must always update |
duke@435 | 1113 | // UP info. |
duke@435 | 1114 | if( deflrg.reg() >= LRG::SPILL_REG ) { // Spilled? |
duke@435 | 1115 | uint slidx = lrg2reach[defidx]; |
duke@435 | 1116 | // Add to defs list for later assignment of new live range number |
duke@435 | 1117 | defs->push(n); |
duke@435 | 1118 | // Set a flag on the Node indicating it has already spilled. |
duke@435 | 1119 | // Only do it for capacity spills not conflict spills. |
duke@435 | 1120 | if( !deflrg._direct_conflict ) |
duke@435 | 1121 | set_was_spilled(n); |
duke@435 | 1122 | assert(!n->is_Phi(),"Cannot insert Phi into DEFS list"); |
duke@435 | 1123 | // Grab UP info for DEF |
duke@435 | 1124 | const RegMask &dmask = n->out_RegMask(); |
duke@435 | 1125 | bool defup = dmask.is_UP(); |
duke@435 | 1126 | // Only split at Def if this is a HRP block or bound (and spilled once) |
duke@435 | 1127 | if( !n->rematerialize() && |
duke@435 | 1128 | (((dmask.is_bound1() || dmask.is_bound2() || dmask.is_misaligned_Pair()) && |
duke@435 | 1129 | (deflrg._direct_conflict || deflrg._must_spill)) || |
duke@435 | 1130 | // Check for LRG being up in a register and we are inside a high |
duke@435 | 1131 | // pressure area. Spill it down immediately. |
duke@435 | 1132 | (defup && is_high_pressure(b,&deflrg,insidx))) ) { |
duke@435 | 1133 | assert( !n->rematerialize(), "" ); |
duke@435 | 1134 | assert( !n->is_SpillCopy(), "" ); |
duke@435 | 1135 | // Do a split at the def site. |
duke@435 | 1136 | maxlrg = split_DEF( n, b, insidx, maxlrg, Reachblock, debug_defs, splits, slidx ); |
duke@435 | 1137 | // If it wasn't split bail |
duke@435 | 1138 | if (!maxlrg) { |
duke@435 | 1139 | return 0; |
duke@435 | 1140 | } |
duke@435 | 1141 | // Split DEF's Down |
duke@435 | 1142 | UPblock[slidx] = 0; |
duke@435 | 1143 | #ifndef PRODUCT |
duke@435 | 1144 | // DEBUG |
duke@435 | 1145 | if( trace_spilling() ) { |
duke@435 | 1146 | tty->print("\nNew Split DOWN DEF of Spill Idx "); |
duke@435 | 1147 | tty->print("%d, UP %d:\n",slidx,false); |
duke@435 | 1148 | n->dump(); |
duke@435 | 1149 | } |
duke@435 | 1150 | #endif |
duke@435 | 1151 | } |
duke@435 | 1152 | else { // Neither bound nor HRP, must be LRP |
duke@435 | 1153 | // otherwise, just record the def |
duke@435 | 1154 | Reachblock[slidx] = n; |
duke@435 | 1155 | // UP should come from the outRegmask() of the DEF |
duke@435 | 1156 | UPblock[slidx] = defup; |
duke@435 | 1157 | // Update debug list of reaching down definitions, kill if DEF is UP |
duke@435 | 1158 | debug_defs[slidx] = defup ? NULL : n; |
duke@435 | 1159 | #ifndef PRODUCT |
duke@435 | 1160 | // DEBUG |
duke@435 | 1161 | if( trace_spilling() ) { |
duke@435 | 1162 | tty->print("\nNew DEF of Spill Idx "); |
duke@435 | 1163 | tty->print("%d, UP %d:\n",slidx,defup); |
duke@435 | 1164 | n->dump(); |
duke@435 | 1165 | } |
duke@435 | 1166 | #endif |
duke@435 | 1167 | } // End else LRP |
duke@435 | 1168 | } // End if spill def |
duke@435 | 1169 | |
duke@435 | 1170 | // ********** Split Left Over Mem-Mem Moves ********** |
duke@435 | 1171 | // Check for mem-mem copies and split them now. Do not do this |
duke@435 | 1172 | // to copies about to be spilled; they will be Split shortly. |
duke@435 | 1173 | if( copyidx ) { |
duke@435 | 1174 | Node *use = n->in(copyidx); |
duke@435 | 1175 | uint useidx = Find_id(use); |
duke@435 | 1176 | if( useidx < _maxlrg && // This is not a new split |
duke@435 | 1177 | OptoReg::is_stack(deflrg.reg()) && |
duke@435 | 1178 | deflrg.reg() < LRG::SPILL_REG ) { // And DEF is from stack |
duke@435 | 1179 | LRG &uselrg = lrgs(useidx); |
duke@435 | 1180 | if( OptoReg::is_stack(uselrg.reg()) && |
duke@435 | 1181 | uselrg.reg() < LRG::SPILL_REG && // USE is from stack |
duke@435 | 1182 | deflrg.reg() != uselrg.reg() ) { // Not trivially removed |
duke@435 | 1183 | uint def_ideal_reg = Matcher::base2reg[n->bottom_type()->base()]; |
duke@435 | 1184 | const RegMask &def_rm = *Matcher::idealreg2regmask[def_ideal_reg]; |
duke@435 | 1185 | const RegMask &use_rm = n->in_RegMask(copyidx); |
duke@435 | 1186 | if( def_rm.overlap(use_rm) && n->is_SpillCopy() ) { // Bug 4707800, 'n' may be a storeSSL |
duke@435 | 1187 | if (C->check_node_count(NodeLimitFudgeFactor, out_of_nodes)) { // Check when generating nodes |
duke@435 | 1188 | return 0; |
duke@435 | 1189 | } |
duke@435 | 1190 | Node *spill = new (C) MachSpillCopyNode(use,use_rm,def_rm); |
duke@435 | 1191 | n->set_req(copyidx,spill); |
duke@435 | 1192 | n->as_MachSpillCopy()->set_in_RegMask(def_rm); |
duke@435 | 1193 | // Put the spill just before the copy |
duke@435 | 1194 | insert_proj( b, insidx++, spill, maxlrg++ ); |
duke@435 | 1195 | } |
duke@435 | 1196 | } |
duke@435 | 1197 | } |
duke@435 | 1198 | } |
duke@435 | 1199 | } // End For All Instructions in Block - Non-PHI Pass |
duke@435 | 1200 | |
duke@435 | 1201 | // Check if each LRG is live out of this block so as not to propagate |
duke@435 | 1202 | // beyond the last use of a LRG. |
duke@435 | 1203 | for( slidx = 0; slidx < spill_cnt; slidx++ ) { |
duke@435 | 1204 | uint defidx = lidxs.at(slidx); |
duke@435 | 1205 | IndexSet *liveout = _live->live(b); |
duke@435 | 1206 | if( !liveout->member(defidx) ) { |
duke@435 | 1207 | #ifdef ASSERT |
duke@435 | 1208 | // The index defidx is not live. Check the liveout array to ensure that |
duke@435 | 1209 | // it contains no members which compress to defidx. Finding such an |
duke@435 | 1210 | // instance may be a case to add liveout adjustment in compress_uf_map(). |
duke@435 | 1211 | // See 5063219. |
duke@435 | 1212 | uint member; |
duke@435 | 1213 | IndexSetIterator isi(liveout); |
duke@435 | 1214 | while ((member = isi.next()) != 0) { |
duke@435 | 1215 | assert(defidx != Find_const(member), "Live out member has not been compressed"); |
duke@435 | 1216 | } |
duke@435 | 1217 | #endif |
duke@435 | 1218 | Reachblock[slidx] = NULL; |
duke@435 | 1219 | } else { |
duke@435 | 1220 | assert(Reachblock[slidx] != NULL,"No reaching definition for liveout value"); |
duke@435 | 1221 | } |
duke@435 | 1222 | } |
duke@435 | 1223 | #ifndef PRODUCT |
duke@435 | 1224 | if( trace_spilling() ) |
duke@435 | 1225 | b->dump(); |
duke@435 | 1226 | #endif |
duke@435 | 1227 | } // End For All Blocks |
duke@435 | 1228 | |
duke@435 | 1229 | //----------PASS 2---------- |
duke@435 | 1230 | // Reset all DEF live range numbers here |
duke@435 | 1231 | for( insidx = 0; insidx < defs->size(); insidx++ ) { |
duke@435 | 1232 | // Grab the def |
duke@435 | 1233 | n1 = defs->at(insidx); |
duke@435 | 1234 | // Set new lidx for DEF |
duke@435 | 1235 | new_lrg(n1, maxlrg++); |
duke@435 | 1236 | } |
duke@435 | 1237 | //----------Phi Node Splitting---------- |
duke@435 | 1238 | // Clean up a phi here, and assign a new live range number |
duke@435 | 1239 | // Cycle through this block's predecessors, collecting Reaches |
duke@435 | 1240 | // info for each spilled LRG and update edges. |
duke@435 | 1241 | // Walk the phis list to patch inputs, split phis, and name phis |
never@2358 | 1242 | uint lrgs_before_phi_split = maxlrg; |
duke@435 | 1243 | for( insidx = 0; insidx < phis->size(); insidx++ ) { |
duke@435 | 1244 | Node *phi = phis->at(insidx); |
duke@435 | 1245 | assert(phi->is_Phi(),"This list must only contain Phi Nodes"); |
duke@435 | 1246 | Block *b = _cfg._bbs[phi->_idx]; |
duke@435 | 1247 | // Grab the live range number |
duke@435 | 1248 | uint lidx = Find_id(phi); |
duke@435 | 1249 | uint slidx = lrg2reach[lidx]; |
duke@435 | 1250 | // Update node to lidx map |
duke@435 | 1251 | new_lrg(phi, maxlrg++); |
duke@435 | 1252 | // Get PASS1's up/down decision for the block. |
duke@435 | 1253 | int phi_up = !!UP_entry[slidx]->test(b->_pre_order); |
duke@435 | 1254 | |
duke@435 | 1255 | // Force down if double-spilling live range |
duke@435 | 1256 | if( lrgs(lidx)._was_spilled1 ) |
duke@435 | 1257 | phi_up = false; |
duke@435 | 1258 | |
duke@435 | 1259 | // When splitting a Phi we an split it normal or "inverted". |
duke@435 | 1260 | // An inverted split makes the splits target the Phi's UP/DOWN |
duke@435 | 1261 | // sense inverted; then the Phi is followed by a final def-side |
duke@435 | 1262 | // split to invert back. It changes which blocks the spill code |
duke@435 | 1263 | // goes in. |
duke@435 | 1264 | |
duke@435 | 1265 | // Walk the predecessor blocks and assign the reaching def to the Phi. |
duke@435 | 1266 | // Split Phi nodes by placing USE side splits wherever the reaching |
duke@435 | 1267 | // DEF has the wrong UP/DOWN value. |
duke@435 | 1268 | for( uint i = 1; i < b->num_preds(); i++ ) { |
duke@435 | 1269 | // Get predecessor block pre-order number |
duke@435 | 1270 | Block *pred = _cfg._bbs[b->pred(i)->_idx]; |
duke@435 | 1271 | pidx = pred->_pre_order; |
duke@435 | 1272 | // Grab reaching def |
duke@435 | 1273 | Node *def = Reaches[pidx][slidx]; |
duke@435 | 1274 | assert( def, "must have reaching def" ); |
duke@435 | 1275 | // If input up/down sense and reg-pressure DISagree |
duke@435 | 1276 | if( def->rematerialize() ) { |
never@2358 | 1277 | // Place the rematerialized node above any MSCs created during |
never@2358 | 1278 | // phi node splitting. end_idx points at the insertion point |
never@2358 | 1279 | // so look at the node before it. |
never@2358 | 1280 | int insert = pred->end_idx(); |
never@2358 | 1281 | while (insert >= 1 && |
never@2358 | 1282 | pred->_nodes[insert - 1]->is_SpillCopy() && |
never@2358 | 1283 | Find(pred->_nodes[insert - 1]) >= lrgs_before_phi_split) { |
never@2358 | 1284 | insert--; |
never@2358 | 1285 | } |
never@2358 | 1286 | def = split_Rematerialize( def, pred, insert, maxlrg, splits, slidx, lrg2reach, Reachblock, false ); |
duke@435 | 1287 | if( !def ) return 0; // Bail out |
duke@435 | 1288 | } |
duke@435 | 1289 | // Update the Phi's input edge array |
duke@435 | 1290 | phi->set_req(i,def); |
duke@435 | 1291 | // Grab the UP/DOWN sense for the input |
duke@435 | 1292 | u1 = UP[pidx][slidx]; |
duke@435 | 1293 | if( u1 != (phi_up != 0)) { |
duke@435 | 1294 | maxlrg = split_USE(def, b, phi, i, maxlrg, !u1, false, splits,slidx); |
duke@435 | 1295 | // If it wasn't split bail |
duke@435 | 1296 | if (!maxlrg) { |
duke@435 | 1297 | return 0; |
duke@435 | 1298 | } |
duke@435 | 1299 | } |
duke@435 | 1300 | } // End for all inputs to the Phi |
duke@435 | 1301 | } // End for all Phi Nodes |
duke@435 | 1302 | // Update _maxlrg to save Union asserts |
duke@435 | 1303 | _maxlrg = maxlrg; |
duke@435 | 1304 | |
duke@435 | 1305 | |
duke@435 | 1306 | //----------PASS 3---------- |
duke@435 | 1307 | // Pass over all Phi's to union the live ranges |
duke@435 | 1308 | for( insidx = 0; insidx < phis->size(); insidx++ ) { |
duke@435 | 1309 | Node *phi = phis->at(insidx); |
duke@435 | 1310 | assert(phi->is_Phi(),"This list must only contain Phi Nodes"); |
duke@435 | 1311 | // Walk all inputs to Phi and Union input live range with Phi live range |
duke@435 | 1312 | for( uint i = 1; i < phi->req(); i++ ) { |
duke@435 | 1313 | // Grab the input node |
duke@435 | 1314 | Node *n = phi->in(i); |
duke@435 | 1315 | assert( n, "" ); |
duke@435 | 1316 | uint lidx = Find(n); |
duke@435 | 1317 | uint pidx = Find(phi); |
duke@435 | 1318 | if( lidx < pidx ) |
duke@435 | 1319 | Union(n, phi); |
duke@435 | 1320 | else if( lidx > pidx ) |
duke@435 | 1321 | Union(phi, n); |
duke@435 | 1322 | } // End for all inputs to the Phi Node |
duke@435 | 1323 | } // End for all Phi Nodes |
duke@435 | 1324 | // Now union all two address instructions |
duke@435 | 1325 | for( insidx = 0; insidx < defs->size(); insidx++ ) { |
duke@435 | 1326 | // Grab the def |
duke@435 | 1327 | n1 = defs->at(insidx); |
duke@435 | 1328 | // Set new lidx for DEF & handle 2-addr instructions |
duke@435 | 1329 | if( n1->is_Mach() && ((twoidx = n1->as_Mach()->two_adr()) != 0) ) { |
duke@435 | 1330 | assert( Find(n1->in(twoidx)) < maxlrg,"Assigning bad live range index"); |
duke@435 | 1331 | // Union the input and output live ranges |
duke@435 | 1332 | uint lr1 = Find(n1); |
duke@435 | 1333 | uint lr2 = Find(n1->in(twoidx)); |
duke@435 | 1334 | if( lr1 < lr2 ) |
duke@435 | 1335 | Union(n1, n1->in(twoidx)); |
duke@435 | 1336 | else if( lr1 > lr2 ) |
duke@435 | 1337 | Union(n1->in(twoidx), n1); |
duke@435 | 1338 | } // End if two address |
duke@435 | 1339 | } // End for all defs |
duke@435 | 1340 | // DEBUG |
duke@435 | 1341 | #ifdef ASSERT |
duke@435 | 1342 | // Validate all live range index assignments |
duke@435 | 1343 | for( bidx = 0; bidx < _cfg._num_blocks; bidx++ ) { |
duke@435 | 1344 | b = _cfg._blocks[bidx]; |
duke@435 | 1345 | for( insidx = 0; insidx <= b->end_idx(); insidx++ ) { |
duke@435 | 1346 | Node *n = b->_nodes[insidx]; |
duke@435 | 1347 | uint defidx = Find(n); |
duke@435 | 1348 | assert(defidx < _maxlrg,"Bad live range index in Split"); |
duke@435 | 1349 | assert(defidx < maxlrg,"Bad live range index in Split"); |
duke@435 | 1350 | } |
duke@435 | 1351 | } |
duke@435 | 1352 | // Issue a warning if splitting made no progress |
duke@435 | 1353 | int noprogress = 0; |
duke@435 | 1354 | for( slidx = 0; slidx < spill_cnt; slidx++ ) { |
duke@435 | 1355 | if( PrintOpto && WizardMode && splits.at(slidx) == 0 ) { |
duke@435 | 1356 | tty->print_cr("Failed to split live range %d", lidxs.at(slidx)); |
duke@435 | 1357 | //BREAKPOINT; |
duke@435 | 1358 | } |
duke@435 | 1359 | else { |
duke@435 | 1360 | noprogress++; |
duke@435 | 1361 | } |
duke@435 | 1362 | } |
duke@435 | 1363 | if(!noprogress) { |
duke@435 | 1364 | tty->print_cr("Failed to make progress in Split"); |
duke@435 | 1365 | //BREAKPOINT; |
duke@435 | 1366 | } |
duke@435 | 1367 | #endif |
duke@435 | 1368 | // Return updated count of live ranges |
duke@435 | 1369 | return maxlrg; |
duke@435 | 1370 | } |