Lines Matching refs:step
489 static inline void do_filter2(uint8_t* p, int step) {
490 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
494 p[-step] = clip1[255 + p0 + a2];
499 static inline void do_filter4(uint8_t* p, int step) {
500 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
505 p[-2*step] = clip1[255 + p1 + a3];
506 p[- step] = clip1[255 + p0 + a2];
508 p[ step] = clip1[255 + q1 - a3];
512 static inline void do_filter6(uint8_t* p, int step) {
513 const int p2 = p[-3*step], p1 = p[-2*step], p0 = p[-step];
514 const int q0 = p[0], q1 = p[step], q2 = p[2*step];
519 p[-3*step] = clip1[255 + p2 + a3];
520 p[-2*step] = clip1[255 + p1 + a2];
521 p[- step] = clip1[255 + p0 + a1];
523 p[ step] = clip1[255 + q1 - a2];
524 p[ 2*step] = clip1[255 + q2 - a3];
527 static inline int hev(const uint8_t* p, int step, int thresh) {
528 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
532 static inline int needs_filter(const uint8_t* p, int step, int thresh) {
533 const int p1 = p[-2*step], p0 = p[-step], q0 = p[0], q1 = p[step];
537 static inline int needs_filter2(const uint8_t* p, int step, int t, int it) {
538 const int p3 = p[-4*step], p2 = p[-3*step], p1 = p[-2*step], p0 = p[-step];
539 const int q0 = p[0], q1 = p[step], q2 = p[2*step], q3 = p[3*step];