264 #define have_arb_stage  (arbM  * arbL  != 1)
297   int n = 0, i, preL = 1, preM = 1, shift = 0, arbL = 1, postL = 1, postM = 1;  in rate_init()  local
326         else arbM = i * (int)arbM + try, arbL = i;  in rate_init()
329     L = preL * arbL, M = arbM * postM, x = (L|M)&1, L >>= !x, M >>= !x;  in rate_init()
330     if (iOpt && postL == 1 && (d = preL * arbL / arbM) > 4 && d != 5) {  in rate_init()
332       arbM = arbM * postL / arbL / preL, arbL = 1, n = 0;  in rate_init()
334       preL = L, preM = M, arbM = arbL = postM = 1;  in rate_init()
372         arbM / arbL, att, phase, &pre_stage, preL, max(preM, 1));  in rate_init()
380     arb_stage.out_in_ratio = MULT32 * arbL / arb_stage.step.all;  in rate_init()
385     double x = .5, at, Fp, Fs, Fn, mult = upsample? 1 : arbL / arbM;  in rate_init()
388     Fn = !upsample && preM? x = arbM / arbL : 1;  in rate_init()
402         arbM /= arbL, arbL = 1, rational = sox_false;  in rate_init()
404       phases = !rational? (1 << phase_bits) : arbL;  in rate_init()
410       if ((num_coefs & 1) && rational && (arbL & 1))  in rate_init()
411         phases <<= 1, arbL <<= 1, arbM *= 2;  in rate_init()
412       at = arbL * .5 * (num_coefs & 1);  in rate_init()
433     arb_stage.L = arbL;  in rate_init()
438       arb_stage.out_in_ratio = arbL / arb_stage.step.hi_prec_clock;  in rate_init()
442       arb_stage.out_in_ratio = MULT32 * arbL / arb_stage.step.all;  in rate_init()