Lines Matching defs:step

134     step = step size (Word16)
181 Word16 step, // i : stepsize
236 for (i3 = ipos[3]; i3 < L_CODE; i3 += step)
238 s = L_mult (rr[i3][i3], _1_8); // index incr= step+L_CODE
239 s = L_mac (s, rr[i0][i3], _1_4); // index increment = step
240 s = L_mac (s, rr[i1][i3], _1_4); // index increment = step
251 for (i2 = ipos[2]; i2 < L_CODE; i2 += step)
253 // index increment = step
256 // index incr= step+L_CODE
259 // index increment = step
262 // index increment = step
265 for (i3 = ipos[3]; i3 < L_CODE; i3 += step)
267 // index increment = step
270 // index increment = step
273 // index increment = step
302 for (i5 = ipos[5]; i5 < L_CODE; i5 += step)
319 for (i4 = ipos[4]; i4 < L_CODE; i4 += step)
329 for (i5 = ipos[5]; i5 < L_CODE; i5 += step)
362 for (i7 = ipos[7]; i7 < L_CODE; i7 += step)
381 for (i6 = ipos[6]; i6 < L_CODE; i6 += step)
393 for (i7 = ipos[7]; i7 < L_CODE; i7 += step)
430 for (i9 = ipos[9]; i9 < L_CODE; i9 += step)
451 for (i8 = ipos[8]; i8 < L_CODE; i8 += step)
465 for (i9 = ipos[9]; i9 < L_CODE; i9 += step)
558 Word16 step, /* i : stepsize */
638 for (i3 = ipos[3]; i3 < L_CODE; i3 += step)
657 for (j = ipos[2]; j < L_CODE; j += step)
659 /* index increment = step */
672 for (i3 = ipos[3]; i3 < L_CODE; i3 += step)
674 /* index increment = step */
704 for (i5 = ipos[5]; i5 < L_CODE; i5 += step)
724 for (j = ipos[4]; j < L_CODE; j += step)
747 for (i5 = ipos[5]; i5 < L_CODE; i5 += step)
780 for (i7 = ipos[7]; i7 < L_CODE; i7 += step)
801 for (j = ipos[6]; j < L_CODE; j += step)
832 for (i7 = ipos[7]; i7 < L_CODE; i7 += step)
871 for (i9 = ipos[9]; i9 < L_CODE; i9 += step)
894 for (j = ipos[8]; j < L_CODE; j += step)
929 for (i9 = ipos[9]; i9 < L_CODE; i9 += step)