mirror of https://git.ffmpeg.org/ffmpeg.git
checkasm: add a test for HEVC IDCT
Signed-off-by: Anton Khirnov <anton@khirnov.net>
This commit is contained in:
parent
9b2ccafb48
commit
e3f941cb03
|
@ -35,6 +35,30 @@
|
|||
} \
|
||||
} while (0)
|
||||
|
||||
static void check_idct(HEVCDSPContext h, int bit_depth)
|
||||
{
|
||||
int i;
|
||||
LOCAL_ALIGNED(32, int16_t, coeffs0, [32 * 32]);
|
||||
LOCAL_ALIGNED(32, int16_t, coeffs1, [32 * 32]);
|
||||
|
||||
for (i = 2; i <= 5; i++) {
|
||||
int block_size = 1 << i;
|
||||
int size = block_size * block_size;
|
||||
int col_limit = block_size;
|
||||
declare_func(void, int16_t *coeffs, int col_limit);
|
||||
|
||||
randomize_buffers(coeffs0, size);
|
||||
memcpy(coeffs1, coeffs0, sizeof(*coeffs0) * size);
|
||||
if (check_func(h.idct[i - 2], "hevc_idct_%dx%d_%d", block_size, block_size, bit_depth)) {
|
||||
call_ref(coeffs0, col_limit);
|
||||
call_new(coeffs1, col_limit);
|
||||
if (memcmp(coeffs0, coeffs1, sizeof(*coeffs0) * size))
|
||||
fail();
|
||||
bench_new(coeffs1, col_limit);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void check_idct_dc(HEVCDSPContext h, int bit_depth)
|
||||
{
|
||||
int i;
|
||||
|
@ -49,7 +73,7 @@ static void check_idct_dc(HEVCDSPContext h, int bit_depth)
|
|||
randomize_buffers(coeffs0, size);
|
||||
memcpy(coeffs1, coeffs0, sizeof(*coeffs0) * size);
|
||||
|
||||
if (check_func(h.idct_dc[i - 2], "idct_%dx%d_dc_%d", block_size, block_size, bit_depth)) {
|
||||
if (check_func(h.idct_dc[i - 2], "hevc_idct_%dx%d_dc_%d", block_size, block_size, bit_depth)) {
|
||||
call_ref(coeffs0);
|
||||
call_new(coeffs1);
|
||||
if (memcmp(coeffs0, coeffs1, sizeof(*coeffs0) * size))
|
||||
|
@ -70,4 +94,12 @@ void checkasm_check_hevc_idct(void)
|
|||
check_idct_dc(h, bit_depth);
|
||||
}
|
||||
report("idct_dc");
|
||||
|
||||
for (bit_depth = 8; bit_depth <= 10; bit_depth++) {
|
||||
HEVCDSPContext h;
|
||||
|
||||
ff_hevc_dsp_init(&h, bit_depth);
|
||||
check_idct(h, bit_depth);
|
||||
}
|
||||
report("idct");
|
||||
}
|
||||
|
|
Loading…
Reference in New Issue