Lines Matching defs:shift
93 // {result} := ({input} << shift) mod F_n, where shift >= K.
184 // with the shift as follows:
186 // result = [iX-1] .... [ i0 ] <---------- shift by {power_of_two}
511 // We pass theta as a shift amount; it really means 2^theta.
618 const int shift = n_ * omega - m;
621 ShiftModFn(temp_, part, shift, K_);
655 int shift = -theta * k - m;
656 if (shift < 0) shift += 2 * n_ * theta;
657 DCHECK(shift >= 0);
659 ShiftModFn(temp_, input, shift, K_);