Lines Matching refs:bits
161 if( _A[i] ) { // Found some bits
171 // Clear out partial bits; leave only bit pairs
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;
183 // Smear out partial bits; leave only bit pairs
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;
198 int bits = _A[i];
199 while( bits ) { // Check bits for pairing
200 int bit = bits & -bits; // Extract low bit
203 bits -= bit; // Remove bit from mask
205 if( (bits & (bit<<1)) == 0 ) return false;
206 bits -= (bit<<1); // Remove other halve of pair
218 if( _A[i] ) { // Found some bits
219 if( bit != -1 ) return false; // Already had bits, so fail
221 if( bit != _A[i] ) return false; // Found many bits, so fail
229 // Return TRUE if the mask contains an adjacent pair of bits and no other bits.
235 if( _A[i] ) { // Found some bits
236 if( bit != -1 ) return false; // Already had bits, so fail
240 return false; // Require adjacent bit pair and no more bits
242 if( bit != _A[i] ) return false; // Found many bits, so fail
261 if (_A[i]) { // Found some bits
271 // Clear out partial bits; leave only aligned adjacent bit pairs
274 assert(2 <= size && size <= 8, "update low bits table");
278 int bits = _A[i];
279 int sets = (bits & low_bits_mask);
281 sets = (bits & (sets<<1)); // filter bits which produce whole sets
285 sets |= (sets>>2); // Smear 2 hi-bits into a set
287 sets |= (sets>>4); // Smear 4 hi-bits into a set
296 // Smear out partial bits to aligned adjacent bit sets
299 assert(2 <= size && size <= 8, "update low bits table");
303 int bits = _A[i];
306 sets |= (bits & low_bits_mask); // collect partial bits
307 bits = bits>>1;
311 sets |= (sets<<2); // Smear 2 lo-bits into a set
313 sets |= (sets<<4); // Smear 4 lo-bits into a set
324 assert(2 <= size && size <= 8, "update low bits table");
329 int bits = _A[i];
330 while (bits) { // Check bits for pairing
331 int bit = bits & -bits; // Extract low bit
337 // Check for aligned adjacent bits in this set
338 if ((bits & set) != set) return false;
339 bits -= set; // Remove this set
346 // Return TRUE if the mask contains one adjacent set of bits and no other bits.
350 assert(1 <= size && size <= 8, "update low bits table");
353 if (_A[i] ) { // Found some bits
355 return false; // Already had bits, so fail
361 return false; // Require adjacent bit set and no more bits
364 return false; // Found many bits, so fail
366 // The lower 24 bits should be 0 since it is split case and size <= 8.
371 return false; // Require expected low bits in next word
385 // Slower check for any stack bits set (also DOWN)
393 // Compute size of register mask in bits