| /external/libvpx/libvpx/test/ |
| H A D | dct32x32_test.cc | 41 const int kNumCoeffs = 1024; member in namespace:__anon11095
54 void reference_32x32_dct_2d(const int16_t input[kNumCoeffs],
55 double output[kNumCoeffs]) {
124 DECLARE_ALIGNED(16, int16_t, test_input_block[kNumCoeffs]);
125 DECLARE_ALIGNED(16, tran_low_t, test_temp_block[kNumCoeffs]);
126 DECLARE_ALIGNED(16, uint8_t, dst[kNumCoeffs]);
127 DECLARE_ALIGNED(16, uint8_t, src[kNumCoeffs]);
129 DECLARE_ALIGNED(16, uint16_t, dst16[kNumCoeffs]);
130 DECLARE_ALIGNED(16, uint16_t, src16[kNumCoeffs]);
135 for (int j = 0; j < kNumCoeffs;
[all...] |
| H A D | dct16x16_test.cc | 42 const int kNumCoeffs = 256; member in namespace:__anon11094
338 DECLARE_ALIGNED(16, int16_t, test_input_block[kNumCoeffs]);
339 DECLARE_ALIGNED(16, tran_low_t, test_temp_block[kNumCoeffs]);
340 DECLARE_ALIGNED(16, uint8_t, dst[kNumCoeffs]);
341 DECLARE_ALIGNED(16, uint8_t, src[kNumCoeffs]);
343 DECLARE_ALIGNED(16, uint16_t, dst16[kNumCoeffs]);
344 DECLARE_ALIGNED(16, uint16_t, src16[kNumCoeffs]);
348 for (int j = 0; j < kNumCoeffs; ++j) {
374 for (int j = 0; j < kNumCoeffs; ++j) {
398 DECLARE_ALIGNED(16, int16_t, input_block[kNumCoeffs]);
[all...] |
| H A D | fdct4x4_test.cc | 31 const int kNumCoeffs = 16; member in namespace:__anon11101
107 DECLARE_ALIGNED(16, int16_t, test_input_block[kNumCoeffs]);
108 DECLARE_ALIGNED(16, tran_low_t, test_temp_block[kNumCoeffs]);
109 DECLARE_ALIGNED(16, uint8_t, dst[kNumCoeffs]);
110 DECLARE_ALIGNED(16, uint8_t, src[kNumCoeffs]);
112 DECLARE_ALIGNED(16, uint16_t, dst16[kNumCoeffs]);
113 DECLARE_ALIGNED(16, uint16_t, src16[kNumCoeffs]);
117 for (int j = 0; j < kNumCoeffs; ++j) {
142 for (int j = 0; j < kNumCoeffs; ++j) {
169 DECLARE_ALIGNED(16, int16_t, input_block[kNumCoeffs]);
[all...] |
| H A D | lpf_8_test.cc | 33 const int kNumCoeffs = 1024; member in namespace:__anon11108
199 DECLARE_ALIGNED(16, uint16_t, s[kNumCoeffs]);
200 DECLARE_ALIGNED(16, uint16_t, ref_s[kNumCoeffs]);
202 DECLARE_ALIGNED(8, uint8_t, s[kNumCoeffs]);
203 DECLARE_ALIGNED(8, uint8_t, ref_s[kNumCoeffs]);
224 int32_t p = kNumCoeffs/32;
226 uint16_t tmp_s[kNumCoeffs];
228 while (j < kNumCoeffs) {
235 while (k++ < ((val & 0x1f) + 1) && j < kNumCoeffs) {
247 for (j = 0; j < kNumCoeffs;
[all...] |
| H A D | fdct8x8_test.cc | 33 const int kNumCoeffs = 64; member in namespace:__anon11102
61 void reference_8x8_dct_2d(const int16_t input[kNumCoeffs],
62 double output[kNumCoeffs]) {
384 DECLARE_ALIGNED(16, int16_t, in[kNumCoeffs]);
385 DECLARE_ALIGNED(16, tran_low_t, coeff[kNumCoeffs]);
386 DECLARE_ALIGNED(16, uint8_t, dst[kNumCoeffs]);
387 DECLARE_ALIGNED(16, uint8_t, src[kNumCoeffs]);
389 DECLARE_ALIGNED(16, uint16_t, src16[kNumCoeffs]);
390 DECLARE_ALIGNED(16, uint16_t, dst16[kNumCoeffs]);
394 double out_r[kNumCoeffs];
[all...] |
| /external/webrtc/webrtc/modules/audio_processing/ |
| H A D | three_band_filter_bank.cc | 48 // Factors to take into account when choosing |kNumCoeffs|:
49 // 1. Higher |kNumCoeffs|, means faster transition, which ensures less
53 // |kNumBands| * |kSparsity| * |kNumCoeffs| / 2, so it increases linearly
54 // with |kNumCoeffs|.
55 // 3. The computation complexity also increases linearly with |kNumCoeffs|.
56 const size_t kNumCoeffs = 4; member in namespace:webrtc::__anon20319
60 // N = kNumBands * kSparsity * kNumCoeffs - 1;
62 // reshape(h, kNumBands * kSparsity, kNumCoeffs);
71 const float kLowpassCoeffs[kNumBands * kSparsity][kNumCoeffs] =
117 kLowpassCoeffs[i * kNumBands + j], kNumCoeffs, kSparsit
[all...] |