36               int64_t num, int64_t den, int64_t max)  in av_reduce()  argument
39     int sign = (num < 0) ^ (den < 0);  in av_reduce()
40     int64_t gcd = av_gcd(FFABS(num), FFABS(den));  in av_reduce()
44         den = FFABS(den) / gcd;  in av_reduce()
46     if (num <= max && den <= max) {  in av_reduce()
47         a1 = (AVRational) { num, den };  in av_reduce()
48         den = 0;  in av_reduce()
51     while (den) {  in av_reduce()
52         uint64_t x        = num / den;  in av_reduce()
53         int64_t next_den  = num - den * x;  in av_reduce()
55         int64_t a2d       = x * a1.den + a0.den;  in av_reduce()
59             if (a1.den) x = FFMIN(x, (max - a0.den) / a1.den);  in av_reduce()
61             if (den * (2 * x * a1.den + a0.den) > num * a1.den)  in av_reduce()
62                 a1 = (AVRational) { x * a1.num + a0.num, x * a1.den + a0.den };  in av_reduce()
68         num = den;  in av_reduce()
69         den = next_den;  in av_reduce()
71     av_assert2(av_gcd(a1.num, a1.den) <= 1U);  in av_reduce()
72     av_assert2(a1.num <= max && a1.den <= max);  in av_reduce()
75     *dst_den = a1.den;  in av_reduce()
77     return den == 0;  in av_reduce()
82     av_reduce(&b.num, &b.den,  in av_mul_q()
84                b.den * (int64_t) c.den, INT_MAX);  in av_mul_q()
90     return av_mul_q(b, (AVRational) { c.den, c.num });  in av_div_q()
94     av_reduce(&b.num, &b.den,  in av_add_q()
95                b.num * (int64_t) c.den +  in av_add_q()
96                c.num * (int64_t) b.den,  in av_add_q()
97                b.den * (int64_t) c.den, INT_MAX);  in av_add_q()
103     return av_add_q(b, (AVRational) { -c.num, c.den });  in av_sub_q()
110     int64_t den;  in av_d2q()  local
117     den = 1LL << (61 - exponent);  in av_d2q()
120     av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, max);  in av_d2q()
121     if ((!a.num || !a.den) && d && max>0 && max<INT_MAX)  in av_d2q()
122         av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, INT_MAX);  in av_d2q()
130     int64_t a = q1.num * (int64_t)q2.den + q2.num * (int64_t)q1.den;  in av_nearer_q()
131     int64_t b = 2 * (int64_t)q1.den * q2.den;  in av_nearer_q()
134     int64_t x_up = av_rescale_rnd(a, q.den, b, AV_ROUND_UP);  in av_nearer_q()
137     int64_t x_down = av_rescale_rnd(a, q.den, b, AV_ROUND_DOWN);  in av_nearer_q()
145     for (i = 0; q_list[i].den; i++)  in av_find_nearest_q_idx()
157     if (q.den < 0) {  in av_q2intfloat()
158         q.den *= -1;  in av_q2intfloat()
166     if (!q.num && !q.den) return 0xFFC00000;  in av_q2intfloat()
168     if (!q.den) return 0x7F800000 | (q.num & 0x80000000);  in av_q2intfloat()
170     shift = 23 + av_log2(q.den) - av_log2(q.num);  in av_q2intfloat()
171     if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);  in av_q2intfloat()
172     else            n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);  in av_q2intfloat()
177     if (shift >= 0) n = av_rescale(q.num, 1LL<<shift, q.den);  in av_q2intfloat()
178     else            n = av_rescale(q.num, 1, ((int64_t)q.den) << -shift);  in av_q2intfloat()