Lines Matching defs:shift
1813 int shift = 31 - (int)c;
1819 u = _approximate_isqrt(m << 2*shift) >> shift;
1917 * computed separately, and then combined using a left shift.
3406 comb_odd_part << shift
3408 where 2**shift is the largest power of two dividing comb(n, k)
3409 and comb_odd_part is comb(n, k) >> shift. comb_odd_part can be
3416 int shift = factorial_trailing_zeros[n]
3419 return PyLong_FromUnsignedLongLong(comb_odd_part << shift);
3452 int shift = factorial_trailing_zeros[n]
3454 return PyLong_FromUnsignedLongLong(perm_odd_part << shift);