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.

378 lines
10KB

  1. /*
  2. * H.26L/H.264/AVC/JVT/14496-10/... encoder/decoder
  3. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This file is part of Libav.
  6. *
  7. * Libav 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. * Libav 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 Libav; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * Context Adaptive Binary Arithmetic Coder.
  24. */
  25. #include <string.h>
  26. #include "libavutil/common.h"
  27. #include "get_bits.h"
  28. #include "cabac.h"
  29. static const uint8_t lps_range[64][4]= {
  30. {128,176,208,240}, {128,167,197,227}, {128,158,187,216}, {123,150,178,205},
  31. {116,142,169,195}, {111,135,160,185}, {105,128,152,175}, {100,122,144,166},
  32. { 95,116,137,158}, { 90,110,130,150}, { 85,104,123,142}, { 81, 99,117,135},
  33. { 77, 94,111,128}, { 73, 89,105,122}, { 69, 85,100,116}, { 66, 80, 95,110},
  34. { 62, 76, 90,104}, { 59, 72, 86, 99}, { 56, 69, 81, 94}, { 53, 65, 77, 89},
  35. { 51, 62, 73, 85}, { 48, 59, 69, 80}, { 46, 56, 66, 76}, { 43, 53, 63, 72},
  36. { 41, 50, 59, 69}, { 39, 48, 56, 65}, { 37, 45, 54, 62}, { 35, 43, 51, 59},
  37. { 33, 41, 48, 56}, { 32, 39, 46, 53}, { 30, 37, 43, 50}, { 29, 35, 41, 48},
  38. { 27, 33, 39, 45}, { 26, 31, 37, 43}, { 24, 30, 35, 41}, { 23, 28, 33, 39},
  39. { 22, 27, 32, 37}, { 21, 26, 30, 35}, { 20, 24, 29, 33}, { 19, 23, 27, 31},
  40. { 18, 22, 26, 30}, { 17, 21, 25, 28}, { 16, 20, 23, 27}, { 15, 19, 22, 25},
  41. { 14, 18, 21, 24}, { 14, 17, 20, 23}, { 13, 16, 19, 22}, { 12, 15, 18, 21},
  42. { 12, 14, 17, 20}, { 11, 14, 16, 19}, { 11, 13, 15, 18}, { 10, 12, 15, 17},
  43. { 10, 12, 14, 16}, { 9, 11, 13, 15}, { 9, 11, 12, 14}, { 8, 10, 12, 14},
  44. { 8, 9, 11, 13}, { 7, 9, 11, 12}, { 7, 9, 10, 12}, { 7, 8, 10, 11},
  45. { 6, 8, 9, 11}, { 6, 7, 9, 10}, { 6, 7, 8, 9}, { 2, 2, 2, 2},
  46. };
  47. uint8_t ff_h264_mlps_state[4*64];
  48. uint8_t ff_h264_lps_range[4*2*64];
  49. uint8_t ff_h264_lps_state[2*64];
  50. uint8_t ff_h264_mps_state[2*64];
  51. static const uint8_t mps_state[64]= {
  52. 1, 2, 3, 4, 5, 6, 7, 8,
  53. 9,10,11,12,13,14,15,16,
  54. 17,18,19,20,21,22,23,24,
  55. 25,26,27,28,29,30,31,32,
  56. 33,34,35,36,37,38,39,40,
  57. 41,42,43,44,45,46,47,48,
  58. 49,50,51,52,53,54,55,56,
  59. 57,58,59,60,61,62,62,63,
  60. };
  61. static const uint8_t lps_state[64]= {
  62. 0, 0, 1, 2, 2, 4, 4, 5,
  63. 6, 7, 8, 9, 9,11,11,12,
  64. 13,13,15,15,16,16,18,18,
  65. 19,19,21,21,22,22,23,24,
  66. 24,25,26,26,27,27,28,29,
  67. 29,30,30,30,31,32,32,33,
  68. 33,33,34,34,35,35,35,36,
  69. 36,36,37,37,37,38,38,63,
  70. };
  71. const uint8_t ff_h264_norm_shift[512]= {
  72. 9,8,7,7,6,6,6,6,5,5,5,5,5,5,5,5,
  73. 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,
  74. 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
  75. 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
  76. 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
  77. 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
  78. 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
  79. 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,
  80. 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  81. 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  82. 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  83. 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,
  84. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  85. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  86. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  87. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  88. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  89. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  90. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  91. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  92. };
  93. /**
  94. *
  95. * @param buf_size size of buf in bits
  96. */
  97. void ff_init_cabac_encoder(CABACContext *c, uint8_t *buf, int buf_size){
  98. init_put_bits(&c->pb, buf, buf_size);
  99. c->low= 0;
  100. c->range= 0x1FE;
  101. c->outstanding_count= 0;
  102. c->pb.bit_left++; //avoids firstBitFlag
  103. }
  104. /**
  105. *
  106. * @param buf_size size of buf in bits
  107. */
  108. void ff_init_cabac_decoder(CABACContext *c, const uint8_t *buf, int buf_size){
  109. c->bytestream_start=
  110. c->bytestream= buf;
  111. c->bytestream_end= buf + buf_size;
  112. #if CABAC_BITS == 16
  113. c->low = (*c->bytestream++)<<18;
  114. c->low+= (*c->bytestream++)<<10;
  115. #else
  116. c->low = (*c->bytestream++)<<10;
  117. #endif
  118. c->low+= ((*c->bytestream++)<<2) + 2;
  119. c->range= 0x1FE;
  120. }
  121. void ff_init_cabac_states(CABACContext *c){
  122. int i, j;
  123. for(i=0; i<64; i++){
  124. for(j=0; j<4; j++){ //FIXME check if this is worth the 1 shift we save
  125. ff_h264_lps_range[j*2*64+2*i+0]=
  126. ff_h264_lps_range[j*2*64+2*i+1]= lps_range[i][j];
  127. }
  128. ff_h264_mlps_state[128+2*i+0]=
  129. ff_h264_mps_state[2*i+0]= 2*mps_state[i]+0;
  130. ff_h264_mlps_state[128+2*i+1]=
  131. ff_h264_mps_state[2*i+1]= 2*mps_state[i]+1;
  132. if( i ){
  133. ff_h264_mlps_state[128-2*i-1]= 2*lps_state[i]+0;
  134. ff_h264_mlps_state[128-2*i-2]= 2*lps_state[i]+1;
  135. }else{
  136. ff_h264_mlps_state[128-2*i-1]= 1;
  137. ff_h264_mlps_state[128-2*i-2]= 0;
  138. }
  139. }
  140. }
  141. #ifdef TEST
  142. #define SIZE 10240
  143. #include "libavutil/lfg.h"
  144. #include "avcodec.h"
  145. #include "cabac.h"
  146. static inline void put_cabac_bit(CABACContext *c, int b){
  147. put_bits(&c->pb, 1, b);
  148. for(;c->outstanding_count; c->outstanding_count--){
  149. put_bits(&c->pb, 1, 1-b);
  150. }
  151. }
  152. static inline void renorm_cabac_encoder(CABACContext *c){
  153. while(c->range < 0x100){
  154. //FIXME optimize
  155. if(c->low<0x100){
  156. put_cabac_bit(c, 0);
  157. }else if(c->low<0x200){
  158. c->outstanding_count++;
  159. c->low -= 0x100;
  160. }else{
  161. put_cabac_bit(c, 1);
  162. c->low -= 0x200;
  163. }
  164. c->range+= c->range;
  165. c->low += c->low;
  166. }
  167. }
  168. static void put_cabac(CABACContext *c, uint8_t * const state, int bit){
  169. int RangeLPS= ff_h264_lps_range[2*(c->range&0xC0) + *state];
  170. if(bit == ((*state)&1)){
  171. c->range -= RangeLPS;
  172. *state= ff_h264_mps_state[*state];
  173. }else{
  174. c->low += c->range - RangeLPS;
  175. c->range = RangeLPS;
  176. *state= ff_h264_lps_state[*state];
  177. }
  178. renorm_cabac_encoder(c);
  179. }
  180. /**
  181. * @param bit 0 -> write zero bit, !=0 write one bit
  182. */
  183. static void put_cabac_bypass(CABACContext *c, int bit){
  184. c->low += c->low;
  185. if(bit){
  186. c->low += c->range;
  187. }
  188. //FIXME optimize
  189. if(c->low<0x200){
  190. put_cabac_bit(c, 0);
  191. }else if(c->low<0x400){
  192. c->outstanding_count++;
  193. c->low -= 0x200;
  194. }else{
  195. put_cabac_bit(c, 1);
  196. c->low -= 0x400;
  197. }
  198. }
  199. /**
  200. *
  201. * @return the number of bytes written
  202. */
  203. static int put_cabac_terminate(CABACContext *c, int bit){
  204. c->range -= 2;
  205. if(!bit){
  206. renorm_cabac_encoder(c);
  207. }else{
  208. c->low += c->range;
  209. c->range= 2;
  210. renorm_cabac_encoder(c);
  211. assert(c->low <= 0x1FF);
  212. put_cabac_bit(c, c->low>>9);
  213. put_bits(&c->pb, 2, ((c->low>>7)&3)|1);
  214. flush_put_bits(&c->pb); //FIXME FIXME FIXME XXX wrong
  215. }
  216. return (put_bits_count(&c->pb)+7)>>3;
  217. }
  218. /**
  219. * put (truncated) unary binarization.
  220. */
  221. static void put_cabac_u(CABACContext *c, uint8_t * state, int v, int max, int max_index, int truncated){
  222. int i;
  223. assert(v <= max);
  224. for(i=0; i<v; i++){
  225. put_cabac(c, state, 1);
  226. if(i < max_index) state++;
  227. }
  228. if(truncated==0 || v<max)
  229. put_cabac(c, state, 0);
  230. }
  231. /**
  232. * put unary exp golomb k-th order binarization.
  233. */
  234. static void put_cabac_ueg(CABACContext *c, uint8_t * state, int v, int max, int is_signed, int k, int max_index){
  235. int i;
  236. if(v==0)
  237. put_cabac(c, state, 0);
  238. else{
  239. const int sign= v < 0;
  240. if(is_signed) v= FFABS(v);
  241. if(v<max){
  242. for(i=0; i<v; i++){
  243. put_cabac(c, state, 1);
  244. if(i < max_index) state++;
  245. }
  246. put_cabac(c, state, 0);
  247. }else{
  248. int m= 1<<k;
  249. for(i=0; i<max; i++){
  250. put_cabac(c, state, 1);
  251. if(i < max_index) state++;
  252. }
  253. v -= max;
  254. while(v >= m){ //FIXME optimize
  255. put_cabac_bypass(c, 1);
  256. v-= m;
  257. m+= m;
  258. }
  259. put_cabac_bypass(c, 0);
  260. while(m>>=1){
  261. put_cabac_bypass(c, v&m);
  262. }
  263. }
  264. if(is_signed)
  265. put_cabac_bypass(c, sign);
  266. }
  267. }
  268. int main(void){
  269. CABACContext c;
  270. uint8_t b[9*SIZE];
  271. uint8_t r[9*SIZE];
  272. int i;
  273. uint8_t state[10]= {0};
  274. AVLFG prng;
  275. av_lfg_init(&prng, 1);
  276. ff_init_cabac_encoder(&c, b, SIZE);
  277. ff_init_cabac_states(&c);
  278. for(i=0; i<SIZE; i++){
  279. r[i] = av_lfg_get(&prng) % 7;
  280. }
  281. for(i=0; i<SIZE; i++){
  282. START_TIMER
  283. put_cabac_bypass(&c, r[i]&1);
  284. STOP_TIMER("put_cabac_bypass")
  285. }
  286. for(i=0; i<SIZE; i++){
  287. START_TIMER
  288. put_cabac(&c, state, r[i]&1);
  289. STOP_TIMER("put_cabac")
  290. }
  291. for(i=0; i<SIZE; i++){
  292. START_TIMER
  293. put_cabac_u(&c, state, r[i], 6, 3, i&1);
  294. STOP_TIMER("put_cabac_u")
  295. }
  296. for(i=0; i<SIZE; i++){
  297. START_TIMER
  298. put_cabac_ueg(&c, state, r[i], 3, 0, 1, 2);
  299. STOP_TIMER("put_cabac_ueg")
  300. }
  301. put_cabac_terminate(&c, 1);
  302. ff_init_cabac_decoder(&c, b, SIZE);
  303. memset(state, 0, sizeof(state));
  304. for(i=0; i<SIZE; i++){
  305. START_TIMER
  306. if( (r[i]&1) != get_cabac_bypass(&c) )
  307. av_log(NULL, AV_LOG_ERROR, "CABAC bypass failure at %d\n", i);
  308. STOP_TIMER("get_cabac_bypass")
  309. }
  310. for(i=0; i<SIZE; i++){
  311. START_TIMER
  312. if( (r[i]&1) != get_cabac(&c, state) )
  313. av_log(NULL, AV_LOG_ERROR, "CABAC failure at %d\n", i);
  314. STOP_TIMER("get_cabac")
  315. }
  316. if(!get_cabac_terminate(&c))
  317. av_log(NULL, AV_LOG_ERROR, "where's the Terminator?\n");
  318. return 0;
  319. }
  320. #endif /* TEST */