Coverage Report

Created: 2022-08-24 06:15

/src/aom/av1/common/av1_txfm.c
Line
Count
Source
1
/*
2
 * Copyright (c) 2017, Alliance for Open Media. All rights reserved
3
 *
4
 * This source code is subject to the terms of the BSD 2 Clause License and
5
 * the Alliance for Open Media Patent License 1.0. If the BSD 2 Clause License
6
 * was not distributed with this source code in the LICENSE file, you can
7
 * obtain it at www.aomedia.org/license/software. If the Alliance for Open
8
 * Media Patent License 1.0 was not distributed with this source code in the
9
 * PATENTS file, you can obtain it at www.aomedia.org/license/patent.
10
 */
11
12
#include "config/aom_dsp_rtcd.h"
13
#include "config/av1_rtcd.h"
14
15
#include "av1/common/av1_txfm.h"
16
17
// av1_cospi_arr[i][j] = (int)round(cos(PI*j/128) * (1<<(cos_bit_min+i)));
18
const int32_t av1_cospi_arr_data[7][64] = {
19
  { 1024, 1024, 1023, 1021, 1019, 1016, 1013, 1009, 1004, 999, 993, 987, 980,
20
    972,  964,  955,  946,  936,  926,  915,  903,  891,  878, 865, 851, 837,
21
    822,  807,  792,  775,  759,  742,  724,  706,  688,  669, 650, 630, 610,
22
    590,  569,  548,  526,  505,  483,  460,  438,  415,  392, 369, 345, 321,
23
    297,  273,  249,  224,  200,  175,  150,  125,  100,  75,  50,  25 },
24
  { 2048, 2047, 2046, 2042, 2038, 2033, 2026, 2018, 2009, 1998, 1987,
25
    1974, 1960, 1945, 1928, 1911, 1892, 1872, 1851, 1829, 1806, 1782,
26
    1757, 1730, 1703, 1674, 1645, 1615, 1583, 1551, 1517, 1483, 1448,
27
    1412, 1375, 1338, 1299, 1260, 1220, 1179, 1138, 1096, 1053, 1009,
28
    965,  921,  876,  830,  784,  737,  690,  642,  595,  546,  498,
29
    449,  400,  350,  301,  251,  201,  151,  100,  50 },
30
  { 4096, 4095, 4091, 4085, 4076, 4065, 4052, 4036, 4017, 3996, 3973,
31
    3948, 3920, 3889, 3857, 3822, 3784, 3745, 3703, 3659, 3612, 3564,
32
    3513, 3461, 3406, 3349, 3290, 3229, 3166, 3102, 3035, 2967, 2896,
33
    2824, 2751, 2675, 2598, 2520, 2440, 2359, 2276, 2191, 2106, 2019,
34
    1931, 1842, 1751, 1660, 1567, 1474, 1380, 1285, 1189, 1092, 995,
35
    897,  799,  700,  601,  501,  401,  301,  201,  101 },
36
  { 8192, 8190, 8182, 8170, 8153, 8130, 8103, 8071, 8035, 7993, 7946,
37
    7895, 7839, 7779, 7713, 7643, 7568, 7489, 7405, 7317, 7225, 7128,
38
    7027, 6921, 6811, 6698, 6580, 6458, 6333, 6203, 6070, 5933, 5793,
39
    5649, 5501, 5351, 5197, 5040, 4880, 4717, 4551, 4383, 4212, 4038,
40
    3862, 3683, 3503, 3320, 3135, 2948, 2760, 2570, 2378, 2185, 1990,
41
    1795, 1598, 1401, 1202, 1003, 803,  603,  402,  201 },
42
  { 16384, 16379, 16364, 16340, 16305, 16261, 16207, 16143, 16069, 15986, 15893,
43
    15791, 15679, 15557, 15426, 15286, 15137, 14978, 14811, 14635, 14449, 14256,
44
    14053, 13842, 13623, 13395, 13160, 12916, 12665, 12406, 12140, 11866, 11585,
45
    11297, 11003, 10702, 10394, 10080, 9760,  9434,  9102,  8765,  8423,  8076,
46
    7723,  7366,  7005,  6639,  6270,  5897,  5520,  5139,  4756,  4370,  3981,
47
    3590,  3196,  2801,  2404,  2006,  1606,  1205,  804,   402 },
48
  { 32768, 32758, 32729, 32679, 32610, 32522, 32413, 32286, 32138, 31972, 31786,
49
    31581, 31357, 31114, 30853, 30572, 30274, 29957, 29622, 29269, 28899, 28511,
50
    28106, 27684, 27246, 26791, 26320, 25833, 25330, 24812, 24279, 23732, 23170,
51
    22595, 22006, 21403, 20788, 20160, 19520, 18868, 18205, 17531, 16846, 16151,
52
    15447, 14733, 14010, 13279, 12540, 11793, 11039, 10279, 9512,  8740,  7962,
53
    7180,  6393,  5602,  4808,  4011,  3212,  2411,  1608,  804 },
54
  { 65536, 65516, 65457, 65358, 65220, 65043, 64827, 64571, 64277, 63944, 63572,
55
    63162, 62714, 62228, 61705, 61145, 60547, 59914, 59244, 58538, 57798, 57022,
56
    56212, 55368, 54491, 53581, 52639, 51665, 50660, 49624, 48559, 47464, 46341,
57
    45190, 44011, 42806, 41576, 40320, 39040, 37736, 36410, 35062, 33692, 32303,
58
    30893, 29466, 28020, 26558, 25080, 23586, 22078, 20557, 19024, 17479, 15924,
59
    14359, 12785, 11204, 9616,  8022,  6424,  4821,  3216,  1608 }
60
};
61
62
// av1_sinpi_arr_data[i][j] = (int)round((sqrt(2) * sin(j*Pi/9) * 2 / 3) * (1
63
// << (cos_bit_min + i))) modified so that elements j=1,2 sum to element j=4.
64
const int32_t av1_sinpi_arr_data[7][5] = {
65
  { 0, 330, 621, 836, 951 },        { 0, 660, 1241, 1672, 1901 },
66
  { 0, 1321, 2482, 3344, 3803 },    { 0, 2642, 4964, 6689, 7606 },
67
  { 0, 5283, 9929, 13377, 15212 },  { 0, 10566, 19858, 26755, 30424 },
68
  { 0, 21133, 39716, 53510, 60849 }
69
};
70
71
231M
void av1_round_shift_array_c(int32_t *arr, int size, int bit) {
72
231M
  int i;
73
231M
  if (bit == 0) {
74
76.0M
    return;
75
155M
  } else {
76
155M
    if (bit > 0) {
77
3.44G
      for (i = 0; i < size; i++) {
78
3.34G
        arr[i] = round_shift(arr[i], bit);
79
3.34G
      }
80
99.3M
    } else {
81
1.07G
      for (i = 0; i < size; i++) {
82
1.01G
        arr[i] = (int32_t)clamp64(((int64_t)1 << (-bit)) * arr[i], INT32_MIN,
83
1.01G
                                  INT32_MAX);
84
1.01G
      }
85
55.9M
    }
86
155M
  }
87
231M
}
88
89
const TXFM_TYPE av1_txfm_type_ls[5][TX_TYPES_1D] = {
90
  { TXFM_TYPE_DCT4, TXFM_TYPE_ADST4, TXFM_TYPE_ADST4, TXFM_TYPE_IDENTITY4 },
91
  { TXFM_TYPE_DCT8, TXFM_TYPE_ADST8, TXFM_TYPE_ADST8, TXFM_TYPE_IDENTITY8 },
92
  { TXFM_TYPE_DCT16, TXFM_TYPE_ADST16, TXFM_TYPE_ADST16, TXFM_TYPE_IDENTITY16 },
93
  { TXFM_TYPE_DCT32, TXFM_TYPE_INVALID, TXFM_TYPE_INVALID,
94
    TXFM_TYPE_IDENTITY32 },
95
  { TXFM_TYPE_DCT64, TXFM_TYPE_INVALID, TXFM_TYPE_INVALID, TXFM_TYPE_INVALID }
96
};
97
98
const int8_t av1_txfm_stage_num_list[TXFM_TYPES] = {
99
  4,   // TXFM_TYPE_DCT4
100
  6,   // TXFM_TYPE_DCT8
101
  8,   // TXFM_TYPE_DCT16
102
  10,  // TXFM_TYPE_DCT32
103
  12,  // TXFM_TYPE_DCT64
104
  7,   // TXFM_TYPE_ADST4
105
  8,   // TXFM_TYPE_ADST8
106
  10,  // TXFM_TYPE_ADST16
107
  1,   // TXFM_TYPE_IDENTITY4
108
  1,   // TXFM_TYPE_IDENTITY8
109
  1,   // TXFM_TYPE_IDENTITY16
110
  1,   // TXFM_TYPE_IDENTITY32
111
};
112
113
void av1_range_check_buf(int32_t stage, const int32_t *input,
114
1.26G
                         const int32_t *buf, int32_t size, int8_t bit) {
115
#if CONFIG_COEFFICIENT_RANGE_CHECKING
116
  const int64_t max_value = (1LL << (bit - 1)) - 1;
117
  const int64_t min_value = -(1LL << (bit - 1));
118
119
  int in_range = 1;
120
121
  for (int i = 0; i < size; ++i) {
122
    if (buf[i] < min_value || buf[i] > max_value) {
123
      in_range = 0;
124
    }
125
  }
126
127
  if (!in_range) {
128
    fprintf(stderr, "Error: coeffs contain out-of-range values\n");
129
    fprintf(stderr, "size: %d\n", size);
130
    fprintf(stderr, "stage: %d\n", stage);
131
    fprintf(stderr, "allowed range: [%" PRId64 ";%" PRId64 "]\n", min_value,
132
            max_value);
133
134
    fprintf(stderr, "coeffs: ");
135
136
    fprintf(stderr, "[");
137
    for (int j = 0; j < size; j++) {
138
      if (j > 0) fprintf(stderr, ", ");
139
      fprintf(stderr, "%d", input[j]);
140
    }
141
    fprintf(stderr, "]\n");
142
143
    fprintf(stderr, "   buf: ");
144
145
    fprintf(stderr, "[");
146
    for (int j = 0; j < size; j++) {
147
      if (j > 0) fprintf(stderr, ", ");
148
      fprintf(stderr, "%d", buf[j]);
149
    }
150
    fprintf(stderr, "]\n\n");
151
  }
152
153
  assert(in_range);
154
#else
155
1.26G
  (void)stage;
156
1.26G
  (void)input;
157
1.26G
  (void)buf;
158
1.26G
  (void)size;
159
1.26G
  (void)bit;
160
1.26G
#endif
161
1.26G
}