Mon, 24 Nov 2014 07:29:03 -0800
8058148: MaxNodeLimit and LiveNodeCountInliningCutoff
Reviewed-by: kvn, roland
duke@435 | 1 | /* |
mikael@6198 | 2 | * Copyright (c) 1997, 2013, 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 | #ifndef SHARE_VM_OPTO_CHAITIN_HPP |
stefank@2314 | 26 | #define SHARE_VM_OPTO_CHAITIN_HPP |
stefank@2314 | 27 | |
stefank@2314 | 28 | #include "code/vmreg.hpp" |
stefank@2314 | 29 | #include "libadt/port.hpp" |
stefank@2314 | 30 | #include "memory/resourceArea.hpp" |
stefank@2314 | 31 | #include "opto/connode.hpp" |
stefank@2314 | 32 | #include "opto/live.hpp" |
stefank@2314 | 33 | #include "opto/matcher.hpp" |
stefank@2314 | 34 | #include "opto/phase.hpp" |
stefank@2314 | 35 | #include "opto/regalloc.hpp" |
stefank@2314 | 36 | #include "opto/regmask.hpp" |
stefank@2314 | 37 | |
duke@435 | 38 | class LoopTree; |
duke@435 | 39 | class MachCallNode; |
duke@435 | 40 | class MachSafePointNode; |
duke@435 | 41 | class Matcher; |
duke@435 | 42 | class PhaseCFG; |
duke@435 | 43 | class PhaseLive; |
duke@435 | 44 | class PhaseRegAlloc; |
duke@435 | 45 | class PhaseChaitin; |
duke@435 | 46 | |
duke@435 | 47 | #define OPTO_DEBUG_SPLIT_FREQ BLOCK_FREQUENCY(0.001) |
duke@435 | 48 | #define OPTO_LRG_HIGH_FREQ BLOCK_FREQUENCY(0.25) |
duke@435 | 49 | |
duke@435 | 50 | //------------------------------LRG-------------------------------------------- |
duke@435 | 51 | // Live-RanGe structure. |
duke@435 | 52 | class LRG : public ResourceObj { |
never@3138 | 53 | friend class VMStructs; |
duke@435 | 54 | public: |
adlertz@5916 | 55 | static const uint AllStack_size = 0xFFFFF; // This mask size is used to tell that the mask of this LRG supports stack positions |
duke@435 | 56 | enum { SPILL_REG=29999 }; // Register number of a spilled LRG |
duke@435 | 57 | |
duke@435 | 58 | double _cost; // 2 for loads/1 for stores times block freq |
duke@435 | 59 | double _area; // Sum of all simultaneously live values |
duke@435 | 60 | double score() const; // Compute score from cost and area |
duke@435 | 61 | double _maxfreq; // Maximum frequency of any def or use |
duke@435 | 62 | |
duke@435 | 63 | Node *_def; // Check for multi-def live ranges |
duke@435 | 64 | #ifndef PRODUCT |
duke@435 | 65 | GrowableArray<Node*>* _defs; |
duke@435 | 66 | #endif |
duke@435 | 67 | |
duke@435 | 68 | uint _risk_bias; // Index of LRG which we want to avoid color |
duke@435 | 69 | uint _copy_bias; // Index of LRG which we want to share color |
duke@435 | 70 | |
duke@435 | 71 | uint _next; // Index of next LRG in linked list |
duke@435 | 72 | uint _prev; // Index of prev LRG in linked list |
duke@435 | 73 | private: |
duke@435 | 74 | uint _reg; // Chosen register; undefined if mask is plural |
duke@435 | 75 | public: |
duke@435 | 76 | // Return chosen register for this LRG. Error if the LRG is not bound to |
duke@435 | 77 | // a single register. |
duke@435 | 78 | OptoReg::Name reg() const { return OptoReg::Name(_reg); } |
duke@435 | 79 | void set_reg( OptoReg::Name r ) { _reg = r; } |
duke@435 | 80 | |
duke@435 | 81 | private: |
duke@435 | 82 | uint _eff_degree; // Effective degree: Sum of neighbors _num_regs |
duke@435 | 83 | public: |
adlertz@5916 | 84 | int degree() const { assert( _degree_valid , "" ); return _eff_degree; } |
duke@435 | 85 | // Degree starts not valid and any change to the IFG neighbor |
duke@435 | 86 | // set makes it not valid. |
adlertz@5916 | 87 | void set_degree( uint degree ) { |
adlertz@5916 | 88 | _eff_degree = degree; |
adlertz@5916 | 89 | debug_only(_degree_valid = 1;) |
adlertz@5916 | 90 | assert(!_mask.is_AllStack() || (_mask.is_AllStack() && lo_degree()), "_eff_degree can't be bigger than AllStack_size - _num_regs if the mask supports stack registers"); |
adlertz@5916 | 91 | } |
duke@435 | 92 | // Made a change that hammered degree |
duke@435 | 93 | void invalid_degree() { debug_only(_degree_valid=0;) } |
duke@435 | 94 | // Incrementally modify degree. If it was correct, it should remain correct |
adlertz@5916 | 95 | void inc_degree( uint mod ) { |
adlertz@5916 | 96 | _eff_degree += mod; |
adlertz@5916 | 97 | assert(!_mask.is_AllStack() || (_mask.is_AllStack() && lo_degree()), "_eff_degree can't be bigger than AllStack_size - _num_regs if the mask supports stack registers"); |
adlertz@5916 | 98 | } |
duke@435 | 99 | // Compute the degree between 2 live ranges |
duke@435 | 100 | int compute_degree( LRG &l ) const; |
duke@435 | 101 | |
duke@435 | 102 | private: |
duke@435 | 103 | RegMask _mask; // Allowed registers for this LRG |
duke@435 | 104 | uint _mask_size; // cache of _mask.Size(); |
duke@435 | 105 | public: |
adlertz@5916 | 106 | int compute_mask_size() const { return _mask.is_AllStack() ? AllStack_size : _mask.Size(); } |
duke@435 | 107 | void set_mask_size( int size ) { |
adlertz@5916 | 108 | assert((size == (int)AllStack_size) || (size == (int)_mask.Size()), ""); |
duke@435 | 109 | _mask_size = size; |
kvn@3882 | 110 | #ifdef ASSERT |
kvn@3882 | 111 | _msize_valid=1; |
kvn@3882 | 112 | if (_is_vector) { |
kvn@3882 | 113 | assert(!_fat_proj, "sanity"); |
kvn@3882 | 114 | _mask.verify_sets(_num_regs); |
kvn@3882 | 115 | } else if (_num_regs == 2 && !_fat_proj) { |
kvn@3882 | 116 | _mask.verify_pairs(); |
kvn@3882 | 117 | } |
kvn@3882 | 118 | #endif |
duke@435 | 119 | } |
duke@435 | 120 | void compute_set_mask_size() { set_mask_size(compute_mask_size()); } |
duke@435 | 121 | int mask_size() const { assert( _msize_valid, "mask size not valid" ); |
duke@435 | 122 | return _mask_size; } |
duke@435 | 123 | // Get the last mask size computed, even if it does not match the |
duke@435 | 124 | // count of bits in the current mask. |
duke@435 | 125 | int get_invalid_mask_size() const { return _mask_size; } |
duke@435 | 126 | const RegMask &mask() const { return _mask; } |
duke@435 | 127 | void set_mask( const RegMask &rm ) { _mask = rm; debug_only(_msize_valid=0;)} |
duke@435 | 128 | void AND( const RegMask &rm ) { _mask.AND(rm); debug_only(_msize_valid=0;)} |
duke@435 | 129 | void SUBTRACT( const RegMask &rm ) { _mask.SUBTRACT(rm); debug_only(_msize_valid=0;)} |
duke@435 | 130 | void Clear() { _mask.Clear() ; debug_only(_msize_valid=1); _mask_size = 0; } |
duke@435 | 131 | void Set_All() { _mask.Set_All(); debug_only(_msize_valid=1); _mask_size = RegMask::CHUNK_SIZE; } |
duke@435 | 132 | void Insert( OptoReg::Name reg ) { _mask.Insert(reg); debug_only(_msize_valid=0;) } |
duke@435 | 133 | void Remove( OptoReg::Name reg ) { _mask.Remove(reg); debug_only(_msize_valid=0;) } |
kvn@3882 | 134 | void clear_to_pairs() { _mask.clear_to_pairs(); debug_only(_msize_valid=0;) } |
kvn@3882 | 135 | void clear_to_sets() { _mask.clear_to_sets(_num_regs); debug_only(_msize_valid=0;) } |
duke@435 | 136 | |
duke@435 | 137 | // Number of registers this live range uses when it colors |
duke@435 | 138 | private: |
duke@435 | 139 | uint8 _num_regs; // 2 for Longs and Doubles, 1 for all else |
duke@435 | 140 | // except _num_regs is kill count for fat_proj |
duke@435 | 141 | public: |
duke@435 | 142 | int num_regs() const { return _num_regs; } |
duke@435 | 143 | void set_num_regs( int reg ) { assert( _num_regs == reg || !_num_regs, "" ); _num_regs = reg; } |
duke@435 | 144 | |
duke@435 | 145 | private: |
duke@435 | 146 | // Number of physical registers this live range uses when it colors |
duke@435 | 147 | // Architecture and register-set dependent |
duke@435 | 148 | uint8 _reg_pressure; |
duke@435 | 149 | public: |
duke@435 | 150 | void set_reg_pressure(int i) { _reg_pressure = i; } |
duke@435 | 151 | int reg_pressure() const { return _reg_pressure; } |
duke@435 | 152 | |
duke@435 | 153 | // How much 'wiggle room' does this live range have? |
duke@435 | 154 | // How many color choices can it make (scaled by _num_regs)? |
duke@435 | 155 | int degrees_of_freedom() const { return mask_size() - _num_regs; } |
duke@435 | 156 | // Bound LRGs have ZERO degrees of freedom. We also count |
duke@435 | 157 | // must_spill as bound. |
duke@435 | 158 | bool is_bound () const { return _is_bound; } |
duke@435 | 159 | // Negative degrees-of-freedom; even with no neighbors this |
duke@435 | 160 | // live range must spill. |
duke@435 | 161 | bool not_free() const { return degrees_of_freedom() < 0; } |
duke@435 | 162 | // Is this live range of "low-degree"? Trivially colorable? |
duke@435 | 163 | bool lo_degree () const { return degree() <= degrees_of_freedom(); } |
duke@435 | 164 | // Is this live range just barely "low-degree"? Trivially colorable? |
duke@435 | 165 | bool just_lo_degree () const { return degree() == degrees_of_freedom(); } |
duke@435 | 166 | |
duke@435 | 167 | uint _is_oop:1, // Live-range holds an oop |
duke@435 | 168 | _is_float:1, // True if in float registers |
kvn@3882 | 169 | _is_vector:1, // True if in vector registers |
duke@435 | 170 | _was_spilled1:1, // True if prior spilling on def |
duke@435 | 171 | _was_spilled2:1, // True if twice prior spilling on def |
duke@435 | 172 | _is_bound:1, // live range starts life with no |
duke@435 | 173 | // degrees of freedom. |
duke@435 | 174 | _direct_conflict:1, // True if def and use registers in conflict |
duke@435 | 175 | _must_spill:1, // live range has lost all degrees of freedom |
duke@435 | 176 | // If _fat_proj is set, live range does NOT require aligned, adjacent |
duke@435 | 177 | // registers and has NO interferences. |
duke@435 | 178 | // If _fat_proj is clear, live range requires num_regs() to be a power of |
duke@435 | 179 | // 2, and it requires registers to form an aligned, adjacent set. |
duke@435 | 180 | _fat_proj:1, // |
duke@435 | 181 | _was_lo:1, // Was lo-degree prior to coalesce |
duke@435 | 182 | _msize_valid:1, // _mask_size cache valid |
duke@435 | 183 | _degree_valid:1, // _degree cache valid |
duke@435 | 184 | _has_copy:1, // Adjacent to some copy instruction |
duke@435 | 185 | _at_risk:1; // Simplify says this guy is at risk to spill |
duke@435 | 186 | |
duke@435 | 187 | |
duke@435 | 188 | // Alive if non-zero, dead if zero |
duke@435 | 189 | bool alive() const { return _def != NULL; } |
never@730 | 190 | bool is_multidef() const { return _def == NodeSentinel; } |
never@730 | 191 | bool is_singledef() const { return _def != NodeSentinel; } |
duke@435 | 192 | |
duke@435 | 193 | #ifndef PRODUCT |
duke@435 | 194 | void dump( ) const; |
duke@435 | 195 | #endif |
duke@435 | 196 | }; |
duke@435 | 197 | |
duke@435 | 198 | //------------------------------IFG-------------------------------------------- |
duke@435 | 199 | // InterFerence Graph |
duke@435 | 200 | // An undirected graph implementation. Created with a fixed number of |
duke@435 | 201 | // vertices. Edges can be added & tested. Vertices can be removed, then |
duke@435 | 202 | // added back later with all edges intact. Can add edges between one vertex |
duke@435 | 203 | // and a list of other vertices. Can union vertices (and their edges) |
duke@435 | 204 | // together. The IFG needs to be really really fast, and also fairly |
duke@435 | 205 | // abstract! It needs abstraction so I can fiddle with the implementation to |
duke@435 | 206 | // get even more speed. |
duke@435 | 207 | class PhaseIFG : public Phase { |
never@3138 | 208 | friend class VMStructs; |
duke@435 | 209 | // Current implementation: a triangular adjacency list. |
duke@435 | 210 | |
duke@435 | 211 | // Array of adjacency-lists, indexed by live-range number |
duke@435 | 212 | IndexSet *_adjs; |
duke@435 | 213 | |
duke@435 | 214 | // Assertion bit for proper use of Squaring |
duke@435 | 215 | bool _is_square; |
duke@435 | 216 | |
duke@435 | 217 | // Live range structure goes here |
duke@435 | 218 | LRG *_lrgs; // Array of LRG structures |
duke@435 | 219 | |
duke@435 | 220 | public: |
duke@435 | 221 | // Largest live-range number |
duke@435 | 222 | uint _maxlrg; |
duke@435 | 223 | |
duke@435 | 224 | Arena *_arena; |
duke@435 | 225 | |
duke@435 | 226 | // Keep track of inserted and deleted Nodes |
duke@435 | 227 | VectorSet *_yanked; |
duke@435 | 228 | |
duke@435 | 229 | PhaseIFG( Arena *arena ); |
duke@435 | 230 | void init( uint maxlrg ); |
duke@435 | 231 | |
duke@435 | 232 | // Add edge between a and b. Returns true if actually addded. |
duke@435 | 233 | int add_edge( uint a, uint b ); |
duke@435 | 234 | |
duke@435 | 235 | // Add edge between a and everything in the vector |
duke@435 | 236 | void add_vector( uint a, IndexSet *vec ); |
duke@435 | 237 | |
duke@435 | 238 | // Test for edge existance |
duke@435 | 239 | int test_edge( uint a, uint b ) const; |
duke@435 | 240 | |
duke@435 | 241 | // Square-up matrix for faster Union |
duke@435 | 242 | void SquareUp(); |
duke@435 | 243 | |
duke@435 | 244 | // Return number of LRG neighbors |
duke@435 | 245 | uint neighbor_cnt( uint a ) const { return _adjs[a].count(); } |
duke@435 | 246 | // Union edges of b into a on Squared-up matrix |
duke@435 | 247 | void Union( uint a, uint b ); |
duke@435 | 248 | // Test for edge in Squared-up matrix |
duke@435 | 249 | int test_edge_sq( uint a, uint b ) const; |
duke@435 | 250 | // Yank a Node and all connected edges from the IFG. Be prepared to |
duke@435 | 251 | // re-insert the yanked Node in reverse order of yanking. Return a |
duke@435 | 252 | // list of neighbors (edges) yanked. |
duke@435 | 253 | IndexSet *remove_node( uint a ); |
duke@435 | 254 | // Reinsert a yanked Node |
duke@435 | 255 | void re_insert( uint a ); |
duke@435 | 256 | // Return set of neighbors |
duke@435 | 257 | IndexSet *neighbors( uint a ) const { return &_adjs[a]; } |
duke@435 | 258 | |
duke@435 | 259 | #ifndef PRODUCT |
duke@435 | 260 | // Dump the IFG |
duke@435 | 261 | void dump() const; |
duke@435 | 262 | void stats() const; |
duke@435 | 263 | void verify( const PhaseChaitin * ) const; |
duke@435 | 264 | #endif |
duke@435 | 265 | |
duke@435 | 266 | //--------------- Live Range Accessors |
duke@435 | 267 | LRG &lrgs(uint idx) const { assert(idx < _maxlrg, "oob"); return _lrgs[idx]; } |
duke@435 | 268 | |
duke@435 | 269 | // Compute and set effective degree. Might be folded into SquareUp(). |
duke@435 | 270 | void Compute_Effective_Degree(); |
duke@435 | 271 | |
duke@435 | 272 | // Compute effective degree as the sum of neighbors' _sizes. |
duke@435 | 273 | int effective_degree( uint lidx ) const; |
duke@435 | 274 | }; |
duke@435 | 275 | |
neliasso@4949 | 276 | // The LiveRangeMap class is responsible for storing node to live range id mapping. |
neliasso@4949 | 277 | // Each node is mapped to a live range id (a virtual register). Nodes that are |
neliasso@4949 | 278 | // not considered for register allocation are given live range id 0. |
neliasso@4949 | 279 | class LiveRangeMap VALUE_OBJ_CLASS_SPEC { |
duke@435 | 280 | |
neliasso@4949 | 281 | private: |
neliasso@4949 | 282 | |
neliasso@4949 | 283 | uint _max_lrg_id; |
neliasso@4949 | 284 | |
neliasso@4949 | 285 | // Union-find map. Declared as a short for speed. |
neliasso@4949 | 286 | // Indexed by live-range number, it returns the compacted live-range number |
neliasso@4949 | 287 | LRG_List _uf_map; |
neliasso@4949 | 288 | |
neliasso@4949 | 289 | // Map from Nodes to live ranges |
neliasso@4949 | 290 | LRG_List _names; |
neliasso@4949 | 291 | |
neliasso@4949 | 292 | // Straight out of Tarjan's union-find algorithm |
neliasso@4949 | 293 | uint find_compress(const Node *node) { |
adlertz@5722 | 294 | uint lrg_id = find_compress(_names.at(node->_idx)); |
adlertz@5722 | 295 | _names.at_put(node->_idx, lrg_id); |
neliasso@4949 | 296 | return lrg_id; |
neliasso@4949 | 297 | } |
neliasso@4949 | 298 | |
neliasso@4949 | 299 | uint find_compress(uint lrg); |
neliasso@4949 | 300 | |
neliasso@4949 | 301 | public: |
neliasso@4949 | 302 | |
neliasso@4949 | 303 | const LRG_List& names() { |
neliasso@4949 | 304 | return _names; |
neliasso@4949 | 305 | } |
neliasso@4949 | 306 | |
neliasso@4949 | 307 | uint max_lrg_id() const { |
neliasso@4949 | 308 | return _max_lrg_id; |
neliasso@4949 | 309 | } |
neliasso@4949 | 310 | |
neliasso@4949 | 311 | void set_max_lrg_id(uint max_lrg_id) { |
neliasso@4949 | 312 | _max_lrg_id = max_lrg_id; |
neliasso@4949 | 313 | } |
neliasso@4949 | 314 | |
neliasso@4949 | 315 | uint size() const { |
adlertz@5722 | 316 | return _names.length(); |
neliasso@4949 | 317 | } |
neliasso@4949 | 318 | |
neliasso@4949 | 319 | uint live_range_id(uint idx) const { |
adlertz@5722 | 320 | return _names.at(idx); |
neliasso@4949 | 321 | } |
neliasso@4949 | 322 | |
neliasso@4949 | 323 | uint live_range_id(const Node *node) const { |
adlertz@5722 | 324 | return _names.at(node->_idx); |
neliasso@4949 | 325 | } |
neliasso@4949 | 326 | |
neliasso@4949 | 327 | uint uf_live_range_id(uint lrg_id) const { |
adlertz@5722 | 328 | return _uf_map.at(lrg_id); |
neliasso@4949 | 329 | } |
neliasso@4949 | 330 | |
neliasso@4949 | 331 | void map(uint idx, uint lrg_id) { |
adlertz@5722 | 332 | _names.at_put(idx, lrg_id); |
neliasso@4949 | 333 | } |
neliasso@4949 | 334 | |
neliasso@4949 | 335 | void uf_map(uint dst_lrg_id, uint src_lrg_id) { |
adlertz@5722 | 336 | _uf_map.at_put(dst_lrg_id, src_lrg_id); |
neliasso@4949 | 337 | } |
neliasso@4949 | 338 | |
neliasso@4949 | 339 | void extend(uint idx, uint lrg_id) { |
adlertz@5722 | 340 | _names.at_put_grow(idx, lrg_id); |
neliasso@4949 | 341 | } |
neliasso@4949 | 342 | |
neliasso@4949 | 343 | void uf_extend(uint dst_lrg_id, uint src_lrg_id) { |
adlertz@5722 | 344 | _uf_map.at_put_grow(dst_lrg_id, src_lrg_id); |
neliasso@4949 | 345 | } |
neliasso@4949 | 346 | |
adlertz@5722 | 347 | LiveRangeMap(Arena* arena, uint unique) |
adlertz@5722 | 348 | : _names(arena, unique, unique, 0) |
adlertz@5722 | 349 | , _uf_map(arena, unique, unique, 0) |
neliasso@4949 | 350 | , _max_lrg_id(0) {} |
neliasso@4949 | 351 | |
neliasso@4949 | 352 | uint find_id( const Node *n ) { |
neliasso@4949 | 353 | uint retval = live_range_id(n); |
neliasso@4949 | 354 | assert(retval == find(n),"Invalid node to lidx mapping"); |
neliasso@4949 | 355 | return retval; |
neliasso@4949 | 356 | } |
neliasso@4949 | 357 | |
neliasso@4949 | 358 | // Reset the Union-Find map to identity |
neliasso@4949 | 359 | void reset_uf_map(uint max_lrg_id); |
neliasso@4949 | 360 | |
neliasso@4949 | 361 | // Make all Nodes map directly to their final live range; no need for |
neliasso@4949 | 362 | // the Union-Find mapping after this call. |
neliasso@4949 | 363 | void compress_uf_map_for_nodes(); |
neliasso@4949 | 364 | |
neliasso@4949 | 365 | uint find(uint lidx) { |
adlertz@5722 | 366 | uint uf_lidx = _uf_map.at(lidx); |
neliasso@4949 | 367 | return (uf_lidx == lidx) ? uf_lidx : find_compress(lidx); |
neliasso@4949 | 368 | } |
neliasso@4949 | 369 | |
neliasso@4949 | 370 | // Convert a Node into a Live Range Index - a lidx |
neliasso@4949 | 371 | uint find(const Node *node) { |
neliasso@4949 | 372 | uint lidx = live_range_id(node); |
adlertz@5722 | 373 | uint uf_lidx = _uf_map.at(lidx); |
neliasso@4949 | 374 | return (uf_lidx == lidx) ? uf_lidx : find_compress(node); |
neliasso@4949 | 375 | } |
neliasso@4949 | 376 | |
neliasso@4949 | 377 | // Like Find above, but no path compress, so bad asymptotic behavior |
neliasso@4949 | 378 | uint find_const(uint lrg) const; |
neliasso@4949 | 379 | |
neliasso@4949 | 380 | // Like Find above, but no path compress, so bad asymptotic behavior |
neliasso@4949 | 381 | uint find_const(const Node *node) const { |
adlertz@5722 | 382 | if(node->_idx >= (uint)_names.length()) { |
neliasso@4949 | 383 | return 0; // not mapped, usual for debug dump |
neliasso@4949 | 384 | } |
adlertz@5722 | 385 | return find_const(_names.at(node->_idx)); |
neliasso@4949 | 386 | } |
neliasso@4949 | 387 | }; |
duke@435 | 388 | |
duke@435 | 389 | //------------------------------Chaitin---------------------------------------- |
duke@435 | 390 | // Briggs-Chaitin style allocation, mostly. |
duke@435 | 391 | class PhaseChaitin : public PhaseRegAlloc { |
never@3138 | 392 | friend class VMStructs; |
duke@435 | 393 | |
duke@435 | 394 | int _trip_cnt; |
duke@435 | 395 | int _alternate; |
duke@435 | 396 | |
duke@435 | 397 | LRG &lrgs(uint idx) const { return _ifg->lrgs(idx); } |
duke@435 | 398 | PhaseLive *_live; // Liveness, used in the interference graph |
duke@435 | 399 | PhaseIFG *_ifg; // Interference graph (for original chunk) |
duke@435 | 400 | Node_List **_lrg_nodes; // Array of node; lists for lrgs which spill |
duke@435 | 401 | VectorSet _spilled_once; // Nodes that have been spilled |
duke@435 | 402 | VectorSet _spilled_twice; // Nodes that have been spilled twice |
duke@435 | 403 | |
duke@435 | 404 | // Combine the Live Range Indices for these 2 Nodes into a single live |
duke@435 | 405 | // range. Future requests for any Node in either live range will |
duke@435 | 406 | // return the live range index for the combined live range. |
duke@435 | 407 | void Union( const Node *src, const Node *dst ); |
duke@435 | 408 | |
duke@435 | 409 | void new_lrg( const Node *x, uint lrg ); |
duke@435 | 410 | |
duke@435 | 411 | // Compact live ranges, removing unused ones. Return new maxlrg. |
duke@435 | 412 | void compact(); |
duke@435 | 413 | |
duke@435 | 414 | uint _lo_degree; // Head of lo-degree LRGs list |
duke@435 | 415 | uint _lo_stk_degree; // Head of lo-stk-degree LRGs list |
duke@435 | 416 | uint _hi_degree; // Head of hi-degree LRGs list |
duke@435 | 417 | uint _simplified; // Linked list head of simplified LRGs |
duke@435 | 418 | |
duke@435 | 419 | // Helper functions for Split() |
duke@435 | 420 | uint split_DEF( Node *def, Block *b, int loc, uint max, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx ); |
duke@435 | 421 | uint split_USE( Node *def, Block *b, Node *use, uint useidx, uint max, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx ); |
neliasso@4949 | 422 | |
neliasso@4949 | 423 | //------------------------------clone_projs------------------------------------ |
neliasso@4949 | 424 | // After cloning some rematerialized instruction, clone any MachProj's that |
neliasso@4949 | 425 | // follow it. Example: Intel zero is XOR, kills flags. Sparc FP constants |
neliasso@4949 | 426 | // use G3 as an address temp. |
kvn@5543 | 427 | int clone_projs(Block* b, uint idx, Node* orig, Node* copy, uint& max_lrg_id); |
neliasso@4949 | 428 | |
kvn@5543 | 429 | int clone_projs(Block* b, uint idx, Node* orig, Node* copy, LiveRangeMap& lrg_map) { |
kvn@5543 | 430 | uint max_lrg_id = lrg_map.max_lrg_id(); |
kvn@5543 | 431 | int found_projs = clone_projs(b, idx, orig, copy, max_lrg_id); |
kvn@5543 | 432 | if (found_projs > 0) { |
kvn@5543 | 433 | // max_lrg_id is updated during call above |
kvn@5543 | 434 | lrg_map.set_max_lrg_id(max_lrg_id); |
neliasso@4949 | 435 | } |
neliasso@4949 | 436 | return found_projs; |
neliasso@4949 | 437 | } |
neliasso@4949 | 438 | |
never@730 | 439 | Node *split_Rematerialize(Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits, |
never@730 | 440 | int slidx, uint *lrg2reach, Node **Reachblock, bool walkThru); |
duke@435 | 441 | // True if lidx is used before any real register is def'd in the block |
duke@435 | 442 | bool prompt_use( Block *b, uint lidx ); |
duke@435 | 443 | Node *get_spillcopy_wide( Node *def, Node *use, uint uidx ); |
twisti@1040 | 444 | // Insert the spill at chosen location. Skip over any intervening Proj's or |
duke@435 | 445 | // Phis. Skip over a CatchNode and projs, inserting in the fall-through block |
duke@435 | 446 | // instead. Update high-pressure indices. Create a new live range. |
duke@435 | 447 | void insert_proj( Block *b, uint i, Node *spill, uint maxlrg ); |
duke@435 | 448 | |
duke@435 | 449 | bool is_high_pressure( Block *b, LRG *lrg, uint insidx ); |
duke@435 | 450 | |
duke@435 | 451 | uint _oldphi; // Node index which separates pre-allocation nodes |
duke@435 | 452 | |
duke@435 | 453 | Block **_blks; // Array of blocks sorted by frequency for coalescing |
duke@435 | 454 | |
kvn@1108 | 455 | float _high_frequency_lrg; // Frequency at which LRG will be spilled for debug info |
kvn@1108 | 456 | |
duke@435 | 457 | #ifndef PRODUCT |
duke@435 | 458 | bool _trace_spilling; |
duke@435 | 459 | #endif |
duke@435 | 460 | |
duke@435 | 461 | public: |
duke@435 | 462 | PhaseChaitin( uint unique, PhaseCFG &cfg, Matcher &matcher ); |
duke@435 | 463 | ~PhaseChaitin() {} |
duke@435 | 464 | |
neliasso@4949 | 465 | LiveRangeMap _lrg_map; |
duke@435 | 466 | |
duke@435 | 467 | // Do all the real work of allocate |
duke@435 | 468 | void Register_Allocate(); |
duke@435 | 469 | |
kvn@1108 | 470 | float high_frequency_lrg() const { return _high_frequency_lrg; } |
kvn@1108 | 471 | |
duke@435 | 472 | #ifndef PRODUCT |
duke@435 | 473 | bool trace_spilling() const { return _trace_spilling; } |
duke@435 | 474 | #endif |
duke@435 | 475 | |
duke@435 | 476 | private: |
duke@435 | 477 | // De-SSA the world. Assign registers to Nodes. Use the same register for |
duke@435 | 478 | // all inputs to a PhiNode, effectively coalescing live ranges. Insert |
duke@435 | 479 | // copies as needed. |
duke@435 | 480 | void de_ssa(); |
duke@435 | 481 | |
duke@435 | 482 | // Add edge between reg and everything in the vector. |
duke@435 | 483 | // Same as _ifg->add_vector(reg,live) EXCEPT use the RegMask |
duke@435 | 484 | // information to trim the set of interferences. Return the |
duke@435 | 485 | // count of edges added. |
duke@435 | 486 | void interfere_with_live( uint reg, IndexSet *live ); |
duke@435 | 487 | // Count register pressure for asserts |
duke@435 | 488 | uint count_int_pressure( IndexSet *liveout ); |
duke@435 | 489 | uint count_float_pressure( IndexSet *liveout ); |
duke@435 | 490 | |
duke@435 | 491 | // Build the interference graph using virtual registers only. |
duke@435 | 492 | // Used for aggressive coalescing. |
duke@435 | 493 | void build_ifg_virtual( ); |
duke@435 | 494 | |
duke@435 | 495 | // Build the interference graph using physical registers when available. |
duke@435 | 496 | // That is, if 2 live ranges are simultaneously alive but in their |
duke@435 | 497 | // acceptable register sets do not overlap, then they do not interfere. |
duke@435 | 498 | uint build_ifg_physical( ResourceArea *a ); |
duke@435 | 499 | |
duke@435 | 500 | // Gather LiveRanGe information, including register masks and base pointer/ |
duke@435 | 501 | // derived pointer relationships. |
duke@435 | 502 | void gather_lrg_masks( bool mod_cisc_masks ); |
duke@435 | 503 | |
duke@435 | 504 | // Force the bases of derived pointers to be alive at GC points. |
duke@435 | 505 | bool stretch_base_pointer_live_ranges( ResourceArea *a ); |
duke@435 | 506 | // Helper to stretch above; recursively discover the base Node for |
duke@435 | 507 | // a given derived Node. Easy for AddP-related machine nodes, but |
duke@435 | 508 | // needs to be recursive for derived Phis. |
duke@435 | 509 | Node *find_base_for_derived( Node **derived_base_map, Node *derived, uint &maxlrg ); |
duke@435 | 510 | |
duke@435 | 511 | // Set the was-lo-degree bit. Conservative coalescing should not change the |
duke@435 | 512 | // colorability of the graph. If any live range was of low-degree before |
duke@435 | 513 | // coalescing, it should Simplify. This call sets the was-lo-degree bit. |
duke@435 | 514 | void set_was_low(); |
duke@435 | 515 | |
duke@435 | 516 | // Split live-ranges that must spill due to register conflicts (as opposed |
duke@435 | 517 | // to capacity spills). Typically these are things def'd in a register |
duke@435 | 518 | // and used on the stack or vice-versa. |
duke@435 | 519 | void pre_spill(); |
duke@435 | 520 | |
duke@435 | 521 | // Init LRG caching of degree, numregs. Init lo_degree list. |
duke@435 | 522 | void cache_lrg_info( ); |
duke@435 | 523 | |
duke@435 | 524 | // Simplify the IFG by removing LRGs of low degree with no copies |
duke@435 | 525 | void Pre_Simplify(); |
duke@435 | 526 | |
duke@435 | 527 | // Simplify the IFG by removing LRGs of low degree |
duke@435 | 528 | void Simplify(); |
duke@435 | 529 | |
duke@435 | 530 | // Select colors by re-inserting edges into the IFG. |
twisti@1040 | 531 | // Return TRUE if any spills occurred. |
duke@435 | 532 | uint Select( ); |
duke@435 | 533 | // Helper function for select which allows biased coloring |
duke@435 | 534 | OptoReg::Name choose_color( LRG &lrg, int chunk ); |
duke@435 | 535 | // Helper function which implements biasing heuristic |
duke@435 | 536 | OptoReg::Name bias_color( LRG &lrg, int chunk ); |
duke@435 | 537 | |
duke@435 | 538 | // Split uncolorable live ranges |
duke@435 | 539 | // Return new number of live ranges |
kvn@4019 | 540 | uint Split(uint maxlrg, ResourceArea* split_arena); |
duke@435 | 541 | |
duke@435 | 542 | // Copy 'was_spilled'-edness from one Node to another. |
duke@435 | 543 | void copy_was_spilled( Node *src, Node *dst ); |
duke@435 | 544 | // Set the 'spilled_once' or 'spilled_twice' flag on a node. |
duke@435 | 545 | void set_was_spilled( Node *n ); |
duke@435 | 546 | |
duke@435 | 547 | // Convert ideal spill-nodes into machine loads & stores |
duke@435 | 548 | // Set C->failing when fixup spills could not complete, node limit exceeded. |
duke@435 | 549 | void fixup_spills(); |
duke@435 | 550 | |
duke@435 | 551 | // Post-Allocation peephole copy removal |
duke@435 | 552 | void post_allocate_copy_removal(); |
duke@435 | 553 | Node *skip_copies( Node *c ); |
never@1358 | 554 | // Replace the old node with the current live version of that value |
never@1358 | 555 | // and yank the old value if it's dead. |
never@1358 | 556 | int replace_and_yank_if_dead( Node *old, OptoReg::Name nreg, |
never@1358 | 557 | Block *current_block, Node_List& value, Node_List& regnd ) { |
never@1358 | 558 | Node* v = regnd[nreg]; |
never@1358 | 559 | assert(v->outcnt() != 0, "no dead values"); |
never@1358 | 560 | old->replace_by(v); |
never@1358 | 561 | return yank_if_dead(old, current_block, &value, ®nd); |
never@1358 | 562 | } |
never@1358 | 563 | |
kvn@3405 | 564 | int yank_if_dead( Node *old, Block *current_block, Node_List *value, Node_List *regnd ) { |
kvn@3405 | 565 | return yank_if_dead_recurse(old, old, current_block, value, regnd); |
kvn@3405 | 566 | } |
kvn@3405 | 567 | int yank_if_dead_recurse(Node *old, Node *orig_old, Block *current_block, |
kvn@3405 | 568 | Node_List *value, Node_List *regnd); |
roland@3133 | 569 | int yank( Node *old, Block *current_block, Node_List *value, Node_List *regnd ); |
duke@435 | 570 | int elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List ®nd, bool can_change_regs ); |
duke@435 | 571 | int use_prior_register( Node *copy, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd ); |
duke@435 | 572 | bool may_be_copy_of_callee( Node *def ) const; |
duke@435 | 573 | |
duke@435 | 574 | // If nreg already contains the same constant as val then eliminate it |
never@505 | 575 | bool eliminate_copy_of_constant(Node* val, Node* n, |
never@505 | 576 | Block *current_block, Node_List& value, Node_List ®nd, |
duke@435 | 577 | OptoReg::Name nreg, OptoReg::Name nreg2); |
duke@435 | 578 | // Extend the node to LRG mapping |
duke@435 | 579 | void add_reference( const Node *node, const Node *old_node); |
duke@435 | 580 | |
duke@435 | 581 | private: |
duke@435 | 582 | |
duke@435 | 583 | static int _final_loads, _final_stores, _final_copies, _final_memoves; |
duke@435 | 584 | static double _final_load_cost, _final_store_cost, _final_copy_cost, _final_memove_cost; |
duke@435 | 585 | static int _conserv_coalesce, _conserv_coalesce_pair; |
duke@435 | 586 | static int _conserv_coalesce_trie, _conserv_coalesce_quad; |
duke@435 | 587 | static int _post_alloc; |
duke@435 | 588 | static int _lost_opp_pp_coalesce, _lost_opp_cflow_coalesce; |
duke@435 | 589 | static int _used_cisc_instructions, _unused_cisc_instructions; |
duke@435 | 590 | static int _allocator_attempts, _allocator_successes; |
duke@435 | 591 | |
duke@435 | 592 | #ifndef PRODUCT |
duke@435 | 593 | static uint _high_pressure, _low_pressure; |
duke@435 | 594 | |
duke@435 | 595 | void dump() const; |
duke@435 | 596 | void dump( const Node *n ) const; |
duke@435 | 597 | void dump( const Block * b ) const; |
duke@435 | 598 | void dump_degree_lists() const; |
duke@435 | 599 | void dump_simplified() const; |
never@2358 | 600 | void dump_lrg( uint lidx, bool defs_only) const; |
never@2358 | 601 | void dump_lrg( uint lidx) const { |
never@2358 | 602 | // dump defs and uses by default |
never@2358 | 603 | dump_lrg(lidx, false); |
never@2358 | 604 | } |
duke@435 | 605 | void dump_bb( uint pre_order ) const; |
duke@435 | 606 | |
duke@435 | 607 | // Verify that base pointers and derived pointers are still sane |
duke@435 | 608 | void verify_base_ptrs( ResourceArea *a ) const; |
duke@435 | 609 | |
kvn@1001 | 610 | void verify( ResourceArea *a, bool verify_ifg = false ) const; |
kvn@1001 | 611 | |
duke@435 | 612 | void dump_for_spill_split_recycle() const; |
duke@435 | 613 | |
duke@435 | 614 | public: |
duke@435 | 615 | void dump_frame() const; |
duke@435 | 616 | char *dump_register( const Node *n, char *buf ) const; |
duke@435 | 617 | private: |
duke@435 | 618 | static void print_chaitin_statistics(); |
duke@435 | 619 | #endif |
duke@435 | 620 | friend class PhaseCoalesce; |
duke@435 | 621 | friend class PhaseAggressiveCoalesce; |
duke@435 | 622 | friend class PhaseConservativeCoalesce; |
duke@435 | 623 | }; |
stefank@2314 | 624 | |
stefank@2314 | 625 | #endif // SHARE_VM_OPTO_CHAITIN_HPP |