Lines Matching refs:step
495 static WEBP_INLINE void do_filter2(uint8_t* p, int step) {
496 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
500 p[-step] = clip1[255 + p0 + a2];
505 static WEBP_INLINE void do_filter4(uint8_t* p, int step) {
506 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
511 p[-2*step] = clip1[255 + p1 + a3];
512 p[- step] = clip1[255 + p0 + a2];
514 p[ step] = clip1[255 + q1 - a3];
518 static WEBP_INLINE void do_filter6(uint8_t* p, int step) {
519 const int p2 = p[-3*step], p1 = p[-2*step], p0 = p[-step];
520 const int q0 = p[0], q1 = p[step], q2 = p[2*step];
525 p[-3*step] = clip1[255 + p2 + a3];
526 p[-2*step] = clip1[255 + p1 + a2];
527 p[- step] = clip1[255 + p0 + a1];
529 p[ step] = clip1[255 + q1 - a2];
530 p[ 2*step] = clip1[255 + q2 - a3];
533 static WEBP_INLINE int hev(const uint8_t* p, int step, int thresh) {
534 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
538 static WEBP_INLINE int needs_filter(const uint8_t* p, int step, int thresh) {
539 step], p0 = p[-step], q0 = p[0], q1 = p[step];
544 int step, int t, int it) {
545 const int p3 = p[-4*step], p2 = p[-3*step], p1 = p[-2*step], p0 = p[-step];
546 const int q0 = p[0], q1 = p[step], q2 = p[2*step], q3 = p[3*step];
