FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavutil/rational.c
Date: 2026-08-30 18:45:47
Exec Total Coverage
Lines: 85 92 92.4%
Functions: 10 10 100.0%
Branches: 37 48 77.1%
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 /**
23 * @file
24 * rational numbers
25 * @author Michael Niedermayer <michaelni@gmx.at>
26 */
27
28 #include "avassert.h"
29 #include <limits.h>
30
31 #include "common.h"
32 #include "mathematics.h"
33 #include "rational.h"
34
35 13216718 int av_reduce(int *dst_num, int *dst_den,
36 int64_t num, int64_t den, int64_t max)
37 {
38 13216718 AVRational a0 = { 0, 1 }, a1 = { 1, 0 };
39 13216718 int sign = (num < 0) ^ (den < 0);
40 13216718 int64_t gcd = av_gcd(FFABS(num), FFABS(den));
41
42
2/2
✓ Branch 0 taken 13212267 times.
✓ Branch 1 taken 4451 times.
 13216718 if (gcd) {
43 13212267 num = FFABS(num) / gcd;
44 13212267 den = FFABS(den) / gcd;
45 }
46
4/4
✓ Branch 0 taken 13216371 times.
✓ Branch 1 taken 347 times.
✓ Branch 2 taken 13216369 times.
✓ Branch 3 taken 2 times.
 13216718 if (num <= max && den <= max) {
47 13216369 a1 = (AVRational) { num, den };
48 13216369 den = 0;
49 }
50
51
2/2
✓ Branch 0 taken 2933 times.
✓ Branch 1 taken 13216369 times.
 13219302 while (den) {
52 2933 uint64_t x = num / den;
53 2933 int64_t next_den = num - den * x;
54 2933 int64_t a2n = x * a1.num + a0.num;
55 2933 int64_t a2d = x * a1.den + a0.den;
56
57
4/4
✓ Branch 0 taken 2588 times.
✓ Branch 1 taken 345 times.
✓ Branch 2 taken 4 times.
✓ Branch 3 taken 2584 times.
 2933 if (a2n > max || a2d > max) {
58
2/2
✓ Branch 0 taken 348 times.
✓ Branch 1 taken 1 times.
 349 if (a1.num) x = (max - a0.num) / a1.num;
59
1/2
✓ Branch 0 taken 349 times.
✗ Branch 1 not taken.
 349 if (a1.den) x = FFMIN(x, (max - a0.den) / a1.den);
60
61
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 346 times.
 349 if (den * (2 * x * a1.den + a0.den) > num * a1.den)
62 3 a1 = (AVRational) { x * a1.num + a0.num, x * a1.den + a0.den };
63 349 break;
64 }
65
66 2584 a0 = a1;
67 2584 a1 = (AVRational) { a2n, a2d };
68 2584 num = den;
69 2584 den = next_den;
70 }
71 av_assert2(av_gcd(a1.num, a1.den) <= 1U);
72 av_assert2(a1.num <= max && a1.den <= max);
73
74
2/2
✓ Branch 0 taken 6667982 times.
✓ Branch 1 taken 6548736 times.
 13216718 *dst_num = sign ? -a1.num : a1.num;
75 13216718 *dst_den = a1.den;
76
77 13216718 return den == 0;
78 }
79
80 7654442 AVRational av_mul_q(AVRational b, AVRational c)
81 {
82 7654442 av_reduce(&b.num, &b.den,
83 7654442 b.num * (int64_t) c.num,
84 7654442 b.den * (int64_t) c.den, INT_MAX);
85 7654442 return b;
86 }
87
88 2343365 AVRational av_div_q(AVRational b, AVRational c)
89 {
90 2343365 return av_mul_q(b, (AVRational) { c.den, c.num });
91 }
92
93 9971 AVRational av_add_q(AVRational b, AVRational c) {
94 9971 av_reduce(&b.num, &b.den,
95 9971 b.num * (int64_t) c.den +
96 9971 c.num * (int64_t) b.den,
97 9971 b.den * (int64_t) c.den, INT_MAX);
98 9971 return b;
99 }
100
101 5146938 AVRational av_sub_q(AVRational b, AVRational c)
102 {
103 5146938 av_reduce(&b.num, &b.den,
104 5146938 b.num * (int64_t) c.den -
105 5146938 c.num * (int64_t) b.den,
106 5146938 b.den * (int64_t) c.den, INT_MAX);
107 5146938 return b;
108 }
109
110 217970 AVRational av_d2q(double d, int max)
111 {
112 AVRational a;
113 int exponent;
114 int64_t den;
115
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 217970 times.
 217970 if (isnan(d))
116 ✗ return (AVRational) { 0,0 };
117
2/2
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 217962 times.
 217970 if (fabs(d) > INT_MAX + 3LL)
118
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 4 times.
 8 return (AVRational) { d < 0 ? -1 : 1, 0 };
119 217962 frexp(d, &exponent);
120 217962 exponent = FFMAX(exponent-1, 0);
121 217962 den = 1LL << (62 - exponent);
122 // (int64_t)rint() and llrint() do not work with gcc on ia64 and sparc64,
123 // see Ticket2713 for affected gcc/glibc versions
124 217962 av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, max);
125
126 217962 return a;
127 }
128
129 50440 int av_nearer_q(AVRational q, AVRational q1, AVRational q2)
130 {
131 /* n/d is q, a/b is the median between q1 and q2 */
132 50440 int64_t a = q1.num * (int64_t)q2.den + q2.num * (int64_t)q1.den;
133 50440 int64_t b = 2 * (int64_t)q1.den * q2.den;
134
135 /* rnd_up(a*d/b) > n => a*d/b > n */
136 50440 int64_t x_up = av_rescale_rnd(a, q.den, b, AV_ROUND_UP);
137
138 /* rnd_down(a*d/b) < n => a*d/b < n */
139 50440 int64_t x_down = av_rescale_rnd(a, q.den, b, AV_ROUND_DOWN);
140
141 50440 return ((x_up > q.num) - (x_down < q.num)) * av_cmp_q(q2, q1);
142 }
143
144 76 int av_find_nearest_q_idx(AVRational q, const AVRational* q_list)
145 {
146 76 int i, nearest_q_idx = 0;
147
2/2
✓ Branch 0 taken 4173 times.
✓ Branch 1 taken 76 times.
 4249 for (i = 0; q_list[i].den; i++)
148
2/2
✓ Branch 1 taken 863 times.
✓ Branch 2 taken 3310 times.
 4173 if (av_nearer_q(q, q_list[i], q_list[nearest_q_idx]) > 0)
149 863 nearest_q_idx = i;
150
151 76 return nearest_q_idx;
152 }
153
154 3 uint32_t av_q2intfloat(AVRational q) {
155 int64_t n;
156 int shift;
157 3 int sign = 0;
158
159
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (q.den < 0) {
160 ✗ q.den *= -1;
161 ✗ q.num *= -1;
162 }
163
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (q.num < 0) {
164 ✗ q.num *= -1;
165 ✗ sign = 1;
166 }
167
168
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 3 if (!q.num && !q.den) return 0xFFC00000;
169
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (!q.num) return 0;
170
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 3 times.
 3 if (!q.den) return 0x7F800000 | (q.num & 0x80000000);
171
172 3 shift = 23 + av_log2(q.den) - av_log2(q.num);
173
1/2
✓ Branch 0 taken 3 times.
✗ Branch 1 not taken.
 3 if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);
174 ✗ else n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);
175
176 3 shift -= n >= (1<<24);
177 3 shift += n < (1<<23);
178
179
1/2
✓ Branch 0 taken 3 times.
✗ Branch 1 not taken.
 3 if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);
180 ✗ else n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);
181
182 av_assert1(n < (1<<24));
183 av_assert1(n >= (1<<23));
184
185 3 return sign<<31 | (150-shift)<<23 | (n - (1<<23));
186 }
187
188 378 AVRational av_gcd_q(AVRational a, AVRational b, int max_den, AVRational def)
189 {
190 int64_t gcd, lcm;
191
192 378 gcd = av_gcd(a.den, b.den);
193 378 lcm = (a.den / gcd) * b.den;
194
2/2
✓ Branch 0 taken 376 times.
✓ Branch 1 taken 2 times.
 378 return lcm < max_den ? av_make_q(av_gcd(a.num, b.num), lcm) : def;
195 }
196