mathematics.c 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  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. /**
  21. * @file mathematics.c
  22. * Miscellaneous math routines and tables.
  23. */
  24. #include "common.h"
  25. #include "mathematics.h"
  26. const uint8_t ff_sqrt_tab[256]={
  27. 0, 16, 23, 28, 32, 36, 40, 43, 46, 48, 51, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 77, 79, 80, 82, 84, 85, 87, 88, 90,
  28. 91, 92, 94, 95, 96, 98, 99,100,102,103,104,105,107,108,109,110,111,112,114,115,116,117,118,119,120,121,122,123,124,125,126,127,
  29. 128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,144,145,146,147,148,149,150,151,151,152,153,154,155,156,156,
  30. 157,158,159,160,160,161,162,163,164,164,165,166,167,168,168,169,170,171,171,172,173,174,174,175,176,176,177,178,179,179,180,181,
  31. 182,182,183,184,184,185,186,186,187,188,188,189,190,190,191,192,192,193,194,194,195,196,196,197,198,198,199,200,200,201,202,202,
  32. 203,204,204,205,205,206,207,207,208,208,209,210,210,211,212,212,213,213,214,215,215,216,216,217,218,218,219,219,220,220,221,222,
  33. 222,223,223,224,224,225,226,226,227,227,228,228,229,230,230,231,231,232,232,233,233,234,235,235,236,236,237,237,238,238,239,239,
  34. 240,240,241,242,242,243,243,244,244,245,245,246,246,247,247,248,248,249,249,250,250,251,251,252,252,253,253,254,254,255,255,255
  35. };
  36. const uint8_t ff_log2_tab[256]={
  37. 0,0,1,1,2,2,2,2,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
  38. 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,
  39. 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
  40. 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,
  41. 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
  42. 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
  43. 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,
  44. 7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7
  45. };
  46. int64_t ff_gcd(int64_t a, int64_t b){
  47. if(b) return ff_gcd(b, a%b);
  48. else return a;
  49. }
  50. int64_t av_rescale_rnd(int64_t a, int64_t b, int64_t c, enum AVRounding rnd){
  51. int64_t r=0;
  52. assert(c > 0);
  53. assert(b >=0);
  54. assert(rnd >=0 && rnd<=5 && rnd!=4);
  55. if(a<0 && a != INT64_MIN) return -av_rescale_rnd(-a, b, c, rnd ^ ((rnd>>1)&1));
  56. if(rnd==AV_ROUND_NEAR_INF) r= c/2;
  57. else if(rnd&1) r= c-1;
  58. if(b<=INT_MAX && c<=INT_MAX){
  59. if(a<=INT_MAX)
  60. return (a * b + r)/c;
  61. else
  62. return a/c*b + (a%c*b + r)/c;
  63. }else{
  64. #if 1
  65. uint64_t a0= a&0xFFFFFFFF;
  66. uint64_t a1= a>>32;
  67. uint64_t b0= b&0xFFFFFFFF;
  68. uint64_t b1= b>>32;
  69. uint64_t t1= a0*b1 + a1*b0;
  70. uint64_t t1a= t1<<32;
  71. int i;
  72. a0 = a0*b0 + t1a;
  73. a1 = a1*b1 + (t1>>32) + (a0<t1a);
  74. a0 += r;
  75. a1 += a0<r;
  76. for(i=63; i>=0; i--){
  77. // int o= a1 & 0x8000000000000000ULL;
  78. a1+= a1 + ((a0>>i)&1);
  79. t1+=t1;
  80. if(/*o || */c <= a1){
  81. a1 -= c;
  82. t1++;
  83. }
  84. }
  85. return t1;
  86. }
  87. #else
  88. AVInteger ai;
  89. ai= av_mul_i(av_int2i(a), av_int2i(b));
  90. ai= av_add_i(ai, av_int2i(r));
  91. return av_i2int(av_div_i(ai, av_int2i(c)));
  92. }
  93. #endif
  94. }
  95. int64_t av_rescale(int64_t a, int64_t b, int64_t c){
  96. return av_rescale_rnd(a, b, c, AV_ROUND_NEAR_INF);
  97. }
  98. int64_t av_rescale_q(int64_t a, AVRational bq, AVRational cq){
  99. int64_t b= bq.num * (int64_t)cq.den;
  100. int64_t c= cq.num * (int64_t)bq.den;
  101. return av_rescale_rnd(a, b, c, AV_ROUND_NEAR_INF);
  102. }
  103. #ifdef TEST
  104. #include "integer.h"
  105. #undef printf
  106. int main(void){
  107. int64_t a,b,c,d,e;
  108. for(a=7; a<(1LL<<62); a+=a/3+1){
  109. for(b=3; b<(1LL<<62); b+=b/4+1){
  110. for(c=9; c<(1LL<<62); c+=(c*2)/5+3){
  111. int64_t r= c/2;
  112. AVInteger ai;
  113. ai= av_mul_i(av_int2i(a), av_int2i(b));
  114. ai= av_add_i(ai, av_int2i(r));
  115. d= av_i2int(av_div_i(ai, av_int2i(c)));
  116. e= av_rescale(a,b,c);
  117. if((double)a * (double)b / (double)c > (1LL<<63))
  118. continue;
  119. if(d!=e) printf("%"PRId64"*%"PRId64"/%"PRId64"= %"PRId64"=%"PRId64"\n", a, b, c, d, e);
  120. }
  121. }
  122. }
  123. return 0;
  124. }
  125. #endif