Lines Matching defs:input
93 // {result} := ({input} << shift) mod F_n, where shift >= K.
94 void ShiftModFn_Large(digit_t* result, const digit_t* input, int digit_shift,
106 // input = [ iK ][iK-1] .... .... [ i1 ][ i0 ]
116 result[i] = digit_add2(input[i + K - digit_shift], carry, &carry);
118 result[digit_shift] = digit_sub(input[K] + carry, input[0], &borrow);
120 digit_t d = input[i - digit_shift];
126 input[K - digit_shift - 1] >> (kDigitBits - bits_shift);
128 digit_t d = input[i + K - digit_shift];
135 digit_t d = input[K];
142 d = input[0];
147 d = input[1];
155 digit_t d = input[i - digit_shift];
179 // Sets {result} := {input} * 2^{power_of_two} mod 2^{K} + 1.
181 void ShiftModFn(digit_t* result, const digit_t* input, int power_of_two, int K,
185 // input = [ iK ][iK-1] .... .... [ i1 ][ i0 ]
196 return ShiftModFn_Large(result, input, digit_shift, bits_shift, K);
200 // We do a single pass over {input}, starting by copying digits [i1] to
203 // Read input digits unless we know they are zero.
206 result[i + digit_shift] = input[i];
208 // Any remaining work can hard-code the knowledge that input[i] == 0.
210 DCHECK(input[i] == 0);
213 // Second phase: subtract input digits [iX] to [iK] from (virtually) zero-
217 digit_t d = input[i];
220 // Any remaining work can hard-code the knowledge that input[i] == 0.
222 DCHECK(input[i] == 0);
226 result[digit_shift] = digit_sub2(input[0], input[K], borrow, &borrow);
232 // Read input digits unless we know they are zero.
235 digit_t d = input[i];
239 // Any remaining work can hard-code the knowledge that input[i] == 0.
241 DCHECK(input[i] == 0);
248 digit_t d = input[i];
253 // Any remaining work can hard-code the knowledge that input[i] == 0.
255 DCHECK(input[i] == 0);
261 DCHECK(input[i] == 0);
265 digit_t d = input[K];
399 // Decides what parameters to use for a given input bit length {N}.
562 // need as input for the "DIT" aka "decimation in time" backwards transform.
588 // turns bit-reversed input into normally sorted output.
658 digit_t* input = part_[k];
659 ShiftModFn(temp_, input, shift, K_);
662 // Subtract F_n from input before adding to result. We use the following