FFmpeg coverage

Directory: ../../../ffmpeg/
File: src/libavutil/rational.c
Date: 2024-11-20 23:03:26
Exec Total Coverage
Lines: 81 88 92.0%
Functions: 10 10 100.0%
Branches: 36 48 75.0%
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 1382250 int av_reduce(int *dst_num, int *dst_den,
36 int64_t num, int64_t den, int64_t max)
37 {
38 1382250 AVRational a0 = { 0, 1 }, a1 = { 1, 0 };
39 1382250 int sign = (num < 0) ^ (den < 0);
40 1382250 int64_t gcd = av_gcd(FFABS(num), FFABS(den));
41
42
2/2
✓ Branch 0 taken 1378331 times.
✓ Branch 1 taken 3919 times.
 1382250 if (gcd) {
43 1378331 num = FFABS(num) / gcd;
44 1378331 den = FFABS(den) / gcd;
45 }
46
3/4
✓ Branch 0 taken 1381927 times.
✓ Branch 1 taken 323 times.
✓ Branch 2 taken 1381927 times.
✗ Branch 3 not taken.
 1382250 if (num <= max && den <= max) {
47 1381927 a1 = (AVRational) { num, den };
48 1381927 den = 0;
49 }
50
51
2/2
✓ Branch 0 taken 2687 times.
✓ Branch 1 taken 1381927 times.
 1384614 while (den) {
52 2687 uint64_t x = num / den;
53 2687 int64_t next_den = num - den * x;
54 2687 int64_t a2n = x * a1.num + a0.num;
55 2687 int64_t a2d = x * a1.den + a0.den;
56
57
4/4
✓ Branch 0 taken 2366 times.
✓ Branch 1 taken 321 times.
✓ Branch 2 taken 2 times.
✓ Branch 3 taken 2364 times.
 2687 if (a2n > max || a2d > max) {
58
2/2
✓ Branch 0 taken 322 times.
✓ Branch 1 taken 1 times.
 323 if (a1.num) x = (max - a0.num) / a1.num;
59
1/2
✓ Branch 0 taken 323 times.
✗ Branch 1 not taken.
 323 if (a1.den) x = FFMIN(x, (max - a0.den) / a1.den);
60
61
2/2
✓ Branch 0 taken 3 times.
✓ Branch 1 taken 320 times.
 323 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 323 break;
64 }
65
66 2364 a0 = a1;
67 2364 a1 = (AVRational) { a2n, a2d };
68 2364 num = den;
69 2364 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 34 times.
✓ Branch 1 taken 1382216 times.
 1382250 *dst_num = sign ? -a1.num : a1.num;
75 1382250 *dst_den = a1.den;
76
77 1382250 return den == 0;
78 }
79
80 1018275 AVRational av_mul_q(AVRational b, AVRational c)
81 {
82 1018275 av_reduce(&b.num, &b.den,
83 1018275 b.num * (int64_t) c.num,
84 1018275 b.den * (int64_t) c.den, INT_MAX);
85 1018275 return b;
86 }
87
88 181722 AVRational av_div_q(AVRational b, AVRational c)
89 {
90 181722 return av_mul_q(b, (AVRational) { c.den, c.num });
91 }
92
93 8596 AVRational av_add_q(AVRational b, AVRational c) {
94 8596 av_reduce(&b.num, &b.den,
95 8596 b.num * (int64_t) c.den +
96 8596 c.num * (int64_t) b.den,
97 8596 b.den * (int64_t) c.den, INT_MAX);
98 8596 return b;
99 }
100
101 130 AVRational av_sub_q(AVRational b, AVRational c)
102 {
103 130 return av_add_q(b, (AVRational) { -c.num, c.den });
104 }
105
106 200089 AVRational av_d2q(double d, int max)
107 {
108 AVRational a;
109 int exponent;
110 int64_t den;
111
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 200089 times.
 200089 if (isnan(d))
112 ✗ return (AVRational) { 0,0 };
113
2/2
✓ Branch 0 taken 8 times.
✓ Branch 1 taken 200081 times.
 200089 if (fabs(d) > INT_MAX + 3LL)
114
2/2
✓ Branch 0 taken 4 times.
✓ Branch 1 taken 4 times.
 8 return (AVRational) { d < 0 ? -1 : 1, 0 };
115 200081 frexp(d, &exponent);
116 200081 exponent = FFMAX(exponent-1, 0);
117 200081 den = 1LL << (62 - exponent);
118 // (int64_t)rint() and llrint() do not work with gcc on ia64 and sparc64,
119 // see Ticket2713 for affected gcc/glibc versions
120 200081 av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, max);
121
122 200081 return a;
123 }
124
125 33830 int av_nearer_q(AVRational q, AVRational q1, AVRational q2)
126 {
127 /* n/d is q, a/b is the median between q1 and q2 */
128 33830 int64_t a = q1.num * (int64_t)q2.den + q2.num * (int64_t)q1.den;
129 33830 int64_t b = 2 * (int64_t)q1.den * q2.den;
130
131 /* rnd_up(a*d/b) > n => a*d/b > n */
132 33830 int64_t x_up = av_rescale_rnd(a, q.den, b, AV_ROUND_UP);
133
134 /* rnd_down(a*d/b) < n => a*d/b < n */
135 33830 int64_t x_down = av_rescale_rnd(a, q.den, b, AV_ROUND_DOWN);
136
137 33830 return ((x_up > q.num) - (x_down < q.num)) * av_cmp_q(q2, q1);
138 }
139
140 54 int av_find_nearest_q_idx(AVRational q, const AVRational* q_list)
141 {
142 54 int i, nearest_q_idx = 0;
143
2/2
✓ Branch 0 taken 2809 times.
✓ Branch 1 taken 54 times.
 2863 for (i = 0; q_list[i].den; i++)
144
2/2
✓ Branch 1 taken 660 times.
✓ Branch 2 taken 2149 times.
 2809 if (av_nearer_q(q, q_list[i], q_list[nearest_q_idx]) > 0)
145 660 nearest_q_idx = i;
146
147 54 return nearest_q_idx;
148 }
149
150 1 uint32_t av_q2intfloat(AVRational q) {
151 int64_t n;
152 int shift;
153 1 int sign = 0;
154
155
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
 1 if (q.den < 0) {
156 ✗ q.den *= -1;
157 ✗ q.num *= -1;
158 }
159
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
 1 if (q.num < 0) {
160 ✗ q.num *= -1;
161 ✗ sign = 1;
162 }
163
164
1/4
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
✗ Branch 2 not taken.
✗ Branch 3 not taken.
 1 if (!q.num && !q.den) return 0xFFC00000;
165
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
 1 if (!q.num) return 0;
166
1/2
✗ Branch 0 not taken.
✓ Branch 1 taken 1 times.
 1 if (!q.den) return 0x7F800000 | (q.num & 0x80000000);
167
168 1 shift = 23 + av_log2(q.den) - av_log2(q.num);
169
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
 1 if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);
170 ✗ else n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);
171
172 1 shift -= n >= (1<<24);
173 1 shift += n < (1<<23);
174
175
1/2
✓ Branch 0 taken 1 times.
✗ Branch 1 not taken.
 1 if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);
176 ✗ else n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);
177
178 av_assert1(n < (1<<24));
179 av_assert1(n >= (1<<23));
180
181 1 return sign<<31 | (150-shift)<<23 | (n - (1<<23));
182 }
183
184 46 AVRational av_gcd_q(AVRational a, AVRational b, int max_den, AVRational def)
185 {
186 int64_t gcd, lcm;
187
188 46 gcd = av_gcd(a.den, b.den);
189 46 lcm = (a.den / gcd) * b.den;
190
2/2
✓ Branch 0 taken 44 times.
✓ Branch 1 taken 2 times.
 46 return lcm < max_den ? av_make_q(av_gcd(a.num, b.num), lcm) : def;
191 }
192