author | brutisso |
Mon, 17 Dec 2012 15:25:26 +0100 | |
changeset 14841 | d069f5506f71 |
parent 13104 | 657b387034fb |
child 15241 | 87d217c2d183 |
permissions | -rw-r--r-- |
1 | 1 |
/* |
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
2 |
* Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
1 | 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 |
* |
|
5547
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
19 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
20 |
* or visit www.oracle.com if you need additional information or have any |
f4b087cbb361
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
1
diff
changeset
|
21 |
* questions. |
1 | 22 |
* |
23 |
*/ |
|
24 |
||
7397 | 25 |
#include "precompiled.hpp" |
26 |
#include "opto/compile.hpp" |
|
27 |
#include "opto/regmask.hpp" |
|
28 |
#ifdef TARGET_ARCH_MODEL_x86_32 |
|
29 |
# include "adfiles/ad_x86_32.hpp" |
|
30 |
#endif |
|
31 |
#ifdef TARGET_ARCH_MODEL_x86_64 |
|
32 |
# include "adfiles/ad_x86_64.hpp" |
|
33 |
#endif |
|
34 |
#ifdef TARGET_ARCH_MODEL_sparc |
|
35 |
# include "adfiles/ad_sparc.hpp" |
|
36 |
#endif |
|
37 |
#ifdef TARGET_ARCH_MODEL_zero |
|
38 |
# include "adfiles/ad_zero.hpp" |
|
39 |
#endif |
|
8107
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
40 |
#ifdef TARGET_ARCH_MODEL_arm |
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
41 |
# include "adfiles/ad_arm.hpp" |
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
42 |
#endif |
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
43 |
#ifdef TARGET_ARCH_MODEL_ppc |
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
44 |
# include "adfiles/ad_ppc.hpp" |
78e5bd944384
7016023: Enable building ARM and PPC from src/closed repository
bobv
parents:
7397
diff
changeset
|
45 |
#endif |
1 | 46 |
|
47 |
#define RM_SIZE _RM_SIZE /* a constant private to the class RegMask */ |
|
48 |
||
49 |
//-------------Non-zero bit search methods used by RegMask--------------------- |
|
50 |
// Find lowest 1, or return 32 if empty |
|
51 |
int find_lowest_bit( uint32 mask ) { |
|
52 |
int n = 0; |
|
53 |
if( (mask & 0xffff) == 0 ) { |
|
54 |
mask >>= 16; |
|
55 |
n += 16; |
|
56 |
} |
|
57 |
if( (mask & 0xff) == 0 ) { |
|
58 |
mask >>= 8; |
|
59 |
n += 8; |
|
60 |
} |
|
61 |
if( (mask & 0xf) == 0 ) { |
|
62 |
mask >>= 4; |
|
63 |
n += 4; |
|
64 |
} |
|
65 |
if( (mask & 0x3) == 0 ) { |
|
66 |
mask >>= 2; |
|
67 |
n += 2; |
|
68 |
} |
|
69 |
if( (mask & 0x1) == 0 ) { |
|
70 |
mask >>= 1; |
|
71 |
n += 1; |
|
72 |
} |
|
73 |
if( mask == 0 ) { |
|
74 |
n = 32; |
|
75 |
} |
|
76 |
return n; |
|
77 |
} |
|
78 |
||
79 |
// Find highest 1, or return 32 if empty |
|
80 |
int find_hihghest_bit( uint32 mask ) { |
|
81 |
int n = 0; |
|
82 |
if( mask > 0xffff ) { |
|
83 |
mask >>= 16; |
|
84 |
n += 16; |
|
85 |
} |
|
86 |
if( mask > 0xff ) { |
|
87 |
mask >>= 8; |
|
88 |
n += 8; |
|
89 |
} |
|
90 |
if( mask > 0xf ) { |
|
91 |
mask >>= 4; |
|
92 |
n += 4; |
|
93 |
} |
|
94 |
if( mask > 0x3 ) { |
|
95 |
mask >>= 2; |
|
96 |
n += 2; |
|
97 |
} |
|
98 |
if( mask > 0x1 ) { |
|
99 |
mask >>= 1; |
|
100 |
n += 1; |
|
101 |
} |
|
102 |
if( mask == 0 ) { |
|
103 |
n = 32; |
|
104 |
} |
|
105 |
return n; |
|
106 |
} |
|
107 |
||
108 |
//------------------------------dump------------------------------------------- |
|
109 |
||
110 |
#ifndef PRODUCT |
|
111 |
void OptoReg::dump( int r ) { |
|
112 |
switch( r ) { |
|
113 |
case Special: tty->print("r---"); break; |
|
114 |
case Bad: tty->print("rBAD"); break; |
|
115 |
default: |
|
116 |
if( r < _last_Mach_Reg ) tty->print(Matcher::regName[r]); |
|
117 |
else tty->print("rS%d",r); |
|
118 |
break; |
|
119 |
} |
|
120 |
} |
|
121 |
#endif |
|
122 |
||
123 |
||
124 |
//============================================================================= |
|
125 |
const RegMask RegMask::Empty( |
|
126 |
# define BODY(I) 0, |
|
127 |
FORALL_BODY |
|
128 |
# undef BODY |
|
129 |
0 |
|
130 |
); |
|
131 |
||
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
132 |
//============================================================================= |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
133 |
bool RegMask::is_vector(uint ireg) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
134 |
return (ireg == Op_VecS || ireg == Op_VecD || ireg == Op_VecX || ireg == Op_VecY); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
135 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
136 |
|
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
137 |
int RegMask::num_registers(uint ireg) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
138 |
switch(ireg) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
139 |
case Op_VecY: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
140 |
return 8; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
141 |
case Op_VecX: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
142 |
return 4; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
143 |
case Op_VecD: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
144 |
case Op_RegD: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
145 |
case Op_RegL: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
146 |
#ifdef _LP64 |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
147 |
case Op_RegP: |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
148 |
#endif |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
149 |
return 2; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
150 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
151 |
// Op_VecS and the rest ideal registers. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
152 |
return 1; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
153 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
154 |
|
1 | 155 |
//------------------------------find_first_pair-------------------------------- |
156 |
// Find the lowest-numbered register pair in the mask. Return the |
|
157 |
// HIGHEST register number in the pair, or BAD if no pairs. |
|
158 |
OptoReg::Name RegMask::find_first_pair() const { |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
159 |
verify_pairs(); |
1 | 160 |
for( int i = 0; i < RM_SIZE; i++ ) { |
161 |
if( _A[i] ) { // Found some bits |
|
162 |
int bit = _A[i] & -_A[i]; // Extract low bit |
|
163 |
// Convert to bit number, return hi bit in pair |
|
164 |
return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+1); |
|
165 |
} |
|
166 |
} |
|
167 |
return OptoReg::Bad; |
|
168 |
} |
|
169 |
||
170 |
//------------------------------ClearToPairs----------------------------------- |
|
171 |
// Clear out partial bits; leave only bit pairs |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
172 |
void RegMask::clear_to_pairs() { |
1 | 173 |
for( int i = 0; i < RM_SIZE; i++ ) { |
174 |
int bits = _A[i]; |
|
175 |
bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair |
|
176 |
bits |= (bits>>1); // Smear 1 hi-bit into a pair |
|
177 |
_A[i] = bits; |
|
178 |
} |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
179 |
verify_pairs(); |
1 | 180 |
} |
181 |
||
182 |
//------------------------------SmearToPairs----------------------------------- |
|
183 |
// Smear out partial bits; leave only bit pairs |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
184 |
void RegMask::smear_to_pairs() { |
1 | 185 |
for( int i = 0; i < RM_SIZE; i++ ) { |
186 |
int bits = _A[i]; |
|
187 |
bits |= ((bits & 0x55555555)<<1); // Smear lo bit hi per pair |
|
188 |
bits |= ((bits & 0xAAAAAAAA)>>1); // Smear hi bit lo per pair |
|
189 |
_A[i] = bits; |
|
190 |
} |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
191 |
verify_pairs(); |
1 | 192 |
} |
193 |
||
194 |
//------------------------------is_aligned_pairs------------------------------- |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
195 |
bool RegMask::is_aligned_pairs() const { |
1 | 196 |
// Assert that the register mask contains only bit pairs. |
197 |
for( int i = 0; i < RM_SIZE; i++ ) { |
|
198 |
int bits = _A[i]; |
|
199 |
while( bits ) { // Check bits for pairing |
|
200 |
int bit = bits & -bits; // Extract low bit |
|
201 |
// Low bit is not odd means its mis-aligned. |
|
202 |
if( (bit & 0x55555555) == 0 ) return false; |
|
203 |
bits -= bit; // Remove bit from mask |
|
204 |
// Check for aligned adjacent bit |
|
205 |
if( (bits & (bit<<1)) == 0 ) return false; |
|
206 |
bits -= (bit<<1); // Remove other halve of pair |
|
207 |
} |
|
208 |
} |
|
209 |
return true; |
|
210 |
} |
|
211 |
||
212 |
//------------------------------is_bound1-------------------------------------- |
|
213 |
// Return TRUE if the mask contains a single bit |
|
214 |
int RegMask::is_bound1() const { |
|
215 |
if( is_AllStack() ) return false; |
|
216 |
int bit = -1; // Set to hold the one bit allowed |
|
217 |
for( int i = 0; i < RM_SIZE; i++ ) { |
|
218 |
if( _A[i] ) { // Found some bits |
|
219 |
if( bit != -1 ) return false; // Already had bits, so fail |
|
220 |
bit = _A[i] & -_A[i]; // Extract 1 bit from mask |
|
221 |
if( bit != _A[i] ) return false; // Found many bits, so fail |
|
222 |
} |
|
223 |
} |
|
224 |
// True for both the empty mask and for a single bit |
|
225 |
return true; |
|
226 |
} |
|
227 |
||
228 |
//------------------------------is_bound2-------------------------------------- |
|
229 |
// Return TRUE if the mask contains an adjacent pair of bits and no other bits. |
|
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
230 |
int RegMask::is_bound_pair() const { |
1 | 231 |
if( is_AllStack() ) return false; |
232 |
||
233 |
int bit = -1; // Set to hold the one bit allowed |
|
234 |
for( int i = 0; i < RM_SIZE; i++ ) { |
|
235 |
if( _A[i] ) { // Found some bits |
|
236 |
if( bit != -1 ) return false; // Already had bits, so fail |
|
237 |
bit = _A[i] & -(_A[i]); // Extract 1 bit from mask |
|
238 |
if( (bit << 1) != 0 ) { // Bit pair stays in same word? |
|
239 |
if( (bit | (bit<<1)) != _A[i] ) |
|
240 |
return false; // Require adjacent bit pair and no more bits |
|
241 |
} else { // Else its a split-pair case |
|
242 |
if( bit != _A[i] ) return false; // Found many bits, so fail |
|
243 |
i++; // Skip iteration forward |
|
244 |
if( _A[i] != 1 ) return false; // Require 1 lo bit in next word |
|
245 |
} |
|
246 |
} |
|
247 |
} |
|
248 |
// True for both the empty mask and for a bit pair |
|
249 |
return true; |
|
250 |
} |
|
251 |
||
13104
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
252 |
static int low_bits[3] = { 0x55555555, 0x11111111, 0x01010101 }; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
253 |
//------------------------------find_first_set--------------------------------- |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
254 |
// Find the lowest-numbered register set in the mask. Return the |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
255 |
// HIGHEST register number in the set, or BAD if no sets. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
256 |
// Works also for size 1. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
257 |
OptoReg::Name RegMask::find_first_set(int size) const { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
258 |
verify_sets(size); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
259 |
for (int i = 0; i < RM_SIZE; i++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
260 |
if (_A[i]) { // Found some bits |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
261 |
int bit = _A[i] & -_A[i]; // Extract low bit |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
262 |
// Convert to bit number, return hi bit in pair |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
263 |
return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+(size-1)); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
264 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
265 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
266 |
return OptoReg::Bad; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
267 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
268 |
|
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
269 |
//------------------------------clear_to_sets---------------------------------- |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
270 |
// Clear out partial bits; leave only aligned adjacent bit pairs |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
271 |
void RegMask::clear_to_sets(int size) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
272 |
if (size == 1) return; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
273 |
assert(2 <= size && size <= 8, "update low bits table"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
274 |
assert(is_power_of_2(size), "sanity"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
275 |
int low_bits_mask = low_bits[size>>2]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
276 |
for (int i = 0; i < RM_SIZE; i++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
277 |
int bits = _A[i]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
278 |
int sets = (bits & low_bits_mask); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
279 |
for (int j = 1; j < size; j++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
280 |
sets = (bits & (sets<<1)); // filter bits which produce whole sets |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
281 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
282 |
sets |= (sets>>1); // Smear 1 hi-bit into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
283 |
if (size > 2) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
284 |
sets |= (sets>>2); // Smear 2 hi-bits into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
285 |
if (size > 4) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
286 |
sets |= (sets>>4); // Smear 4 hi-bits into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
287 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
288 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
289 |
_A[i] = sets; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
290 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
291 |
verify_sets(size); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
292 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
293 |
|
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
294 |
//------------------------------smear_to_sets---------------------------------- |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
295 |
// Smear out partial bits to aligned adjacent bit sets |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
296 |
void RegMask::smear_to_sets(int size) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
297 |
if (size == 1) return; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
298 |
assert(2 <= size && size <= 8, "update low bits table"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
299 |
assert(is_power_of_2(size), "sanity"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
300 |
int low_bits_mask = low_bits[size>>2]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
301 |
for (int i = 0; i < RM_SIZE; i++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
302 |
int bits = _A[i]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
303 |
int sets = 0; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
304 |
for (int j = 0; j < size; j++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
305 |
sets |= (bits & low_bits_mask); // collect partial bits |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
306 |
bits = bits>>1; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
307 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
308 |
sets |= (sets<<1); // Smear 1 lo-bit into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
309 |
if (size > 2) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
310 |
sets |= (sets<<2); // Smear 2 lo-bits into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
311 |
if (size > 4) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
312 |
sets |= (sets<<4); // Smear 4 lo-bits into a set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
313 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
314 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
315 |
_A[i] = sets; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
316 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
317 |
verify_sets(size); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
318 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
319 |
|
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
320 |
//------------------------------is_aligned_set-------------------------------- |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
321 |
bool RegMask::is_aligned_sets(int size) const { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
322 |
if (size == 1) return true; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
323 |
assert(2 <= size && size <= 8, "update low bits table"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
324 |
assert(is_power_of_2(size), "sanity"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
325 |
int low_bits_mask = low_bits[size>>2]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
326 |
// Assert that the register mask contains only bit sets. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
327 |
for (int i = 0; i < RM_SIZE; i++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
328 |
int bits = _A[i]; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
329 |
while (bits) { // Check bits for pairing |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
330 |
int bit = bits & -bits; // Extract low bit |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
331 |
// Low bit is not odd means its mis-aligned. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
332 |
if ((bit & low_bits_mask) == 0) return false; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
333 |
// Do extra work since (bit << size) may overflow. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
334 |
int hi_bit = bit << (size-1); // high bit |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
335 |
int set = hi_bit + ((hi_bit-1) & ~(bit-1)); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
336 |
// Check for aligned adjacent bits in this set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
337 |
if ((bits & set) != set) return false; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
338 |
bits -= set; // Remove this set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
339 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
340 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
341 |
return true; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
342 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
343 |
|
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
344 |
//------------------------------is_bound_set----------------------------------- |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
345 |
// Return TRUE if the mask contains one adjacent set of bits and no other bits. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
346 |
// Works also for size 1. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
347 |
int RegMask::is_bound_set(int size) const { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
348 |
if( is_AllStack() ) return false; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
349 |
assert(1 <= size && size <= 8, "update low bits table"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
350 |
int bit = -1; // Set to hold the one bit allowed |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
351 |
for (int i = 0; i < RM_SIZE; i++) { |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
352 |
if (_A[i] ) { // Found some bits |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
353 |
if (bit != -1) |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
354 |
return false; // Already had bits, so fail |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
355 |
bit = _A[i] & -_A[i]; // Extract 1 bit from mask |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
356 |
int hi_bit = bit << (size-1); // high bit |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
357 |
if (hi_bit != 0) { // Bit set stays in same word? |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
358 |
int set = hi_bit + ((hi_bit-1) & ~(bit-1)); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
359 |
if (set != _A[i]) |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
360 |
return false; // Require adjacent bit set and no more bits |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
361 |
} else { // Else its a split-set case |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
362 |
if (((-1) & ~(bit-1)) != _A[i]) |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
363 |
return false; // Found many bits, so fail |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
364 |
i++; // Skip iteration forward and check high part |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
365 |
assert(size <= 8, "update next code"); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
366 |
// The lower 24 bits should be 0 since it is split case and size <= 8. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
367 |
int set = bit>>24; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
368 |
set = set & -set; // Remove sign extension. |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
369 |
set = (((set << size) - 1) >> 8); |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
370 |
if (_A[i] != set) return false; // Require 1 lo bit in next word |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
371 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
372 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
373 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
374 |
// True for both the empty mask and for a bit set |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
375 |
return true; |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
376 |
} |
657b387034fb
7119644: Increase superword's vector size up to 256 bits
kvn
parents:
8921
diff
changeset
|
377 |
|
1 | 378 |
//------------------------------is_UP------------------------------------------ |
379 |
// UP means register only, Register plus stack, or stack only is DOWN |
|
380 |
bool RegMask::is_UP() const { |
|
381 |
// Quick common case check for DOWN (any stack slot is legal) |
|
382 |
if( is_AllStack() ) |
|
383 |
return false; |
|
384 |
// Slower check for any stack bits set (also DOWN) |
|
385 |
if( overlap(Matcher::STACK_ONLY_mask) ) |
|
386 |
return false; |
|
387 |
// Not DOWN, so must be UP |
|
388 |
return true; |
|
389 |
} |
|
390 |
||
391 |
//------------------------------Size------------------------------------------- |
|
392 |
// Compute size of register mask in bits |
|
393 |
uint RegMask::Size() const { |
|
394 |
extern uint8 bitsInByte[256]; |
|
395 |
uint sum = 0; |
|
396 |
for( int i = 0; i < RM_SIZE; i++ ) |
|
397 |
sum += |
|
398 |
bitsInByte[(_A[i]>>24) & 0xff] + |
|
399 |
bitsInByte[(_A[i]>>16) & 0xff] + |
|
400 |
bitsInByte[(_A[i]>> 8) & 0xff] + |
|
401 |
bitsInByte[ _A[i] & 0xff]; |
|
402 |
return sum; |
|
403 |
} |
|
404 |
||
405 |
#ifndef PRODUCT |
|
406 |
//------------------------------print------------------------------------------ |
|
407 |
void RegMask::dump( ) const { |
|
408 |
tty->print("["); |
|
409 |
RegMask rm = *this; // Structure copy into local temp |
|
410 |
||
411 |
OptoReg::Name start = rm.find_first_elem(); // Get a register |
|
412 |
if( OptoReg::is_valid(start) ) { // Check for empty mask |
|
413 |
rm.Remove(start); // Yank from mask |
|
414 |
OptoReg::dump(start); // Print register |
|
415 |
OptoReg::Name last = start; |
|
416 |
||
417 |
// Now I have printed an initial register. |
|
418 |
// Print adjacent registers as "rX-rZ" instead of "rX,rY,rZ". |
|
419 |
// Begin looping over the remaining registers. |
|
420 |
while( 1 ) { // |
|
421 |
OptoReg::Name reg = rm.find_first_elem(); // Get a register |
|
422 |
if( !OptoReg::is_valid(reg) ) |
|
423 |
break; // Empty mask, end loop |
|
424 |
rm.Remove(reg); // Yank from mask |
|
425 |
||
426 |
if( last+1 == reg ) { // See if they are adjacent |
|
427 |
// Adjacent registers just collect into long runs, no printing. |
|
428 |
last = reg; |
|
429 |
} else { // Ending some kind of run |
|
430 |
if( start == last ) { // 1-register run; no special printing |
|
431 |
} else if( start+1 == last ) { |
|
432 |
tty->print(","); // 2-register run; print as "rX,rY" |
|
433 |
OptoReg::dump(last); |
|
434 |
} else { // Multi-register run; print as "rX-rZ" |
|
435 |
tty->print("-"); |
|
436 |
OptoReg::dump(last); |
|
437 |
} |
|
438 |
tty->print(","); // Seperate start of new run |
|
439 |
start = last = reg; // Start a new register run |
|
440 |
OptoReg::dump(start); // Print register |
|
441 |
} // End of if ending a register run or not |
|
442 |
} // End of while regmask not empty |
|
443 |
||
444 |
if( start == last ) { // 1-register run; no special printing |
|
445 |
} else if( start+1 == last ) { |
|
446 |
tty->print(","); // 2-register run; print as "rX,rY" |
|
447 |
OptoReg::dump(last); |
|
448 |
} else { // Multi-register run; print as "rX-rZ" |
|
449 |
tty->print("-"); |
|
450 |
OptoReg::dump(last); |
|
451 |
} |
|
452 |
if( rm.is_AllStack() ) tty->print("..."); |
|
453 |
} |
|
454 |
tty->print("]"); |
|
455 |
} |
|
456 |
#endif |