rational.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206
  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. * @file
  23. * rational numbers
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #include "avassert.h"
  27. #include <limits.h>
  28. #include "common.h"
  29. #include "mathematics.h"
  30. #include "rational.h"
  31. int av_reduce(int *dst_num, int *dst_den,
  32. int64_t num, int64_t den, int64_t max)
  33. {
  34. AVRational a0 = { 0, 1 }, a1 = { 1, 0 };
  35. int sign = (num < 0) ^ (den < 0);
  36. int64_t gcd = av_gcd(FFABS(num), FFABS(den));
  37. if (gcd) {
  38. num = FFABS(num) / gcd;
  39. den = FFABS(den) / gcd;
  40. }
  41. if (num <= max && den <= max) {
  42. a1 = (AVRational) { num, den };
  43. den = 0;
  44. }
  45. while (den) {
  46. uint64_t x = num / den;
  47. int64_t next_den = num - den * x;
  48. int64_t a2n = x * a1.num + a0.num;
  49. int64_t a2d = x * a1.den + a0.den;
  50. if (a2n > max || a2d > max) {
  51. if (a1.num) x = (max - a0.num) / a1.num;
  52. if (a1.den) x = FFMIN(x, (max - a0.den) / a1.den);
  53. if (den * (2 * x * a1.den + a0.den) > num * a1.den)
  54. a1 = (AVRational) { x * a1.num + a0.num, x * a1.den + a0.den };
  55. break;
  56. }
  57. a0 = a1;
  58. a1 = (AVRational) { a2n, a2d };
  59. num = den;
  60. den = next_den;
  61. }
  62. av_assert2(av_gcd(a1.num, a1.den) <= 1U);
  63. *dst_num = sign ? -a1.num : a1.num;
  64. *dst_den = a1.den;
  65. return den == 0;
  66. }
  67. AVRational av_mul_q(AVRational b, AVRational c)
  68. {
  69. av_reduce(&b.num, &b.den,
  70. b.num * (int64_t) c.num,
  71. b.den * (int64_t) c.den, INT_MAX);
  72. return b;
  73. }
  74. AVRational av_div_q(AVRational b, AVRational c)
  75. {
  76. return av_mul_q(b, (AVRational) { c.den, c.num });
  77. }
  78. AVRational av_add_q(AVRational b, AVRational c) {
  79. av_reduce(&b.num, &b.den,
  80. b.num * (int64_t) c.den +
  81. c.num * (int64_t) b.den,
  82. b.den * (int64_t) c.den, INT_MAX);
  83. return b;
  84. }
  85. AVRational av_sub_q(AVRational b, AVRational c)
  86. {
  87. return av_add_q(b, (AVRational) { -c.num, c.den });
  88. }
  89. AVRational av_d2q(double d, int max)
  90. {
  91. AVRational a;
  92. #define LOG2 0.69314718055994530941723212145817656807550013436025
  93. int exponent;
  94. int64_t den;
  95. if (isnan(d))
  96. return (AVRational) { 0,0 };
  97. if (fabs(d) > INT_MAX + 3LL)
  98. return (AVRational) { d < 0 ? -1 : 1, 0 };
  99. exponent = FFMAX( (int)(log(fabs(d) + 1e-20)/LOG2), 0);
  100. den = 1LL << (61 - exponent);
  101. // (int64_t)rint() and llrint() do not work with gcc on ia64 and sparc64
  102. av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, max);
  103. if ((!a.num || !a.den) && d && max>0 && max<INT_MAX)
  104. av_reduce(&a.num, &a.den, floor(d * den + 0.5), den, INT_MAX);
  105. return a;
  106. }
  107. int av_nearer_q(AVRational q, AVRational q1, AVRational q2)
  108. {
  109. /* n/d is q, a/b is the median between q1 and q2 */
  110. int64_t a = q1.num * (int64_t)q2.den + q2.num * (int64_t)q1.den;
  111. int64_t b = 2 * (int64_t)q1.den * q2.den;
  112. /* rnd_up(a*d/b) > n => a*d/b > n */
  113. int64_t x_up = av_rescale_rnd(a, q.den, b, AV_ROUND_UP);
  114. /* rnd_down(a*d/b) < n => a*d/b < n */
  115. int64_t x_down = av_rescale_rnd(a, q.den, b, AV_ROUND_DOWN);
  116. return ((x_up > q.num) - (x_down < q.num)) * av_cmp_q(q2, q1);
  117. }
  118. int av_find_nearest_q_idx(AVRational q, const AVRational* q_list)
  119. {
  120. int i, nearest_q_idx = 0;
  121. for (i = 0; q_list[i].den; i++)
  122. if (av_nearer_q(q, q_list[i], q_list[nearest_q_idx]) > 0)
  123. nearest_q_idx = i;
  124. return nearest_q_idx;
  125. }
  126. #ifdef TEST
  127. int main(void)
  128. {
  129. AVRational a,b,r;
  130. for (a.num = -2; a.num <= 2; a.num++) {
  131. for (a.den = -2; a.den <= 2; a.den++) {
  132. for (b.num = -2; b.num <= 2; b.num++) {
  133. for (b.den = -2; b.den <= 2; b.den++) {
  134. int c = av_cmp_q(a,b);
  135. double d = av_q2d(a) == av_q2d(b) ?
  136. 0 : (av_q2d(a) - av_q2d(b));
  137. if (d > 0) d = 1;
  138. else if (d < 0) d = -1;
  139. else if (d != d) d = INT_MIN;
  140. if (c != d)
  141. av_log(NULL, AV_LOG_ERROR, "%d/%d %d/%d, %d %f\n", a.num,
  142. a.den, b.num, b.den, c,d);
  143. r = av_sub_q(av_add_q(b,a), b);
  144. if(b.den && (r.num*a.den != a.num*r.den || !r.num != !a.num || !r.den != !a.den))
  145. av_log(NULL, AV_LOG_ERROR, "%d/%d ", r.num, r.den);
  146. }
  147. }
  148. }
  149. }
  150. for (a.num = 1; a.num <= 10; a.num++) {
  151. for (a.den = 1; a.den <= 10; a.den++) {
  152. if (av_gcd(a.num, a.den) > 1)
  153. continue;
  154. for (b.num = 1; b.num <= 10; b.num++) {
  155. for (b.den = 1; b.den <= 10; b.den++) {
  156. int start;
  157. if (av_gcd(b.num, b.den) > 1)
  158. continue;
  159. if (av_cmp_q(b, a) < 0)
  160. continue;
  161. for (start = 0; start < 10 ; start++) {
  162. int acc= start;
  163. int i;
  164. for (i = 0; i<100; i++) {
  165. int exact = start + av_rescale_q(i+1, b, a);
  166. acc = av_add_stable(a, acc, b, 1);
  167. if (FFABS(acc - exact) > 2) {
  168. av_log(NULL, AV_LOG_ERROR, "%d/%d %d/%d, %d %d\n", a.num,
  169. a.den, b.num, b.den, acc, exact);
  170. return 1;
  171. }
  172. }
  173. }
  174. }
  175. }
  176. }
  177. }
  178. return 0;
  179. }
  180. #endif