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.

403 lines
9.6KB

  1. /*
  2. * exp golomb vlc stuff
  3. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This library is free software; you can redistribute it and/or
  6. * modify it under the terms of the GNU Lesser General Public
  7. * License as published by the Free Software Foundation; either
  8. * version 2 of the License, or (at your option) any later version.
  9. *
  10. * This library is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  13. * Lesser General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU Lesser General Public
  16. * License along with this library; if not, write to the Free Software
  17. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  18. *
  19. */
  20. /**
  21. * @file golomb.h
  22. * @brief
  23. * exp golomb vlc stuff
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #define INVALID_VLC 0x80000000
  27. extern const uint8_t ff_golomb_vlc_len[512];
  28. extern const uint8_t ff_ue_golomb_vlc_code[512];
  29. extern const int8_t ff_se_golomb_vlc_code[512];
  30. extern const uint8_t ff_ue_golomb_len[256];
  31. extern const uint8_t ff_interleaved_golomb_vlc_len[256];
  32. extern const uint8_t ff_interleaved_ue_golomb_vlc_code[256];
  33. extern const int8_t ff_interleaved_se_golomb_vlc_code[256];
  34. /**
  35. * read unsigned exp golomb code.
  36. */
  37. static inline int get_ue_golomb(GetBitContext *gb){
  38. unsigned int buf;
  39. int log;
  40. OPEN_READER(re, gb);
  41. UPDATE_CACHE(re, gb);
  42. buf=GET_CACHE(re, gb);
  43. if(buf >= (1<<27)){
  44. buf >>= 32 - 9;
  45. LAST_SKIP_BITS(re, gb, ff_golomb_vlc_len[buf]);
  46. CLOSE_READER(re, gb);
  47. return ff_ue_golomb_vlc_code[buf];
  48. }else{
  49. log= 2*av_log2(buf) - 31;
  50. buf>>= log;
  51. buf--;
  52. LAST_SKIP_BITS(re, gb, 32 - log);
  53. CLOSE_READER(re, gb);
  54. return buf;
  55. }
  56. }
  57. static inline int svq3_get_ue_golomb(GetBitContext *gb){
  58. uint32_t buf;
  59. int log;
  60. OPEN_READER(re, gb);
  61. UPDATE_CACHE(re, gb);
  62. buf=GET_CACHE(re, gb);
  63. if(buf&0xAA800000){
  64. buf >>= 32 - 8;
  65. LAST_SKIP_BITS(re, gb, ff_interleaved_golomb_vlc_len[buf]);
  66. CLOSE_READER(re, gb);
  67. return ff_interleaved_ue_golomb_vlc_code[buf];
  68. }else{
  69. buf|=1;
  70. if((buf & 0xAAAAAAAA) == 0)
  71. return INVALID_VLC;
  72. for(log=31; (buf & 0x80000000) == 0; log--){
  73. buf = (buf << 2) - ((buf << log) >> (log - 1)) + (buf >> 30);
  74. }
  75. LAST_SKIP_BITS(re, gb, 63 - 2*log);
  76. CLOSE_READER(re, gb);
  77. return ((buf << log) >> log) - 1;
  78. }
  79. }
  80. /**
  81. * read unsigned truncated exp golomb code.
  82. */
  83. static inline int get_te0_golomb(GetBitContext *gb, int range){
  84. assert(range >= 1);
  85. if(range==1) return 0;
  86. else if(range==2) return get_bits1(gb)^1;
  87. else return get_ue_golomb(gb);
  88. }
  89. /**
  90. * read unsigned truncated exp golomb code.
  91. */
  92. static inline int get_te_golomb(GetBitContext *gb, int range){
  93. assert(range >= 1);
  94. if(range==2) return get_bits1(gb)^1;
  95. else return get_ue_golomb(gb);
  96. }
  97. /**
  98. * read signed exp golomb code.
  99. */
  100. static inline int get_se_golomb(GetBitContext *gb){
  101. unsigned int buf;
  102. int log;
  103. OPEN_READER(re, gb);
  104. UPDATE_CACHE(re, gb);
  105. buf=GET_CACHE(re, gb);
  106. if(buf >= (1<<27)){
  107. buf >>= 32 - 9;
  108. LAST_SKIP_BITS(re, gb, ff_golomb_vlc_len[buf]);
  109. CLOSE_READER(re, gb);
  110. return ff_se_golomb_vlc_code[buf];
  111. }else{
  112. log= 2*av_log2(buf) - 31;
  113. buf>>= log;
  114. LAST_SKIP_BITS(re, gb, 32 - log);
  115. CLOSE_READER(re, gb);
  116. if(buf&1) buf= -(buf>>1);
  117. else buf= (buf>>1);
  118. return buf;
  119. }
  120. }
  121. static inline int svq3_get_se_golomb(GetBitContext *gb){
  122. unsigned int buf;
  123. int log;
  124. OPEN_READER(re, gb);
  125. UPDATE_CACHE(re, gb);
  126. buf=GET_CACHE(re, gb);
  127. if(buf&0xAA800000){
  128. buf >>= 32 - 8;
  129. LAST_SKIP_BITS(re, gb, ff_interleaved_golomb_vlc_len[buf]);
  130. CLOSE_READER(re, gb);
  131. return ff_interleaved_se_golomb_vlc_code[buf];
  132. }else{
  133. buf |=1;
  134. if((buf & 0xAAAAAAAA) == 0)
  135. return INVALID_VLC;
  136. for(log=31; (buf & 0x80000000) == 0; log--){
  137. buf = (buf << 2) - ((buf << log) >> (log - 1)) + (buf >> 30);
  138. }
  139. LAST_SKIP_BITS(re, gb, 63 - 2*log);
  140. CLOSE_READER(re, gb);
  141. return (signed) (((((buf << log) >> log) - 1) ^ -(buf & 0x1)) + 1) >> 1;
  142. }
  143. }
  144. /**
  145. * read unsigned golomb rice code (ffv1).
  146. */
  147. static inline int get_ur_golomb(GetBitContext *gb, int k, int limit, int esc_len){
  148. unsigned int buf;
  149. int log;
  150. OPEN_READER(re, gb);
  151. UPDATE_CACHE(re, gb);
  152. buf=GET_CACHE(re, gb);
  153. log= av_log2(buf);
  154. if(log > 31-limit){
  155. buf >>= log - k;
  156. buf += (30-log)<<k;
  157. LAST_SKIP_BITS(re, gb, 32 + k - log);
  158. CLOSE_READER(re, gb);
  159. return buf;
  160. }else{
  161. buf >>= 32 - limit - esc_len;
  162. LAST_SKIP_BITS(re, gb, esc_len + limit);
  163. CLOSE_READER(re, gb);
  164. return buf + limit - 1;
  165. }
  166. }
  167. /**
  168. * read unsigned golomb rice code (jpegls).
  169. */
  170. static inline int get_ur_golomb_jpegls(GetBitContext *gb, int k, int limit, int esc_len){
  171. unsigned int buf;
  172. int log;
  173. OPEN_READER(re, gb);
  174. UPDATE_CACHE(re, gb);
  175. buf=GET_CACHE(re, gb);
  176. log= av_log2(buf);
  177. if(log > 31-11){
  178. buf >>= log - k;
  179. buf += (30-log)<<k;
  180. LAST_SKIP_BITS(re, gb, 32 + k - log);
  181. CLOSE_READER(re, gb);
  182. return buf;
  183. }else{
  184. int i;
  185. for(i=0; SHOW_UBITS(re, gb, 1) == 0; i++){
  186. LAST_SKIP_BITS(re, gb, 1);
  187. UPDATE_CACHE(re, gb);
  188. }
  189. SKIP_BITS(re, gb, 1);
  190. if(i < limit - 1){
  191. if(k){
  192. buf = SHOW_UBITS(re, gb, k);
  193. LAST_SKIP_BITS(re, gb, k);
  194. }else{
  195. buf=0;
  196. }
  197. CLOSE_READER(re, gb);
  198. return buf + (i<<k);
  199. }else if(i == limit - 1){
  200. buf = SHOW_UBITS(re, gb, esc_len);
  201. LAST_SKIP_BITS(re, gb, esc_len);
  202. CLOSE_READER(re, gb);
  203. return buf + 1;
  204. }else
  205. return -1;
  206. }
  207. }
  208. /**
  209. * read unsigned golomb rice code (flac).
  210. */
  211. static inline int get_sr_golomb_flac(GetBitContext *gb, int k, int limit, int esc_len){
  212. int v= get_ur_golomb_jpegls(gb, k, limit, esc_len);
  213. return (v>>1) ^ -(v&1);
  214. }
  215. #ifdef TRACE
  216. static inline int get_ue(GetBitContext *s, char *file, char *func, int line){
  217. int show= show_bits(s, 24);
  218. int pos= get_bits_count(s);
  219. int i= get_ue_golomb(s);
  220. int len= get_bits_count(s) - pos;
  221. int bits= show>>(24-len);
  222. print_bin(bits, len);
  223. printf("%5d %2d %3d ue @%5d in %s %s:%d\n", bits, len, i, pos, file, func, line);
  224. return i;
  225. }
  226. static inline int get_se(GetBitContext *s, char *file, char *func, int line){
  227. int show= show_bits(s, 24);
  228. int pos= get_bits_count(s);
  229. int i= get_se_golomb(s);
  230. int len= get_bits_count(s) - pos;
  231. int bits= show>>(24-len);
  232. print_bin(bits, len);
  233. printf("%5d %2d %3d se @%5d in %s %s:%d\n", bits, len, i, pos, file, func, line);
  234. return i;
  235. }
  236. static inline int get_te(GetBitContext *s, int r, char *file, char *func, int line){
  237. int show= show_bits(s, 24);
  238. int pos= get_bits_count(s);
  239. int i= get_te0_golomb(s, r);
  240. int len= get_bits_count(s) - pos;
  241. int bits= show>>(24-len);
  242. print_bin(bits, len);
  243. printf("%5d %2d %3d te @%5d in %s %s:%d\n", bits, len, i, pos, file, func, line);
  244. return i;
  245. }
  246. #define get_ue_golomb(a) get_ue(a, __FILE__, __PRETTY_FUNCTION__, __LINE__)
  247. #define get_se_golomb(a) get_se(a, __FILE__, __PRETTY_FUNCTION__, __LINE__)
  248. #define get_te_golomb(a, r) get_te(a, r, __FILE__, __PRETTY_FUNCTION__, __LINE__)
  249. #define get_te0_golomb(a, r) get_te(a, r, __FILE__, __PRETTY_FUNCTION__, __LINE__)
  250. #endif
  251. /**
  252. * write unsigned exp golomb code.
  253. */
  254. static inline void set_ue_golomb(PutBitContext *pb, int i){
  255. int e;
  256. assert(i>=0);
  257. #if 0
  258. if(i=0){
  259. put_bits(pb, 1, 1);
  260. return;
  261. }
  262. #endif
  263. if(i<256)
  264. put_bits(pb, ff_ue_golomb_len[i], i+1);
  265. else{
  266. e= av_log2(i+1);
  267. put_bits(pb, 2*e+1, i+1);
  268. }
  269. }
  270. /**
  271. * write truncated unsigned exp golomb code.
  272. */
  273. static inline void set_te_golomb(PutBitContext *pb, int i, int range){
  274. assert(range >= 1);
  275. assert(i<=range);
  276. if(range==2) put_bits(pb, 1, i^1);
  277. else set_ue_golomb(pb, i);
  278. }
  279. /**
  280. * write signed exp golomb code.
  281. */
  282. static inline void set_se_golomb(PutBitContext *pb, int i){
  283. #if 0
  284. if(i<=0) i= -2*i;
  285. else i= 2*i-1;
  286. #elif 1
  287. i= 2*i-1;
  288. if(i<0) i^= -1; //FIXME check if gcc does the right thing
  289. #else
  290. i= 2*i-1;
  291. i^= (i>>31);
  292. #endif
  293. set_ue_golomb(pb, i);
  294. }
  295. /**
  296. * write unsigned golomb rice code (ffv1).
  297. */
  298. static inline void set_ur_golomb(PutBitContext *pb, int i, int k, int limit, int esc_len){
  299. int e;
  300. assert(i>=0);
  301. e= i>>k;
  302. if(e<limit){
  303. put_bits(pb, e + k + 1, (1<<k) + (i&((1<<k)-1)));
  304. }else{
  305. put_bits(pb, limit + esc_len, i - limit + 1);
  306. }
  307. }
  308. /**
  309. * write unsigned golomb rice code (jpegls).
  310. */
  311. static inline void set_ur_golomb_jpegls(PutBitContext *pb, int i, int k, int limit, int esc_len){
  312. int e;
  313. assert(i>=0);
  314. e= (i>>k) + 1;
  315. if(e<limit){
  316. put_bits(pb, e, 1);
  317. if(k)
  318. put_bits(pb, k, i&((1<<k)-1));
  319. }else{
  320. put_bits(pb, limit , 1);
  321. put_bits(pb, esc_len, i - 1);
  322. }
  323. }