Lines Matching full:curstep
453 int k, YC, PL, PR, dir, curstep;
480 curstep = dir * step;
505 if( !mask[i] && DIFF_INT_C1( img + i, img - curstep + i ))
514 (DIFF_INT_C1( img + i, img + i - curstep) && i <= R)))
528 DIFF_INT_C1( val, img - curstep + (i-1))) ||
530 DIFF_INT_C1( val, img - curstep + i )) ||
532 DIFF_INT_C1( val, img - curstep + (i+1) ))))
543 DIFF_INT_C1( val, img - curstep + (i-1) ))) ||
545 DIFF_INT_C1( val, img - curstep + i )) ||
547 DIFF_INT_C1( val, img - curstep + (i+1) ))))
568 curstep = dir * step;
593 if( !mask[i] && DIFF_INT_C3( img + i*3, img - curstep + i*3 ))
602 (DIFF_INT_C3( img + i*3, img + i*3 - curstep) && i <= R)))
616 DIFF_INT_C3( val, img - curstep + (i-1)*3 )) ||
618 DIFF_INT_C3( val, img - curstep + i*3 )) ||
620 DIFF_INT_C3( val, img - curstep + (i+1)*3 ))))
631 DIFF_INT_C3( val, img - curstep + (i-1)*3 ))) ||
633 DIFF_INT_C3( val, img - curstep + i*3 )) ||
635 DIFF_INT_C3( val, img - curstep + (i+1)*3 ))))
759 int k, YC, PL, PR, dir, curstep;
786 curstep = dir * step;
811 if( !mask[i] && DIFF_FLT_C1( img + i, img - curstep + i ))
820 (DIFF_FLT_C1( img + i, img + i - curstep) && i <= R)))
835 DIFF_FLT_C1( val, img - curstep + (i-1) )) ||
837 DIFF_FLT_C1( val, img - curstep + i )) ||
839 DIFF_FLT_C1( val, img - curstep + (i+1) ))))
850 DIFF_FLT_C1( val, img - curstep + (i-1) ))) ||
852 DIFF_FLT_C1( val, img - curstep + i )) ||
854 DIFF_FLT_C1( val, img - curstep + (i+1) ))))
875 curstep = dir * step;
900 if( !mask[i] && DIFF_FLT_C3( img + i*3, img - curstep + i*3 ))
909 (DIFF_FLT_C3( img + i*3, img + i*3 - curstep) && i <= R)))
924 DIFF_FLT_C3( val, img - curstep + (i-1)*3 )) ||
926 DIFF_FLT_C3( val, img - curstep + i*3 )) ||
928 DIFF_FLT_C3( val, img - curstep + (i+1)*3 ))))
939 DIFF_FLT_C3( val, img - curstep + (i-1)*3 ))) ||
941 DIFF_FLT_C3( val, img - curstep + i*3 )) ||
943 DIFF_FLT_C3( val, img - curstep + (i+1)*3 ))))
