You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

112 lines
2.9KB

  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 rational.c
  24. * Rational numbers
  25. * @author Michael Niedermayer <michaelni@gmx.at>
  26. */
  27. //#include <math.h>
  28. #include <limits.h>
  29. #include "common.h"
  30. #include "mathematics.h"
  31. #include "rational.h"
  32. int av_reduce(int *dst_nom, int *dst_den, int64_t nom, int64_t den, int64_t max){
  33. AVRational a0={0,1}, a1={1,0};
  34. int sign= (nom<0) ^ (den<0);
  35. int64_t gcd= ff_gcd(FFABS(nom), FFABS(den));
  36. nom = FFABS(nom)/gcd;
  37. den = FFABS(den)/gcd;
  38. if(nom<=max && den<=max){
  39. a1= (AVRational){nom, den};
  40. den=0;
  41. }
  42. while(den){
  43. int64_t x = nom / den;
  44. int64_t next_den= nom - den*x;
  45. int64_t a2n= x*a1.num + a0.num;
  46. int64_t a2d= x*a1.den + a0.den;
  47. if(a2n > max || a2d > max) break;
  48. a0= a1;
  49. a1= (AVRational){a2n, a2d};
  50. nom= den;
  51. den= next_den;
  52. }
  53. assert(ff_gcd(a1.num, a1.den) == 1);
  54. *dst_nom = sign ? -a1.num : a1.num;
  55. *dst_den = a1.den;
  56. return den==0;
  57. }
  58. /**
  59. * returns b*c.
  60. */
  61. AVRational av_mul_q(AVRational b, AVRational c){
  62. av_reduce(&b.num, &b.den, b.num * (int64_t)c.num, b.den * (int64_t)c.den, INT_MAX);
  63. return b;
  64. }
  65. /**
  66. * returns b/c.
  67. */
  68. AVRational av_div_q(AVRational b, AVRational c){
  69. return av_mul_q(b, (AVRational){c.den, c.num});
  70. }
  71. /**
  72. * returns b+c.
  73. */
  74. AVRational av_add_q(AVRational b, AVRational c){
  75. av_reduce(&b.num, &b.den, b.num * (int64_t)c.den + c.num * (int64_t)b.den, b.den * (int64_t)c.den, INT_MAX);
  76. return b;
  77. }
  78. /**
  79. * returns b-c.
  80. */
  81. AVRational av_sub_q(AVRational b, AVRational c){
  82. return av_add_q(b, (AVRational){-c.num, c.den});
  83. }
  84. /**
  85. * Converts a double precission floating point number to a AVRational.
  86. * @param max the maximum allowed numerator and denominator
  87. */
  88. AVRational av_d2q(double d, int max){
  89. AVRational a;
  90. #define LOG2 0.69314718055994530941723212145817656807550013436025
  91. int exponent= FFMAX( (int)(log(fabs(d) + 1e-20)/LOG2), 0);
  92. int64_t den= 1LL << (61 - exponent);
  93. av_reduce(&a.num, &a.den, (int64_t)(d * den + 0.5), den, max);
  94. return a;
  95. }