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