FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavutil/tests/rational.c
Date: 2026-10-28 19:13:44
Exec Total Coverage
Lines: 83 97 85.6%
Functions: 2 2 100.0%
Branches: 89 108 82.4%
Line Branch Exec Source
1 /*
2 * rational numbers
3 * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
4 *
5 * This file is part of FFmpeg.
6 *
7 * FFmpeg is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License as published by the Free Software Foundation; either
10 * version 2.1 of the License, or (at your option) any later version.
11 *
12 * FFmpeg is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * Lesser General Public License for more details.
16 *
17 * You should have received a copy of the GNU Lesser General Public
18 * License along with FFmpeg; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 #include "libavutil/rational.c"
23 #include "libavutil/integer.h"
24 #include "libavutil/intfloat.h"
25
26 29555 static int check_q2intfloat(AVRational q)
27 {
28 29555 float f = av_int2float(av_q2intfloat(q));
29 29555 float f2 = av_q2d(q);
30 int fail;
31
32
3/4
✓ Branch 0 taken 29554 times.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 29554 times.
 29555 if (isnan(f) || isnan(f2))
33
2/4
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 1 times.
 1 fail = !isnan(f) || !isnan(f2);
34
3/4
✓ Branch 0 taken 29551 times.
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 29551 times.
 29554 else if (isinf(f) || isinf(f2))
35 3 fail = f != f2;
36 else
37 29551 fail = fabs(f - f2) > fabs(f)/5000000;
38
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 29555 times.
 29555 if (fail)
39 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d %f %f\n", q.num, q.den, f, f2);
40 29555 return fail;
41 }
42
43 1 int main(void)
44 {
45 AVRational a,b,r;
46 int i,j,k;
47 1 int ret = 0;
48 static const int64_t numlist[] = {
49 INT64_MIN, INT64_MIN+1, INT64_MAX, INT32_MIN, INT32_MAX, 1,0,-1,
50 123456789, INT32_MAX-1, INT32_MAX+1LL, UINT32_MAX-1, UINT32_MAX, UINT32_MAX+1LL
51 };
52
53
2/2
✓ Branch 0 taken 5 times.
✓ Branch 1 taken 1 times.
 6 for (a.num = -2; a.num <= 2; a.num++) {
54
2/2
✓ Branch 0 taken 25 times.
✓ Branch 1 taken 5 times.
 30 for (a.den = -2; a.den <= 2; a.den++) {
55
2/2
✓ Branch 0 taken 125 times.
✓ Branch 1 taken 25 times.
 150 for (b.num = -2; b.num <= 2; b.num++) {
56
2/2
✓ Branch 0 taken 625 times.
✓ Branch 1 taken 125 times.
 750 for (b.den = -2; b.den <= 2; b.den++) {
57 625 int c = av_cmp_q(a,b);
58 625 double d = av_q2d(a) == av_q2d(b) ?
59
2/2
✓ Branch 0 taken 553 times.
✓ Branch 1 taken 72 times.
 625 0 : (av_q2d(a) - av_q2d(b));
60
2/2
✓ Branch 0 taken 252 times.
✓ Branch 1 taken 373 times.
 625 if (d > 0) d = 1;
61
2/2
✓ Branch 0 taken 252 times.
✓ Branch 1 taken 121 times.
 373 else if (d < 0) d = -1;
62
2/2
✓ Branch 0 taken 49 times.
✓ Branch 1 taken 72 times.
 121 else if (d != d) d = INT_MIN;
63
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 625 times.
 625 if (c != d) {
64 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d %d/%d, %d %f\n", a.num,
65 a.den, b.num, b.den, c,d);
66 ✗ ret = 1;
67 }
68 625 r = av_sub_q(av_add_q(b,a), b);
69
5/8
✓ Branch 0 taken 500 times.
✓ Branch 1 taken 125 times.
✓ Branch 2 taken 500 times.
✗ Branch 3 not taken.
✓ Branch 4 taken 500 times.
✗ Branch 5 not taken.
✗ Branch 6 not taken.
✓ Branch 7 taken 500 times.
 625 if(b.den && (r.num*a.den != a.num*r.den || !r.num != !a.num || !r.den != !a.den)) {
70 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d ", r.num, r.den);
71 ✗ ret = 1;
72 }
73 }
74 }
75 }
76 }
77
78 /* Check overflow behavior and edge cases */
79 static const AVRational unit_mul_q[][3] = {
80 {{INT_MAX, 2}, { 2, 1}, { INT_MAX, 1}},
81 {{INT_MAX, 2}, {-2, 1}, {-INT_MAX, 1}},
82 {{INT_MAX, 2}, { 0, 1}, {0, 1}},
83 {{INT_MIN, 2}, { 2, 1}, {-INT_MAX, 1}}, /* not INT_MIN */
84 {{INT_MIN, 2}, {-2, 1}, { INT_MAX, 1}},
85 {{INT_MIN, 2}, { 0, 1}, {0, 1}},
86 {{INT_MAX >> 8, 1}, {INT_MAX >> 8, 1}, {INT_MAX, 1}},
87 {{1, INT_MAX >> 8}, {1, INT_MAX >> 8}, {0, 1}},
88 {{1, 1}, {0, 0}, {0, 0}},
89 {{0, 1}, {0, 0}, {0, 0}},
90 };
91
92
2/2
✓ Branch 0 taken 10 times.
✓ Branch 1 taken 1 times.
 11 for (i = 0; i < FF_ARRAY_ELEMS(unit_mul_q); i++) {
93
2/2
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 10 times.
 30 for (int c = 0; c < 2; c++) { /* test commutativity */
94 20 AVRational a = unit_mul_q[i][c ? 1 : 0];
95 20 AVRational b = unit_mul_q[i][c ? 0 : 1];
96 20 AVRational c = unit_mul_q[i][2];
97 20 AVRational r = av_mul_q(a, b);
98
2/4
✓ Branch 0 taken 20 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 20 times.
 20 if (r.num != c.num || r.den != c.den) {
99 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d * %d/%d = %d/%d, expected %d/%d\n",
100 a.num, a.den, b.num, b.den, r.num, r.den, c.num, c.den);
101 ✗ ret = 1;
102 }
103 }
104 }
105
106 static const AVRational unit_add_q[][3] = {
107 {{INT_MAX, 1}, { 2, 2}, { INT_MAX, 1}},
108 {{INT_MAX, 1}, {-2, 2}, { INT_MAX - 1, 1}},
109 {{INT_MAX, 1}, { 0, 2}, { INT_MAX, 1}},
110 {{INT_MIN, 1}, { 2, 2}, {-INT_MAX, 1}},
111 {{INT_MIN, 1}, {-2, 2}, {-INT_MAX, 1}},
112 {{INT_MIN, 1}, { 0, 2}, {-INT_MAX, 1}},
113 {{INT_MAX - 10, 1}, {20, 1}, { INT_MAX, 1}},
114 {{2, INT_MAX}, {2, INT_MAX}, {4, INT_MAX}},
115 {{1, 1}, {0, 0}, {0, 0}},
116 {{0, 1}, {0, 0}, {0, 0}},
117 };
118
119
2/2
✓ Branch 0 taken 10 times.
✓ Branch 1 taken 1 times.
 11 for (i = 0; i < FF_ARRAY_ELEMS(unit_add_q); i++) {
120
2/2
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 10 times.
 30 for (int c = 0; c < 2; c++) { /* test commutativity */
121 20 AVRational a = unit_add_q[i][c ? 1 : 0];
122 20 AVRational b = unit_add_q[i][c ? 0 : 1];
123 20 AVRational c = unit_add_q[i][2];
124 20 AVRational r = av_add_q(a, b);
125
2/4
✓ Branch 0 taken 20 times.
✗ Branch 1 not taken.
✗ Branch 2 not taken.
✓ Branch 3 taken 20 times.
 20 if (r.num != c.num || r.den != c.den) {
126 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d + %d/%d = %d/%d, expected %d/%d\n",
127 a.num, a.den, b.num, b.den, r.num, r.den, c.num, c.den);
128 ✗ ret = 1;
129 }
130 }
131 }
132
133
2/2
✓ Branch 0 taken 14 times.
✓ Branch 1 taken 1 times.
 15 for (i = 0; i < FF_ARRAY_ELEMS(numlist); i++) {
134 14 int64_t a = numlist[i];
135
136
2/2
✓ Branch 0 taken 196 times.
✓ Branch 1 taken 14 times.
 210 for (j = 0; j < FF_ARRAY_ELEMS(numlist); j++) {
137 196 int64_t b = numlist[j];
138
2/2
✓ Branch 0 taken 70 times.
✓ Branch 1 taken 126 times.
 196 if (b<=0)
139 70 continue;
140
2/2
✓ Branch 0 taken 1764 times.
✓ Branch 1 taken 126 times.
 1890 for (k = 0; k < FF_ARRAY_ELEMS(numlist); k++) {
141 1764 int64_t c = numlist[k];
142 int64_t res;
143 AVInteger ai;
144
145
2/2
✓ Branch 0 taken 630 times.
✓ Branch 1 taken 1134 times.
 1764 if (c<=0)
146 1764 continue;
147 1134 res = av_rescale_rnd(a,b,c, AV_ROUND_ZERO);
148
149 1134 ai = av_mul_i(av_int2i(a), av_int2i(b));
150 1134 ai = av_div_i(ai, av_int2i(c));
151
152
3/4
✓ Branch 0 taken 75 times.
✓ Branch 1 taken 1059 times.
✓ Branch 2 taken 75 times.
✗ Branch 3 not taken.
 1134 if (av_cmp_i(ai, av_int2i(INT64_MAX)) > 0 && res == INT64_MIN)
153 75 continue;
154
3/4
✓ Branch 0 taken 76 times.
✓ Branch 1 taken 983 times.
✓ Branch 2 taken 76 times.
✗ Branch 3 not taken.
 1059 if (av_cmp_i(ai, av_int2i(INT64_MIN)) < 0 && res == INT64_MIN)
155 76 continue;
156
2/2
✓ Branch 0 taken 957 times.
✓ Branch 1 taken 26 times.
 983 if (av_cmp_i(ai, av_int2i(res)) == 0)
157 957 continue;
158
159 // Special exception for INT64_MIN, remove this in case INT64_MIN is handled without off by 1 error
160
2/4
✓ Branch 0 taken 26 times.
✗ Branch 1 not taken.
✓ Branch 2 taken 26 times.
✗ Branch 3 not taken.
 26 if (av_cmp_i(ai, av_int2i(res-1)) == 0 && a == INT64_MIN)
161 26 continue;
162
163 ✗ av_log(NULL, AV_LOG_ERROR, "%"PRId64" * %"PRId64" / %"PRId64" = %"PRId64" or %"PRId64"\n", a,b,c, res, av_i2int(ai));
164 ✗ ret = 1;
165 }
166 }
167 }
168
169
2/2
✓ Branch 0 taken 10 times.
✓ Branch 1 taken 1 times.
 11 for (a.num = 1; a.num <= 10; a.num++) {
170
2/2
✓ Branch 0 taken 100 times.
✓ Branch 1 taken 10 times.
 110 for (a.den = 1; a.den <= 10; a.den++) {
171
2/2
✓ Branch 0 taken 37 times.
✓ Branch 1 taken 63 times.
 100 if (av_gcd(a.num, a.den) > 1)
172 37 continue;
173
2/2
✓ Branch 0 taken 630 times.
✓ Branch 1 taken 63 times.
 693 for (b.num = 1; b.num <= 10; b.num++) {
174
2/2
✓ Branch 0 taken 6300 times.
✓ Branch 1 taken 630 times.
 6930 for (b.den = 1; b.den <= 10; b.den++) {
175 int start;
176
2/2
✓ Branch 0 taken 2331 times.
✓ Branch 1 taken 3969 times.
 6300 if (av_gcd(b.num, b.den) > 1)
177 2331 continue;
178
2/2
✓ Branch 1 taken 1953 times.
✓ Branch 2 taken 2016 times.
 3969 if (av_cmp_q(b, a) < 0)
179 1953 continue;
180
2/2
✓ Branch 0 taken 20160 times.
✓ Branch 1 taken 2016 times.
 22176 for (start = 0; start < 10 ; start++) {
181 20160 int acc= start;
182 int i;
183
184
2/2
✓ Branch 0 taken 2016000 times.
✓ Branch 1 taken 20160 times.
 2036160 for (i = 0; i<100; i++) {
185 2016000 int exact = start + av_rescale_q(i+1, b, a);
186 2016000 acc = av_add_stable(a, acc, b, 1);
187
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 2016000 times.
 2016000 if (FFABS(acc - exact) > 2) {
188 ✗ av_log(NULL, AV_LOG_ERROR, "%d/%d %d/%d, %d %d\n", a.num,
189 a.den, b.num, b.den, acc, exact);
190 ✗ return 1;
191 }
192 }
193 }
194 }
195 }
196 }
197 }
198
199
2/2
✓ Branch 0 taken 20 times.
✓ Branch 1 taken 1 times.
 21 for (int64_t den = 1; den <= INT_MAX; den *= 3) {
200 20 a.den = den;
201
2/2
✓ Branch 0 taken 29540 times.
✓ Branch 1 taken 20 times.
 29560 for (a.num = -1; a.num < (1<<27); a.num += 1 + a.num/100) {
202
1/2
✗ Branch 1 not taken.
✓ Branch 2 taken 29540 times.
 29540 if (check_q2intfloat(a))
203 ✗ return 1;
204 }
205 }
206
207 static const AVRational q2intfloat_list[] = {
208 {INT_MIN, 1}, {1, INT_MIN}, {INT_MIN, INT_MIN}, {INT_MIN, -1}, {-1, INT_MIN},
209 {INT_MAX, INT_MIN}, {INT_MIN, INT_MAX}, {-3, -7}, {3, -7},
210 {1, 0}, {-1, 0}, {INT_MIN, 0}, {0, 0}, {0, 1}, {0, INT_MIN},
211 };
212
213
2/2
✓ Branch 0 taken 15 times.
✓ Branch 1 taken 1 times.
 16 for (i = 0; i < FF_ARRAY_ELEMS(q2intfloat_list); i++)
214 15 ret |= check_q2intfloat(q2intfloat_list[i]);
215
216 1 return ret;
217 }
218