Lines Matching refs:steps
95 for(i = 0; i < pmsMaxStates; i++) pmsCtls.pmsDefs[i] = &pmsDummy; /* Initialize the table to dummy steps */
246 * Delayed steps are a step down for accounting purposes.
327 * See if we are done chaining steps
371 for(i = 0; i < pmsMaxStates; i++) { /* Step through the steps and clear the statistics since we were parked */
575 uint32_t setf, steps, i, nstps;
585 steps = pdsize / sizeof(pmsDef); /* Get the number of steps supplied */
587 if((steps >= pmsMaxStates) || (steps < pmsFree)) /* Complain if too big or too small */
595 for(i = 0; i < steps; i++) { /* Step through and verify the definitions */
621 if((pd[i].pmsDown != pmsParked) && pd[i].pmsDown >= steps) {
626 if((pd[i].pmsNext != pmsParked) && pd[i].pmsNext >= steps) {
631 if((pd[i].pmsSetCmd == pmsDelay) && (pd[i].pmsTDelay >= steps)) {
648 for(i = 0; i < steps; i++) { /* Start with each step. Inefficient, but who cares */
654 if(pd[cstp].pmsSetCmd == pmsDelay) break; /* Delayed steps always terminate a chain so no endless loop here */
660 if(nstps >= steps) { /* We've stepped for more steps than we have, must be an endless loop! */
680 newsize = steps * sizeof(pmsDef); /* Get the size needed for the definition blocks */
713 for(i = 0; i < steps; i++) { /* Replace the step table entries */