264 #define have_arb_stage  (arbM  * arbL  != 1)
296   double arbM = factor, tbw_tighten = 1;  in rate_init()  local
314     upsample = arbM < 1;  in rate_init()
315     for (i = arbM * .5, shift = 0; i >>= 1; arbM *= .5, ++shift);  in rate_init()
316     preM = upsample || (arbM > 1.5 && arbM < 2);  in rate_init()
317     postM = 1 + (arbM > 1 && preM), arbM /= postM;  in rate_init()
318     preL = 1 + (!preM && arbM < 2) + (upsample && mode), arbM *= preL;  in rate_init()
319     if ((frac = arbM - (int)arbM))  in rate_init()
325           arbM = ceil(arbM), shift += arbM > 2, arbM /= 1 + (arbM > 2);  in rate_init()
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()
377     arb_stage.step.all = arbM * MULT32 + .5;  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()
411         phases <<= 1, arbL <<= 1, arbM *= 2;  in rate_init()
437       arb_stage.step.hi_prec_clock = arbM;  in rate_init()
441       arb_stage.step.all = arbM * MULT32 + .5;  in rate_init()