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.

293 lines
8.6KB

  1. /*
  2. * Common bit i/o utils
  3. * Copyright (c) 2000, 2001 Fabrice Bellard.
  4. * Copyright (c) 2002-2004 Michael Niedermayer <michaelni@gmx.at>
  5. *
  6. * This library 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 of the License, or (at your option) any later version.
  10. *
  11. * This library 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 this library; if not, write to the Free Software
  18. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  19. *
  20. * alternative bitstream reader & writer by Michael Niedermayer <michaelni@gmx.at>
  21. */
  22. /**
  23. * @file common.c
  24. * common internal api.
  25. */
  26. #include "avcodec.h"
  27. const uint8_t ff_sqrt_tab[128]={
  28. 0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5,
  29. 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
  30. 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9,
  31. 9, 9, 9, 9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11
  32. };
  33. const uint8_t ff_log2_tab[256]={
  34. 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,
  35. 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,
  36. 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,
  37. 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,
  38. 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,
  39. 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,
  40. 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,
  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. };
  43. void align_put_bits(PutBitContext *s)
  44. {
  45. #ifdef ALT_BITSTREAM_WRITER
  46. put_bits(s,( - s->index) & 7,0);
  47. #else
  48. put_bits(s,s->bit_left & 7,0);
  49. #endif
  50. }
  51. void put_string(PutBitContext * pbc, char *s, int put_zero)
  52. {
  53. while(*s){
  54. put_bits(pbc, 8, *s);
  55. s++;
  56. }
  57. if(put_zero)
  58. put_bits(pbc, 8, 0);
  59. }
  60. /* bit input functions */
  61. /**
  62. * reads 0-32 bits.
  63. */
  64. unsigned int get_bits_long(GetBitContext *s, int n){
  65. if(n<=17) return get_bits(s, n);
  66. else{
  67. int ret= get_bits(s, 16) << (n-16);
  68. return ret | get_bits(s, n-16);
  69. }
  70. }
  71. /**
  72. * shows 0-32 bits.
  73. */
  74. unsigned int show_bits_long(GetBitContext *s, int n){
  75. if(n<=17) return show_bits(s, n);
  76. else{
  77. GetBitContext gb= *s;
  78. int ret= get_bits_long(s, n);
  79. *s= gb;
  80. return ret;
  81. }
  82. }
  83. void align_get_bits(GetBitContext *s)
  84. {
  85. int n= (-get_bits_count(s)) & 7;
  86. if(n) skip_bits(s, n);
  87. }
  88. int check_marker(GetBitContext *s, const char *msg)
  89. {
  90. int bit= get_bits1(s);
  91. if(!bit)
  92. av_log(NULL, AV_LOG_INFO, "Marker bit missing %s\n", msg);
  93. return bit;
  94. }
  95. /* VLC decoding */
  96. //#define DEBUG_VLC
  97. #define GET_DATA(v, table, i, wrap, size) \
  98. {\
  99. const uint8_t *ptr = (const uint8_t *)table + i * wrap;\
  100. switch(size) {\
  101. case 1:\
  102. v = *(const uint8_t *)ptr;\
  103. break;\
  104. case 2:\
  105. v = *(const uint16_t *)ptr;\
  106. break;\
  107. default:\
  108. v = *(const uint32_t *)ptr;\
  109. break;\
  110. }\
  111. }
  112. static int alloc_table(VLC *vlc, int size)
  113. {
  114. int index;
  115. index = vlc->table_size;
  116. vlc->table_size += size;
  117. if (vlc->table_size > vlc->table_allocated) {
  118. vlc->table_allocated += (1 << vlc->bits);
  119. vlc->table = av_realloc(vlc->table,
  120. sizeof(VLC_TYPE) * 2 * vlc->table_allocated);
  121. if (!vlc->table)
  122. return -1;
  123. }
  124. return index;
  125. }
  126. static int build_table(VLC *vlc, int table_nb_bits,
  127. int nb_codes,
  128. const void *bits, int bits_wrap, int bits_size,
  129. const void *codes, int codes_wrap, int codes_size,
  130. uint32_t code_prefix, int n_prefix)
  131. {
  132. int i, j, k, n, table_size, table_index, nb, n1, index;
  133. uint32_t code;
  134. VLC_TYPE (*table)[2];
  135. table_size = 1 << table_nb_bits;
  136. table_index = alloc_table(vlc, table_size);
  137. #ifdef DEBUG_VLC
  138. printf("new table index=%d size=%d code_prefix=%x n=%d\n",
  139. table_index, table_size, code_prefix, n_prefix);
  140. #endif
  141. if (table_index < 0)
  142. return -1;
  143. table = &vlc->table[table_index];
  144. for(i=0;i<table_size;i++) {
  145. table[i][1] = 0; //bits
  146. table[i][0] = -1; //codes
  147. }
  148. /* first pass: map codes and compute auxillary table sizes */
  149. for(i=0;i<nb_codes;i++) {
  150. GET_DATA(n, bits, i, bits_wrap, bits_size);
  151. GET_DATA(code, codes, i, codes_wrap, codes_size);
  152. /* we accept tables with holes */
  153. if (n <= 0)
  154. continue;
  155. #if defined(DEBUG_VLC) && 0
  156. printf("i=%d n=%d code=0x%x\n", i, n, code);
  157. #endif
  158. /* if code matches the prefix, it is in the table */
  159. n -= n_prefix;
  160. if (n > 0 && (code >> n) == code_prefix) {
  161. if (n <= table_nb_bits) {
  162. /* no need to add another table */
  163. j = (code << (table_nb_bits - n)) & (table_size - 1);
  164. nb = 1 << (table_nb_bits - n);
  165. for(k=0;k<nb;k++) {
  166. #ifdef DEBUG_VLC
  167. av_log(NULL, AV_LOG_DEBUG, "%4x: code=%d n=%d\n",
  168. j, i, n);
  169. #endif
  170. if (table[j][1] /*bits*/ != 0) {
  171. av_log(NULL, AV_LOG_ERROR, "incorrect codes\n");
  172. av_abort();
  173. }
  174. table[j][1] = n; //bits
  175. table[j][0] = i; //code
  176. j++;
  177. }
  178. } else {
  179. n -= table_nb_bits;
  180. j = (code >> n) & ((1 << table_nb_bits) - 1);
  181. #ifdef DEBUG_VLC
  182. printf("%4x: n=%d (subtable)\n",
  183. j, n);
  184. #endif
  185. /* compute table size */
  186. n1 = -table[j][1]; //bits
  187. if (n > n1)
  188. n1 = n;
  189. table[j][1] = -n1; //bits
  190. }
  191. }
  192. }
  193. /* second pass : fill auxillary tables recursively */
  194. for(i=0;i<table_size;i++) {
  195. n = table[i][1]; //bits
  196. if (n < 0) {
  197. n = -n;
  198. if (n > table_nb_bits) {
  199. n = table_nb_bits;
  200. table[i][1] = -n; //bits
  201. }
  202. index = build_table(vlc, n, nb_codes,
  203. bits, bits_wrap, bits_size,
  204. codes, codes_wrap, codes_size,
  205. (code_prefix << table_nb_bits) | i,
  206. n_prefix + table_nb_bits);
  207. if (index < 0)
  208. return -1;
  209. /* note: realloc has been done, so reload tables */
  210. table = &vlc->table[table_index];
  211. table[i][0] = index; //code
  212. }
  213. }
  214. return table_index;
  215. }
  216. /* Build VLC decoding tables suitable for use with get_vlc().
  217. 'nb_bits' set thee decoding table size (2^nb_bits) entries. The
  218. bigger it is, the faster is the decoding. But it should not be too
  219. big to save memory and L1 cache. '9' is a good compromise.
  220. 'nb_codes' : number of vlcs codes
  221. 'bits' : table which gives the size (in bits) of each vlc code.
  222. 'codes' : table which gives the bit pattern of of each vlc code.
  223. 'xxx_wrap' : give the number of bytes between each entry of the
  224. 'bits' or 'codes' tables.
  225. 'xxx_size' : gives the number of bytes of each entry of the 'bits'
  226. or 'codes' tables.
  227. 'wrap' and 'size' allows to use any memory configuration and types
  228. (byte/word/long) to store the 'bits' and 'codes' tables.
  229. */
  230. int init_vlc(VLC *vlc, int nb_bits, int nb_codes,
  231. const void *bits, int bits_wrap, int bits_size,
  232. const void *codes, int codes_wrap, int codes_size)
  233. {
  234. vlc->bits = nb_bits;
  235. vlc->table = NULL;
  236. vlc->table_allocated = 0;
  237. vlc->table_size = 0;
  238. #ifdef DEBUG_VLC
  239. printf("build table nb_codes=%d\n", nb_codes);
  240. #endif
  241. if (build_table(vlc, nb_bits, nb_codes,
  242. bits, bits_wrap, bits_size,
  243. codes, codes_wrap, codes_size,
  244. 0, 0) < 0) {
  245. av_free(vlc->table);
  246. return -1;
  247. }
  248. return 0;
  249. }
  250. void free_vlc(VLC *vlc)
  251. {
  252. av_free(vlc->table);
  253. }
  254. int64_t ff_gcd(int64_t a, int64_t b){
  255. if(b) return ff_gcd(b, a%b);
  256. else return a;
  257. }