41         sox_sample_t  step;      /* step size */  member
51 /* these are step-size adjust factors, where
84         sox_sample_t step;  in AdpcmDecode()  local
86         /** Compute next step value **/  in AdpcmDecode()
87         step = state->step;  in AdpcmDecode()
90                 nstep = (stepAdjustTable[c] * step) >> 8;  in AdpcmDecode()
91                 state->step = (nstep < 16)? 16:nstep;  in AdpcmDecode()
98         /** then add the code*step adjustment **/  in AdpcmDecode()
100         sample = (c * step) + vlin;  in AdpcmDecode()
137     lsbshortldi(state[ch].step, ip);  in lsx_ms_adpcm_block_expand_i()
177         int *iostep,         /* input/output step, REQUIRE 16 <= *st <= 0x7fff */  in AdpcmMashS()
184         int d, v0, v1, step;  in AdpcmMashS()  local
196         step = *iostep;  in AdpcmMashS()
202                 op[0] = step; op[1] = step>>8;  in AdpcmMashS()
216                 dp = d3 + (step<<3) + (step>>1);  in AdpcmMashS()
219                         c = dp/step;  in AdpcmMashS()
223                 dp = c * step;   /* quantized estimate of samp - vlin */  in AdpcmMashS()
241                 /* Update the step for the next sample */  in AdpcmMashS()
242                 step = (stepAdjustTable[c] * step) >> 8;  in AdpcmMashS()
243                 if (step < 16) step = 16;  in AdpcmMashS()
248         lsx_debug_more("ch%d: st %d->%d, d %.1f\n", ch, *iostep, step, sqrt(d2));  in AdpcmMashS()
249         *iostep = step;  in AdpcmMashS()
273          * beginning with last step-value, and with slightly  in AdpcmMashChannel()
274          * forward-adjusted step-value, taking best of the 14  in AdpcmMashChannel()
279 …          d0=AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[k], ip, n, &ss, NULL); /* with step s0 */  in AdpcmMashChannel()
285 …          d1=AdpcmMashS(ch, chans, v, lsx_ms_adpcm_i_coef[k], ip, n, &ss, NULL); /* with step s1 */  in AdpcmMashChannel()