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.

575 lines
15KB

  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 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. /**
  23. * @file cabac.h
  24. * Context Adaptive Binary Arithmetic Coder.
  25. */
  26. //#undef NDEBUG
  27. #include <assert.h>
  28. #define CABAC_BITS 16
  29. #define CABAC_MASK ((1<<CABAC_BITS)-1)
  30. typedef struct CABACContext{
  31. int low;
  32. int range;
  33. int outstanding_count;
  34. #ifdef STRICT_LIMITS
  35. int symCount;
  36. #endif
  37. uint8_t lps_range[2*66][4]; ///< rangeTabLPS
  38. uint8_t lps_state[2*65]; ///< transIdxLPS
  39. uint8_t mps_state[2*65]; ///< transIdxMPS
  40. const uint8_t *bytestream_start;
  41. const uint8_t *bytestream;
  42. const uint8_t *bytestream_end;
  43. PutBitContext pb;
  44. }CABACContext;
  45. extern const uint8_t ff_h264_lps_range[64][4];
  46. extern const uint8_t ff_h264_mps_state[64];
  47. extern const uint8_t ff_h264_lps_state[64];
  48. extern const uint8_t ff_h264_norm_shift[128];
  49. void ff_init_cabac_encoder(CABACContext *c, uint8_t *buf, int buf_size);
  50. void ff_init_cabac_decoder(CABACContext *c, const uint8_t *buf, int buf_size);
  51. void ff_init_cabac_states(CABACContext *c, uint8_t const (*lps_range)[4],
  52. uint8_t const *mps_state, uint8_t const *lps_state, int state_count);
  53. static inline void put_cabac_bit(CABACContext *c, int b){
  54. put_bits(&c->pb, 1, b);
  55. for(;c->outstanding_count; c->outstanding_count--){
  56. put_bits(&c->pb, 1, 1-b);
  57. }
  58. }
  59. static inline void renorm_cabac_encoder(CABACContext *c){
  60. while(c->range < 0x100){
  61. //FIXME optimize
  62. if(c->low<0x100){
  63. put_cabac_bit(c, 0);
  64. }else if(c->low<0x200){
  65. c->outstanding_count++;
  66. c->low -= 0x100;
  67. }else{
  68. put_cabac_bit(c, 1);
  69. c->low -= 0x200;
  70. }
  71. c->range+= c->range;
  72. c->low += c->low;
  73. }
  74. }
  75. static void put_cabac(CABACContext *c, uint8_t * const state, int bit){
  76. int RangeLPS= c->lps_range[*state][c->range>>6];
  77. if(bit == ((*state)&1)){
  78. c->range -= RangeLPS;
  79. *state= c->mps_state[*state];
  80. }else{
  81. c->low += c->range - RangeLPS;
  82. c->range = RangeLPS;
  83. *state= c->lps_state[*state];
  84. }
  85. renorm_cabac_encoder(c);
  86. #ifdef STRICT_LIMITS
  87. c->symCount++;
  88. #endif
  89. }
  90. static void put_cabac_static(CABACContext *c, int RangeLPS, int bit){
  91. assert(c->range > RangeLPS);
  92. if(!bit){
  93. c->range -= RangeLPS;
  94. }else{
  95. c->low += c->range - RangeLPS;
  96. c->range = RangeLPS;
  97. }
  98. renorm_cabac_encoder(c);
  99. #ifdef STRICT_LIMITS
  100. c->symCount++;
  101. #endif
  102. }
  103. /**
  104. * @param bit 0 -> write zero bit, !=0 write one bit
  105. */
  106. static void put_cabac_bypass(CABACContext *c, int bit){
  107. c->low += c->low;
  108. if(bit){
  109. c->low += c->range;
  110. }
  111. //FIXME optimize
  112. if(c->low<0x200){
  113. put_cabac_bit(c, 0);
  114. }else if(c->low<0x400){
  115. c->outstanding_count++;
  116. c->low -= 0x200;
  117. }else{
  118. put_cabac_bit(c, 1);
  119. c->low -= 0x400;
  120. }
  121. #ifdef STRICT_LIMITS
  122. c->symCount++;
  123. #endif
  124. }
  125. /**
  126. *
  127. * @return the number of bytes written
  128. */
  129. static int put_cabac_terminate(CABACContext *c, int bit){
  130. c->range -= 2;
  131. if(!bit){
  132. renorm_cabac_encoder(c);
  133. }else{
  134. c->low += c->range;
  135. c->range= 2;
  136. renorm_cabac_encoder(c);
  137. assert(c->low <= 0x1FF);
  138. put_cabac_bit(c, c->low>>9);
  139. put_bits(&c->pb, 2, ((c->low>>7)&3)|1);
  140. flush_put_bits(&c->pb); //FIXME FIXME FIXME XXX wrong
  141. }
  142. #ifdef STRICT_LIMITS
  143. c->symCount++;
  144. #endif
  145. return (put_bits_count(&c->pb)+7)>>3;
  146. }
  147. /**
  148. * put (truncated) unary binarization.
  149. */
  150. static void put_cabac_u(CABACContext *c, uint8_t * state, int v, int max, int max_index, int truncated){
  151. int i;
  152. assert(v <= max);
  153. #if 1
  154. for(i=0; i<v; i++){
  155. put_cabac(c, state, 1);
  156. if(i < max_index) state++;
  157. }
  158. if(truncated==0 || v<max)
  159. put_cabac(c, state, 0);
  160. #else
  161. if(v <= max_index){
  162. for(i=0; i<v; i++){
  163. put_cabac(c, state+i, 1);
  164. }
  165. if(truncated==0 || v<max)
  166. put_cabac(c, state+i, 0);
  167. }else{
  168. for(i=0; i<=max_index; i++){
  169. put_cabac(c, state+i, 1);
  170. }
  171. for(; i<v; i++){
  172. put_cabac(c, state+max_index, 1);
  173. }
  174. if(truncated==0 || v<max)
  175. put_cabac(c, state+max_index, 0);
  176. }
  177. #endif
  178. }
  179. /**
  180. * put unary exp golomb k-th order binarization.
  181. */
  182. static void put_cabac_ueg(CABACContext *c, uint8_t * state, int v, int max, int is_signed, int k, int max_index){
  183. int i;
  184. if(v==0)
  185. put_cabac(c, state, 0);
  186. else{
  187. const int sign= v < 0;
  188. if(is_signed) v= ABS(v);
  189. if(v<max){
  190. for(i=0; i<v; i++){
  191. put_cabac(c, state, 1);
  192. if(i < max_index) state++;
  193. }
  194. put_cabac(c, state, 0);
  195. }else{
  196. int m= 1<<k;
  197. for(i=0; i<max; i++){
  198. put_cabac(c, state, 1);
  199. if(i < max_index) state++;
  200. }
  201. v -= max;
  202. while(v >= m){ //FIXME optimize
  203. put_cabac_bypass(c, 1);
  204. v-= m;
  205. m+= m;
  206. }
  207. put_cabac_bypass(c, 0);
  208. while(m>>=1){
  209. put_cabac_bypass(c, v&m);
  210. }
  211. }
  212. if(is_signed)
  213. put_cabac_bypass(c, sign);
  214. }
  215. }
  216. static void refill(CABACContext *c){
  217. #if CABAC_BITS == 16
  218. c->low+= (c->bytestream[0]<<9) + (c->bytestream[1]<<1);
  219. #else
  220. c->low+= c->bytestream[0]<<1;
  221. #endif
  222. c->low -= CABAC_MASK;
  223. c->bytestream+= CABAC_BITS/8;
  224. }
  225. static void refill2(CABACContext *c){
  226. int i, x;
  227. x= c->low ^ (c->low-1);
  228. i= 7 - ff_h264_norm_shift[x>>(CABAC_BITS+1)];
  229. x= -CABAC_MASK;
  230. #if CABAC_BITS == 16
  231. x+= (c->bytestream[0]<<9) + (c->bytestream[1]<<1);
  232. #else
  233. x+= c->bytestream[0]<<1;
  234. #endif
  235. c->low += x<<i;
  236. c->bytestream+= CABAC_BITS/8;
  237. }
  238. static inline void renorm_cabac_decoder(CABACContext *c){
  239. while(c->range < (0x200 << CABAC_BITS)){
  240. c->range+= c->range;
  241. c->low+= c->low;
  242. if(!(c->low & CABAC_MASK))
  243. refill(c);
  244. }
  245. }
  246. static inline void renorm_cabac_decoder_once(CABACContext *c){
  247. #ifdef ARCH_X86_DISABLED
  248. int temp;
  249. #if 0
  250. //P3:683 athlon:475
  251. asm(
  252. "lea -0x2000000(%0), %2 \n\t"
  253. "shr $31, %2 \n\t" //FIXME 31->63 for x86-64
  254. "shl %%cl, %0 \n\t"
  255. "shl %%cl, %1 \n\t"
  256. : "+r"(c->range), "+r"(c->low), "+c"(temp)
  257. );
  258. #elif 0
  259. //P3:680 athlon:474
  260. asm(
  261. "cmp $0x2000000, %0 \n\t"
  262. "setb %%cl \n\t" //FIXME 31->63 for x86-64
  263. "shl %%cl, %0 \n\t"
  264. "shl %%cl, %1 \n\t"
  265. : "+r"(c->range), "+r"(c->low), "+c"(temp)
  266. );
  267. #elif 1
  268. int temp2;
  269. //P3:665 athlon:517
  270. asm(
  271. "lea -0x2000000(%0), %%eax \n\t"
  272. "cdq \n\t"
  273. "mov %0, %%eax \n\t"
  274. "and %%edx, %0 \n\t"
  275. "and %1, %%edx \n\t"
  276. "add %%eax, %0 \n\t"
  277. "add %%edx, %1 \n\t"
  278. : "+r"(c->range), "+r"(c->low), "+a"(temp), "+d"(temp2)
  279. );
  280. #elif 0
  281. int temp2;
  282. //P3:673 athlon:509
  283. asm(
  284. "cmp $0x2000000, %0 \n\t"
  285. "sbb %%edx, %%edx \n\t"
  286. "mov %0, %%eax \n\t"
  287. "and %%edx, %0 \n\t"
  288. "and %1, %%edx \n\t"
  289. "add %%eax, %0 \n\t"
  290. "add %%edx, %1 \n\t"
  291. : "+r"(c->range), "+r"(c->low), "+a"(temp), "+d"(temp2)
  292. );
  293. #else
  294. int temp2;
  295. //P3:677 athlon:511
  296. asm(
  297. "cmp $0x2000000, %0 \n\t"
  298. "lea (%0, %0), %%eax \n\t"
  299. "lea (%1, %1), %%edx \n\t"
  300. "cmovb %%eax, %0 \n\t"
  301. "cmovb %%edx, %1 \n\t"
  302. : "+r"(c->range), "+r"(c->low), "+a"(temp), "+d"(temp2)
  303. );
  304. #endif
  305. #else
  306. //P3:675 athlon:476
  307. int shift= (uint32_t)(c->range - (0x200 << CABAC_BITS))>>31;
  308. c->range<<= shift;
  309. c->low <<= shift;
  310. #endif
  311. if(!(c->low & CABAC_MASK))
  312. refill(c);
  313. }
  314. static int get_cabac(CABACContext *c, uint8_t * const state){
  315. //FIXME gcc generates duplicate load/stores for c->low and c->range
  316. #ifdef ARCH_X86
  317. int bit;
  318. #define LOW "0"
  319. #define RANGE "4"
  320. #define LPS_RANGE "12"
  321. #define LPS_STATE "12+2*66*4"
  322. #define MPS_STATE "12+2*66*4+2*65"
  323. #define BYTESTART "12+2*66*4+4*65"
  324. #define BYTE "16+2*66*4+4*65"
  325. #define BYTEEND "20+2*66*4+4*65"
  326. asm volatile(
  327. "movzbl (%1), %%eax \n\t"
  328. "movl "RANGE "(%2), %%ebx \n\t"
  329. "movl "RANGE "(%2), %%edx \n\t"
  330. "shrl $23, %%ebx \n\t"
  331. "leal "LPS_RANGE"(%2, %%eax, 4), %%esi \n\t"
  332. "movzbl (%%ebx, %%esi), %%esi \n\t"
  333. "shll $17, %%esi \n\t"
  334. "movl "LOW "(%2), %%ebx \n\t"
  335. //eax:state ebx:low, edx:range, esi:RangeLPS
  336. "subl %%esi, %%edx \n\t"
  337. "cmpl %%edx, %%ebx \n\t"
  338. " ja 1f \n\t"
  339. "cmp $0x2000000, %%edx \n\t" //FIXME avoidable
  340. "setb %%cl \n\t"
  341. "shl %%cl, %%edx \n\t"
  342. "shl %%cl, %%ebx \n\t"
  343. "movb "MPS_STATE"(%2, %%eax), %%cl \n\t"
  344. "movb %%cl, (%1) \n\t"
  345. //eax:state ebx:low, edx:range, esi:RangeLPS
  346. "test %%bx, %%bx \n\t"
  347. " jnz 2f \n\t"
  348. "movl "BYTE "(%2), %%esi \n\t"
  349. "subl $0xFFFF, %%ebx \n\t"
  350. "movzwl (%%esi), %%ecx \n\t"
  351. "bswap %%ecx \n\t"
  352. "shrl $15, %%ecx \n\t"
  353. "addl $2, %%esi \n\t"
  354. "addl %%ecx, %%ebx \n\t"
  355. "movl %%esi, "BYTE "(%2) \n\t"
  356. "jmp 2f \n\t"
  357. "1: \n\t"
  358. //eax:state ebx:low, edx:range, esi:RangeLPS
  359. "subl %%edx, %%ebx \n\t"
  360. "movl %%esi, %%edx \n\t"
  361. "shr $19, %%esi \n\t"
  362. "movb " MANGLE(ff_h264_norm_shift) "(%%esi), %%cl \n\t"
  363. "shll %%cl, %%ebx \n\t"
  364. "shll %%cl, %%edx \n\t"
  365. "movb "LPS_STATE"(%2, %%eax), %%cl \n\t"
  366. "movb %%cl, (%1) \n\t"
  367. "incl %%eax \n\t"
  368. "test %%bx, %%bx \n\t"
  369. " jnz 2f \n\t"
  370. "movl "BYTE "(%2), %%ecx \n\t"
  371. "movzwl (%%ecx), %%esi \n\t"
  372. "bswap %%esi \n\t"
  373. "shrl $15, %%esi \n\t"
  374. "subl $0xFFFF, %%esi \n\t"
  375. "addl $2, %%ecx \n\t"
  376. "movl %%ecx, "BYTE "(%2) \n\t"
  377. "leal -1(%%ebx), %%ecx \n\t"
  378. "xorl %%ebx, %%ecx \n\t"
  379. "shrl $17, %%ecx \n\t"
  380. "movb " MANGLE(ff_h264_norm_shift) "(%%ecx), %%cl \n\t"
  381. "neg %%cl \n\t"
  382. "add $7, %%cl \n\t"
  383. "shll %%cl , %%esi \n\t"
  384. "addl %%esi, %%ebx \n\t"
  385. "2: \n\t"
  386. "movl %%edx, "RANGE "(%2) \n\t"
  387. "movl %%ebx, "LOW "(%2) \n\t"
  388. "andl $1, %%eax \n\t"
  389. :"=&a"(bit) //FIXME this is fragile gcc either runs out of registers or misscompiles it (for example if "+a"(bit) or "+m"(*state) is used
  390. :"r"(state), "r"(c)
  391. : "%ecx", "%ebx", "%edx", "%esi"
  392. );
  393. #else
  394. int s = *state;
  395. int RangeLPS= c->lps_range[s][c->range>>(CABAC_BITS+7)]<<(CABAC_BITS+1);
  396. int bit, lps_mask attribute_unused;
  397. c->range -= RangeLPS;
  398. #ifndef BRANCHLESS_CABAD
  399. if(c->low < c->range){
  400. bit= s&1;
  401. *state= c->mps_state[s];
  402. renorm_cabac_decoder_once(c);
  403. }else{
  404. bit= ff_h264_norm_shift[RangeLPS>>19];
  405. c->low -= c->range;
  406. *state= c->lps_state[s];
  407. c->range = RangeLPS<<bit;
  408. c->low <<= bit;
  409. bit= (s&1)^1;
  410. if(!(c->low & 0xFFFF)){
  411. refill2(c);
  412. }
  413. }
  414. #else
  415. lps_mask= (c->range - c->low)>>31;
  416. c->low -= c->range & lps_mask;
  417. c->range += (RangeLPS - c->range) & lps_mask;
  418. s^=lps_mask;
  419. *state= c->mps_state[s];
  420. bit= s&1;
  421. lps_mask= ff_h264_norm_shift[c->range>>(CABAC_BITS+3)];
  422. c->range<<= lps_mask;
  423. c->low <<= lps_mask;
  424. if(!(c->low & CABAC_MASK))
  425. refill2(c);
  426. #endif
  427. #endif
  428. return bit;
  429. }
  430. static int get_cabac_bypass(CABACContext *c){
  431. c->low += c->low;
  432. if(!(c->low & CABAC_MASK))
  433. refill(c);
  434. if(c->low < c->range){
  435. return 0;
  436. }else{
  437. c->low -= c->range;
  438. return 1;
  439. }
  440. }
  441. /**
  442. *
  443. * @return the number of bytes read or 0 if no end
  444. */
  445. static int get_cabac_terminate(CABACContext *c){
  446. c->range -= 4<<CABAC_BITS;
  447. if(c->low < c->range){
  448. renorm_cabac_decoder_once(c);
  449. return 0;
  450. }else{
  451. return c->bytestream - c->bytestream_start;
  452. }
  453. }
  454. /**
  455. * get (truncated) unnary binarization.
  456. */
  457. static int get_cabac_u(CABACContext *c, uint8_t * state, int max, int max_index, int truncated){
  458. int i;
  459. for(i=0; i<max; i++){
  460. if(get_cabac(c, state)==0)
  461. return i;
  462. if(i< max_index) state++;
  463. }
  464. return truncated ? max : -1;
  465. }
  466. /**
  467. * get unary exp golomb k-th order binarization.
  468. */
  469. static int get_cabac_ueg(CABACContext *c, uint8_t * state, int max, int is_signed, int k, int max_index){
  470. int i, v;
  471. int m= 1<<k;
  472. if(get_cabac(c, state)==0)
  473. return 0;
  474. if(0 < max_index) state++;
  475. for(i=1; i<max; i++){
  476. if(get_cabac(c, state)==0){
  477. if(is_signed && get_cabac_bypass(c)){
  478. return -i;
  479. }else
  480. return i;
  481. }
  482. if(i < max_index) state++;
  483. }
  484. while(get_cabac_bypass(c)){
  485. i+= m;
  486. m+= m;
  487. }
  488. v=0;
  489. while(m>>=1){
  490. v+= v + get_cabac_bypass(c);
  491. }
  492. i += v;
  493. if(is_signed && get_cabac_bypass(c)){
  494. return -i;
  495. }else
  496. return i;
  497. }