Tue, 09 Mar 2010 20:16:19 +0100
6919934: JSR 292 needs to support x86 C1
Summary: This implements JSR 292 support for C1 x86.
Reviewed-by: never, jrose, kvn
duke@435 | 1 | /* |
duke@435 | 2 | * Copyright 1997-2006 Sun Microsystems, Inc. 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 | * |
duke@435 | 19 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
duke@435 | 20 | * CA 95054 USA or visit www.sun.com if you need additional information or |
duke@435 | 21 | * have any questions. |
duke@435 | 22 | * |
duke@435 | 23 | */ |
duke@435 | 24 | |
duke@435 | 25 | #include "incls/_precompiled.incl" |
duke@435 | 26 | #include "incls/_regmask.cpp.incl" |
duke@435 | 27 | |
duke@435 | 28 | #define RM_SIZE _RM_SIZE /* a constant private to the class RegMask */ |
duke@435 | 29 | |
duke@435 | 30 | //-------------Non-zero bit search methods used by RegMask--------------------- |
duke@435 | 31 | // Find lowest 1, or return 32 if empty |
duke@435 | 32 | int find_lowest_bit( uint32 mask ) { |
duke@435 | 33 | int n = 0; |
duke@435 | 34 | if( (mask & 0xffff) == 0 ) { |
duke@435 | 35 | mask >>= 16; |
duke@435 | 36 | n += 16; |
duke@435 | 37 | } |
duke@435 | 38 | if( (mask & 0xff) == 0 ) { |
duke@435 | 39 | mask >>= 8; |
duke@435 | 40 | n += 8; |
duke@435 | 41 | } |
duke@435 | 42 | if( (mask & 0xf) == 0 ) { |
duke@435 | 43 | mask >>= 4; |
duke@435 | 44 | n += 4; |
duke@435 | 45 | } |
duke@435 | 46 | if( (mask & 0x3) == 0 ) { |
duke@435 | 47 | mask >>= 2; |
duke@435 | 48 | n += 2; |
duke@435 | 49 | } |
duke@435 | 50 | if( (mask & 0x1) == 0 ) { |
duke@435 | 51 | mask >>= 1; |
duke@435 | 52 | n += 1; |
duke@435 | 53 | } |
duke@435 | 54 | if( mask == 0 ) { |
duke@435 | 55 | n = 32; |
duke@435 | 56 | } |
duke@435 | 57 | return n; |
duke@435 | 58 | } |
duke@435 | 59 | |
duke@435 | 60 | // Find highest 1, or return 32 if empty |
duke@435 | 61 | int find_hihghest_bit( uint32 mask ) { |
duke@435 | 62 | int n = 0; |
duke@435 | 63 | if( mask > 0xffff ) { |
duke@435 | 64 | mask >>= 16; |
duke@435 | 65 | n += 16; |
duke@435 | 66 | } |
duke@435 | 67 | if( mask > 0xff ) { |
duke@435 | 68 | mask >>= 8; |
duke@435 | 69 | n += 8; |
duke@435 | 70 | } |
duke@435 | 71 | if( mask > 0xf ) { |
duke@435 | 72 | mask >>= 4; |
duke@435 | 73 | n += 4; |
duke@435 | 74 | } |
duke@435 | 75 | if( mask > 0x3 ) { |
duke@435 | 76 | mask >>= 2; |
duke@435 | 77 | n += 2; |
duke@435 | 78 | } |
duke@435 | 79 | if( mask > 0x1 ) { |
duke@435 | 80 | mask >>= 1; |
duke@435 | 81 | n += 1; |
duke@435 | 82 | } |
duke@435 | 83 | if( mask == 0 ) { |
duke@435 | 84 | n = 32; |
duke@435 | 85 | } |
duke@435 | 86 | return n; |
duke@435 | 87 | } |
duke@435 | 88 | |
duke@435 | 89 | //------------------------------dump------------------------------------------- |
duke@435 | 90 | |
duke@435 | 91 | #ifndef PRODUCT |
duke@435 | 92 | void OptoReg::dump( int r ) { |
duke@435 | 93 | switch( r ) { |
duke@435 | 94 | case Special: tty->print("r---"); break; |
duke@435 | 95 | case Bad: tty->print("rBAD"); break; |
duke@435 | 96 | default: |
duke@435 | 97 | if( r < _last_Mach_Reg ) tty->print(Matcher::regName[r]); |
duke@435 | 98 | else tty->print("rS%d",r); |
duke@435 | 99 | break; |
duke@435 | 100 | } |
duke@435 | 101 | } |
duke@435 | 102 | #endif |
duke@435 | 103 | |
duke@435 | 104 | |
duke@435 | 105 | //============================================================================= |
duke@435 | 106 | const RegMask RegMask::Empty( |
duke@435 | 107 | # define BODY(I) 0, |
duke@435 | 108 | FORALL_BODY |
duke@435 | 109 | # undef BODY |
duke@435 | 110 | 0 |
duke@435 | 111 | ); |
duke@435 | 112 | |
duke@435 | 113 | //------------------------------find_first_pair-------------------------------- |
duke@435 | 114 | // Find the lowest-numbered register pair in the mask. Return the |
duke@435 | 115 | // HIGHEST register number in the pair, or BAD if no pairs. |
duke@435 | 116 | OptoReg::Name RegMask::find_first_pair() const { |
duke@435 | 117 | VerifyPairs(); |
duke@435 | 118 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 119 | if( _A[i] ) { // Found some bits |
duke@435 | 120 | int bit = _A[i] & -_A[i]; // Extract low bit |
duke@435 | 121 | // Convert to bit number, return hi bit in pair |
duke@435 | 122 | return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+1); |
duke@435 | 123 | } |
duke@435 | 124 | } |
duke@435 | 125 | return OptoReg::Bad; |
duke@435 | 126 | } |
duke@435 | 127 | |
duke@435 | 128 | //------------------------------ClearToPairs----------------------------------- |
duke@435 | 129 | // Clear out partial bits; leave only bit pairs |
duke@435 | 130 | void RegMask::ClearToPairs() { |
duke@435 | 131 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 132 | int bits = _A[i]; |
duke@435 | 133 | bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair |
duke@435 | 134 | bits |= (bits>>1); // Smear 1 hi-bit into a pair |
duke@435 | 135 | _A[i] = bits; |
duke@435 | 136 | } |
duke@435 | 137 | VerifyPairs(); |
duke@435 | 138 | } |
duke@435 | 139 | |
duke@435 | 140 | //------------------------------SmearToPairs----------------------------------- |
duke@435 | 141 | // Smear out partial bits; leave only bit pairs |
duke@435 | 142 | void RegMask::SmearToPairs() { |
duke@435 | 143 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 144 | int bits = _A[i]; |
duke@435 | 145 | bits |= ((bits & 0x55555555)<<1); // Smear lo bit hi per pair |
duke@435 | 146 | bits |= ((bits & 0xAAAAAAAA)>>1); // Smear hi bit lo per pair |
duke@435 | 147 | _A[i] = bits; |
duke@435 | 148 | } |
duke@435 | 149 | VerifyPairs(); |
duke@435 | 150 | } |
duke@435 | 151 | |
duke@435 | 152 | //------------------------------is_aligned_pairs------------------------------- |
duke@435 | 153 | bool RegMask::is_aligned_Pairs() const { |
duke@435 | 154 | // Assert that the register mask contains only bit pairs. |
duke@435 | 155 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 156 | int bits = _A[i]; |
duke@435 | 157 | while( bits ) { // Check bits for pairing |
duke@435 | 158 | int bit = bits & -bits; // Extract low bit |
duke@435 | 159 | // Low bit is not odd means its mis-aligned. |
duke@435 | 160 | if( (bit & 0x55555555) == 0 ) return false; |
duke@435 | 161 | bits -= bit; // Remove bit from mask |
duke@435 | 162 | // Check for aligned adjacent bit |
duke@435 | 163 | if( (bits & (bit<<1)) == 0 ) return false; |
duke@435 | 164 | bits -= (bit<<1); // Remove other halve of pair |
duke@435 | 165 | } |
duke@435 | 166 | } |
duke@435 | 167 | return true; |
duke@435 | 168 | } |
duke@435 | 169 | |
duke@435 | 170 | //------------------------------is_bound1-------------------------------------- |
duke@435 | 171 | // Return TRUE if the mask contains a single bit |
duke@435 | 172 | int RegMask::is_bound1() const { |
duke@435 | 173 | if( is_AllStack() ) return false; |
duke@435 | 174 | int bit = -1; // Set to hold the one bit allowed |
duke@435 | 175 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 176 | if( _A[i] ) { // Found some bits |
duke@435 | 177 | if( bit != -1 ) return false; // Already had bits, so fail |
duke@435 | 178 | bit = _A[i] & -_A[i]; // Extract 1 bit from mask |
duke@435 | 179 | if( bit != _A[i] ) return false; // Found many bits, so fail |
duke@435 | 180 | } |
duke@435 | 181 | } |
duke@435 | 182 | // True for both the empty mask and for a single bit |
duke@435 | 183 | return true; |
duke@435 | 184 | } |
duke@435 | 185 | |
duke@435 | 186 | //------------------------------is_bound2-------------------------------------- |
duke@435 | 187 | // Return TRUE if the mask contains an adjacent pair of bits and no other bits. |
duke@435 | 188 | int RegMask::is_bound2() const { |
duke@435 | 189 | if( is_AllStack() ) return false; |
duke@435 | 190 | |
duke@435 | 191 | int bit = -1; // Set to hold the one bit allowed |
duke@435 | 192 | for( int i = 0; i < RM_SIZE; i++ ) { |
duke@435 | 193 | if( _A[i] ) { // Found some bits |
duke@435 | 194 | if( bit != -1 ) return false; // Already had bits, so fail |
duke@435 | 195 | bit = _A[i] & -(_A[i]); // Extract 1 bit from mask |
duke@435 | 196 | if( (bit << 1) != 0 ) { // Bit pair stays in same word? |
duke@435 | 197 | if( (bit | (bit<<1)) != _A[i] ) |
duke@435 | 198 | return false; // Require adjacent bit pair and no more bits |
duke@435 | 199 | } else { // Else its a split-pair case |
duke@435 | 200 | if( bit != _A[i] ) return false; // Found many bits, so fail |
duke@435 | 201 | i++; // Skip iteration forward |
duke@435 | 202 | if( _A[i] != 1 ) return false; // Require 1 lo bit in next word |
duke@435 | 203 | } |
duke@435 | 204 | } |
duke@435 | 205 | } |
duke@435 | 206 | // True for both the empty mask and for a bit pair |
duke@435 | 207 | return true; |
duke@435 | 208 | } |
duke@435 | 209 | |
duke@435 | 210 | //------------------------------is_UP------------------------------------------ |
duke@435 | 211 | // UP means register only, Register plus stack, or stack only is DOWN |
duke@435 | 212 | bool RegMask::is_UP() const { |
duke@435 | 213 | // Quick common case check for DOWN (any stack slot is legal) |
duke@435 | 214 | if( is_AllStack() ) |
duke@435 | 215 | return false; |
duke@435 | 216 | // Slower check for any stack bits set (also DOWN) |
duke@435 | 217 | if( overlap(Matcher::STACK_ONLY_mask) ) |
duke@435 | 218 | return false; |
duke@435 | 219 | // Not DOWN, so must be UP |
duke@435 | 220 | return true; |
duke@435 | 221 | } |
duke@435 | 222 | |
duke@435 | 223 | //------------------------------Size------------------------------------------- |
duke@435 | 224 | // Compute size of register mask in bits |
duke@435 | 225 | uint RegMask::Size() const { |
duke@435 | 226 | extern uint8 bitsInByte[256]; |
duke@435 | 227 | uint sum = 0; |
duke@435 | 228 | for( int i = 0; i < RM_SIZE; i++ ) |
duke@435 | 229 | sum += |
duke@435 | 230 | bitsInByte[(_A[i]>>24) & 0xff] + |
duke@435 | 231 | bitsInByte[(_A[i]>>16) & 0xff] + |
duke@435 | 232 | bitsInByte[(_A[i]>> 8) & 0xff] + |
duke@435 | 233 | bitsInByte[ _A[i] & 0xff]; |
duke@435 | 234 | return sum; |
duke@435 | 235 | } |
duke@435 | 236 | |
duke@435 | 237 | #ifndef PRODUCT |
duke@435 | 238 | //------------------------------print------------------------------------------ |
duke@435 | 239 | void RegMask::dump( ) const { |
duke@435 | 240 | tty->print("["); |
duke@435 | 241 | RegMask rm = *this; // Structure copy into local temp |
duke@435 | 242 | |
duke@435 | 243 | OptoReg::Name start = rm.find_first_elem(); // Get a register |
duke@435 | 244 | if( OptoReg::is_valid(start) ) { // Check for empty mask |
duke@435 | 245 | rm.Remove(start); // Yank from mask |
duke@435 | 246 | OptoReg::dump(start); // Print register |
duke@435 | 247 | OptoReg::Name last = start; |
duke@435 | 248 | |
duke@435 | 249 | // Now I have printed an initial register. |
duke@435 | 250 | // Print adjacent registers as "rX-rZ" instead of "rX,rY,rZ". |
duke@435 | 251 | // Begin looping over the remaining registers. |
duke@435 | 252 | while( 1 ) { // |
duke@435 | 253 | OptoReg::Name reg = rm.find_first_elem(); // Get a register |
duke@435 | 254 | if( !OptoReg::is_valid(reg) ) |
duke@435 | 255 | break; // Empty mask, end loop |
duke@435 | 256 | rm.Remove(reg); // Yank from mask |
duke@435 | 257 | |
duke@435 | 258 | if( last+1 == reg ) { // See if they are adjacent |
duke@435 | 259 | // Adjacent registers just collect into long runs, no printing. |
duke@435 | 260 | last = reg; |
duke@435 | 261 | } else { // Ending some kind of run |
duke@435 | 262 | if( start == last ) { // 1-register run; no special printing |
duke@435 | 263 | } else if( start+1 == last ) { |
duke@435 | 264 | tty->print(","); // 2-register run; print as "rX,rY" |
duke@435 | 265 | OptoReg::dump(last); |
duke@435 | 266 | } else { // Multi-register run; print as "rX-rZ" |
duke@435 | 267 | tty->print("-"); |
duke@435 | 268 | OptoReg::dump(last); |
duke@435 | 269 | } |
duke@435 | 270 | tty->print(","); // Seperate start of new run |
duke@435 | 271 | start = last = reg; // Start a new register run |
duke@435 | 272 | OptoReg::dump(start); // Print register |
duke@435 | 273 | } // End of if ending a register run or not |
duke@435 | 274 | } // End of while regmask not empty |
duke@435 | 275 | |
duke@435 | 276 | if( start == last ) { // 1-register run; no special printing |
duke@435 | 277 | } else if( start+1 == last ) { |
duke@435 | 278 | tty->print(","); // 2-register run; print as "rX,rY" |
duke@435 | 279 | OptoReg::dump(last); |
duke@435 | 280 | } else { // Multi-register run; print as "rX-rZ" |
duke@435 | 281 | tty->print("-"); |
duke@435 | 282 | OptoReg::dump(last); |
duke@435 | 283 | } |
duke@435 | 284 | if( rm.is_AllStack() ) tty->print("..."); |
duke@435 | 285 | } |
duke@435 | 286 | tty->print("]"); |
duke@435 | 287 | } |
duke@435 | 288 | #endif |