integer.c 5.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197
  1. /*
  2. * arbitrary precision integers
  3. * Copyright (c) 2004 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 libavutil/integer.c
  23. * arbitrary precision integers
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #include "common.h"
  27. #include "integer.h"
  28. AVInteger av_add_i(AVInteger a, AVInteger b){
  29. int i, carry=0;
  30. for(i=0; i<AV_INTEGER_SIZE; i++){
  31. carry= (carry>>16) + a.v[i] + b.v[i];
  32. a.v[i]= carry;
  33. }
  34. return a;
  35. }
  36. AVInteger av_sub_i(AVInteger a, AVInteger b){
  37. int i, carry=0;
  38. for(i=0; i<AV_INTEGER_SIZE; i++){
  39. carry= (carry>>16) + a.v[i] - b.v[i];
  40. a.v[i]= carry;
  41. }
  42. return a;
  43. }
  44. int av_log2_i(AVInteger a){
  45. int i;
  46. for(i=AV_INTEGER_SIZE-1; i>=0; i--){
  47. if(a.v[i])
  48. return av_log2_16bit(a.v[i]) + 16*i;
  49. }
  50. return -1;
  51. }
  52. AVInteger av_mul_i(AVInteger a, AVInteger b){
  53. AVInteger out;
  54. int i, j;
  55. int na= (av_log2_i(a)+16) >> 4;
  56. int nb= (av_log2_i(b)+16) >> 4;
  57. memset(&out, 0, sizeof(out));
  58. for(i=0; i<na; i++){
  59. unsigned int carry=0;
  60. if(a.v[i])
  61. for(j=i; j<AV_INTEGER_SIZE && j-i<=nb; j++){
  62. carry= (carry>>16) + out.v[j] + a.v[i]*b.v[j-i];
  63. out.v[j]= carry;
  64. }
  65. }
  66. return out;
  67. }
  68. int av_cmp_i(AVInteger a, AVInteger b){
  69. int i;
  70. int v= (int16_t)a.v[AV_INTEGER_SIZE-1] - (int16_t)b.v[AV_INTEGER_SIZE-1];
  71. if(v) return (v>>16)|1;
  72. for(i=AV_INTEGER_SIZE-2; i>=0; i--){
  73. int v= a.v[i] - b.v[i];
  74. if(v) return (v>>16)|1;
  75. }
  76. return 0;
  77. }
  78. AVInteger av_shr_i(AVInteger a, int s){
  79. AVInteger out;
  80. int i;
  81. for(i=0; i<AV_INTEGER_SIZE; i++){
  82. unsigned int index= i + (s>>4);
  83. unsigned int v=0;
  84. if(index+1<AV_INTEGER_SIZE) v = a.v[index+1]<<16;
  85. if(index <AV_INTEGER_SIZE) v+= a.v[index ];
  86. out.v[i]= v >> (s&15);
  87. }
  88. return out;
  89. }
  90. AVInteger av_mod_i(AVInteger *quot, AVInteger a, AVInteger b){
  91. int i= av_log2_i(a) - av_log2_i(b);
  92. AVInteger quot_temp;
  93. if(!quot) quot = &quot_temp;
  94. assert((int16_t)a[AV_INTEGER_SIZE-1] >= 0 && (int16_t)b[AV_INTEGER_SIZE-1] >= 0);
  95. assert(av_log2(b)>=0);
  96. if(i > 0)
  97. b= av_shr_i(b, -i);
  98. memset(quot, 0, sizeof(AVInteger));
  99. while(i-- >= 0){
  100. *quot= av_shr_i(*quot, -1);
  101. if(av_cmp_i(a, b) >= 0){
  102. a= av_sub_i(a, b);
  103. quot->v[0] += 1;
  104. }
  105. b= av_shr_i(b, 1);
  106. }
  107. return a;
  108. }
  109. AVInteger av_div_i(AVInteger a, AVInteger b){
  110. AVInteger quot;
  111. av_mod_i(&quot, a, b);
  112. return quot;
  113. }
  114. AVInteger av_int2i(int64_t a){
  115. AVInteger out;
  116. int i;
  117. for(i=0; i<AV_INTEGER_SIZE; i++){
  118. out.v[i]= a;
  119. a>>=16;
  120. }
  121. return out;
  122. }
  123. int64_t av_i2int(AVInteger a){
  124. int i;
  125. int64_t out=(int8_t)a.v[AV_INTEGER_SIZE-1];
  126. for(i= AV_INTEGER_SIZE-2; i>=0; i--){
  127. out = (out<<16) + a.v[i];
  128. }
  129. return out;
  130. }
  131. #ifdef TEST
  132. #undef NDEBUG
  133. #include <assert.h>
  134. const uint8_t ff_log2_tab[256]={
  135. 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,
  136. 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,
  137. 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,
  138. 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,
  139. 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,
  140. 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,
  141. 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,
  142. 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
  143. };
  144. int main(void){
  145. int64_t a,b;
  146. for(a=7; a<256*256*256; a+=13215){
  147. for(b=3; b<256*256*256; b+=27118){
  148. AVInteger ai= av_int2i(a);
  149. AVInteger bi= av_int2i(b);
  150. assert(av_i2int(ai) == a);
  151. assert(av_i2int(bi) == b);
  152. assert(av_i2int(av_add_i(ai,bi)) == a+b);
  153. assert(av_i2int(av_sub_i(ai,bi)) == a-b);
  154. assert(av_i2int(av_mul_i(ai,bi)) == a*b);
  155. assert(av_i2int(av_shr_i(ai, 9)) == a>>9);
  156. assert(av_i2int(av_shr_i(ai,-9)) == a<<9);
  157. assert(av_i2int(av_shr_i(ai, 17)) == a>>17);
  158. assert(av_i2int(av_shr_i(ai,-17)) == a<<17);
  159. assert(av_log2_i(ai) == av_log2(a));
  160. assert(av_i2int(av_div_i(ai,bi)) == a/b);
  161. }
  162. }
  163. return 0;
  164. }
  165. #endif