Lines Matching defs:bits
9 #include "src/base/bits.h"
1298 // bits,
1299 // second word in high bits.
1609 } else if (base::bits::IsPowerOfTwo(value + 1) ||
1613 int shift_cnt = base::bits::CountTrailingZeros64(value);
1625 shift_cnt = 16 + base::bits::CountTrailingZeros64(value >> 16);
1692 // least significant 32-bits, and a signed 16-bit value in its
1693 // most significant 32-bits.
1699 // least significant 48-bits, and a signed 16-bit value in its
1700 // most significant 16-bits.
1716 // 32-bit number, and the middle 16 bits are all zero, or all one.
1734 } else if (base::bits::IsPowerOfTwo(j.immediate() + 1) ||
1738 int shift_cnt = 64 - base::bits::CountTrailingZeros64(j.immediate() + 1);
1746 int shift_cnt = base::bits::CountTrailingZeros64(j.immediate());
1785 shift_cnt = 16 + base::bits::CountTrailingZeros64(j.immediate() >> 16);
1925 if ((regs.bits() & (1 << i)) != 0) {
1936 if ((regs.bits() & (1 << i)) != 0) {
1950 if ((regs.bits() & (1 << i)) != 0) {
1961 if ((regs.bits() & (1 << i)) != 0) {
1975 if ((regs.bits() & (1 << i)) != 0) {
1986 if ((regs.bits() & (1 << i)) != 0) {
3175 // Start by flipping the bits end-for-end so we can count the number of
3182 // Convert trailing zeroes to trailing ones, and bits to their left
3201 // Start by flipping the bits end-for-end so we can count the number of
3208 // Convert trailing zeroes to trailing ones, and bits to their left
3245 // bits are set but the algorithm here attempts to minimize the total
3246 // number of instructions executed even when a large number of bits
3465 int32_t TurboAssembler::GetOffset(int32_t offset, Label* L, OffsetSize bits) {
3467 offset = branch_offset_helper(L, bits) >> 2;
3469 DCHECK(is_intn(offset, bits));
3488 OffsetSize bits) {
3489 if (!is_near(L, bits)) return false;
3490 *offset = GetOffset(*offset, L, bits);
3494 bool TurboAssembler::CalculateOffset(Label* L, int32_t* offset, OffsetSize bits,
3496 if (!is_near(L, bits)) return false;
3498 *offset = GetOffset(*offset, L, bits);
3976 OffsetSize bits = OffsetSize::kOffset16;
3986 if (!is_near(L, bits)) return false;
3988 offset = GetOffset(offset, L, bits);
3992 if (!is_near(L, bits)) return false;
3994 offset = GetOffset(offset, L, bits);
4011 if (!is_near(L, bits)) return false;
4013 offset = GetOffset(offset, L, bits);
4030 if (!is_near(L, bits)) return false;
4032 offset = GetOffset(offset, L, bits);
4048 if (!is_near(L, bits)) return false;
4050 offset = GetOffset(offset, L, bits);
4067 if (!is_near(L, bits)) return false;
4069 offset = GetOffset(offset, L, bits);
4077 if (!is_near(L, bits)) return false;
4079 offset = GetOffset(offset, L, bits);
4084 if (!is_near(L, bits)) return false;
4086 offset = GetOffset(offset, L, bits);
4091 if (!is_near(L, bits)) return false;
4093 offset = GetOffset(offset, L, bits);
4098 if (!is_near(L, bits)) return false;
4100 offset = GetOffset(offset, L, bits);
5432 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
5523 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
5932 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
5985 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));