Home | History | Annotate | Download | only in x86

Lines Matching defs:shift

525 void X86Mir2Lir::CalculateMagicAndShift(int64_t divisor, int64_t& magic, int& shift, bool is_long) {
526 // It does not make sense to calculate magic and shift for zero divisor.
531 * The magic number M and shift S can be calculated in the following way:
540 * So the shift p is the smallest p satisfying
549 * the shift number S.
593 shift = (is_long) ? p - 64 : p - 32;
653 int shift;
654 CalculateMagicAndShift((int64_t)imm, magic, shift, false /* is_long */);
709 // Do we need the shift?
710 if (shift != 0) {
711 // Shift EDX by 'shift' bits.
712 NewLIR2(kX86Sar32RI, rs_r2.GetReg(), shift);
1838 int shift;
1839 CalculateMagicAndShift(imm, magic, shift, true /* is_long */);
1884 // Do we need the shift?
1885 if (shift != 0) {
1886 // Shift RDX by 'shift' bits.
1887 OpRegImm(kOpAsr, rs_r2q, shift);
2252 // Per spec, we only care about low 6 bits of shift amount.