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.

384 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. #ifdef STRICT_LIMITS
  103. c->sym_count =0;
  104. #endif
  105. c->pb.bit_left++; //avoids firstBitFlag
  106. }
  107. /**
  108. *
  109. * @param buf_size size of buf in bits
  110. */
  111. void ff_init_cabac_decoder(CABACContext *c, const uint8_t *buf, int buf_size){
  112. c->bytestream_start=
  113. c->bytestream= buf;
  114. c->bytestream_end= buf + buf_size;
  115. #if CABAC_BITS == 16
  116. c->low = (*c->bytestream++)<<18;
  117. c->low+= (*c->bytestream++)<<10;
  118. #else
  119. c->low = (*c->bytestream++)<<10;
  120. #endif
  121. c->low+= ((*c->bytestream++)<<2) + 2;
  122. c->range= 0x1FE;
  123. }
  124. void ff_init_cabac_states(CABACContext *c){
  125. int i, j;
  126. for(i=0; i<64; i++){
  127. for(j=0; j<4; j++){ //FIXME check if this is worth the 1 shift we save
  128. ff_h264_lps_range[j*2*64+2*i+0]=
  129. ff_h264_lps_range[j*2*64+2*i+1]= lps_range[i][j];
  130. }
  131. ff_h264_mlps_state[128+2*i+0]=
  132. ff_h264_mps_state[2*i+0]= 2*mps_state[i]+0;
  133. ff_h264_mlps_state[128+2*i+1]=
  134. ff_h264_mps_state[2*i+1]= 2*mps_state[i]+1;
  135. if( i ){
  136. ff_h264_mlps_state[128-2*i-1]= 2*lps_state[i]+0;
  137. ff_h264_mlps_state[128-2*i-2]= 2*lps_state[i]+1;
  138. }else{
  139. ff_h264_mlps_state[128-2*i-1]= 1;
  140. ff_h264_mlps_state[128-2*i-2]= 0;
  141. }
  142. }
  143. }
  144. #ifdef TEST
  145. #define SIZE 10240
  146. #include "libavutil/lfg.h"
  147. #include "avcodec.h"
  148. #include "cabac.h"
  149. static void put_cabac(CABACContext *c, uint8_t * const state, int bit){
  150. int RangeLPS= ff_h264_lps_range[2*(c->range&0xC0) + *state];
  151. if(bit == ((*state)&1)){
  152. c->range -= RangeLPS;
  153. *state= ff_h264_mps_state[*state];
  154. }else{
  155. c->low += c->range - RangeLPS;
  156. c->range = RangeLPS;
  157. *state= ff_h264_lps_state[*state];
  158. }
  159. renorm_cabac_encoder(c);
  160. #ifdef STRICT_LIMITS
  161. c->symCount++;
  162. #endif
  163. }
  164. /**
  165. * @param bit 0 -> write zero bit, !=0 write one bit
  166. */
  167. static void put_cabac_bypass(CABACContext *c, int bit){
  168. c->low += c->low;
  169. if(bit){
  170. c->low += c->range;
  171. }
  172. //FIXME optimize
  173. if(c->low<0x200){
  174. put_cabac_bit(c, 0);
  175. }else if(c->low<0x400){
  176. c->outstanding_count++;
  177. c->low -= 0x200;
  178. }else{
  179. put_cabac_bit(c, 1);
  180. c->low -= 0x400;
  181. }
  182. #ifdef STRICT_LIMITS
  183. c->symCount++;
  184. #endif
  185. }
  186. /**
  187. *
  188. * @return the number of bytes written
  189. */
  190. static int put_cabac_terminate(CABACContext *c, int bit){
  191. c->range -= 2;
  192. if(!bit){
  193. renorm_cabac_encoder(c);
  194. }else{
  195. c->low += c->range;
  196. c->range= 2;
  197. renorm_cabac_encoder(c);
  198. assert(c->low <= 0x1FF);
  199. put_cabac_bit(c, c->low>>9);
  200. put_bits(&c->pb, 2, ((c->low>>7)&3)|1);
  201. flush_put_bits(&c->pb); //FIXME FIXME FIXME XXX wrong
  202. }
  203. #ifdef STRICT_LIMITS
  204. c->symCount++;
  205. #endif
  206. return (put_bits_count(&c->pb)+7)>>3;
  207. }
  208. /**
  209. * put (truncated) unary binarization.
  210. */
  211. static void put_cabac_u(CABACContext *c, uint8_t * state, int v, int max, int max_index, int truncated){
  212. int i;
  213. assert(v <= max);
  214. for(i=0; i<v; i++){
  215. put_cabac(c, state, 1);
  216. if(i < max_index) state++;
  217. }
  218. if(truncated==0 || v<max)
  219. put_cabac(c, state, 0);
  220. }
  221. /**
  222. * put unary exp golomb k-th order binarization.
  223. */
  224. static void put_cabac_ueg(CABACContext *c, uint8_t * state, int v, int max, int is_signed, int k, int max_index){
  225. int i;
  226. if(v==0)
  227. put_cabac(c, state, 0);
  228. else{
  229. const int sign= v < 0;
  230. if(is_signed) v= FFABS(v);
  231. if(v<max){
  232. for(i=0; i<v; i++){
  233. put_cabac(c, state, 1);
  234. if(i < max_index) state++;
  235. }
  236. put_cabac(c, state, 0);
  237. }else{
  238. int m= 1<<k;
  239. for(i=0; i<max; i++){
  240. put_cabac(c, state, 1);
  241. if(i < max_index) state++;
  242. }
  243. v -= max;
  244. while(v >= m){ //FIXME optimize
  245. put_cabac_bypass(c, 1);
  246. v-= m;
  247. m+= m;
  248. }
  249. put_cabac_bypass(c, 0);
  250. while(m>>=1){
  251. put_cabac_bypass(c, v&m);
  252. }
  253. }
  254. if(is_signed)
  255. put_cabac_bypass(c, sign);
  256. }
  257. }
  258. int main(void){
  259. CABACContext c;
  260. uint8_t b[9*SIZE];
  261. uint8_t r[9*SIZE];
  262. int i;
  263. uint8_t state[10]= {0};
  264. AVLFG prng;
  265. av_lfg_init(&prng, 1);
  266. ff_init_cabac_encoder(&c, b, SIZE);
  267. ff_init_cabac_states(&c);
  268. for(i=0; i<SIZE; i++){
  269. r[i] = av_lfg_get(&prng) % 7;
  270. }
  271. for(i=0; i<SIZE; i++){
  272. START_TIMER
  273. put_cabac_bypass(&c, r[i]&1);
  274. STOP_TIMER("put_cabac_bypass")
  275. }
  276. for(i=0; i<SIZE; i++){
  277. START_TIMER
  278. put_cabac(&c, state, r[i]&1);
  279. STOP_TIMER("put_cabac")
  280. }
  281. for(i=0; i<SIZE; i++){
  282. START_TIMER
  283. put_cabac_u(&c, state, r[i], 6, 3, i&1);
  284. STOP_TIMER("put_cabac_u")
  285. }
  286. for(i=0; i<SIZE; i++){
  287. START_TIMER
  288. put_cabac_ueg(&c, state, r[i], 3, 0, 1, 2);
  289. STOP_TIMER("put_cabac_ueg")
  290. }
  291. put_cabac_terminate(&c, 1);
  292. ff_init_cabac_decoder(&c, b, SIZE);
  293. memset(state, 0, sizeof(state));
  294. for(i=0; i<SIZE; i++){
  295. START_TIMER
  296. if( (r[i]&1) != get_cabac_bypass(&c) )
  297. av_log(NULL, AV_LOG_ERROR, "CABAC bypass failure at %d\n", i);
  298. STOP_TIMER("get_cabac_bypass")
  299. }
  300. for(i=0; i<SIZE; i++){
  301. START_TIMER
  302. if( (r[i]&1) != get_cabac(&c, state) )
  303. av_log(NULL, AV_LOG_ERROR, "CABAC failure at %d\n", i);
  304. STOP_TIMER("get_cabac")
  305. }
  306. #if 0
  307. for(i=0; i<SIZE; i++){
  308. START_TIMER
  309. if( r[i] != get_cabac_u(&c, state, (i&1) ? 6 : 7, 3, i&1) )
  310. av_log(NULL, AV_LOG_ERROR, "CABAC unary (truncated) binarization failure at %d\n", i);
  311. STOP_TIMER("get_cabac_u")
  312. }
  313. for(i=0; i<SIZE; i++){
  314. START_TIMER
  315. if( r[i] != get_cabac_ueg(&c, state, 3, 0, 1, 2))
  316. av_log(NULL, AV_LOG_ERROR, "CABAC unary (truncated) binarization failure at %d\n", i);
  317. STOP_TIMER("get_cabac_ueg")
  318. }
  319. #endif
  320. if(!get_cabac_terminate(&c))
  321. av_log(NULL, AV_LOG_ERROR, "where's the Terminator?\n");
  322. return 0;
  323. }
  324. #endif /* TEST */