Lines Matching defs:bits
1846 // bits: aBbb.bbbc.defg.h000.0000.0000.0000.0000
1847 uint32_t bits = float_to_rawbits(imm);
1849 uint32_t bit7 = ((bits >> 31) & 0x1) << 7;
1851 uint32_t bit6 = ((bits >> 29) & 0x1) << 6;
1853 uint32_t bit5_to_0 = (bits >> 19) & 0x3f;
1861 // bits: aBbb.bbbb.bbcd.efgh.0000.0000.0000.0000
1863 uint64_t bits = double_to_rawbits(imm);
1865 uint32_t bit7 = ((bits >> 63) & 0x1) << 7;
1867 uint32_t bit6 = ((bits >> 61) & 0x1) << 6;
1869 uint32_t bit5_to_0 = (bits >> 48) & 0x3f;
2145 // Bits extracted are high_bit:0.
2147 // Number of bits left in the result that are not introduced by the shift.
2168 // No need to extend as the extended bits would be shifted away.
2295 // (s bits must not be all set)
2297 // A pattern is constructed of size bits, where the least significant S+1
2298 // bits are set. The pattern is rotated right by R, and repeated across a
2305 // support 64-bit immediates where the top 32-bits are zero, and the bottom
2306 // 32-bits are an encodable logical immediate.
2308 // 1. If the value has all set or all clear bits, it can't be encoded.
2320 // The fixed bits in the immediate s field.
2328 // 2. If the value is two bits wide, it can be encoded.
2344 // 3. If the sum of leading zeros, trailing zeros and set bits is equal to
2350 // 4. If the sum of leading ones, trailing ones and unset bits in the
2381 uint32_t bits = float_to_rawbits(imm);
2382 // bits[19..0] are cleared.
2383 if ((bits & 0x7ffff) != 0) {
2387 // bits[29..25] are all set or all cleared.
2388 uint32_t b_pattern = (bits >> 16) & 0x3e00;
2394 if (((bits ^ (bits << 1)) & 0x40000000) == 0) {
2406 uint64_t bits = double_to_rawbits(imm);
2407 // bits[47..0] are cleared.
2408 if ((bits & 0xffffffffffffL) != 0) {
2412 // bits[61..54] are all set or all cleared.
2413 uint32_t b_pattern = (bits >> 48) & 0x3fc0;
2419 if (((bits ^ (bits << 1)) & 0x4000000000000000L) == 0) {
2613 // TODO(all): currently each relocated constant is 64 bits, consider adding
