| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | /* | ||
| 2 | * This file is part of FFmpeg. | ||
| 3 | * | ||
| 4 | * FFmpeg is free software; you can redistribute it and/or | ||
| 5 | * modify it under the terms of the GNU Lesser General Public | ||
| 6 | * License as published by the Free Software Foundation; either | ||
| 7 | * version 2.1 of the License, or (at your option) any later version. | ||
| 8 | * | ||
| 9 | * FFmpeg is distributed in the hope that it will be useful, | ||
| 10 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | ||
| 11 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | ||
| 12 | * Lesser General Public License for more details. | ||
| 13 | * | ||
| 14 | * You should have received a copy of the GNU Lesser General Public | ||
| 15 | * License along with FFmpeg; if not, write to the Free Software | ||
| 16 | * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA | ||
| 17 | */ | ||
| 18 | |||
| 19 | #include <stdint.h> | ||
| 20 | |||
| 21 | #include "config.h" | ||
| 22 | #include "libavutil/attributes.h" | ||
| 23 | #include "libavutil/avassert.h" | ||
| 24 | #include "libavutil/common.h" | ||
| 25 | |||
| 26 | #include "apv.h" | ||
| 27 | #include "apv_dsp.h" | ||
| 28 | |||
| 29 | |||
| 30 | static const int8_t apv_trans_matrix[8][8] = { | ||
| 31 | { 64, 64, 64, 64, 64, 64, 64, 64 }, | ||
| 32 | { 89, 75, 50, 18, -18, -50, -75, -89 }, | ||
| 33 | { 84, 35, -35, -84, -84, -35, 35, 84 }, | ||
| 34 | { 75, -18, -89, -50, 50, 89, 18, -75 }, | ||
| 35 | { 64, -64, -64, 64, 64, -64, -64, 64 }, | ||
| 36 | { 50, -89, 18, 75, -75, -18, 89, -50 }, | ||
| 37 | { 35, -84, 84, -35, -35, 84, -84, 35 }, | ||
| 38 | { 18, -50, 75, -89, 89, -75, 50, -18 }, | ||
| 39 | }; | ||
| 40 | |||
| 41 | 8643 | static void apv_decode_transquant_c(void *output, | |
| 42 | ptrdiff_t pitch, | ||
| 43 | const int16_t *input_flat, | ||
| 44 | const int16_t *qmatrix_flat, | ||
| 45 | int bit_depth, | ||
| 46 | int qp_shift) | ||
| 47 | { | ||
| 48 | 8643 | const int16_t (*input)[8] = (const int16_t(*)[8])input_flat; | |
| 49 | 8643 | const int16_t (*qmatrix)[8] = (const int16_t(*)[8])qmatrix_flat; | |
| 50 | |||
| 51 | int16_t scaled_coeff[8][8]; | ||
| 52 | int32_t recon_sample[8][8]; | ||
| 53 | |||
| 54 | // Dequant. | ||
| 55 | { | ||
| 56 | // Note that level_scale was already combined into qmatrix | ||
| 57 | // before we got here. | ||
| 58 | 8643 | int bd_shift = bit_depth + 3 - 5; | |
| 59 | |||
| 60 |
2/2✓ Branch 0 taken 69144 times.
✓ Branch 1 taken 8643 times.
|
77787 | for (int y = 0; y < 8; y++) { |
| 61 |
2/2✓ Branch 0 taken 553152 times.
✓ Branch 1 taken 69144 times.
|
622296 | for (int x = 0; x < 8; x++) { |
| 62 | 553152 | int coeff = ((int)(input[y][x] * qmatrix[y][x] * (1U << qp_shift) + | |
| 63 | 553152 | (1 << (bd_shift - 1)))) >> bd_shift; | |
| 64 | |||
| 65 | 553152 | scaled_coeff[y][x] = | |
| 66 | 553152 | av_clip(coeff, APV_MIN_TRANS_COEFF, | |
| 67 | APV_MAX_TRANS_COEFF); | ||
| 68 | } | ||
| 69 | } | ||
| 70 | } | ||
| 71 | |||
| 72 | // Transform. | ||
| 73 | { | ||
| 74 | int32_t tmp[8][8]; | ||
| 75 | |||
| 76 | // Vertical transform of columns. | ||
| 77 |
2/2✓ Branch 0 taken 69144 times.
✓ Branch 1 taken 8643 times.
|
77787 | for (int x = 0; x < 8; x++) { |
| 78 |
2/2✓ Branch 0 taken 553152 times.
✓ Branch 1 taken 69144 times.
|
622296 | for (int i = 0; i < 8; i++) { |
| 79 | 553152 | int sum = 0; | |
| 80 |
2/2✓ Branch 0 taken 4425216 times.
✓ Branch 1 taken 553152 times.
|
4978368 | for (int j = 0; j < 8; j++) |
| 81 | 4425216 | sum += apv_trans_matrix[j][i] * scaled_coeff[j][x]; | |
| 82 | 553152 | tmp[i][x] = sum; | |
| 83 | } | ||
| 84 | } | ||
| 85 | |||
| 86 | // Renormalise. | ||
| 87 |
2/2✓ Branch 0 taken 69144 times.
✓ Branch 1 taken 8643 times.
|
77787 | for (int x = 0; x < 8; x++) { |
| 88 |
2/2✓ Branch 0 taken 553152 times.
✓ Branch 1 taken 69144 times.
|
622296 | for (int y = 0; y < 8; y++) |
| 89 | 553152 | tmp[y][x] = (tmp[y][x] + 64) >> 7; | |
| 90 | } | ||
| 91 | |||
| 92 | // Horizontal transform of rows. | ||
| 93 |
2/2✓ Branch 0 taken 69144 times.
✓ Branch 1 taken 8643 times.
|
77787 | for (int y = 0; y < 8; y++) { |
| 94 |
2/2✓ Branch 0 taken 553152 times.
✓ Branch 1 taken 69144 times.
|
622296 | for (int i = 0; i < 8; i++) { |
| 95 | 553152 | int sum = 0; | |
| 96 |
2/2✓ Branch 0 taken 4425216 times.
✓ Branch 1 taken 553152 times.
|
4978368 | for (int j = 0; j < 8; j++) |
| 97 | 4425216 | sum += apv_trans_matrix[j][i] * tmp[y][j]; | |
| 98 | 553152 | recon_sample[y][i] = sum; | |
| 99 | } | ||
| 100 | } | ||
| 101 | } | ||
| 102 | |||
| 103 | // Output. | ||
| 104 | av_assert2(bit_depth > 8 && bit_depth <= 16); | ||
| 105 | 8643 | uint16_t *ptr = output; | |
| 106 | 8643 | int bd_shift = 20 - bit_depth; | |
| 107 | 8643 | pitch /= 2; // Pitch was in bytes, 2 bytes per sample. | |
| 108 | |||
| 109 |
2/2✓ Branch 0 taken 69144 times.
✓ Branch 1 taken 8643 times.
|
77787 | for (int y = 0; y < 8; y++) { |
| 110 |
2/2✓ Branch 0 taken 553152 times.
✓ Branch 1 taken 69144 times.
|
622296 | for (int x = 0; x < 8; x++) { |
| 111 | 553152 | int sample = ((recon_sample[y][x] + | |
| 112 | 553152 | (1 << (bd_shift - 1))) >> bd_shift) + | |
| 113 | 553152 | (1 << (bit_depth - 1)); | |
| 114 | 553152 | ptr[x] = av_clip_uintp2(sample, bit_depth); | |
| 115 | } | ||
| 116 | 69144 | ptr += pitch; | |
| 117 | } | ||
| 118 | 8643 | } | |
| 119 | |||
| 120 | 22 | av_cold void ff_apv_dsp_init(APVDSPContext *dsp) | |
| 121 | { | ||
| 122 | 22 | dsp->decode_transquant = apv_decode_transquant_c; | |
| 123 | |||
| 124 | #if ARCH_X86_64 && HAVE_X86ASM | ||
| 125 | 22 | ff_apv_dsp_init_x86_64(dsp); | |
| 126 | #endif | ||
| 127 | 22 | } | |
| 128 |