Lines Matching refs:step
30 static WEBP_INLINE void do_filter2(uint8_t* p, int step) {
31 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
35 p[-step] = VP8kclip1[p0 + a2];
40 static WEBP_INLINE void do_filter4(uint8_t* p, int step) {
41 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
46 p[-2 * step] = VP8kclip1[p1 + a3];
47 p[- step] = VP8kclip1[p0 + a2];
49 p[ step] = VP8kclip1[q1 - a3];
53 static WEBP_INLINE void do_filter6(uint8_t* p, int step) {
54 const int p2 = p[-3 * step], p1 = p[-2 * step], p0 = p[-step];
55 const int q0 = p[0], q1 = p[step], q2 = p[2 * step];
61 p[-3 * step] = VP8kclip1[p2 + a3];
62 p[-2 * step] = VP8kclip1[p1 + a2];
63 p[- step] = VP8kclip1[p0 + a1];
65 p[ step] = VP8kclip1[q1 - a2];
66 p[ 2 * step] = VP8kclip1[q2 - a3];
69 static WEBP_INLINE int hev(const uint8_t* p, int step, int thresh) {
70 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
74 static WEBP_INLINE int needs_filter(const uint8_t* p, int step, int t) {
75 const int p1 = p[-2 * step], p0 = p[-step], q0 = p[0], q1 = p[step];
80 int step, int t, int it) {
81 const int p3 = p[-4 * step], p2 = p[-3 * step];
82 const int p1 = p[-2 * step], p0 = p[-step];
83 const int q0 = p[0], q1 = p[step], q2 = p[2 * step], q3 = p[3 * step];
