152   while (p->remL + p->L * num_in >= f->dft_length) {  in dft_stage_fn()
153     div_t divd = div(f->dft_length - overlap - p->remL + p->L - 1, p->L);  in dft_stage_fn()
158     output = fifo_reserve(output_fifo, f->dft_length);  in dft_stage_fn()
160       int portion = f->dft_length / p->L;  in dft_stage_fn()
169       for (portion <<= 1; i < f->dft_length; i += portion, portion <<= 1) {  in dft_stage_fn()
175         memcpy(output, input, f->dft_length * sizeof(*output));  in dft_stage_fn()
177         memset(output, 0, f->dft_length * sizeof(*output));  in dft_stage_fn()
178         for (j = 0, i = p->remL; i < f->dft_length; ++j, i += p->L)  in dft_stage_fn()
182       lsx_safe_rdft(f->dft_length, 1, output);  in dft_stage_fn()
187       for (i = 2; i < f->dft_length; i += 2) {  in dft_stage_fn()
192       lsx_safe_rdft(f->dft_length, -1, output);  in dft_stage_fn()
194         for (j = 0, i = p->remM; i < f->dft_length - overlap; ++j,  in dft_stage_fn()
197         p->remM = i - (f->dft_length - overlap);  in dft_stage_fn()
198         fifo_trim_by(output_fifo, f->dft_length - j);  in dft_stage_fn()
204       for (i = 2; i < (f->dft_length >> m); i += 2) {  in dft_stage_fn()
210       lsx_safe_rdft(f->dft_length >> m, -1, output);  in dft_stage_fn()
211       fifo_trim_by(output_fifo, (((1 << m) - 1) * f->dft_length + overlap) >>m);  in dft_stage_fn()
223     int num_taps = 0, dft_length, i;  in dft_stage_init()  local
231     dft_length = lsx_set_dft_length(num_taps);  in dft_stage_init()
232     f->coefs = calloc(dft_length, sizeof(*f->coefs));  in dft_stage_init()
234       f->coefs[(i + dft_length - num_taps + 1) & (dft_length - 1)]  in dft_stage_init()
235         = h[i] / dft_length * 2 * L;  in dft_stage_init()
238     f->dft_length = dft_length;  in dft_stage_init()
239     lsx_safe_rdft(dft_length, 1, f->coefs);  in dft_stage_init()
241         num_taps, dft_length, Fp, Fs, Fn, att, L, M);  in dft_stage_init()