mathematics.h 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129
  1. /*
  2. * copyright (c) 2005 Michael Niedermayer <michaelni@gmx.at>
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with FFmpeg; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. #ifndef AVUTIL_MATHEMATICS_H
  21. #define AVUTIL_MATHEMATICS_H
  22. #include <stdint.h>
  23. #include <math.h>
  24. #include "attributes.h"
  25. #include "rational.h"
  26. #include "intfloat.h"
  27. #ifndef M_E
  28. #define M_E 2.7182818284590452354 /* e */
  29. #endif
  30. #ifndef M_LN2
  31. #define M_LN2 0.69314718055994530942 /* log_e 2 */
  32. #endif
  33. #ifndef M_LN10
  34. #define M_LN10 2.30258509299404568402 /* log_e 10 */
  35. #endif
  36. #ifndef M_LOG2_10
  37. #define M_LOG2_10 3.32192809488736234787 /* log_2 10 */
  38. #endif
  39. #ifndef M_PHI
  40. #define M_PHI 1.61803398874989484820 /* phi / golden ratio */
  41. #endif
  42. #ifndef M_PI
  43. #define M_PI 3.14159265358979323846 /* pi */
  44. #endif
  45. #ifndef M_SQRT1_2
  46. #define M_SQRT1_2 0.70710678118654752440 /* 1/sqrt(2) */
  47. #endif
  48. #ifndef M_SQRT2
  49. #define M_SQRT2 1.41421356237309504880 /* sqrt(2) */
  50. #endif
  51. #ifndef NAN
  52. #define NAN av_int2float(0x7fc00000)
  53. #endif
  54. #ifndef INFINITY
  55. #define INFINITY av_int2float(0x7f800000)
  56. #endif
  57. /**
  58. * @addtogroup lavu_math
  59. * @{
  60. */
  61. enum AVRounding {
  62. AV_ROUND_ZERO = 0, ///< Round toward zero.
  63. AV_ROUND_INF = 1, ///< Round away from zero.
  64. AV_ROUND_DOWN = 2, ///< Round toward -infinity.
  65. AV_ROUND_UP = 3, ///< Round toward +infinity.
  66. AV_ROUND_NEAR_INF = 5, ///< Round to nearest and halfway cases away from zero.
  67. };
  68. /**
  69. * Return the greatest common divisor of a and b.
  70. * If both a and b are 0 or either or both are <0 then behavior is
  71. * undefined.
  72. */
  73. int64_t av_const av_gcd(int64_t a, int64_t b);
  74. /**
  75. * Rescale a 64-bit integer with rounding to nearest.
  76. * A simple a*b/c isn't possible as it can overflow.
  77. */
  78. int64_t av_rescale(int64_t a, int64_t b, int64_t c) av_const;
  79. /**
  80. * Rescale a 64-bit integer with specified rounding.
  81. * A simple a*b/c isn't possible as it can overflow.
  82. */
  83. int64_t av_rescale_rnd(int64_t a, int64_t b, int64_t c, enum AVRounding) av_const;
  84. /**
  85. * Rescale a 64-bit integer by 2 rational numbers.
  86. */
  87. int64_t av_rescale_q(int64_t a, AVRational bq, AVRational cq) av_const;
  88. /**
  89. * Rescale a 64-bit integer by 2 rational numbers with specified rounding.
  90. */
  91. int64_t av_rescale_q_rnd(int64_t a, AVRational bq, AVRational cq,
  92. enum AVRounding) av_const;
  93. /**
  94. * Compare 2 timestamps each in its own timebases.
  95. * The result of the function is undefined if one of the timestamps
  96. * is outside the int64_t range when represented in the others timebase.
  97. * @return -1 if ts_a is before ts_b, 1 if ts_a is after ts_b or 0 if they represent the same position
  98. */
  99. int av_compare_ts(int64_t ts_a, AVRational tb_a, int64_t ts_b, AVRational tb_b);
  100. /**
  101. * Compare 2 integers modulo mod.
  102. * That is we compare integers a and b for which only the least
  103. * significant log2(mod) bits are known.
  104. *
  105. * @param mod must be a power of 2
  106. * @return a negative value if a is smaller than b
  107. * a positive value if a is greater than b
  108. * 0 if a equals b
  109. */
  110. int64_t av_compare_mod(uint64_t a, uint64_t b, uint64_t mod);
  111. /**
  112. * @}
  113. */
  114. #endif /* AVUTIL_MATHEMATICS_H */