Lines Matching defs:bits
9 #include "src/base/bits.h"
309 // no bits are set, and cc is eq, it will branch to done
316 // no bits are set, and cc is eq, it will branch to done
1296 // bits,
1297 // second word in high bits.
1751 if ((regs.bits() & (1 << i)) != 0) {
1762 if ((regs.bits() & (1 << i)) != 0) {
2018 // if src is NaN/+-Infinity/+-Zero or if the exponent is larger than # of bits
2072 // (i.e., 23 or 52-bits) falls into this path, the value range of the input
2111 // if src is NaN/+-Infinity/+-Zero or if the exponent is larger than # of bits
2627 // Convert trailing zeroes to trailing ones, and bits to their left
2651 // Convert trailing zeroes to trailing ones, and bits to their left
2688 // bits are set but the algorithm here attempts to minimize the total
2689 // number of instructions executed even when a large number of bits
2886 int32_t TurboAssembler::GetOffset(int32_t offset, Label* L, OffsetSize bits) {
2888 offset = branch_offset_helper(L, bits);
2890 DCHECK(is_intn(offset, bits));
2909 OffsetSize bits) {
2910 if (!is_near(L, bits)) return false;
2911 *offset = GetOffset(*offset, L, bits);
2915 bool TurboAssembler::CalculateOffset(Label* L, int32_t* offset, OffsetSize bits,
2917 if (!is_near(L, bits)) return false;
2919 *offset = GetOffset(*offset, L, bits);
4410 if (kCallerSavedFPU.bits() & (1 << i)) {
4424 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
4451 if (kCalleeSavedFPU.bits() & (1 << i)) {
4520 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
4822 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
4874 DCHECK(base::bits::IsPowerOfTwo(frame_alignment));
5100 // Corrupt the top 32 bits. Made up of 16 fixed bits and 16 pc offset bits.