Thu, 01 Aug 2013 17:25:10 -0700
Merge
1 /*
2 * Copyright (c) 1997, 2010, Oracle and/or its affiliates. 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 Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
20 * or visit www.oracle.com if you need additional information or have any
21 * questions.
22 *
23 */
25 #ifndef SHARE_VM_OPTO_LIVE_HPP
26 #define SHARE_VM_OPTO_LIVE_HPP
28 #include "libadt/port.hpp"
29 #include "libadt/vectset.hpp"
30 #include "opto/block.hpp"
31 #include "opto/indexSet.hpp"
32 #include "opto/phase.hpp"
33 #include "opto/regmask.hpp"
35 class Block;
36 class PhaseCFG;
37 class VectorSet;
38 class IndexSet;
40 //------------------------------LRG_List---------------------------------------
41 // Map Node indices to Live RanGe indices.
42 // Array lookup in the optimized case.
43 class LRG_List : public ResourceObj {
44 friend class VMStructs;
45 uint _cnt, _max;
46 uint* _lidxs;
47 ReallocMark _nesting; // assertion check for reallocations
48 public:
49 LRG_List( uint max );
51 uint lookup( uint nidx ) const {
52 return _lidxs[nidx];
53 }
54 uint operator[] (uint nidx) const { return lookup(nidx); }
56 void map( uint nidx, uint lidx ) {
57 assert( nidx < _cnt, "oob" );
58 _lidxs[nidx] = lidx;
59 }
60 void extend( uint nidx, uint lidx );
62 uint Size() const { return _cnt; }
63 };
65 //------------------------------PhaseLive--------------------------------------
66 // Compute live-in/live-out
67 class PhaseLive : public Phase {
68 // Array of Sets of values live at the start of a block.
69 // Indexed by block pre-order number.
70 IndexSet *_live;
72 // Array of Sets of values defined locally in the block
73 // Indexed by block pre-order number.
74 IndexSet *_defs;
76 // Array of delta-set pointers, indexed by block pre-order number
77 IndexSet **_deltas;
78 IndexSet *_free_IndexSet; // Free list of same
80 Block_List *_worklist; // Worklist for iterative solution
82 const PhaseCFG &_cfg; // Basic blocks
83 const LRG_List &_names; // Mapping from Nodes to live ranges
84 uint _maxlrg; // Largest live-range number
85 Arena *_arena;
87 IndexSet *getset( Block *p );
88 IndexSet *getfreeset( );
89 void freeset( const Block *p );
90 void add_liveout( Block *p, uint r, VectorSet &first_pass );
91 void add_liveout( Block *p, IndexSet *lo, VectorSet &first_pass );
93 public:
94 PhaseLive(const PhaseCFG &cfg, const LRG_List &names, Arena *arena);
95 ~PhaseLive() {}
96 // Compute liveness info
97 void compute(uint maxlrg);
98 // Reset arena storage
99 void reset() { _live = NULL; }
101 // Return the live-out set for this block
102 IndexSet *live( const Block * b ) { return &_live[b->_pre_order-1]; }
104 #ifndef PRODUCT
105 void dump( const Block *b ) const;
106 void stats(uint iters) const;
107 #endif
108 };
110 #endif // SHARE_VM_OPTO_LIVE_HPP