duke@435: /*
duke@435:  * Copyright 1997-2006 Sun Microsystems, Inc.  All Rights Reserved.
duke@435:  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
duke@435:  *
duke@435:  * This code is free software; you can redistribute it and/or modify it
duke@435:  * under the terms of the GNU General Public License version 2 only, as
duke@435:  * published by the Free Software Foundation.
duke@435:  *
duke@435:  * This code is distributed in the hope that it will be useful, but WITHOUT
duke@435:  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
duke@435:  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
duke@435:  * version 2 for more details (a copy is included in the LICENSE file that
duke@435:  * accompanied this code).
duke@435:  *
duke@435:  * You should have received a copy of the GNU General Public License version
duke@435:  * 2 along with this work; if not, write to the Free Software Foundation,
duke@435:  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
duke@435:  *
duke@435:  * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
duke@435:  * CA 95054 USA or visit www.sun.com if you need additional information or
duke@435:  * have any questions.
duke@435:  *
duke@435:  */
duke@435: 
duke@435: #include "incls/_precompiled.incl"
duke@435: #include "incls/_regmask.cpp.incl"
duke@435: 
duke@435: #define RM_SIZE _RM_SIZE /* a constant private to the class RegMask */
duke@435: 
duke@435: //-------------Non-zero bit search methods used by RegMask---------------------
duke@435: // Find lowest 1, or return 32 if empty
duke@435: int find_lowest_bit( uint32 mask ) {
duke@435:   int n = 0;
duke@435:   if( (mask & 0xffff) == 0 ) {
duke@435:     mask >>= 16;
duke@435:     n += 16;
duke@435:   }
duke@435:   if( (mask & 0xff) == 0 ) {
duke@435:     mask >>= 8;
duke@435:     n += 8;
duke@435:   }
duke@435:   if( (mask & 0xf) == 0 ) {
duke@435:     mask >>= 4;
duke@435:     n += 4;
duke@435:   }
duke@435:   if( (mask & 0x3) == 0 ) {
duke@435:     mask >>= 2;
duke@435:     n += 2;
duke@435:   }
duke@435:   if( (mask & 0x1) == 0 ) {
duke@435:     mask >>= 1;
duke@435:      n += 1;
duke@435:   }
duke@435:   if( mask == 0 ) {
duke@435:     n = 32;
duke@435:   }
duke@435:   return n;
duke@435: }
duke@435: 
duke@435: // Find highest 1, or return 32 if empty
duke@435: int find_hihghest_bit( uint32 mask ) {
duke@435:   int n = 0;
duke@435:   if( mask > 0xffff ) {
duke@435:     mask >>= 16;
duke@435:     n += 16;
duke@435:   }
duke@435:   if( mask > 0xff ) {
duke@435:     mask >>= 8;
duke@435:     n += 8;
duke@435:   }
duke@435:   if( mask > 0xf ) {
duke@435:     mask >>= 4;
duke@435:     n += 4;
duke@435:   }
duke@435:   if( mask > 0x3 ) {
duke@435:     mask >>= 2;
duke@435:     n += 2;
duke@435:   }
duke@435:   if( mask > 0x1 ) {
duke@435:     mask >>= 1;
duke@435:     n += 1;
duke@435:   }
duke@435:   if( mask == 0 ) {
duke@435:     n = 32;
duke@435:   }
duke@435:   return n;
duke@435: }
duke@435: 
duke@435: //------------------------------dump-------------------------------------------
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: void OptoReg::dump( int r ) {
duke@435:   switch( r ) {
duke@435:   case Special: tty->print("r---");   break;
duke@435:   case Bad:     tty->print("rBAD");   break;
duke@435:   default:
duke@435:     if( r < _last_Mach_Reg ) tty->print(Matcher::regName[r]);
duke@435:     else tty->print("rS%d",r);
duke@435:     break;
duke@435:   }
duke@435: }
duke@435: #endif
duke@435: 
duke@435: 
duke@435: //=============================================================================
duke@435: const RegMask RegMask::Empty(
duke@435: # define BODY(I) 0,
duke@435:   FORALL_BODY
duke@435: # undef BODY
duke@435:   0
duke@435: );
duke@435: 
duke@435: //------------------------------find_first_pair--------------------------------
duke@435: // Find the lowest-numbered register pair in the mask.  Return the
duke@435: // HIGHEST register number in the pair, or BAD if no pairs.
duke@435: OptoReg::Name RegMask::find_first_pair() const {
duke@435:   VerifyPairs();
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     if( _A[i] ) {               // Found some bits
duke@435:       int bit = _A[i] & -_A[i]; // Extract low bit
duke@435:       // Convert to bit number, return hi bit in pair
duke@435:       return OptoReg::Name((i<<_LogWordBits)+find_lowest_bit(bit)+1);
duke@435:     }
duke@435:   }
duke@435:   return OptoReg::Bad;
duke@435: }
duke@435: 
duke@435: //------------------------------ClearToPairs-----------------------------------
duke@435: // Clear out partial bits; leave only bit pairs
duke@435: void RegMask::ClearToPairs() {
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     int bits = _A[i];
duke@435:     bits &= ((bits & 0x55555555)<<1); // 1 hi-bit set for each pair
duke@435:     bits |= (bits>>1);          // Smear 1 hi-bit into a pair
duke@435:     _A[i] = bits;
duke@435:   }
duke@435:   VerifyPairs();
duke@435: }
duke@435: 
duke@435: //------------------------------SmearToPairs-----------------------------------
duke@435: // Smear out partial bits; leave only bit pairs
duke@435: void RegMask::SmearToPairs() {
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     int bits = _A[i];
duke@435:     bits |= ((bits & 0x55555555)<<1); // Smear lo bit hi per pair
duke@435:     bits |= ((bits & 0xAAAAAAAA)>>1); // Smear hi bit lo per pair
duke@435:     _A[i] = bits;
duke@435:   }
duke@435:   VerifyPairs();
duke@435: }
duke@435: 
duke@435: //------------------------------is_aligned_pairs-------------------------------
duke@435: bool RegMask::is_aligned_Pairs() const {
duke@435:   // Assert that the register mask contains only bit pairs.
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     int bits = _A[i];
duke@435:     while( bits ) {             // Check bits for pairing
duke@435:       int bit = bits & -bits;   // Extract low bit
duke@435:       // Low bit is not odd means its mis-aligned.
duke@435:       if( (bit & 0x55555555) == 0 ) return false;
duke@435:       bits -= bit;              // Remove bit from mask
duke@435:       // Check for aligned adjacent bit
duke@435:       if( (bits & (bit<<1)) == 0 ) return false;
duke@435:       bits -= (bit<<1);         // Remove other halve of pair
duke@435:     }
duke@435:   }
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: //------------------------------is_bound1--------------------------------------
duke@435: // Return TRUE if the mask contains a single bit
duke@435: int RegMask::is_bound1() const {
duke@435:   if( is_AllStack() ) return false;
duke@435:   int bit = -1;                 // Set to hold the one bit allowed
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     if( _A[i] ) {               // Found some bits
duke@435:       if( bit != -1 ) return false; // Already had bits, so fail
duke@435:       bit = _A[i] & -_A[i];     // Extract 1 bit from mask
duke@435:       if( bit != _A[i] ) return false; // Found many bits, so fail
duke@435:     }
duke@435:   }
duke@435:   // True for both the empty mask and for a single bit
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: //------------------------------is_bound2--------------------------------------
duke@435: // Return TRUE if the mask contains an adjacent pair of bits and no other bits.
duke@435: int RegMask::is_bound2() const {
duke@435:   if( is_AllStack() ) return false;
duke@435: 
duke@435:   int bit = -1;                 // Set to hold the one bit allowed
duke@435:   for( int i = 0; i < RM_SIZE; i++ ) {
duke@435:     if( _A[i] ) {               // Found some bits
duke@435:       if( bit != -1 ) return false; // Already had bits, so fail
duke@435:       bit = _A[i] & -(_A[i]);   // Extract 1 bit from mask
duke@435:       if( (bit << 1) != 0 ) {   // Bit pair stays in same word?
duke@435:         if( (bit | (bit<<1)) != _A[i] )
duke@435:           return false;         // Require adjacent bit pair and no more bits
duke@435:       } else {                  // Else its a split-pair case
duke@435:         if( bit != _A[i] ) return false; // Found many bits, so fail
duke@435:         i++;                    // Skip iteration forward
duke@435:         if( _A[i] != 1 ) return false; // Require 1 lo bit in next word
duke@435:       }
duke@435:     }
duke@435:   }
duke@435:   // True for both the empty mask and for a bit pair
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: //------------------------------is_UP------------------------------------------
duke@435: // UP means register only, Register plus stack, or stack only is DOWN
duke@435: bool RegMask::is_UP() const {
duke@435:   // Quick common case check for DOWN (any stack slot is legal)
duke@435:   if( is_AllStack() )
duke@435:     return false;
duke@435:   // Slower check for any stack bits set (also DOWN)
duke@435:   if( overlap(Matcher::STACK_ONLY_mask) )
duke@435:     return false;
duke@435:   // Not DOWN, so must be UP
duke@435:   return true;
duke@435: }
duke@435: 
duke@435: //------------------------------Size-------------------------------------------
duke@435: // Compute size of register mask in bits
duke@435: uint RegMask::Size() const {
duke@435:   extern uint8 bitsInByte[256];
duke@435:   uint sum = 0;
duke@435:   for( int i = 0; i < RM_SIZE; i++ )
duke@435:     sum +=
duke@435:       bitsInByte[(_A[i]>>24) & 0xff] +
duke@435:       bitsInByte[(_A[i]>>16) & 0xff] +
duke@435:       bitsInByte[(_A[i]>> 8) & 0xff] +
duke@435:       bitsInByte[ _A[i]      & 0xff];
duke@435:   return sum;
duke@435: }
duke@435: 
duke@435: #ifndef PRODUCT
duke@435: //------------------------------print------------------------------------------
duke@435: void RegMask::dump( ) const {
duke@435:   tty->print("[");
duke@435:   RegMask rm = *this;           // Structure copy into local temp
duke@435: 
duke@435:   OptoReg::Name start = rm.find_first_elem(); // Get a register
duke@435:   if( OptoReg::is_valid(start) ) { // Check for empty mask
duke@435:     rm.Remove(start);           // Yank from mask
duke@435:     OptoReg::dump(start);       // Print register
duke@435:     OptoReg::Name last = start;
duke@435: 
duke@435:     // Now I have printed an initial register.
duke@435:     // Print adjacent registers as "rX-rZ" instead of "rX,rY,rZ".
duke@435:     // Begin looping over the remaining registers.
duke@435:     while( 1 ) {                //
duke@435:       OptoReg::Name reg = rm.find_first_elem(); // Get a register
duke@435:       if( !OptoReg::is_valid(reg) )
duke@435:         break;                  // Empty mask, end loop
duke@435:       rm.Remove(reg);           // Yank from mask
duke@435: 
duke@435:       if( last+1 == reg ) {     // See if they are adjacent
duke@435:         // Adjacent registers just collect into long runs, no printing.
duke@435:         last = reg;
duke@435:       } else {                  // Ending some kind of run
duke@435:         if( start == last ) {   // 1-register run; no special printing
duke@435:         } else if( start+1 == last ) {
duke@435:           tty->print(",");      // 2-register run; print as "rX,rY"
duke@435:           OptoReg::dump(last);
duke@435:         } else {                // Multi-register run; print as "rX-rZ"
duke@435:           tty->print("-");
duke@435:           OptoReg::dump(last);
duke@435:         }
duke@435:         tty->print(",");        // Seperate start of new run
duke@435:         start = last = reg;     // Start a new register run
duke@435:         OptoReg::dump(start); // Print register
duke@435:       } // End of if ending a register run or not
duke@435:     } // End of while regmask not empty
duke@435: 
duke@435:     if( start == last ) {       // 1-register run; no special printing
duke@435:     } else if( start+1 == last ) {
duke@435:       tty->print(",");          // 2-register run; print as "rX,rY"
duke@435:       OptoReg::dump(last);
duke@435:     } else {                    // Multi-register run; print as "rX-rZ"
duke@435:       tty->print("-");
duke@435:       OptoReg::dump(last);
duke@435:     }
duke@435:     if( rm.is_AllStack() ) tty->print("...");
duke@435:   }
duke@435:   tty->print("]");
duke@435: }
duke@435: #endif