Lines Matching defs:steps
753 int steps;
769 steps = icvFindLoop( state );
771 if( steps == 0 )
775 for( i = 1; i < steps; i += 2 )
787 for( i = 0; i < steps; i += 2 )
835 int i, steps = 1;
845 steps = 1;
849 if( (steps & 1) == 1 )
869 loop[steps++] = new_x;
877 i = steps & 1;
878 new_x = loop[steps - 1];
887 is_used[loop[--steps] - _x] = 0;
890 while( new_x == 0 && steps > 0 );
892 is_used[loop[steps - 1] - _x] = 0;
893 loop[steps - 1] = new_x;
897 while( steps > 0 );
899 return steps;