Home | History | Annotate | Download | only in vpx_dsp
      1 /*
      2  *  Copyright (c) 2016 The WebM project authors. All Rights Reserved.
      3  *
      4  *  Use of this source code is governed by a BSD-style license
      5  *  that can be found in the LICENSE file in the root of the source
      6  *  tree. An additional intellectual property rights grant can be found
      7  *  in the file PATENTS.  All contributing project authors may
      8  *  be found in the AUTHORS file in the root of the source tree.
      9  */
     10 #include <assert.h>
     11 #include <stdlib.h>
     12 #include "vpx_ports/mem.h"
     13 
     14 DECLARE_PROTECTED(const int16_t vpx_rv[]) = {
     15   8,  5,  2,  2,  8,  12, 4,  9,  8,  3,  0,  3,  9,  0,  0,  0,  8,  3,  14,
     16   4,  10, 1,  11, 14, 1,  14, 9,  6,  12, 11, 8,  6,  10, 0,  0,  8,  9,  0,
     17   3,  14, 8,  11, 13, 4,  2,  9,  0,  3,  9,  6,  1,  2,  3,  14, 13, 1,  8,
     18   2,  9,  7,  3,  3,  1,  13, 13, 6,  6,  5,  2,  7,  11, 9,  11, 8,  7,  3,
     19   2,  0,  13, 13, 14, 4,  12, 5,  12, 10, 8,  10, 13, 10, 4,  14, 4,  10, 0,
     20   8,  11, 1,  13, 7,  7,  14, 6,  14, 13, 2,  13, 5,  4,  4,  0,  10, 0,  5,
     21   13, 2,  12, 7,  11, 13, 8,  0,  4,  10, 7,  2,  7,  2,  2,  5,  3,  4,  7,
     22   3,  3,  14, 14, 5,  9,  13, 3,  14, 3,  6,  3,  0,  11, 8,  13, 1,  13, 1,
     23   12, 0,  10, 9,  7,  6,  2,  8,  5,  2,  13, 7,  1,  13, 14, 7,  6,  7,  9,
     24   6,  10, 11, 7,  8,  7,  5,  14, 8,  4,  4,  0,  8,  7,  10, 0,  8,  14, 11,
     25   3,  12, 5,  7,  14, 3,  14, 5,  2,  6,  11, 12, 12, 8,  0,  11, 13, 1,  2,
     26   0,  5,  10, 14, 7,  8,  0,  4,  11, 0,  8,  0,  3,  10, 5,  8,  0,  11, 6,
     27   7,  8,  10, 7,  13, 9,  2,  5,  1,  5,  10, 2,  4,  3,  5,  6,  10, 8,  9,
     28   4,  11, 14, 0,  10, 0,  5,  13, 2,  12, 7,  11, 13, 8,  0,  4,  10, 7,  2,
     29   7,  2,  2,  5,  3,  4,  7,  3,  3,  14, 14, 5,  9,  13, 3,  14, 3,  6,  3,
     30   0,  11, 8,  13, 1,  13, 1,  12, 0,  10, 9,  7,  6,  2,  8,  5,  2,  13, 7,
     31   1,  13, 14, 7,  6,  7,  9,  6,  10, 11, 7,  8,  7,  5,  14, 8,  4,  4,  0,
     32   8,  7,  10, 0,  8,  14, 11, 3,  12, 5,  7,  14, 3,  14, 5,  2,  6,  11, 12,
     33   12, 8,  0,  11, 13, 1,  2,  0,  5,  10, 14, 7,  8,  0,  4,  11, 0,  8,  0,
     34   3,  10, 5,  8,  0,  11, 6,  7,  8,  10, 7,  13, 9,  2,  5,  1,  5,  10, 2,
     35   4,  3,  5,  6,  10, 8,  9,  4,  11, 14, 3,  8,  3,  7,  8,  5,  11, 4,  12,
     36   3,  11, 9,  14, 8,  14, 13, 4,  3,  1,  2,  14, 6,  5,  4,  4,  11, 4,  6,
     37   2,  1,  5,  8,  8,  12, 13, 5,  14, 10, 12, 13, 0,  9,  5,  5,  11, 10, 13,
     38   9,  10, 13,
     39 };
     40 
     41 void vpx_post_proc_down_and_across_mb_row_c(unsigned char *src_ptr,
     42                                             unsigned char *dst_ptr,
     43                                             int src_pixels_per_line,
     44                                             int dst_pixels_per_line, int cols,
     45                                             unsigned char *f, int size) {
     46   unsigned char *p_src, *p_dst;
     47   int row;
     48   int col;
     49   unsigned char v;
     50   unsigned char d[4];
     51 
     52   assert(size >= 8);
     53   assert(cols >= 8);
     54 
     55   for (row = 0; row < size; row++) {
     56     /* post_proc_down for one row */
     57     p_src = src_ptr;
     58     p_dst = dst_ptr;
     59 
     60     for (col = 0; col < cols; col++) {
     61       unsigned char p_above2 = p_src[col - 2 * src_pixels_per_line];
     62       unsigned char p_above1 = p_src[col - src_pixels_per_line];
     63       unsigned char p_below1 = p_src[col + src_pixels_per_line];
     64       unsigned char p_below2 = p_src[col + 2 * src_pixels_per_line];
     65 
     66       v = p_src[col];
     67 
     68       if ((abs(v - p_above2) < f[col]) && (abs(v - p_above1) < f[col]) &&
     69           (abs(v - p_below1) < f[col]) && (abs(v - p_below2) < f[col])) {
     70         unsigned char k1, k2, k3;
     71         k1 = (p_above2 + p_above1 + 1) >> 1;
     72         k2 = (p_below2 + p_below1 + 1) >> 1;
     73         k3 = (k1 + k2 + 1) >> 1;
     74         v = (k3 + v + 1) >> 1;
     75       }
     76 
     77       p_dst[col] = v;
     78     }
     79 
     80     /* now post_proc_across */
     81     p_src = dst_ptr;
     82     p_dst = dst_ptr;
     83 
     84     p_src[-2] = p_src[-1] = p_src[0];
     85     p_src[cols] = p_src[cols + 1] = p_src[cols - 1];
     86 
     87     for (col = 0; col < cols; col++) {
     88       v = p_src[col];
     89 
     90       if ((abs(v - p_src[col - 2]) < f[col]) &&
     91           (abs(v - p_src[col - 1]) < f[col]) &&
     92           (abs(v - p_src[col + 1]) < f[col]) &&
     93           (abs(v - p_src[col + 2]) < f[col])) {
     94         unsigned char k1, k2, k3;
     95         k1 = (p_src[col - 2] + p_src[col - 1] + 1) >> 1;
     96         k2 = (p_src[col + 2] + p_src[col + 1] + 1) >> 1;
     97         k3 = (k1 + k2 + 1) >> 1;
     98         v = (k3 + v + 1) >> 1;
     99       }
    100 
    101       d[col & 3] = v;
    102 
    103       if (col >= 2) p_dst[col - 2] = d[(col - 2) & 3];
    104     }
    105 
    106     /* handle the last two pixels */
    107     p_dst[col - 2] = d[(col - 2) & 3];
    108     p_dst[col - 1] = d[(col - 1) & 3];
    109 
    110     /* next row */
    111     src_ptr += src_pixels_per_line;
    112     dst_ptr += dst_pixels_per_line;
    113   }
    114 }
    115 
    116 void vpx_mbpost_proc_across_ip_c(unsigned char *src, int pitch, int rows,
    117                                  int cols, int flimit) {
    118   int r, c, i;
    119 
    120   unsigned char *s = src;
    121   unsigned char d[16];
    122 
    123   for (r = 0; r < rows; r++) {
    124     int sumsq = 16;
    125     int sum = 0;
    126 
    127     for (i = -8; i < 0; i++) s[i] = s[0];
    128 
    129     /* 17 avoids valgrind warning - we buffer values in c in d
    130      * and only write them when we've read 8 ahead...
    131      */
    132     for (i = 0; i < 17; i++) s[i + cols] = s[cols - 1];
    133 
    134     for (i = -8; i <= 6; i++) {
    135       sumsq += s[i] * s[i];
    136       sum += s[i];
    137       d[i + 8] = 0;
    138     }
    139 
    140     for (c = 0; c < cols + 8; c++) {
    141       int x = s[c + 7] - s[c - 8];
    142       int y = s[c + 7] + s[c - 8];
    143 
    144       sum += x;
    145       sumsq += x * y;
    146 
    147       d[c & 15] = s[c];
    148 
    149       if (sumsq * 15 - sum * sum < flimit) {
    150         d[c & 15] = (8 + sum + s[c]) >> 4;
    151       }
    152 
    153       s[c - 8] = d[(c - 8) & 15];
    154     }
    155 
    156     s += pitch;
    157   }
    158 }
    159 
    160 void vpx_mbpost_proc_down_c(unsigned char *dst, int pitch, int rows, int cols,
    161                             int flimit) {
    162   int r, c, i;
    163 
    164   for (c = 0; c < cols; c++) {
    165     unsigned char *s = &dst[c];
    166     int sumsq = 0;
    167     int sum = 0;
    168     unsigned char d[16];
    169 
    170     for (i = -8; i < 0; i++) s[i * pitch] = s[0];
    171 
    172     /* 17 avoids valgrind warning - we buffer values in c in d
    173      * and only write them when we've read 8 ahead...
    174      */
    175     for (i = 0; i < 17; i++) s[(i + rows) * pitch] = s[(rows - 1) * pitch];
    176 
    177     for (i = -8; i <= 6; i++) {
    178       sumsq += s[i * pitch] * s[i * pitch];
    179       sum += s[i * pitch];
    180     }
    181 
    182     for (r = 0; r < rows + 8; r++) {
    183       sumsq += s[7 * pitch] * s[7 * pitch] - s[-8 * pitch] * s[-8 * pitch];
    184       sum += s[7 * pitch] - s[-8 * pitch];
    185       d[r & 15] = s[0];
    186 
    187       if (sumsq * 15 - sum * sum < flimit) {
    188         d[r & 15] = (vpx_rv[(r & 127) + (c & 7)] + sum + s[0]) >> 4;
    189       }
    190       if (r >= 8) s[-8 * pitch] = d[(r - 8) & 15];
    191       s += pitch;
    192     }
    193   }
    194 }
    195