0
|
1 /*
|
|
2 * Copyright 1997-2006 Sun Microsystems, Inc. All Rights Reserved.
|
|
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
4 *
|
|
5 * This code is free software; you can redistribute it and/or modify it
|
|
6 * under the terms of the GNU General Public License version 2 only, as
|
|
7 * published by the Free Software Foundation.
|
|
8 *
|
|
9 * This code is distributed in the hope that it will be useful, but WITHOUT
|
|
10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
12 * version 2 for more details (a copy is included in the LICENSE file that
|
|
13 * accompanied this code).
|
|
14 *
|
|
15 * You should have received a copy of the GNU General Public License version
|
|
16 * 2 along with this work; if not, write to the Free Software Foundation,
|
|
17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
18 *
|
|
19 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
|
|
20 * CA 95054 USA or visit www.sun.com if you need additional information or
|
|
21 * have any questions.
|
|
22 *
|
|
23 */
|
|
24
|
|
25 class LoopTree;
|
|
26 class MachCallNode;
|
|
27 class MachSafePointNode;
|
|
28 class Matcher;
|
|
29 class PhaseCFG;
|
|
30 class PhaseLive;
|
|
31 class PhaseRegAlloc;
|
|
32 class PhaseChaitin;
|
|
33
|
|
34 #define OPTO_DEBUG_SPLIT_FREQ BLOCK_FREQUENCY(0.001)
|
|
35 #define OPTO_LRG_HIGH_FREQ BLOCK_FREQUENCY(0.25)
|
|
36
|
|
37 //------------------------------LRG--------------------------------------------
|
|
38 // Live-RanGe structure.
|
|
39 class LRG : public ResourceObj {
|
|
40 public:
|
|
41 enum { SPILL_REG=29999 }; // Register number of a spilled LRG
|
|
42
|
|
43 double _cost; // 2 for loads/1 for stores times block freq
|
|
44 double _area; // Sum of all simultaneously live values
|
|
45 double score() const; // Compute score from cost and area
|
|
46 double _maxfreq; // Maximum frequency of any def or use
|
|
47
|
|
48 Node *_def; // Check for multi-def live ranges
|
|
49 #ifndef PRODUCT
|
|
50 GrowableArray<Node*>* _defs;
|
|
51 #endif
|
|
52
|
|
53 uint _risk_bias; // Index of LRG which we want to avoid color
|
|
54 uint _copy_bias; // Index of LRG which we want to share color
|
|
55
|
|
56 uint _next; // Index of next LRG in linked list
|
|
57 uint _prev; // Index of prev LRG in linked list
|
|
58 private:
|
|
59 uint _reg; // Chosen register; undefined if mask is plural
|
|
60 public:
|
|
61 // Return chosen register for this LRG. Error if the LRG is not bound to
|
|
62 // a single register.
|
|
63 OptoReg::Name reg() const { return OptoReg::Name(_reg); }
|
|
64 void set_reg( OptoReg::Name r ) { _reg = r; }
|
|
65
|
|
66 private:
|
|
67 uint _eff_degree; // Effective degree: Sum of neighbors _num_regs
|
|
68 public:
|
|
69 int degree() const { assert( _degree_valid, "" ); return _eff_degree; }
|
|
70 // Degree starts not valid and any change to the IFG neighbor
|
|
71 // set makes it not valid.
|
|
72 void set_degree( uint degree ) { _eff_degree = degree; debug_only(_degree_valid = 1;) }
|
|
73 // Made a change that hammered degree
|
|
74 void invalid_degree() { debug_only(_degree_valid=0;) }
|
|
75 // Incrementally modify degree. If it was correct, it should remain correct
|
|
76 void inc_degree( uint mod ) { _eff_degree += mod; }
|
|
77 // Compute the degree between 2 live ranges
|
|
78 int compute_degree( LRG &l ) const;
|
|
79
|
|
80 private:
|
|
81 RegMask _mask; // Allowed registers for this LRG
|
|
82 uint _mask_size; // cache of _mask.Size();
|
|
83 public:
|
|
84 int compute_mask_size() const { return _mask.is_AllStack() ? 65535 : _mask.Size(); }
|
|
85 void set_mask_size( int size ) {
|
|
86 assert((size == 65535) || (size == (int)_mask.Size()), "");
|
|
87 _mask_size = size;
|
|
88 debug_only(_msize_valid=1;)
|
|
89 debug_only( if( _num_regs == 2 && !_fat_proj ) _mask.VerifyPairs(); )
|
|
90 }
|
|
91 void compute_set_mask_size() { set_mask_size(compute_mask_size()); }
|
|
92 int mask_size() const { assert( _msize_valid, "mask size not valid" );
|
|
93 return _mask_size; }
|
|
94 // Get the last mask size computed, even if it does not match the
|
|
95 // count of bits in the current mask.
|
|
96 int get_invalid_mask_size() const { return _mask_size; }
|
|
97 const RegMask &mask() const { return _mask; }
|
|
98 void set_mask( const RegMask &rm ) { _mask = rm; debug_only(_msize_valid=0;)}
|
|
99 void AND( const RegMask &rm ) { _mask.AND(rm); debug_only(_msize_valid=0;)}
|
|
100 void SUBTRACT( const RegMask &rm ) { _mask.SUBTRACT(rm); debug_only(_msize_valid=0;)}
|
|
101 void Clear() { _mask.Clear() ; debug_only(_msize_valid=1); _mask_size = 0; }
|
|
102 void Set_All() { _mask.Set_All(); debug_only(_msize_valid=1); _mask_size = RegMask::CHUNK_SIZE; }
|
|
103 void Insert( OptoReg::Name reg ) { _mask.Insert(reg); debug_only(_msize_valid=0;) }
|
|
104 void Remove( OptoReg::Name reg ) { _mask.Remove(reg); debug_only(_msize_valid=0;) }
|
|
105 void ClearToPairs() { _mask.ClearToPairs(); debug_only(_msize_valid=0;) }
|
|
106
|
|
107 // Number of registers this live range uses when it colors
|
|
108 private:
|
|
109 uint8 _num_regs; // 2 for Longs and Doubles, 1 for all else
|
|
110 // except _num_regs is kill count for fat_proj
|
|
111 public:
|
|
112 int num_regs() const { return _num_regs; }
|
|
113 void set_num_regs( int reg ) { assert( _num_regs == reg || !_num_regs, "" ); _num_regs = reg; }
|
|
114
|
|
115 private:
|
|
116 // Number of physical registers this live range uses when it colors
|
|
117 // Architecture and register-set dependent
|
|
118 uint8 _reg_pressure;
|
|
119 public:
|
|
120 void set_reg_pressure(int i) { _reg_pressure = i; }
|
|
121 int reg_pressure() const { return _reg_pressure; }
|
|
122
|
|
123 // How much 'wiggle room' does this live range have?
|
|
124 // How many color choices can it make (scaled by _num_regs)?
|
|
125 int degrees_of_freedom() const { return mask_size() - _num_regs; }
|
|
126 // Bound LRGs have ZERO degrees of freedom. We also count
|
|
127 // must_spill as bound.
|
|
128 bool is_bound () const { return _is_bound; }
|
|
129 // Negative degrees-of-freedom; even with no neighbors this
|
|
130 // live range must spill.
|
|
131 bool not_free() const { return degrees_of_freedom() < 0; }
|
|
132 // Is this live range of "low-degree"? Trivially colorable?
|
|
133 bool lo_degree () const { return degree() <= degrees_of_freedom(); }
|
|
134 // Is this live range just barely "low-degree"? Trivially colorable?
|
|
135 bool just_lo_degree () const { return degree() == degrees_of_freedom(); }
|
|
136
|
|
137 uint _is_oop:1, // Live-range holds an oop
|
|
138 _is_float:1, // True if in float registers
|
|
139 _was_spilled1:1, // True if prior spilling on def
|
|
140 _was_spilled2:1, // True if twice prior spilling on def
|
|
141 _is_bound:1, // live range starts life with no
|
|
142 // degrees of freedom.
|
|
143 _direct_conflict:1, // True if def and use registers in conflict
|
|
144 _must_spill:1, // live range has lost all degrees of freedom
|
|
145 // If _fat_proj is set, live range does NOT require aligned, adjacent
|
|
146 // registers and has NO interferences.
|
|
147 // If _fat_proj is clear, live range requires num_regs() to be a power of
|
|
148 // 2, and it requires registers to form an aligned, adjacent set.
|
|
149 _fat_proj:1, //
|
|
150 _was_lo:1, // Was lo-degree prior to coalesce
|
|
151 _msize_valid:1, // _mask_size cache valid
|
|
152 _degree_valid:1, // _degree cache valid
|
|
153 _has_copy:1, // Adjacent to some copy instruction
|
|
154 _at_risk:1; // Simplify says this guy is at risk to spill
|
|
155
|
|
156
|
|
157 // Alive if non-zero, dead if zero
|
|
158 bool alive() const { return _def != NULL; }
|
|
159
|
|
160 #ifndef PRODUCT
|
|
161 void dump( ) const;
|
|
162 #endif
|
|
163 };
|
|
164
|
|
165 //------------------------------LRG_List---------------------------------------
|
|
166 // Map Node indices to Live RanGe indices.
|
|
167 // Array lookup in the optimized case.
|
|
168 class LRG_List : public ResourceObj {
|
|
169 uint _cnt, _max;
|
|
170 uint* _lidxs;
|
|
171 ReallocMark _nesting; // assertion check for reallocations
|
|
172 public:
|
|
173 LRG_List( uint max );
|
|
174
|
|
175 uint lookup( uint nidx ) const {
|
|
176 return _lidxs[nidx];
|
|
177 }
|
|
178 uint operator[] (uint nidx) const { return lookup(nidx); }
|
|
179
|
|
180 void map( uint nidx, uint lidx ) {
|
|
181 assert( nidx < _cnt, "oob" );
|
|
182 _lidxs[nidx] = lidx;
|
|
183 }
|
|
184 void extend( uint nidx, uint lidx );
|
|
185
|
|
186 uint Size() const { return _cnt; }
|
|
187 };
|
|
188
|
|
189 //------------------------------IFG--------------------------------------------
|
|
190 // InterFerence Graph
|
|
191 // An undirected graph implementation. Created with a fixed number of
|
|
192 // vertices. Edges can be added & tested. Vertices can be removed, then
|
|
193 // added back later with all edges intact. Can add edges between one vertex
|
|
194 // and a list of other vertices. Can union vertices (and their edges)
|
|
195 // together. The IFG needs to be really really fast, and also fairly
|
|
196 // abstract! It needs abstraction so I can fiddle with the implementation to
|
|
197 // get even more speed.
|
|
198 class PhaseIFG : public Phase {
|
|
199 // Current implementation: a triangular adjacency list.
|
|
200
|
|
201 // Array of adjacency-lists, indexed by live-range number
|
|
202 IndexSet *_adjs;
|
|
203
|
|
204 // Assertion bit for proper use of Squaring
|
|
205 bool _is_square;
|
|
206
|
|
207 // Live range structure goes here
|
|
208 LRG *_lrgs; // Array of LRG structures
|
|
209
|
|
210 public:
|
|
211 // Largest live-range number
|
|
212 uint _maxlrg;
|
|
213
|
|
214 Arena *_arena;
|
|
215
|
|
216 // Keep track of inserted and deleted Nodes
|
|
217 VectorSet *_yanked;
|
|
218
|
|
219 PhaseIFG( Arena *arena );
|
|
220 void init( uint maxlrg );
|
|
221
|
|
222 // Add edge between a and b. Returns true if actually addded.
|
|
223 int add_edge( uint a, uint b );
|
|
224
|
|
225 // Add edge between a and everything in the vector
|
|
226 void add_vector( uint a, IndexSet *vec );
|
|
227
|
|
228 // Test for edge existance
|
|
229 int test_edge( uint a, uint b ) const;
|
|
230
|
|
231 // Square-up matrix for faster Union
|
|
232 void SquareUp();
|
|
233
|
|
234 // Return number of LRG neighbors
|
|
235 uint neighbor_cnt( uint a ) const { return _adjs[a].count(); }
|
|
236 // Union edges of b into a on Squared-up matrix
|
|
237 void Union( uint a, uint b );
|
|
238 // Test for edge in Squared-up matrix
|
|
239 int test_edge_sq( uint a, uint b ) const;
|
|
240 // Yank a Node and all connected edges from the IFG. Be prepared to
|
|
241 // re-insert the yanked Node in reverse order of yanking. Return a
|
|
242 // list of neighbors (edges) yanked.
|
|
243 IndexSet *remove_node( uint a );
|
|
244 // Reinsert a yanked Node
|
|
245 void re_insert( uint a );
|
|
246 // Return set of neighbors
|
|
247 IndexSet *neighbors( uint a ) const { return &_adjs[a]; }
|
|
248
|
|
249 #ifndef PRODUCT
|
|
250 // Dump the IFG
|
|
251 void dump() const;
|
|
252 void stats() const;
|
|
253 void verify( const PhaseChaitin * ) const;
|
|
254 #endif
|
|
255
|
|
256 //--------------- Live Range Accessors
|
|
257 LRG &lrgs(uint idx) const { assert(idx < _maxlrg, "oob"); return _lrgs[idx]; }
|
|
258
|
|
259 // Compute and set effective degree. Might be folded into SquareUp().
|
|
260 void Compute_Effective_Degree();
|
|
261
|
|
262 // Compute effective degree as the sum of neighbors' _sizes.
|
|
263 int effective_degree( uint lidx ) const;
|
|
264 };
|
|
265
|
|
266 // TEMPORARILY REPLACED WITH COMMAND LINE FLAG
|
|
267
|
|
268 //// !!!!! Magic Constants need to move into ad file
|
|
269 #ifdef SPARC
|
|
270 //#define FLOAT_PRESSURE 30 /* SFLT_REG_mask.Size() - 1 */
|
|
271 //#define INT_PRESSURE 23 /* NOTEMP_I_REG_mask.Size() - 1 */
|
|
272 #define FLOAT_INCREMENT(regs) regs
|
|
273 #else
|
|
274 //#define FLOAT_PRESSURE 6
|
|
275 //#define INT_PRESSURE 6
|
|
276 #define FLOAT_INCREMENT(regs) 1
|
|
277 #endif
|
|
278
|
|
279 //------------------------------Chaitin----------------------------------------
|
|
280 // Briggs-Chaitin style allocation, mostly.
|
|
281 class PhaseChaitin : public PhaseRegAlloc {
|
|
282
|
|
283 int _trip_cnt;
|
|
284 int _alternate;
|
|
285
|
|
286 uint _maxlrg; // Max live range number
|
|
287 LRG &lrgs(uint idx) const { return _ifg->lrgs(idx); }
|
|
288 PhaseLive *_live; // Liveness, used in the interference graph
|
|
289 PhaseIFG *_ifg; // Interference graph (for original chunk)
|
|
290 Node_List **_lrg_nodes; // Array of node; lists for lrgs which spill
|
|
291 VectorSet _spilled_once; // Nodes that have been spilled
|
|
292 VectorSet _spilled_twice; // Nodes that have been spilled twice
|
|
293
|
|
294 LRG_List _names; // Map from Nodes to Live RanGes
|
|
295
|
|
296 // Union-find map. Declared as a short for speed.
|
|
297 // Indexed by live-range number, it returns the compacted live-range number
|
|
298 LRG_List _uf_map;
|
|
299 // Reset the Union-Find map to identity
|
|
300 void reset_uf_map( uint maxlrg );
|
|
301 // Remove the need for the Union-Find mapping
|
|
302 void compress_uf_map_for_nodes( );
|
|
303
|
|
304 // Combine the Live Range Indices for these 2 Nodes into a single live
|
|
305 // range. Future requests for any Node in either live range will
|
|
306 // return the live range index for the combined live range.
|
|
307 void Union( const Node *src, const Node *dst );
|
|
308
|
|
309 void new_lrg( const Node *x, uint lrg );
|
|
310
|
|
311 // Compact live ranges, removing unused ones. Return new maxlrg.
|
|
312 void compact();
|
|
313
|
|
314 uint _lo_degree; // Head of lo-degree LRGs list
|
|
315 uint _lo_stk_degree; // Head of lo-stk-degree LRGs list
|
|
316 uint _hi_degree; // Head of hi-degree LRGs list
|
|
317 uint _simplified; // Linked list head of simplified LRGs
|
|
318
|
|
319 // Helper functions for Split()
|
|
320 uint split_DEF( Node *def, Block *b, int loc, uint max, Node **Reachblock, Node **debug_defs, GrowableArray<uint> splits, int slidx );
|
|
321 uint split_USE( Node *def, Block *b, Node *use, uint useidx, uint max, bool def_down, bool cisc_sp, GrowableArray<uint> splits, int slidx );
|
|
322 int clone_projs( Block *b, uint idx, Node *con, Node *copy, uint &maxlrg );
|
|
323 Node *split_Rematerialize( Node *def, Block *b, uint insidx, uint &maxlrg, GrowableArray<uint> splits, int slidx, uint *lrg2reach, Node **Reachblock, bool walkThru );
|
|
324 // True if lidx is used before any real register is def'd in the block
|
|
325 bool prompt_use( Block *b, uint lidx );
|
|
326 Node *get_spillcopy_wide( Node *def, Node *use, uint uidx );
|
|
327 // Insert the spill at chosen location. Skip over any interveneing Proj's or
|
|
328 // Phis. Skip over a CatchNode and projs, inserting in the fall-through block
|
|
329 // instead. Update high-pressure indices. Create a new live range.
|
|
330 void insert_proj( Block *b, uint i, Node *spill, uint maxlrg );
|
|
331
|
|
332 bool is_high_pressure( Block *b, LRG *lrg, uint insidx );
|
|
333
|
|
334 uint _oldphi; // Node index which separates pre-allocation nodes
|
|
335
|
|
336 Block **_blks; // Array of blocks sorted by frequency for coalescing
|
|
337
|
|
338 #ifndef PRODUCT
|
|
339 bool _trace_spilling;
|
|
340 #endif
|
|
341
|
|
342 public:
|
|
343 PhaseChaitin( uint unique, PhaseCFG &cfg, Matcher &matcher );
|
|
344 ~PhaseChaitin() {}
|
|
345
|
|
346 // Convert a Node into a Live Range Index - a lidx
|
|
347 uint Find( const Node *n ) {
|
|
348 uint lidx = n2lidx(n);
|
|
349 uint uf_lidx = _uf_map[lidx];
|
|
350 return (uf_lidx == lidx) ? uf_lidx : Find_compress(n);
|
|
351 }
|
|
352 uint Find_const( uint lrg ) const;
|
|
353 uint Find_const( const Node *n ) const;
|
|
354
|
|
355 // Do all the real work of allocate
|
|
356 void Register_Allocate();
|
|
357
|
|
358 uint n2lidx( const Node *n ) const { return _names[n->_idx]; }
|
|
359
|
|
360 #ifndef PRODUCT
|
|
361 bool trace_spilling() const { return _trace_spilling; }
|
|
362 #endif
|
|
363
|
|
364 private:
|
|
365 // De-SSA the world. Assign registers to Nodes. Use the same register for
|
|
366 // all inputs to a PhiNode, effectively coalescing live ranges. Insert
|
|
367 // copies as needed.
|
|
368 void de_ssa();
|
|
369 uint Find_compress( const Node *n );
|
|
370 uint Find( uint lidx ) {
|
|
371 uint uf_lidx = _uf_map[lidx];
|
|
372 return (uf_lidx == lidx) ? uf_lidx : Find_compress(lidx);
|
|
373 }
|
|
374 uint Find_compress( uint lidx );
|
|
375
|
|
376 uint Find_id( const Node *n ) {
|
|
377 uint retval = n2lidx(n);
|
|
378 assert(retval == Find(n),"Invalid node to lidx mapping");
|
|
379 return retval;
|
|
380 }
|
|
381
|
|
382 // Add edge between reg and everything in the vector.
|
|
383 // Same as _ifg->add_vector(reg,live) EXCEPT use the RegMask
|
|
384 // information to trim the set of interferences. Return the
|
|
385 // count of edges added.
|
|
386 void interfere_with_live( uint reg, IndexSet *live );
|
|
387 // Count register pressure for asserts
|
|
388 uint count_int_pressure( IndexSet *liveout );
|
|
389 uint count_float_pressure( IndexSet *liveout );
|
|
390
|
|
391 // Build the interference graph using virtual registers only.
|
|
392 // Used for aggressive coalescing.
|
|
393 void build_ifg_virtual( );
|
|
394
|
|
395 // Build the interference graph using physical registers when available.
|
|
396 // That is, if 2 live ranges are simultaneously alive but in their
|
|
397 // acceptable register sets do not overlap, then they do not interfere.
|
|
398 uint build_ifg_physical( ResourceArea *a );
|
|
399
|
|
400 // Gather LiveRanGe information, including register masks and base pointer/
|
|
401 // derived pointer relationships.
|
|
402 void gather_lrg_masks( bool mod_cisc_masks );
|
|
403
|
|
404 // Force the bases of derived pointers to be alive at GC points.
|
|
405 bool stretch_base_pointer_live_ranges( ResourceArea *a );
|
|
406 // Helper to stretch above; recursively discover the base Node for
|
|
407 // a given derived Node. Easy for AddP-related machine nodes, but
|
|
408 // needs to be recursive for derived Phis.
|
|
409 Node *find_base_for_derived( Node **derived_base_map, Node *derived, uint &maxlrg );
|
|
410
|
|
411 // Set the was-lo-degree bit. Conservative coalescing should not change the
|
|
412 // colorability of the graph. If any live range was of low-degree before
|
|
413 // coalescing, it should Simplify. This call sets the was-lo-degree bit.
|
|
414 void set_was_low();
|
|
415
|
|
416 // Split live-ranges that must spill due to register conflicts (as opposed
|
|
417 // to capacity spills). Typically these are things def'd in a register
|
|
418 // and used on the stack or vice-versa.
|
|
419 void pre_spill();
|
|
420
|
|
421 // Init LRG caching of degree, numregs. Init lo_degree list.
|
|
422 void cache_lrg_info( );
|
|
423
|
|
424 // Simplify the IFG by removing LRGs of low degree with no copies
|
|
425 void Pre_Simplify();
|
|
426
|
|
427 // Simplify the IFG by removing LRGs of low degree
|
|
428 void Simplify();
|
|
429
|
|
430 // Select colors by re-inserting edges into the IFG.
|
|
431 // Return TRUE if any spills occured.
|
|
432 uint Select( );
|
|
433 // Helper function for select which allows biased coloring
|
|
434 OptoReg::Name choose_color( LRG &lrg, int chunk );
|
|
435 // Helper function which implements biasing heuristic
|
|
436 OptoReg::Name bias_color( LRG &lrg, int chunk );
|
|
437
|
|
438 // Split uncolorable live ranges
|
|
439 // Return new number of live ranges
|
|
440 uint Split( uint maxlrg );
|
|
441
|
|
442 // Copy 'was_spilled'-edness from one Node to another.
|
|
443 void copy_was_spilled( Node *src, Node *dst );
|
|
444 // Set the 'spilled_once' or 'spilled_twice' flag on a node.
|
|
445 void set_was_spilled( Node *n );
|
|
446
|
|
447 // Convert ideal spill-nodes into machine loads & stores
|
|
448 // Set C->failing when fixup spills could not complete, node limit exceeded.
|
|
449 void fixup_spills();
|
|
450
|
|
451 // Post-Allocation peephole copy removal
|
|
452 void post_allocate_copy_removal();
|
|
453 Node *skip_copies( Node *c );
|
|
454 int yank_if_dead( Node *old, Block *current_block, Node_List *value, Node_List *regnd );
|
|
455 int elide_copy( Node *n, int k, Block *current_block, Node_List &value, Node_List ®nd, bool can_change_regs );
|
|
456 int use_prior_register( Node *copy, uint idx, Node *def, Block *current_block, Node_List &value, Node_List ®nd );
|
|
457 bool may_be_copy_of_callee( Node *def ) const;
|
|
458
|
|
459 // If nreg already contains the same constant as val then eliminate it
|
|
460 bool eliminate_copy_of_constant(Node* val, Block *current_block, Node_List& value, Node_List ®nd,
|
|
461 OptoReg::Name nreg, OptoReg::Name nreg2);
|
|
462 // Extend the node to LRG mapping
|
|
463 void add_reference( const Node *node, const Node *old_node);
|
|
464
|
|
465 private:
|
|
466
|
|
467 static int _final_loads, _final_stores, _final_copies, _final_memoves;
|
|
468 static double _final_load_cost, _final_store_cost, _final_copy_cost, _final_memove_cost;
|
|
469 static int _conserv_coalesce, _conserv_coalesce_pair;
|
|
470 static int _conserv_coalesce_trie, _conserv_coalesce_quad;
|
|
471 static int _post_alloc;
|
|
472 static int _lost_opp_pp_coalesce, _lost_opp_cflow_coalesce;
|
|
473 static int _used_cisc_instructions, _unused_cisc_instructions;
|
|
474 static int _allocator_attempts, _allocator_successes;
|
|
475
|
|
476 #ifndef PRODUCT
|
|
477 static uint _high_pressure, _low_pressure;
|
|
478
|
|
479 void dump() const;
|
|
480 void dump( const Node *n ) const;
|
|
481 void dump( const Block * b ) const;
|
|
482 void dump_degree_lists() const;
|
|
483 void dump_simplified() const;
|
|
484 void dump_lrg( uint lidx ) const;
|
|
485 void dump_bb( uint pre_order ) const;
|
|
486
|
|
487 // Verify that base pointers and derived pointers are still sane
|
|
488 void verify_base_ptrs( ResourceArea *a ) const;
|
|
489
|
|
490 void dump_for_spill_split_recycle() const;
|
|
491
|
|
492 public:
|
|
493 void dump_frame() const;
|
|
494 char *dump_register( const Node *n, char *buf ) const;
|
|
495 private:
|
|
496 static void print_chaitin_statistics();
|
|
497 #endif
|
|
498 friend class PhaseCoalesce;
|
|
499 friend class PhaseAggressiveCoalesce;
|
|
500 friend class PhaseConservativeCoalesce;
|
|
501 };
|