1cabdff1aSopenharmony_ci/* 2cabdff1aSopenharmony_ci * This file is part of FFmpeg. 3cabdff1aSopenharmony_ci * 4cabdff1aSopenharmony_ci * FFmpeg is free software; you can redistribute it and/or 5cabdff1aSopenharmony_ci * modify it under the terms of the GNU Lesser General Public 6cabdff1aSopenharmony_ci * License as published by the Free Software Foundation; either 7cabdff1aSopenharmony_ci * version 2.1 of the License, or (at your option) any later version. 8cabdff1aSopenharmony_ci * 9cabdff1aSopenharmony_ci * FFmpeg is distributed in the hope that it will be useful, 10cabdff1aSopenharmony_ci * but WITHOUT ANY WARRANTY; without even the implied warranty of 11cabdff1aSopenharmony_ci * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 12cabdff1aSopenharmony_ci * Lesser General Public License for more details. 13cabdff1aSopenharmony_ci * 14cabdff1aSopenharmony_ci * You should have received a copy of the GNU Lesser General Public 15cabdff1aSopenharmony_ci * License along with FFmpeg; if not, write to the Free Software 16cabdff1aSopenharmony_ci * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA 17cabdff1aSopenharmony_ci */ 18cabdff1aSopenharmony_ci 19cabdff1aSopenharmony_ci#include "libavcodec/mpeg12.h" 20cabdff1aSopenharmony_ci#include "libavcodec/mpeg12data.h" 21cabdff1aSopenharmony_ci 22cabdff1aSopenharmony_ciint main(void) 23cabdff1aSopenharmony_ci{ 24cabdff1aSopenharmony_ci int i; 25cabdff1aSopenharmony_ci 26cabdff1aSopenharmony_ci#define TEST_MATCH(frame_rate, code, ext_n, ext_d) do { \ 27cabdff1aSopenharmony_ci AVRational fr = frame_rate; \ 28cabdff1aSopenharmony_ci int c, n, d; \ 29cabdff1aSopenharmony_ci ff_mpeg12_find_best_frame_rate(fr, &c, &n, &d, 0); \ 30cabdff1aSopenharmony_ci if (c != code || n != ext_n || d != ext_d) { \ 31cabdff1aSopenharmony_ci av_log(NULL, AV_LOG_ERROR, "Failed to match %d/%d: " \ 32cabdff1aSopenharmony_ci "code = %d, ext_n = %d, ext_d = %d.\n", \ 33cabdff1aSopenharmony_ci fr.num, fr.den, c, n, d); \ 34cabdff1aSopenharmony_ci return 1; \ 35cabdff1aSopenharmony_ci } \ 36cabdff1aSopenharmony_ci } while (0) 37cabdff1aSopenharmony_ci#define TEST_EXACT(frn, frd) do { \ 38cabdff1aSopenharmony_ci AVRational fr = (AVRational) { frn, frd }; \ 39cabdff1aSopenharmony_ci int c, n, d; \ 40cabdff1aSopenharmony_ci ff_mpeg12_find_best_frame_rate(fr, &c, &n, &d, 0); \ 41cabdff1aSopenharmony_ci if (av_cmp_q(fr, av_mul_q(ff_mpeg12_frame_rate_tab[c], \ 42cabdff1aSopenharmony_ci (AVRational) { n + 1, d + 1 })) != 0) { \ 43cabdff1aSopenharmony_ci av_log(NULL, AV_LOG_ERROR, "Failed to find exact %d/%d: " \ 44cabdff1aSopenharmony_ci "code = %d, ext_n = %d, ext_d = %d.\n", \ 45cabdff1aSopenharmony_ci fr.num, fr.den, c, n, d); \ 46cabdff1aSopenharmony_ci return 1; \ 47cabdff1aSopenharmony_ci } \ 48cabdff1aSopenharmony_ci } while (0) 49cabdff1aSopenharmony_ci 50cabdff1aSopenharmony_ci // Framerates in the table must be chosen exactly. 51cabdff1aSopenharmony_ci for (i = 1; i <= 8; i++) 52cabdff1aSopenharmony_ci TEST_MATCH(ff_mpeg12_frame_rate_tab[i], i, 0, 0); 53cabdff1aSopenharmony_ci 54cabdff1aSopenharmony_ci // As should the same ones with small perturbations. 55cabdff1aSopenharmony_ci // (1/1000 used here to be smaller than half the difference 56cabdff1aSopenharmony_ci // between 24 and 24000/1001.) 57cabdff1aSopenharmony_ci for (i = 1; i <= 8; i++) { 58cabdff1aSopenharmony_ci TEST_MATCH(av_sub_q(ff_mpeg12_frame_rate_tab[i], 59cabdff1aSopenharmony_ci (AVRational) { 1, 1000 }), i, 0, 0); 60cabdff1aSopenharmony_ci TEST_MATCH(av_add_q(ff_mpeg12_frame_rate_tab[i], 61cabdff1aSopenharmony_ci (AVRational) { 1, 1000 }), i, 0, 0); 62cabdff1aSopenharmony_ci } 63cabdff1aSopenharmony_ci 64cabdff1aSopenharmony_ci // Exactly constructable framerates should be exact. Note that some 65cabdff1aSopenharmony_ci // values can be made in multiple ways (e.g. 12 = 24 / 2 == 60 / 5), 66cabdff1aSopenharmony_ci // and there is no reason to favour any particular choice. 67cabdff1aSopenharmony_ci TEST_EXACT( 1, 1); 68cabdff1aSopenharmony_ci TEST_EXACT( 2, 1); 69cabdff1aSopenharmony_ci TEST_EXACT( 12, 1); 70cabdff1aSopenharmony_ci TEST_EXACT( 15000, 1001); 71cabdff1aSopenharmony_ci TEST_EXACT( 15, 1); 72cabdff1aSopenharmony_ci TEST_EXACT( 120, 1); 73cabdff1aSopenharmony_ci TEST_EXACT(120000, 1001); 74cabdff1aSopenharmony_ci TEST_EXACT( 200, 1); 75cabdff1aSopenharmony_ci TEST_EXACT( 240, 1); 76cabdff1aSopenharmony_ci 77cabdff1aSopenharmony_ci // Values higher than 240 (the highest representable, as 60 * 4 / 1) 78cabdff1aSopenharmony_ci // should be mapped to 240. 79cabdff1aSopenharmony_ci for (i = 240; i < 1000; i += 10) 80cabdff1aSopenharmony_ci TEST_MATCH(((AVRational) { i, 1 }), 8, 3, 0); 81cabdff1aSopenharmony_ci // Values lower than 24000/32032 (the lowest representable, as 82cabdff1aSopenharmony_ci // 24000/1001 * 1 / 32) should be mapped to 24000/32032. 83cabdff1aSopenharmony_ci for (i = 74; i > 0; i--) 84cabdff1aSopenharmony_ci TEST_MATCH(((AVRational) { i, 100 }), 1, 0, 31); 85cabdff1aSopenharmony_ci 86cabdff1aSopenharmony_ci return 0; 87cabdff1aSopenharmony_ci} 88