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.

6601 lines
236KB

  1. /*
  2. * H.26L/H.264/AVC/JVT/14496-10/... encoder/decoder
  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 h264.c
  22. * H.264 / AVC / MPEG4 part10 codec.
  23. * @author Michael Niedermayer <michaelni@gmx.at>
  24. */
  25. #include "common.h"
  26. #include "dsputil.h"
  27. #include "avcodec.h"
  28. #include "mpegvideo.h"
  29. #include "h264data.h"
  30. #include "golomb.h"
  31. #include "cabac.h"
  32. #undef NDEBUG
  33. #include <assert.h>
  34. #define interlaced_dct interlaced_dct_is_a_bad_name
  35. #define mb_intra mb_intra_isnt_initalized_see_mb_type
  36. #define LUMA_DC_BLOCK_INDEX 25
  37. #define CHROMA_DC_BLOCK_INDEX 26
  38. #define CHROMA_DC_COEFF_TOKEN_VLC_BITS 8
  39. #define COEFF_TOKEN_VLC_BITS 8
  40. #define TOTAL_ZEROS_VLC_BITS 9
  41. #define CHROMA_DC_TOTAL_ZEROS_VLC_BITS 3
  42. #define RUN_VLC_BITS 3
  43. #define RUN7_VLC_BITS 6
  44. #define MAX_SPS_COUNT 32
  45. #define MAX_PPS_COUNT 256
  46. #define MAX_MMCO_COUNT 66
  47. /**
  48. * Sequence parameter set
  49. */
  50. typedef struct SPS{
  51. int profile_idc;
  52. int level_idc;
  53. int log2_max_frame_num; ///< log2_max_frame_num_minus4 + 4
  54. int poc_type; ///< pic_order_cnt_type
  55. int log2_max_poc_lsb; ///< log2_max_pic_order_cnt_lsb_minus4
  56. int delta_pic_order_always_zero_flag;
  57. int offset_for_non_ref_pic;
  58. int offset_for_top_to_bottom_field;
  59. int poc_cycle_length; ///< num_ref_frames_in_pic_order_cnt_cycle
  60. int ref_frame_count; ///< num_ref_frames
  61. int gaps_in_frame_num_allowed_flag;
  62. int mb_width; ///< frame_width_in_mbs_minus1 + 1
  63. int mb_height; ///< frame_height_in_mbs_minus1 + 1
  64. int frame_mbs_only_flag;
  65. int mb_aff; ///<mb_adaptive_frame_field_flag
  66. int direct_8x8_inference_flag;
  67. int crop; ///< frame_cropping_flag
  68. int crop_left; ///< frame_cropping_rect_left_offset
  69. int crop_right; ///< frame_cropping_rect_right_offset
  70. int crop_top; ///< frame_cropping_rect_top_offset
  71. int crop_bottom; ///< frame_cropping_rect_bottom_offset
  72. int vui_parameters_present_flag;
  73. AVRational sar;
  74. int timing_info_present_flag;
  75. uint32_t num_units_in_tick;
  76. uint32_t time_scale;
  77. int fixed_frame_rate_flag;
  78. short offset_for_ref_frame[256]; //FIXME dyn aloc?
  79. }SPS;
  80. /**
  81. * Picture parameter set
  82. */
  83. typedef struct PPS{
  84. int sps_id;
  85. int cabac; ///< entropy_coding_mode_flag
  86. int pic_order_present; ///< pic_order_present_flag
  87. int slice_group_count; ///< num_slice_groups_minus1 + 1
  88. int mb_slice_group_map_type;
  89. int ref_count[2]; ///< num_ref_idx_l0/1_active_minus1 + 1
  90. int weighted_pred; ///< weighted_pred_flag
  91. int weighted_bipred_idc;
  92. int init_qp; ///< pic_init_qp_minus26 + 26
  93. int init_qs; ///< pic_init_qs_minus26 + 26
  94. int chroma_qp_index_offset;
  95. int deblocking_filter_parameters_present; ///< deblocking_filter_parameters_present_flag
  96. int constrained_intra_pred; ///< constrained_intra_pred_flag
  97. int redundant_pic_cnt_present; ///< redundant_pic_cnt_present_flag
  98. }PPS;
  99. /**
  100. * Memory management control operation opcode.
  101. */
  102. typedef enum MMCOOpcode{
  103. MMCO_END=0,
  104. MMCO_SHORT2UNUSED,
  105. MMCO_LONG2UNUSED,
  106. MMCO_SHORT2LONG,
  107. MMCO_SET_MAX_LONG,
  108. MMCO_RESET,
  109. MMCO_LONG,
  110. } MMCOOpcode;
  111. /**
  112. * Memory management control operation.
  113. */
  114. typedef struct MMCO{
  115. MMCOOpcode opcode;
  116. int short_frame_num;
  117. int long_index;
  118. } MMCO;
  119. /**
  120. * H264Context
  121. */
  122. typedef struct H264Context{
  123. MpegEncContext s;
  124. int nal_ref_idc;
  125. int nal_unit_type;
  126. #define NAL_SLICE 1
  127. #define NAL_DPA 2
  128. #define NAL_DPB 3
  129. #define NAL_DPC 4
  130. #define NAL_IDR_SLICE 5
  131. #define NAL_SEI 6
  132. #define NAL_SPS 7
  133. #define NAL_PPS 8
  134. #define NAL_PICTURE_DELIMITER 9
  135. #define NAL_FILTER_DATA 10
  136. uint8_t *rbsp_buffer;
  137. int rbsp_buffer_size;
  138. /**
  139. * Used to parse AVC variant of h264
  140. */
  141. int is_avc; ///< this flag is != 0 if codec is avc1
  142. int got_avcC; ///< flag used to parse avcC data only once
  143. int nal_length_size; ///< Number of bytes used for nal length (1, 2 or 4)
  144. int chroma_qp; //QPc
  145. int prev_mb_skiped; //FIXME remove (IMHO not used)
  146. //prediction stuff
  147. int chroma_pred_mode;
  148. int intra16x16_pred_mode;
  149. int8_t intra4x4_pred_mode_cache[5*8];
  150. int8_t (*intra4x4_pred_mode)[8];
  151. void (*pred4x4 [9+3])(uint8_t *src, uint8_t *topright, int stride);//FIXME move to dsp?
  152. void (*pred8x8 [4+3])(uint8_t *src, int stride);
  153. void (*pred16x16[4+3])(uint8_t *src, int stride);
  154. unsigned int topleft_samples_available;
  155. unsigned int top_samples_available;
  156. unsigned int topright_samples_available;
  157. unsigned int left_samples_available;
  158. uint8_t (*top_border)[16+2*8];
  159. uint8_t left_border[17+2*9];
  160. /**
  161. * non zero coeff count cache.
  162. * is 64 if not available.
  163. */
  164. uint8_t non_zero_count_cache[6*8] __align8;
  165. uint8_t (*non_zero_count)[16];
  166. /**
  167. * Motion vector cache.
  168. */
  169. int16_t mv_cache[2][5*8][2] __align8;
  170. int8_t ref_cache[2][5*8] __align8;
  171. #define LIST_NOT_USED -1 //FIXME rename?
  172. #define PART_NOT_AVAILABLE -2
  173. /**
  174. * is 1 if the specific list MV&references are set to 0,0,-2.
  175. */
  176. int mv_cache_clean[2];
  177. int block_offset[16+8];
  178. int chroma_subblock_offset[16]; //FIXME remove
  179. uint16_t *mb2b_xy; //FIXME are these 4 a good idea?
  180. uint16_t *mb2b8_xy;
  181. int b_stride; //FIXME use s->b4_stride
  182. int b8_stride;
  183. int halfpel_flag;
  184. int thirdpel_flag;
  185. int unknown_svq3_flag;
  186. int next_slice_index;
  187. SPS sps_buffer[MAX_SPS_COUNT];
  188. SPS sps; ///< current sps
  189. PPS pps_buffer[MAX_PPS_COUNT];
  190. /**
  191. * current pps
  192. */
  193. PPS pps; //FIXME move tp Picture perhaps? (->no) do we need that?
  194. int slice_num;
  195. uint8_t *slice_table_base;
  196. uint8_t *slice_table; ///< slice_table_base + mb_stride + 1
  197. int slice_type;
  198. int slice_type_fixed;
  199. //interlacing specific flags
  200. int mb_field_decoding_flag;
  201. int sub_mb_type[4];
  202. //POC stuff
  203. int poc_lsb;
  204. int poc_msb;
  205. int delta_poc_bottom;
  206. int delta_poc[2];
  207. int frame_num;
  208. int prev_poc_msb; ///< poc_msb of the last reference pic for POC type 0
  209. int prev_poc_lsb; ///< poc_lsb of the last reference pic for POC type 0
  210. int frame_num_offset; ///< for POC type 2
  211. int prev_frame_num_offset; ///< for POC type 2
  212. int prev_frame_num; ///< frame_num of the last pic for POC type 1/2
  213. /**
  214. * frame_num for frames or 2*frame_num for field pics.
  215. */
  216. int curr_pic_num;
  217. /**
  218. * max_frame_num or 2*max_frame_num for field pics.
  219. */
  220. int max_pic_num;
  221. //Weighted pred stuff
  222. int use_weight;
  223. int use_weight_chroma;
  224. int luma_log2_weight_denom;
  225. int chroma_log2_weight_denom;
  226. int luma_weight[2][16];
  227. int luma_offset[2][16];
  228. int chroma_weight[2][16][2];
  229. int chroma_offset[2][16][2];
  230. int implicit_weight[16][16];
  231. //deblock
  232. int deblocking_filter; ///< disable_deblocking_filter_idc with 1<->0
  233. int slice_alpha_c0_offset;
  234. int slice_beta_offset;
  235. int redundant_pic_count;
  236. int direct_spatial_mv_pred;
  237. int dist_scale_factor[16];
  238. /**
  239. * num_ref_idx_l0/1_active_minus1 + 1
  240. */
  241. int ref_count[2];// FIXME split for AFF
  242. Picture *short_ref[16];
  243. Picture *long_ref[16];
  244. Picture default_ref_list[2][32];
  245. Picture ref_list[2][32]; //FIXME size?
  246. Picture field_ref_list[2][32]; //FIXME size?
  247. Picture *delayed_pic[16]; //FIXME size?
  248. /**
  249. * memory management control operations buffer.
  250. */
  251. MMCO mmco[MAX_MMCO_COUNT];
  252. int mmco_index;
  253. int long_ref_count; ///< number of actual long term references
  254. int short_ref_count; ///< number of actual short term references
  255. //data partitioning
  256. GetBitContext intra_gb;
  257. GetBitContext inter_gb;
  258. GetBitContext *intra_gb_ptr;
  259. GetBitContext *inter_gb_ptr;
  260. DCTELEM mb[16*24] __align8;
  261. /**
  262. * Cabac
  263. */
  264. CABACContext cabac;
  265. uint8_t cabac_state[399];
  266. int cabac_init_idc;
  267. /* 0x100 -> non null luma_dc, 0x80/0x40 -> non null chroma_dc (cb/cr), 0x?0 -> chroma_cbp(0,1,2), 0x0? luma_cbp */
  268. uint16_t *cbp_table;
  269. int top_cbp;
  270. int left_cbp;
  271. /* chroma_pred_mode for i4x4 or i16x16, else 0 */
  272. uint8_t *chroma_pred_mode_table;
  273. int last_qscale_diff;
  274. int16_t (*mvd_table[2])[2];
  275. int16_t mvd_cache[2][5*8][2] __align8;
  276. uint8_t *direct_table;
  277. uint8_t direct_cache[5*8];
  278. }H264Context;
  279. static VLC coeff_token_vlc[4];
  280. static VLC chroma_dc_coeff_token_vlc;
  281. static VLC total_zeros_vlc[15];
  282. static VLC chroma_dc_total_zeros_vlc[3];
  283. static VLC run_vlc[6];
  284. static VLC run7_vlc;
  285. static void svq3_luma_dc_dequant_idct_c(DCTELEM *block, int qp);
  286. static void svq3_add_idct_c(uint8_t *dst, DCTELEM *block, int stride, int qp, int dc);
  287. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr);
  288. static inline uint32_t pack16to32(int a, int b){
  289. #ifdef WORDS_BIGENDIAN
  290. return (b&0xFFFF) + (a<<16);
  291. #else
  292. return (a&0xFFFF) + (b<<16);
  293. #endif
  294. }
  295. /**
  296. * fill a rectangle.
  297. * @param h height of the rectangle, should be a constant
  298. * @param w width of the rectangle, should be a constant
  299. * @param size the size of val (1 or 4), should be a constant
  300. */
  301. static inline void fill_rectangle(void *vp, int w, int h, int stride, uint32_t val, int size){ //FIXME ensure this IS inlined
  302. uint8_t *p= (uint8_t*)vp;
  303. assert(size==1 || size==4);
  304. w *= size;
  305. stride *= size;
  306. assert((((int)vp)&(FFMIN(w, STRIDE_ALIGN)-1)) == 0);
  307. //FIXME check what gcc generates for 64 bit on x86 and possible write a 32 bit ver of it
  308. if(w==2 && h==2){
  309. *(uint16_t*)(p + 0)=
  310. *(uint16_t*)(p + stride)= size==4 ? val : val*0x0101;
  311. }else if(w==2 && h==4){
  312. *(uint16_t*)(p + 0*stride)=
  313. *(uint16_t*)(p + 1*stride)=
  314. *(uint16_t*)(p + 2*stride)=
  315. *(uint16_t*)(p + 3*stride)= size==4 ? val : val*0x0101;
  316. }else if(w==4 && h==1){
  317. *(uint32_t*)(p + 0*stride)= size==4 ? val : val*0x01010101;
  318. }else if(w==4 && h==2){
  319. *(uint32_t*)(p + 0*stride)=
  320. *(uint32_t*)(p + 1*stride)= size==4 ? val : val*0x01010101;
  321. }else if(w==4 && h==4){
  322. *(uint32_t*)(p + 0*stride)=
  323. *(uint32_t*)(p + 1*stride)=
  324. *(uint32_t*)(p + 2*stride)=
  325. *(uint32_t*)(p + 3*stride)= size==4 ? val : val*0x01010101;
  326. }else if(w==8 && h==1){
  327. *(uint32_t*)(p + 0)=
  328. *(uint32_t*)(p + 4)= size==4 ? val : val*0x01010101;
  329. }else if(w==8 && h==2){
  330. *(uint32_t*)(p + 0 + 0*stride)=
  331. *(uint32_t*)(p + 4 + 0*stride)=
  332. *(uint32_t*)(p + 0 + 1*stride)=
  333. *(uint32_t*)(p + 4 + 1*stride)= size==4 ? val : val*0x01010101;
  334. }else if(w==8 && h==4){
  335. *(uint64_t*)(p + 0*stride)=
  336. *(uint64_t*)(p + 1*stride)=
  337. *(uint64_t*)(p + 2*stride)=
  338. *(uint64_t*)(p + 3*stride)= size==4 ? val*0x0100000001ULL : val*0x0101010101010101ULL;
  339. }else if(w==16 && h==2){
  340. *(uint64_t*)(p + 0+0*stride)=
  341. *(uint64_t*)(p + 8+0*stride)=
  342. *(uint64_t*)(p + 0+1*stride)=
  343. *(uint64_t*)(p + 8+1*stride)= size==4 ? val*0x0100000001ULL : val*0x0101010101010101ULL;
  344. }else if(w==16 && h==4){
  345. *(uint64_t*)(p + 0+0*stride)=
  346. *(uint64_t*)(p + 8+0*stride)=
  347. *(uint64_t*)(p + 0+1*stride)=
  348. *(uint64_t*)(p + 8+1*stride)=
  349. *(uint64_t*)(p + 0+2*stride)=
  350. *(uint64_t*)(p + 8+2*stride)=
  351. *(uint64_t*)(p + 0+3*stride)=
  352. *(uint64_t*)(p + 8+3*stride)= size==4 ? val*0x0100000001ULL : val*0x0101010101010101ULL;
  353. }else
  354. assert(0);
  355. }
  356. static inline void fill_caches(H264Context *h, int mb_type, int for_deblock){
  357. MpegEncContext * const s = &h->s;
  358. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  359. int topleft_xy, top_xy, topright_xy, left_xy[2];
  360. int topleft_type, top_type, topright_type, left_type[2];
  361. int left_block[4];
  362. int i;
  363. //wow what a mess, why didnt they simplify the interlacing&intra stuff, i cant imagine that these complex rules are worth it
  364. if(h->sps.mb_aff){
  365. //FIXME
  366. topleft_xy = 0; /* avoid warning */
  367. top_xy = 0; /* avoid warning */
  368. topright_xy = 0; /* avoid warning */
  369. }else{
  370. topleft_xy = mb_xy-1 - s->mb_stride;
  371. top_xy = mb_xy - s->mb_stride;
  372. topright_xy= mb_xy+1 - s->mb_stride;
  373. left_xy[0] = mb_xy-1;
  374. left_xy[1] = mb_xy-1;
  375. left_block[0]= 0;
  376. left_block[1]= 1;
  377. left_block[2]= 2;
  378. left_block[3]= 3;
  379. }
  380. if(for_deblock){
  381. topleft_type = h->slice_table[topleft_xy ] < 255 ? s->current_picture.mb_type[topleft_xy] : 0;
  382. top_type = h->slice_table[top_xy ] < 255 ? s->current_picture.mb_type[top_xy] : 0;
  383. topright_type= h->slice_table[topright_xy] < 255 ? s->current_picture.mb_type[topright_xy]: 0;
  384. left_type[0] = h->slice_table[left_xy[0] ] < 255 ? s->current_picture.mb_type[left_xy[0]] : 0;
  385. left_type[1] = h->slice_table[left_xy[1] ] < 255 ? s->current_picture.mb_type[left_xy[1]] : 0;
  386. }else{
  387. topleft_type = h->slice_table[topleft_xy ] == h->slice_num ? s->current_picture.mb_type[topleft_xy] : 0;
  388. top_type = h->slice_table[top_xy ] == h->slice_num ? s->current_picture.mb_type[top_xy] : 0;
  389. topright_type= h->slice_table[topright_xy] == h->slice_num ? s->current_picture.mb_type[topright_xy]: 0;
  390. left_type[0] = h->slice_table[left_xy[0] ] == h->slice_num ? s->current_picture.mb_type[left_xy[0]] : 0;
  391. left_type[1] = h->slice_table[left_xy[1] ] == h->slice_num ? s->current_picture.mb_type[left_xy[1]] : 0;
  392. }
  393. if(IS_INTRA(mb_type)){
  394. h->topleft_samples_available=
  395. h->top_samples_available=
  396. h->left_samples_available= 0xFFFF;
  397. h->topright_samples_available= 0xEEEA;
  398. if(!IS_INTRA(top_type) && (top_type==0 || h->pps.constrained_intra_pred)){
  399. h->topleft_samples_available= 0xB3FF;
  400. h->top_samples_available= 0x33FF;
  401. h->topright_samples_available= 0x26EA;
  402. }
  403. for(i=0; i<2; i++){
  404. if(!IS_INTRA(left_type[i]) && (left_type[i]==0 || h->pps.constrained_intra_pred)){
  405. h->topleft_samples_available&= 0xDF5F;
  406. h->left_samples_available&= 0x5F5F;
  407. }
  408. }
  409. if(!IS_INTRA(topleft_type) && (topleft_type==0 || h->pps.constrained_intra_pred))
  410. h->topleft_samples_available&= 0x7FFF;
  411. if(!IS_INTRA(topright_type) && (topright_type==0 || h->pps.constrained_intra_pred))
  412. h->topright_samples_available&= 0xFBFF;
  413. if(IS_INTRA4x4(mb_type)){
  414. if(IS_INTRA4x4(top_type)){
  415. h->intra4x4_pred_mode_cache[4+8*0]= h->intra4x4_pred_mode[top_xy][4];
  416. h->intra4x4_pred_mode_cache[5+8*0]= h->intra4x4_pred_mode[top_xy][5];
  417. h->intra4x4_pred_mode_cache[6+8*0]= h->intra4x4_pred_mode[top_xy][6];
  418. h->intra4x4_pred_mode_cache[7+8*0]= h->intra4x4_pred_mode[top_xy][3];
  419. }else{
  420. int pred;
  421. if(IS_INTRA16x16(top_type) || (IS_INTER(top_type) && !h->pps.constrained_intra_pred))
  422. pred= 2;
  423. else{
  424. pred= -1;
  425. }
  426. h->intra4x4_pred_mode_cache[4+8*0]=
  427. h->intra4x4_pred_mode_cache[5+8*0]=
  428. h->intra4x4_pred_mode_cache[6+8*0]=
  429. h->intra4x4_pred_mode_cache[7+8*0]= pred;
  430. }
  431. for(i=0; i<2; i++){
  432. if(IS_INTRA4x4(left_type[i])){
  433. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[0+2*i]];
  434. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[1+2*i]];
  435. }else{
  436. int pred;
  437. if(IS_INTRA16x16(left_type[i]) || (IS_INTER(left_type[i]) && !h->pps.constrained_intra_pred))
  438. pred= 2;
  439. else{
  440. pred= -1;
  441. }
  442. h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]=
  443. h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= pred;
  444. }
  445. }
  446. }
  447. }
  448. /*
  449. 0 . T T. T T T T
  450. 1 L . .L . . . .
  451. 2 L . .L . . . .
  452. 3 . T TL . . . .
  453. 4 L . .L . . . .
  454. 5 L . .. . . . .
  455. */
  456. //FIXME constraint_intra_pred & partitioning & nnz (lets hope this is just a typo in the spec)
  457. if(top_type){
  458. h->non_zero_count_cache[4+8*0]= h->non_zero_count[top_xy][0];
  459. h->non_zero_count_cache[5+8*0]= h->non_zero_count[top_xy][1];
  460. h->non_zero_count_cache[6+8*0]= h->non_zero_count[top_xy][2];
  461. h->non_zero_count_cache[7+8*0]= h->non_zero_count[top_xy][3];
  462. h->non_zero_count_cache[1+8*0]= h->non_zero_count[top_xy][7];
  463. h->non_zero_count_cache[2+8*0]= h->non_zero_count[top_xy][8];
  464. h->non_zero_count_cache[1+8*3]= h->non_zero_count[top_xy][10];
  465. h->non_zero_count_cache[2+8*3]= h->non_zero_count[top_xy][11];
  466. h->top_cbp= h->cbp_table[top_xy];
  467. }else{
  468. h->non_zero_count_cache[4+8*0]=
  469. h->non_zero_count_cache[5+8*0]=
  470. h->non_zero_count_cache[6+8*0]=
  471. h->non_zero_count_cache[7+8*0]=
  472. h->non_zero_count_cache[1+8*0]=
  473. h->non_zero_count_cache[2+8*0]=
  474. h->non_zero_count_cache[1+8*3]=
  475. h->non_zero_count_cache[2+8*3]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  476. if(IS_INTRA(mb_type)) h->top_cbp= 0x1C0;
  477. else h->top_cbp= 0;
  478. }
  479. if(left_type[0]){
  480. h->non_zero_count_cache[3+8*1]= h->non_zero_count[left_xy[0]][6];
  481. h->non_zero_count_cache[3+8*2]= h->non_zero_count[left_xy[0]][5];
  482. h->non_zero_count_cache[0+8*1]= h->non_zero_count[left_xy[0]][9]; //FIXME left_block
  483. h->non_zero_count_cache[0+8*4]= h->non_zero_count[left_xy[0]][12];
  484. h->left_cbp= h->cbp_table[left_xy[0]]; //FIXME interlacing
  485. }else{
  486. h->non_zero_count_cache[3+8*1]=
  487. h->non_zero_count_cache[3+8*2]=
  488. h->non_zero_count_cache[0+8*1]=
  489. h->non_zero_count_cache[0+8*4]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  490. if(IS_INTRA(mb_type)) h->left_cbp= 0x1C0;//FIXME interlacing
  491. else h->left_cbp= 0;
  492. }
  493. if(left_type[1]){
  494. h->non_zero_count_cache[3+8*3]= h->non_zero_count[left_xy[1]][4];
  495. h->non_zero_count_cache[3+8*4]= h->non_zero_count[left_xy[1]][3];
  496. h->non_zero_count_cache[0+8*2]= h->non_zero_count[left_xy[1]][8];
  497. h->non_zero_count_cache[0+8*5]= h->non_zero_count[left_xy[1]][11];
  498. }else{
  499. h->non_zero_count_cache[3+8*3]=
  500. h->non_zero_count_cache[3+8*4]=
  501. h->non_zero_count_cache[0+8*2]=
  502. h->non_zero_count_cache[0+8*5]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;
  503. }
  504. #if 1
  505. //FIXME direct mb can skip much of this
  506. if(IS_INTER(mb_type) || (IS_DIRECT(mb_type) && h->direct_spatial_mv_pred)){
  507. int list;
  508. for(list=0; list<2; list++){
  509. if((!IS_8X8(mb_type)) && !USES_LIST(mb_type, list) && !IS_DIRECT(mb_type)){
  510. /*if(!h->mv_cache_clean[list]){
  511. memset(h->mv_cache [list], 0, 8*5*2*sizeof(int16_t)); //FIXME clean only input? clean at all?
  512. memset(h->ref_cache[list], PART_NOT_AVAILABLE, 8*5*sizeof(int8_t));
  513. h->mv_cache_clean[list]= 1;
  514. }*/
  515. continue;
  516. }
  517. h->mv_cache_clean[list]= 0;
  518. if(IS_INTER(topleft_type)){
  519. const int b_xy = h->mb2b_xy[topleft_xy] + 3 + 3*h->b_stride;
  520. const int b8_xy= h->mb2b8_xy[topleft_xy] + 1 + h->b8_stride;
  521. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  522. h->ref_cache[list][scan8[0] - 1 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  523. }else{
  524. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= 0;
  525. h->ref_cache[list][scan8[0] - 1 - 1*8]= topleft_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  526. }
  527. if(IS_INTER(top_type)){
  528. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  529. const int b8_xy= h->mb2b8_xy[top_xy] + h->b8_stride;
  530. *(uint32_t*)h->mv_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 0];
  531. *(uint32_t*)h->mv_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 1];
  532. *(uint32_t*)h->mv_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 2];
  533. *(uint32_t*)h->mv_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 3];
  534. h->ref_cache[list][scan8[0] + 0 - 1*8]=
  535. h->ref_cache[list][scan8[0] + 1 - 1*8]= s->current_picture.ref_index[list][b8_xy + 0];
  536. h->ref_cache[list][scan8[0] + 2 - 1*8]=
  537. h->ref_cache[list][scan8[0] + 3 - 1*8]= s->current_picture.ref_index[list][b8_xy + 1];
  538. }else{
  539. *(uint32_t*)h->mv_cache [list][scan8[0] + 0 - 1*8]=
  540. *(uint32_t*)h->mv_cache [list][scan8[0] + 1 - 1*8]=
  541. *(uint32_t*)h->mv_cache [list][scan8[0] + 2 - 1*8]=
  542. *(uint32_t*)h->mv_cache [list][scan8[0] + 3 - 1*8]= 0;
  543. *(uint32_t*)&h->ref_cache[list][scan8[0] + 0 - 1*8]= ((top_type ? LIST_NOT_USED : PART_NOT_AVAILABLE)&0xFF)*0x01010101;
  544. }
  545. if(IS_INTER(topright_type)){
  546. const int b_xy= h->mb2b_xy[topright_xy] + 3*h->b_stride;
  547. const int b8_xy= h->mb2b8_xy[topright_xy] + h->b8_stride;
  548. *(uint32_t*)h->mv_cache[list][scan8[0] + 4 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];
  549. h->ref_cache[list][scan8[0] + 4 - 1*8]= s->current_picture.ref_index[list][b8_xy];
  550. }else{
  551. *(uint32_t*)h->mv_cache [list][scan8[0] + 4 - 1*8]= 0;
  552. h->ref_cache[list][scan8[0] + 4 - 1*8]= topright_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  553. }
  554. //FIXME unify cleanup or sth
  555. if(IS_INTER(left_type[0])){
  556. const int b_xy= h->mb2b_xy[left_xy[0]] + 3;
  557. const int b8_xy= h->mb2b8_xy[left_xy[0]] + 1;
  558. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 + 0*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[0]];
  559. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 + 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[1]];
  560. h->ref_cache[list][scan8[0] - 1 + 0*8]=
  561. h->ref_cache[list][scan8[0] - 1 + 1*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[0]>>1)];
  562. }else{
  563. *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 0*8]=
  564. *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 1*8]= 0;
  565. h->ref_cache[list][scan8[0] - 1 + 0*8]=
  566. h->ref_cache[list][scan8[0] - 1 + 1*8]= left_type[0] ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  567. }
  568. if(IS_INTER(left_type[1])){
  569. const int b_xy= h->mb2b_xy[left_xy[1]] + 3;
  570. const int b8_xy= h->mb2b8_xy[left_xy[1]] + 1;
  571. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 + 2*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[2]];
  572. *(uint32_t*)h->mv_cache[list][scan8[0] - 1 + 3*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + h->b_stride*left_block[3]];
  573. h->ref_cache[list][scan8[0] - 1 + 2*8]=
  574. h->ref_cache[list][scan8[0] - 1 + 3*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[2]>>1)];
  575. }else{
  576. *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 2*8]=
  577. *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 3*8]= 0;
  578. h->ref_cache[list][scan8[0] - 1 + 2*8]=
  579. h->ref_cache[list][scan8[0] - 1 + 3*8]= left_type[0] ? LIST_NOT_USED : PART_NOT_AVAILABLE;
  580. }
  581. if(for_deblock)
  582. continue;
  583. h->ref_cache[list][scan8[5 ]+1] =
  584. h->ref_cache[list][scan8[7 ]+1] =
  585. h->ref_cache[list][scan8[13]+1] = //FIXME remove past 3 (init somewher else)
  586. h->ref_cache[list][scan8[4 ]] =
  587. h->ref_cache[list][scan8[12]] = PART_NOT_AVAILABLE;
  588. *(uint32_t*)h->mv_cache [list][scan8[5 ]+1]=
  589. *(uint32_t*)h->mv_cache [list][scan8[7 ]+1]=
  590. *(uint32_t*)h->mv_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewher else)
  591. *(uint32_t*)h->mv_cache [list][scan8[4 ]]=
  592. *(uint32_t*)h->mv_cache [list][scan8[12]]= 0;
  593. if( h->pps.cabac ) {
  594. /* XXX beurk, Load mvd */
  595. if(IS_INTER(topleft_type)){
  596. const int b_xy = h->mb2b_xy[topleft_xy] + 3 + 3*h->b_stride;
  597. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy];
  598. }else{
  599. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 - 1*8]= 0;
  600. }
  601. if(IS_INTER(top_type)){
  602. const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;
  603. *(uint32_t*)h->mvd_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 0];
  604. *(uint32_t*)h->mvd_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 1];
  605. *(uint32_t*)h->mvd_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 2];
  606. *(uint32_t*)h->mvd_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 3];
  607. }else{
  608. *(uint32_t*)h->mvd_cache [list][scan8[0] + 0 - 1*8]=
  609. *(uint32_t*)h->mvd_cache [list][scan8[0] + 1 - 1*8]=
  610. *(uint32_t*)h->mvd_cache [list][scan8[0] + 2 - 1*8]=
  611. *(uint32_t*)h->mvd_cache [list][scan8[0] + 3 - 1*8]= 0;
  612. }
  613. if(IS_INTER(left_type[0])){
  614. const int b_xy= h->mb2b_xy[left_xy[0]] + 3;
  615. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 0*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[0]];
  616. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[1]];
  617. }else{
  618. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 0*8]=
  619. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 1*8]= 0;
  620. }
  621. if(IS_INTER(left_type[1])){
  622. const int b_xy= h->mb2b_xy[left_xy[1]] + 3;
  623. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 2*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[2]];
  624. *(uint32_t*)h->mvd_cache[list][scan8[0] - 1 + 3*8]= *(uint32_t*)h->mvd_table[list][b_xy + h->b_stride*left_block[3]];
  625. }else{
  626. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 2*8]=
  627. *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 3*8]= 0;
  628. }
  629. *(uint32_t*)h->mvd_cache [list][scan8[5 ]+1]=
  630. *(uint32_t*)h->mvd_cache [list][scan8[7 ]+1]=
  631. *(uint32_t*)h->mvd_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewher else)
  632. *(uint32_t*)h->mvd_cache [list][scan8[4 ]]=
  633. *(uint32_t*)h->mvd_cache [list][scan8[12]]= 0;
  634. if(h->slice_type == B_TYPE){
  635. fill_rectangle(&h->direct_cache[scan8[0]], 4, 4, 8, 0, 1);
  636. if(IS_DIRECT(top_type)){
  637. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0x01010101;
  638. }else if(IS_8X8(top_type)){
  639. int b8_xy = h->mb2b8_xy[top_xy] + h->b8_stride;
  640. h->direct_cache[scan8[0] + 0 - 1*8]= h->direct_table[b8_xy];
  641. h->direct_cache[scan8[0] + 2 - 1*8]= h->direct_table[b8_xy + 1];
  642. }else{
  643. *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0;
  644. }
  645. //FIXME interlacing
  646. if(IS_DIRECT(left_type[0])){
  647. h->direct_cache[scan8[0] - 1 + 0*8]=
  648. h->direct_cache[scan8[0] - 1 + 2*8]= 1;
  649. }else if(IS_8X8(left_type[0])){
  650. int b8_xy = h->mb2b8_xy[left_xy[0]] + 1;
  651. h->direct_cache[scan8[0] - 1 + 0*8]= h->direct_table[b8_xy];
  652. h->direct_cache[scan8[0] - 1 + 2*8]= h->direct_table[b8_xy + h->b8_stride];
  653. }else{
  654. h->direct_cache[scan8[0] - 1 + 0*8]=
  655. h->direct_cache[scan8[0] - 1 + 2*8]= 0;
  656. }
  657. }
  658. }
  659. }
  660. }
  661. #endif
  662. }
  663. static inline void write_back_intra_pred_mode(H264Context *h){
  664. MpegEncContext * const s = &h->s;
  665. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  666. h->intra4x4_pred_mode[mb_xy][0]= h->intra4x4_pred_mode_cache[7+8*1];
  667. h->intra4x4_pred_mode[mb_xy][1]= h->intra4x4_pred_mode_cache[7+8*2];
  668. h->intra4x4_pred_mode[mb_xy][2]= h->intra4x4_pred_mode_cache[7+8*3];
  669. h->intra4x4_pred_mode[mb_xy][3]= h->intra4x4_pred_mode_cache[7+8*4];
  670. h->intra4x4_pred_mode[mb_xy][4]= h->intra4x4_pred_mode_cache[4+8*4];
  671. h->intra4x4_pred_mode[mb_xy][5]= h->intra4x4_pred_mode_cache[5+8*4];
  672. h->intra4x4_pred_mode[mb_xy][6]= h->intra4x4_pred_mode_cache[6+8*4];
  673. }
  674. /**
  675. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  676. */
  677. static inline int check_intra4x4_pred_mode(H264Context *h){
  678. MpegEncContext * const s = &h->s;
  679. static const int8_t top [12]= {-1, 0,LEFT_DC_PRED,-1,-1,-1,-1,-1, 0};
  680. static const int8_t left[12]= { 0,-1, TOP_DC_PRED, 0,-1,-1,-1, 0,-1,DC_128_PRED};
  681. int i;
  682. if(!(h->top_samples_available&0x8000)){
  683. for(i=0; i<4; i++){
  684. int status= top[ h->intra4x4_pred_mode_cache[scan8[0] + i] ];
  685. if(status<0){
  686. av_log(h->s.avctx, AV_LOG_ERROR, "top block unavailable for requested intra4x4 mode %d at %d %d\n", status, s->mb_x, s->mb_y);
  687. return -1;
  688. } else if(status){
  689. h->intra4x4_pred_mode_cache[scan8[0] + i]= status;
  690. }
  691. }
  692. }
  693. if(!(h->left_samples_available&0x8000)){
  694. for(i=0; i<4; i++){
  695. int status= left[ h->intra4x4_pred_mode_cache[scan8[0] + 8*i] ];
  696. if(status<0){
  697. av_log(h->s.avctx, AV_LOG_ERROR, "left block unavailable for requested intra4x4 mode %d at %d %d\n", status, s->mb_x, s->mb_y);
  698. return -1;
  699. } else if(status){
  700. h->intra4x4_pred_mode_cache[scan8[0] + 8*i]= status;
  701. }
  702. }
  703. }
  704. return 0;
  705. } //FIXME cleanup like next
  706. /**
  707. * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.
  708. */
  709. static inline int check_intra_pred_mode(H264Context *h, int mode){
  710. MpegEncContext * const s = &h->s;
  711. static const int8_t top [7]= {LEFT_DC_PRED8x8, 1,-1,-1};
  712. static const int8_t left[7]= { TOP_DC_PRED8x8,-1, 2,-1,DC_128_PRED8x8};
  713. if(mode < 0 || mode > 6) {
  714. av_log(h->s.avctx, AV_LOG_ERROR, "out of range intra chroma pred mode at %d %d\n", s->mb_x, s->mb_y);
  715. return -1;
  716. }
  717. if(!(h->top_samples_available&0x8000)){
  718. mode= top[ mode ];
  719. if(mode<0){
  720. av_log(h->s.avctx, AV_LOG_ERROR, "top block unavailable for requested intra mode at %d %d\n", s->mb_x, s->mb_y);
  721. return -1;
  722. }
  723. }
  724. if(!(h->left_samples_available&0x8000)){
  725. mode= left[ mode ];
  726. if(mode<0){
  727. av_log(h->s.avctx, AV_LOG_ERROR, "left block unavailable for requested intra mode at %d %d\n", s->mb_x, s->mb_y);
  728. return -1;
  729. }
  730. }
  731. return mode;
  732. }
  733. /**
  734. * gets the predicted intra4x4 prediction mode.
  735. */
  736. static inline int pred_intra_mode(H264Context *h, int n){
  737. const int index8= scan8[n];
  738. const int left= h->intra4x4_pred_mode_cache[index8 - 1];
  739. const int top = h->intra4x4_pred_mode_cache[index8 - 8];
  740. const int min= FFMIN(left, top);
  741. tprintf("mode:%d %d min:%d\n", left ,top, min);
  742. if(min<0) return DC_PRED;
  743. else return min;
  744. }
  745. static inline void write_back_non_zero_count(H264Context *h){
  746. MpegEncContext * const s = &h->s;
  747. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  748. h->non_zero_count[mb_xy][0]= h->non_zero_count_cache[4+8*4];
  749. h->non_zero_count[mb_xy][1]= h->non_zero_count_cache[5+8*4];
  750. h->non_zero_count[mb_xy][2]= h->non_zero_count_cache[6+8*4];
  751. h->non_zero_count[mb_xy][3]= h->non_zero_count_cache[7+8*4];
  752. h->non_zero_count[mb_xy][4]= h->non_zero_count_cache[7+8*3];
  753. h->non_zero_count[mb_xy][5]= h->non_zero_count_cache[7+8*2];
  754. h->non_zero_count[mb_xy][6]= h->non_zero_count_cache[7+8*1];
  755. h->non_zero_count[mb_xy][7]= h->non_zero_count_cache[1+8*2];
  756. h->non_zero_count[mb_xy][8]= h->non_zero_count_cache[2+8*2];
  757. h->non_zero_count[mb_xy][9]= h->non_zero_count_cache[2+8*1];
  758. h->non_zero_count[mb_xy][10]=h->non_zero_count_cache[1+8*5];
  759. h->non_zero_count[mb_xy][11]=h->non_zero_count_cache[2+8*5];
  760. h->non_zero_count[mb_xy][12]=h->non_zero_count_cache[2+8*4];
  761. }
  762. /**
  763. * gets the predicted number of non zero coefficients.
  764. * @param n block index
  765. */
  766. static inline int pred_non_zero_count(H264Context *h, int n){
  767. const int index8= scan8[n];
  768. const int left= h->non_zero_count_cache[index8 - 1];
  769. const int top = h->non_zero_count_cache[index8 - 8];
  770. int i= left + top;
  771. if(i<64) i= (i+1)>>1;
  772. tprintf("pred_nnz L%X T%X n%d s%d P%X\n", left, top, n, scan8[n], i&31);
  773. return i&31;
  774. }
  775. static inline int fetch_diagonal_mv(H264Context *h, const int16_t **C, int i, int list, int part_width){
  776. const int topright_ref= h->ref_cache[list][ i - 8 + part_width ];
  777. if(topright_ref != PART_NOT_AVAILABLE){
  778. *C= h->mv_cache[list][ i - 8 + part_width ];
  779. return topright_ref;
  780. }else{
  781. tprintf("topright MV not available\n");
  782. *C= h->mv_cache[list][ i - 8 - 1 ];
  783. return h->ref_cache[list][ i - 8 - 1 ];
  784. }
  785. }
  786. /**
  787. * gets the predicted MV.
  788. * @param n the block index
  789. * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)
  790. * @param mx the x component of the predicted motion vector
  791. * @param my the y component of the predicted motion vector
  792. */
  793. static inline void pred_motion(H264Context * const h, int n, int part_width, int list, int ref, int * const mx, int * const my){
  794. const int index8= scan8[n];
  795. const int top_ref= h->ref_cache[list][ index8 - 8 ];
  796. const int left_ref= h->ref_cache[list][ index8 - 1 ];
  797. const int16_t * const A= h->mv_cache[list][ index8 - 1 ];
  798. const int16_t * const B= h->mv_cache[list][ index8 - 8 ];
  799. const int16_t * C;
  800. int diagonal_ref, match_count;
  801. assert(part_width==1 || part_width==2 || part_width==4);
  802. /* mv_cache
  803. B . . A T T T T
  804. U . . L . . , .
  805. U . . L . . . .
  806. U . . L . . , .
  807. . . . L . . . .
  808. */
  809. diagonal_ref= fetch_diagonal_mv(h, &C, index8, list, part_width);
  810. match_count= (diagonal_ref==ref) + (top_ref==ref) + (left_ref==ref);
  811. tprintf("pred_motion match_count=%d\n", match_count);
  812. if(match_count > 1){ //most common
  813. *mx= mid_pred(A[0], B[0], C[0]);
  814. *my= mid_pred(A[1], B[1], C[1]);
  815. }else if(match_count==1){
  816. if(left_ref==ref){
  817. *mx= A[0];
  818. *my= A[1];
  819. }else if(top_ref==ref){
  820. *mx= B[0];
  821. *my= B[1];
  822. }else{
  823. *mx= C[0];
  824. *my= C[1];
  825. }
  826. }else{
  827. if(top_ref == PART_NOT_AVAILABLE && diagonal_ref == PART_NOT_AVAILABLE && left_ref != PART_NOT_AVAILABLE){
  828. *mx= A[0];
  829. *my= A[1];
  830. }else{
  831. *mx= mid_pred(A[0], B[0], C[0]);
  832. *my= mid_pred(A[1], B[1], C[1]);
  833. }
  834. }
  835. tprintf("pred_motion (%2d %2d %2d) (%2d %2d %2d) (%2d %2d %2d) -> (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], diagonal_ref, C[0], C[1], left_ref, A[0], A[1], ref, *mx, *my, h->s.mb_x, h->s.mb_y, n, list);
  836. }
  837. /**
  838. * gets the directionally predicted 16x8 MV.
  839. * @param n the block index
  840. * @param mx the x component of the predicted motion vector
  841. * @param my the y component of the predicted motion vector
  842. */
  843. static inline void pred_16x8_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  844. if(n==0){
  845. const int top_ref= h->ref_cache[list][ scan8[0] - 8 ];
  846. const int16_t * const B= h->mv_cache[list][ scan8[0] - 8 ];
  847. tprintf("pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], h->s.mb_x, h->s.mb_y, n, list);
  848. if(top_ref == ref){
  849. *mx= B[0];
  850. *my= B[1];
  851. return;
  852. }
  853. }else{
  854. const int left_ref= h->ref_cache[list][ scan8[8] - 1 ];
  855. const int16_t * const A= h->mv_cache[list][ scan8[8] - 1 ];
  856. tprintf("pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  857. if(left_ref == ref){
  858. *mx= A[0];
  859. *my= A[1];
  860. return;
  861. }
  862. }
  863. //RARE
  864. pred_motion(h, n, 4, list, ref, mx, my);
  865. }
  866. /**
  867. * gets the directionally predicted 8x16 MV.
  868. * @param n the block index
  869. * @param mx the x component of the predicted motion vector
  870. * @param my the y component of the predicted motion vector
  871. */
  872. static inline void pred_8x16_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  873. if(n==0){
  874. const int left_ref= h->ref_cache[list][ scan8[0] - 1 ];
  875. const int16_t * const A= h->mv_cache[list][ scan8[0] - 1 ];
  876. tprintf("pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  877. if(left_ref == ref){
  878. *mx= A[0];
  879. *my= A[1];
  880. return;
  881. }
  882. }else{
  883. const int16_t * C;
  884. int diagonal_ref;
  885. diagonal_ref= fetch_diagonal_mv(h, &C, scan8[4], list, 2);
  886. tprintf("pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", diagonal_ref, C[0], C[1], h->s.mb_x, h->s.mb_y, n, list);
  887. if(diagonal_ref == ref){
  888. *mx= C[0];
  889. *my= C[1];
  890. return;
  891. }
  892. }
  893. //RARE
  894. pred_motion(h, n, 2, list, ref, mx, my);
  895. }
  896. static inline void pred_pskip_motion(H264Context * const h, int * const mx, int * const my){
  897. const int top_ref = h->ref_cache[0][ scan8[0] - 8 ];
  898. const int left_ref= h->ref_cache[0][ scan8[0] - 1 ];
  899. tprintf("pred_pskip: (%d) (%d) at %2d %2d\n", top_ref, left_ref, h->s.mb_x, h->s.mb_y);
  900. if(top_ref == PART_NOT_AVAILABLE || left_ref == PART_NOT_AVAILABLE
  901. || (top_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 8 ] == 0)
  902. || (left_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 1 ] == 0)){
  903. *mx = *my = 0;
  904. return;
  905. }
  906. pred_motion(h, 0, 4, 0, 0, mx, my);
  907. return;
  908. }
  909. static inline void direct_dist_scale_factor(H264Context * const h){
  910. const int poc = h->s.current_picture_ptr->poc;
  911. const int poc1 = h->ref_list[1][0].poc;
  912. int i;
  913. for(i=0; i<h->ref_count[0]; i++){
  914. int poc0 = h->ref_list[0][i].poc;
  915. int td = clip(poc1 - poc0, -128, 127);
  916. if(td == 0 /* FIXME || pic0 is a long-term ref */){
  917. h->dist_scale_factor[i] = 256;
  918. }else{
  919. int tb = clip(poc - poc0, -128, 127);
  920. int tx = (16384 + (ABS(td) >> 1)) / td;
  921. h->dist_scale_factor[i] = clip((tb*tx + 32) >> 6, -1024, 1023);
  922. }
  923. }
  924. }
  925. static inline void pred_direct_motion(H264Context * const h, int *mb_type){
  926. MpegEncContext * const s = &h->s;
  927. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  928. const int b8_xy = 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  929. const int b4_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  930. const int mb_type_col = h->ref_list[1][0].mb_type[mb_xy];
  931. const int16_t (*l1mv0)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[0][b4_xy];
  932. const int8_t *l1ref0 = &h->ref_list[1][0].ref_index[0][b8_xy];
  933. const int is_b8x8 = IS_8X8(*mb_type);
  934. int sub_mb_type;
  935. int i8, i4;
  936. if(IS_8X8(mb_type_col) && !h->sps.direct_8x8_inference_flag){
  937. /* FIXME save sub mb types from previous frames (or derive from MVs)
  938. * so we know exactly what block size to use */
  939. sub_mb_type = MB_TYPE_8x8|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_4x4 */
  940. *mb_type = MB_TYPE_8x8;
  941. }else if(!is_b8x8 && (IS_16X16(mb_type_col) || IS_INTRA(mb_type_col))){
  942. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  943. *mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_16x16 */
  944. }else{
  945. sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */
  946. *mb_type = MB_TYPE_8x8;
  947. }
  948. if(!is_b8x8)
  949. *mb_type |= MB_TYPE_DIRECT2;
  950. tprintf("mb_type = %08x, sub_mb_type = %08x, is_b8x8 = %d, mb_type_col = %08x\n", *mb_type, sub_mb_type, is_b8x8, mb_type_col);
  951. if(h->direct_spatial_mv_pred){
  952. int ref[2];
  953. int mv[2][2];
  954. int list;
  955. /* ref = min(neighbors) */
  956. for(list=0; list<2; list++){
  957. int refa = h->ref_cache[list][scan8[0] - 1];
  958. int refb = h->ref_cache[list][scan8[0] - 8];
  959. int refc = h->ref_cache[list][scan8[0] - 8 + 4];
  960. if(refc == -2)
  961. refc = h->ref_cache[list][scan8[0] - 8 - 1];
  962. ref[list] = refa;
  963. if(ref[list] < 0 || (refb < ref[list] && refb >= 0))
  964. ref[list] = refb;
  965. if(ref[list] < 0 || (refc < ref[list] && refc >= 0))
  966. ref[list] = refc;
  967. if(ref[list] < 0)
  968. ref[list] = -1;
  969. }
  970. if(ref[0] < 0 && ref[1] < 0){
  971. ref[0] = ref[1] = 0;
  972. mv[0][0] = mv[0][1] =
  973. mv[1][0] = mv[1][1] = 0;
  974. }else{
  975. for(list=0; list<2; list++){
  976. if(ref[list] >= 0)
  977. pred_motion(h, 0, 4, list, ref[list], &mv[list][0], &mv[list][1]);
  978. else
  979. mv[list][0] = mv[list][1] = 0;
  980. }
  981. }
  982. if(ref[1] < 0){
  983. *mb_type &= ~MB_TYPE_P0L1;
  984. sub_mb_type &= ~MB_TYPE_P0L1;
  985. }else if(ref[0] < 0){
  986. *mb_type &= ~MB_TYPE_P0L0;
  987. sub_mb_type &= ~MB_TYPE_P0L0;
  988. }
  989. if(IS_16X16(*mb_type)){
  990. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref[0], 1);
  991. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, ref[1], 1);
  992. if(!IS_INTRA(mb_type_col) && l1ref0[0] == 0 &&
  993. ABS(l1mv0[0][0]) <= 1 && ABS(l1mv0[0][1]) <= 1){
  994. if(ref[0] > 0)
  995. fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv[0][0],mv[0][1]), 4);
  996. else
  997. fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  998. if(ref[1] > 0)
  999. fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, pack16to32(mv[1][0],mv[1][1]), 4);
  1000. else
  1001. fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  1002. }else{
  1003. fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv[0][0],mv[0][1]), 4);
  1004. fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, pack16to32(mv[1][0],mv[1][1]), 4);
  1005. }
  1006. }else{
  1007. for(i8=0; i8<4; i8++){
  1008. const int x8 = i8&1;
  1009. const int y8 = i8>>1;
  1010. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1011. continue;
  1012. h->sub_mb_type[i8] = sub_mb_type;
  1013. fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mv[0][0],mv[0][1]), 4);
  1014. fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mv[1][0],mv[1][1]), 4);
  1015. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref[0], 1);
  1016. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, ref[1], 1);
  1017. /* col_zero_flag */
  1018. if(!IS_INTRA(mb_type_col) && l1ref0[x8 + y8*h->b8_stride] == 0){
  1019. for(i4=0; i4<4; i4++){
  1020. const int16_t *mv_col = l1mv0[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1021. if(ABS(mv_col[0]) <= 1 && ABS(mv_col[1]) <= 1){
  1022. if(ref[0] == 0)
  1023. *(uint32_t*)h->mv_cache[0][scan8[i8*4+i4]] = 0;
  1024. if(ref[1] == 0)
  1025. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] = 0;
  1026. }
  1027. }
  1028. }
  1029. }
  1030. }
  1031. }else{ /* direct temporal mv pred */
  1032. /* FIXME assumes that L1ref0 used the same ref lists as current frame */
  1033. if(IS_16X16(*mb_type)){
  1034. fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, 0, 1);
  1035. if(IS_INTRA(mb_type_col)){
  1036. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);
  1037. fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  1038. fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  1039. }else{
  1040. const int ref0 = l1ref0[0];
  1041. const int dist_scale_factor = h->dist_scale_factor[ref0];
  1042. const int16_t *mv_col = l1mv0[0];
  1043. int mv_l0[2];
  1044. mv_l0[0] = (dist_scale_factor * mv_col[0] + 128) >> 8;
  1045. mv_l0[1] = (dist_scale_factor * mv_col[1] + 128) >> 8;
  1046. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref0, 1);
  1047. fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv_l0[0],mv_l0[1]), 4);
  1048. fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]), 4);
  1049. }
  1050. }else{
  1051. for(i8=0; i8<4; i8++){
  1052. const int x8 = i8&1;
  1053. const int y8 = i8>>1;
  1054. int ref0, dist_scale_factor;
  1055. if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))
  1056. continue;
  1057. h->sub_mb_type[i8] = sub_mb_type;
  1058. if(IS_INTRA(mb_type_col)){
  1059. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);
  1060. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1061. fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);
  1062. fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);
  1063. continue;
  1064. }
  1065. ref0 = l1ref0[x8 + y8*h->b8_stride];
  1066. dist_scale_factor = h->dist_scale_factor[ref0];
  1067. fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);
  1068. fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);
  1069. for(i4=0; i4<4; i4++){
  1070. const int16_t *mv_col = l1mv0[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];
  1071. int16_t *mv_l0 = h->mv_cache[0][scan8[i8*4+i4]];
  1072. mv_l0[0] = (dist_scale_factor * mv_col[0] + 128) >> 8;
  1073. mv_l0[1] = (dist_scale_factor * mv_col[1] + 128) >> 8;
  1074. *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] =
  1075. pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);
  1076. }
  1077. }
  1078. }
  1079. }
  1080. }
  1081. static inline void write_back_motion(H264Context *h, int mb_type){
  1082. MpegEncContext * const s = &h->s;
  1083. const int b_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;
  1084. const int b8_xy= 2*s->mb_x + 2*s->mb_y*h->b8_stride;
  1085. int list;
  1086. for(list=0; list<2; list++){
  1087. int y;
  1088. if((!IS_8X8(mb_type)) && !USES_LIST(mb_type, list)){
  1089. if(1){ //FIXME skip or never read if mb_type doesnt use it
  1090. for(y=0; y<4; y++){
  1091. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 0 + y*h->b_stride]=
  1092. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 2 + y*h->b_stride]= 0;
  1093. }
  1094. if( h->pps.cabac ) {
  1095. /* FIXME needed ? */
  1096. for(y=0; y<4; y++){
  1097. *(uint64_t*)h->mvd_table[list][b_xy + 0 + y*h->b_stride]=
  1098. *(uint64_t*)h->mvd_table[list][b_xy + 2 + y*h->b_stride]= 0;
  1099. }
  1100. }
  1101. for(y=0; y<2; y++){
  1102. *(uint16_t*)&s->current_picture.ref_index[list][b8_xy + y*h->b8_stride]= (LIST_NOT_USED&0xFF)*0x0101;
  1103. }
  1104. }
  1105. continue;
  1106. }
  1107. for(y=0; y<4; y++){
  1108. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mv_cache[list][scan8[0]+0 + 8*y];
  1109. *(uint64_t*)s->current_picture.motion_val[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mv_cache[list][scan8[0]+2 + 8*y];
  1110. }
  1111. if( h->pps.cabac ) {
  1112. for(y=0; y<4; y++){
  1113. *(uint64_t*)h->mvd_table[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+0 + 8*y];
  1114. *(uint64_t*)h->mvd_table[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+2 + 8*y];
  1115. }
  1116. }
  1117. for(y=0; y<2; y++){
  1118. s->current_picture.ref_index[list][b8_xy + 0 + y*h->b8_stride]= h->ref_cache[list][scan8[0]+0 + 16*y];
  1119. s->current_picture.ref_index[list][b8_xy + 1 + y*h->b8_stride]= h->ref_cache[list][scan8[0]+2 + 16*y];
  1120. }
  1121. }
  1122. if(h->slice_type == B_TYPE && h->pps.cabac){
  1123. if(IS_8X8(mb_type)){
  1124. h->direct_table[b8_xy+1+0*h->b8_stride] = IS_DIRECT(h->sub_mb_type[1]) ? 1 : 0;
  1125. h->direct_table[b8_xy+0+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[2]) ? 1 : 0;
  1126. h->direct_table[b8_xy+1+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[3]) ? 1 : 0;
  1127. }
  1128. }
  1129. }
  1130. /**
  1131. * Decodes a network abstraction layer unit.
  1132. * @param consumed is the number of bytes used as input
  1133. * @param length is the length of the array
  1134. * @param dst_length is the number of decoded bytes FIXME here or a decode rbsp ttailing?
  1135. * @returns decoded bytes, might be src+1 if no escapes
  1136. */
  1137. static uint8_t *decode_nal(H264Context *h, uint8_t *src, int *dst_length, int *consumed, int length){
  1138. int i, si, di;
  1139. uint8_t *dst;
  1140. // src[0]&0x80; //forbidden bit
  1141. h->nal_ref_idc= src[0]>>5;
  1142. h->nal_unit_type= src[0]&0x1F;
  1143. src++; length--;
  1144. #if 0
  1145. for(i=0; i<length; i++)
  1146. printf("%2X ", src[i]);
  1147. #endif
  1148. for(i=0; i+1<length; i+=2){
  1149. if(src[i]) continue;
  1150. if(i>0 && src[i-1]==0) i--;
  1151. if(i+2<length && src[i+1]==0 && src[i+2]<=3){
  1152. if(src[i+2]!=3){
  1153. /* startcode, so we must be past the end */
  1154. length=i;
  1155. }
  1156. break;
  1157. }
  1158. }
  1159. if(i>=length-1){ //no escaped 0
  1160. *dst_length= length;
  1161. *consumed= length+1; //+1 for the header
  1162. return src;
  1163. }
  1164. h->rbsp_buffer= av_fast_realloc(h->rbsp_buffer, &h->rbsp_buffer_size, length);
  1165. dst= h->rbsp_buffer;
  1166. //printf("deoding esc\n");
  1167. si=di=0;
  1168. while(si<length){
  1169. //remove escapes (very rare 1:2^22)
  1170. if(si+2<length && src[si]==0 && src[si+1]==0 && src[si+2]<=3){
  1171. if(src[si+2]==3){ //escape
  1172. dst[di++]= 0;
  1173. dst[di++]= 0;
  1174. si+=3;
  1175. continue;
  1176. }else //next start code
  1177. break;
  1178. }
  1179. dst[di++]= src[si++];
  1180. }
  1181. *dst_length= di;
  1182. *consumed= si + 1;//+1 for the header
  1183. //FIXME store exact number of bits in the getbitcontext (its needed for decoding)
  1184. return dst;
  1185. }
  1186. #if 0
  1187. /**
  1188. * @param src the data which should be escaped
  1189. * @param dst the target buffer, dst+1 == src is allowed as a special case
  1190. * @param length the length of the src data
  1191. * @param dst_length the length of the dst array
  1192. * @returns length of escaped data in bytes or -1 if an error occured
  1193. */
  1194. static int encode_nal(H264Context *h, uint8_t *dst, uint8_t *src, int length, int dst_length){
  1195. int i, escape_count, si, di;
  1196. uint8_t *temp;
  1197. assert(length>=0);
  1198. assert(dst_length>0);
  1199. dst[0]= (h->nal_ref_idc<<5) + h->nal_unit_type;
  1200. if(length==0) return 1;
  1201. escape_count= 0;
  1202. for(i=0; i<length; i+=2){
  1203. if(src[i]) continue;
  1204. if(i>0 && src[i-1]==0)
  1205. i--;
  1206. if(i+2<length && src[i+1]==0 && src[i+2]<=3){
  1207. escape_count++;
  1208. i+=2;
  1209. }
  1210. }
  1211. if(escape_count==0){
  1212. if(dst+1 != src)
  1213. memcpy(dst+1, src, length);
  1214. return length + 1;
  1215. }
  1216. if(length + escape_count + 1> dst_length)
  1217. return -1;
  1218. //this should be damn rare (hopefully)
  1219. h->rbsp_buffer= av_fast_realloc(h->rbsp_buffer, &h->rbsp_buffer_size, length + escape_count);
  1220. temp= h->rbsp_buffer;
  1221. //printf("encoding esc\n");
  1222. si= 0;
  1223. di= 0;
  1224. while(si < length){
  1225. if(si+2<length && src[si]==0 && src[si+1]==0 && src[si+2]<=3){
  1226. temp[di++]= 0; si++;
  1227. temp[di++]= 0; si++;
  1228. temp[di++]= 3;
  1229. temp[di++]= src[si++];
  1230. }
  1231. else
  1232. temp[di++]= src[si++];
  1233. }
  1234. memcpy(dst+1, temp, length+escape_count);
  1235. assert(di == length+escape_count);
  1236. return di + 1;
  1237. }
  1238. /**
  1239. * write 1,10,100,1000,... for alignment, yes its exactly inverse to mpeg4
  1240. */
  1241. static void encode_rbsp_trailing(PutBitContext *pb){
  1242. int length;
  1243. put_bits(pb, 1, 1);
  1244. length= (-put_bits_count(pb))&7;
  1245. if(length) put_bits(pb, length, 0);
  1246. }
  1247. #endif
  1248. /**
  1249. * identifies the exact end of the bitstream
  1250. * @return the length of the trailing, or 0 if damaged
  1251. */
  1252. static int decode_rbsp_trailing(uint8_t *src){
  1253. int v= *src;
  1254. int r;
  1255. tprintf("rbsp trailing %X\n", v);
  1256. for(r=1; r<9; r++){
  1257. if(v&1) return r;
  1258. v>>=1;
  1259. }
  1260. return 0;
  1261. }
  1262. /**
  1263. * idct tranforms the 16 dc values and dequantize them.
  1264. * @param qp quantization parameter
  1265. */
  1266. static void h264_luma_dc_dequant_idct_c(DCTELEM *block, int qp){
  1267. const int qmul= dequant_coeff[qp][0];
  1268. #define stride 16
  1269. int i;
  1270. int temp[16]; //FIXME check if this is a good idea
  1271. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1272. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1273. //memset(block, 64, 2*256);
  1274. //return;
  1275. for(i=0; i<4; i++){
  1276. const int offset= y_offset[i];
  1277. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1278. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1279. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1280. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1281. temp[4*i+0]= z0+z3;
  1282. temp[4*i+1]= z1+z2;
  1283. temp[4*i+2]= z1-z2;
  1284. temp[4*i+3]= z0-z3;
  1285. }
  1286. for(i=0; i<4; i++){
  1287. const int offset= x_offset[i];
  1288. const int z0= temp[4*0+i] + temp[4*2+i];
  1289. const int z1= temp[4*0+i] - temp[4*2+i];
  1290. const int z2= temp[4*1+i] - temp[4*3+i];
  1291. const int z3= temp[4*1+i] + temp[4*3+i];
  1292. block[stride*0 +offset]= ((z0 + z3)*qmul + 2)>>2; //FIXME think about merging this into decode_resdual
  1293. block[stride*2 +offset]= ((z1 + z2)*qmul + 2)>>2;
  1294. block[stride*8 +offset]= ((z1 - z2)*qmul + 2)>>2;
  1295. block[stride*10+offset]= ((z0 - z3)*qmul + 2)>>2;
  1296. }
  1297. }
  1298. #if 0
  1299. /**
  1300. * dct tranforms the 16 dc values.
  1301. * @param qp quantization parameter ??? FIXME
  1302. */
  1303. static void h264_luma_dc_dct_c(DCTELEM *block/*, int qp*/){
  1304. // const int qmul= dequant_coeff[qp][0];
  1305. int i;
  1306. int temp[16]; //FIXME check if this is a good idea
  1307. static const int x_offset[4]={0, 1*stride, 4* stride, 5*stride};
  1308. static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};
  1309. for(i=0; i<4; i++){
  1310. const int offset= y_offset[i];
  1311. const int z0= block[offset+stride*0] + block[offset+stride*4];
  1312. const int z1= block[offset+stride*0] - block[offset+stride*4];
  1313. const int z2= block[offset+stride*1] - block[offset+stride*5];
  1314. const int z3= block[offset+stride*1] + block[offset+stride*5];
  1315. temp[4*i+0]= z0+z3;
  1316. temp[4*i+1]= z1+z2;
  1317. temp[4*i+2]= z1-z2;
  1318. temp[4*i+3]= z0-z3;
  1319. }
  1320. for(i=0; i<4; i++){
  1321. const int offset= x_offset[i];
  1322. const int z0= temp[4*0+i] + temp[4*2+i];
  1323. const int z1= temp[4*0+i] - temp[4*2+i];
  1324. const int z2= temp[4*1+i] - temp[4*3+i];
  1325. const int z3= temp[4*1+i] + temp[4*3+i];
  1326. block[stride*0 +offset]= (z0 + z3)>>1;
  1327. block[stride*2 +offset]= (z1 + z2)>>1;
  1328. block[stride*8 +offset]= (z1 - z2)>>1;
  1329. block[stride*10+offset]= (z0 - z3)>>1;
  1330. }
  1331. }
  1332. #endif
  1333. #undef xStride
  1334. #undef stride
  1335. static void chroma_dc_dequant_idct_c(DCTELEM *block, int qp){
  1336. const int qmul= dequant_coeff[qp][0];
  1337. const int stride= 16*2;
  1338. const int xStride= 16;
  1339. int a,b,c,d,e;
  1340. a= block[stride*0 + xStride*0];
  1341. b= block[stride*0 + xStride*1];
  1342. c= block[stride*1 + xStride*0];
  1343. d= block[stride*1 + xStride*1];
  1344. e= a-b;
  1345. a= a+b;
  1346. b= c-d;
  1347. c= c+d;
  1348. block[stride*0 + xStride*0]= ((a+c)*qmul + 0)>>1;
  1349. block[stride*0 + xStride*1]= ((e+b)*qmul + 0)>>1;
  1350. block[stride*1 + xStride*0]= ((a-c)*qmul + 0)>>1;
  1351. block[stride*1 + xStride*1]= ((e-b)*qmul + 0)>>1;
  1352. }
  1353. #if 0
  1354. static void chroma_dc_dct_c(DCTELEM *block){
  1355. const int stride= 16*2;
  1356. const int xStride= 16;
  1357. int a,b,c,d,e;
  1358. a= block[stride*0 + xStride*0];
  1359. b= block[stride*0 + xStride*1];
  1360. c= block[stride*1 + xStride*0];
  1361. d= block[stride*1 + xStride*1];
  1362. e= a-b;
  1363. a= a+b;
  1364. b= c-d;
  1365. c= c+d;
  1366. block[stride*0 + xStride*0]= (a+c);
  1367. block[stride*0 + xStride*1]= (e+b);
  1368. block[stride*1 + xStride*0]= (a-c);
  1369. block[stride*1 + xStride*1]= (e-b);
  1370. }
  1371. #endif
  1372. /**
  1373. * gets the chroma qp.
  1374. */
  1375. static inline int get_chroma_qp(H264Context *h, int qscale){
  1376. return chroma_qp[clip(qscale + h->pps.chroma_qp_index_offset, 0, 51)];
  1377. }
  1378. #if 0
  1379. static void h264_diff_dct_c(DCTELEM *block, uint8_t *src1, uint8_t *src2, int stride){
  1380. int i;
  1381. //FIXME try int temp instead of block
  1382. for(i=0; i<4; i++){
  1383. const int d0= src1[0 + i*stride] - src2[0 + i*stride];
  1384. const int d1= src1[1 + i*stride] - src2[1 + i*stride];
  1385. const int d2= src1[2 + i*stride] - src2[2 + i*stride];
  1386. const int d3= src1[3 + i*stride] - src2[3 + i*stride];
  1387. const int z0= d0 + d3;
  1388. const int z3= d0 - d3;
  1389. const int z1= d1 + d2;
  1390. const int z2= d1 - d2;
  1391. block[0 + 4*i]= z0 + z1;
  1392. block[1 + 4*i]= 2*z3 + z2;
  1393. block[2 + 4*i]= z0 - z1;
  1394. block[3 + 4*i]= z3 - 2*z2;
  1395. }
  1396. for(i=0; i<4; i++){
  1397. const int z0= block[0*4 + i] + block[3*4 + i];
  1398. const int z3= block[0*4 + i] - block[3*4 + i];
  1399. const int z1= block[1*4 + i] + block[2*4 + i];
  1400. const int z2= block[1*4 + i] - block[2*4 + i];
  1401. block[0*4 + i]= z0 + z1;
  1402. block[1*4 + i]= 2*z3 + z2;
  1403. block[2*4 + i]= z0 - z1;
  1404. block[3*4 + i]= z3 - 2*z2;
  1405. }
  1406. }
  1407. #endif
  1408. //FIXME need to check that this doesnt overflow signed 32 bit for low qp, iam not sure, its very close
  1409. //FIXME check that gcc inlines this (and optimizes intra & seperate_dc stuff away)
  1410. static inline int quantize_c(DCTELEM *block, uint8_t *scantable, int qscale, int intra, int seperate_dc){
  1411. int i;
  1412. const int * const quant_table= quant_coeff[qscale];
  1413. const int bias= intra ? (1<<QUANT_SHIFT)/3 : (1<<QUANT_SHIFT)/6;
  1414. const unsigned int threshold1= (1<<QUANT_SHIFT) - bias - 1;
  1415. const unsigned int threshold2= (threshold1<<1);
  1416. int last_non_zero;
  1417. if(seperate_dc){
  1418. if(qscale<=18){
  1419. //avoid overflows
  1420. const int dc_bias= intra ? (1<<(QUANT_SHIFT-2))/3 : (1<<(QUANT_SHIFT-2))/6;
  1421. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT-2)) - dc_bias - 1;
  1422. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1423. int level= block[0]*quant_coeff[qscale+18][0];
  1424. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1425. if(level>0){
  1426. level= (dc_bias + level)>>(QUANT_SHIFT-2);
  1427. block[0]= level;
  1428. }else{
  1429. level= (dc_bias - level)>>(QUANT_SHIFT-2);
  1430. block[0]= -level;
  1431. }
  1432. // last_non_zero = i;
  1433. }else{
  1434. block[0]=0;
  1435. }
  1436. }else{
  1437. const int dc_bias= intra ? (1<<(QUANT_SHIFT+1))/3 : (1<<(QUANT_SHIFT+1))/6;
  1438. const unsigned int dc_threshold1= (1<<(QUANT_SHIFT+1)) - dc_bias - 1;
  1439. const unsigned int dc_threshold2= (dc_threshold1<<1);
  1440. int level= block[0]*quant_table[0];
  1441. if(((unsigned)(level+dc_threshold1))>dc_threshold2){
  1442. if(level>0){
  1443. level= (dc_bias + level)>>(QUANT_SHIFT+1);
  1444. block[0]= level;
  1445. }else{
  1446. level= (dc_bias - level)>>(QUANT_SHIFT+1);
  1447. block[0]= -level;
  1448. }
  1449. // last_non_zero = i;
  1450. }else{
  1451. block[0]=0;
  1452. }
  1453. }
  1454. last_non_zero= 0;
  1455. i=1;
  1456. }else{
  1457. last_non_zero= -1;
  1458. i=0;
  1459. }
  1460. for(; i<16; i++){
  1461. const int j= scantable[i];
  1462. int level= block[j]*quant_table[j];
  1463. // if( bias+level >= (1<<(QMAT_SHIFT - 3))
  1464. // || bias-level >= (1<<(QMAT_SHIFT - 3))){
  1465. if(((unsigned)(level+threshold1))>threshold2){
  1466. if(level>0){
  1467. level= (bias + level)>>QUANT_SHIFT;
  1468. block[j]= level;
  1469. }else{
  1470. level= (bias - level)>>QUANT_SHIFT;
  1471. block[j]= -level;
  1472. }
  1473. last_non_zero = i;
  1474. }else{
  1475. block[j]=0;
  1476. }
  1477. }
  1478. return last_non_zero;
  1479. }
  1480. static void pred4x4_vertical_c(uint8_t *src, uint8_t *topright, int stride){
  1481. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1482. ((uint32_t*)(src+0*stride))[0]= a;
  1483. ((uint32_t*)(src+1*stride))[0]= a;
  1484. ((uint32_t*)(src+2*stride))[0]= a;
  1485. ((uint32_t*)(src+3*stride))[0]= a;
  1486. }
  1487. static void pred4x4_horizontal_c(uint8_t *src, uint8_t *topright, int stride){
  1488. ((uint32_t*)(src+0*stride))[0]= src[-1+0*stride]*0x01010101;
  1489. ((uint32_t*)(src+1*stride))[0]= src[-1+1*stride]*0x01010101;
  1490. ((uint32_t*)(src+2*stride))[0]= src[-1+2*stride]*0x01010101;
  1491. ((uint32_t*)(src+3*stride))[0]= src[-1+3*stride]*0x01010101;
  1492. }
  1493. static void pred4x4_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1494. const int dc= ( src[-stride] + src[1-stride] + src[2-stride] + src[3-stride]
  1495. + src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 4) >>3;
  1496. ((uint32_t*)(src+0*stride))[0]=
  1497. ((uint32_t*)(src+1*stride))[0]=
  1498. ((uint32_t*)(src+2*stride))[0]=
  1499. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1500. }
  1501. static void pred4x4_left_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1502. const int dc= ( src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 2) >>2;
  1503. ((uint32_t*)(src+0*stride))[0]=
  1504. ((uint32_t*)(src+1*stride))[0]=
  1505. ((uint32_t*)(src+2*stride))[0]=
  1506. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1507. }
  1508. static void pred4x4_top_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1509. const int dc= ( src[-stride] + src[1-stride] + src[2-stride] + src[3-stride] + 2) >>2;
  1510. ((uint32_t*)(src+0*stride))[0]=
  1511. ((uint32_t*)(src+1*stride))[0]=
  1512. ((uint32_t*)(src+2*stride))[0]=
  1513. ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;
  1514. }
  1515. static void pred4x4_128_dc_c(uint8_t *src, uint8_t *topright, int stride){
  1516. ((uint32_t*)(src+0*stride))[0]=
  1517. ((uint32_t*)(src+1*stride))[0]=
  1518. ((uint32_t*)(src+2*stride))[0]=
  1519. ((uint32_t*)(src+3*stride))[0]= 128U*0x01010101U;
  1520. }
  1521. #define LOAD_TOP_RIGHT_EDGE\
  1522. const int t4= topright[0];\
  1523. const int t5= topright[1];\
  1524. const int t6= topright[2];\
  1525. const int t7= topright[3];\
  1526. #define LOAD_LEFT_EDGE\
  1527. const int l0= src[-1+0*stride];\
  1528. const int l1= src[-1+1*stride];\
  1529. const int l2= src[-1+2*stride];\
  1530. const int l3= src[-1+3*stride];\
  1531. #define LOAD_TOP_EDGE\
  1532. const int t0= src[ 0-1*stride];\
  1533. const int t1= src[ 1-1*stride];\
  1534. const int t2= src[ 2-1*stride];\
  1535. const int t3= src[ 3-1*stride];\
  1536. static void pred4x4_down_right_c(uint8_t *src, uint8_t *topright, int stride){
  1537. const int lt= src[-1-1*stride];
  1538. LOAD_TOP_EDGE
  1539. LOAD_LEFT_EDGE
  1540. src[0+3*stride]=(l3 + 2*l2 + l1 + 2)>>2;
  1541. src[0+2*stride]=
  1542. src[1+3*stride]=(l2 + 2*l1 + l0 + 2)>>2;
  1543. src[0+1*stride]=
  1544. src[1+2*stride]=
  1545. src[2+3*stride]=(l1 + 2*l0 + lt + 2)>>2;
  1546. src[0+0*stride]=
  1547. src[1+1*stride]=
  1548. src[2+2*stride]=
  1549. src[3+3*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1550. src[1+0*stride]=
  1551. src[2+1*stride]=
  1552. src[3+2*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1553. src[2+0*stride]=
  1554. src[3+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1555. src[3+0*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1556. }
  1557. static void pred4x4_down_left_c(uint8_t *src, uint8_t *topright, int stride){
  1558. LOAD_TOP_EDGE
  1559. LOAD_TOP_RIGHT_EDGE
  1560. // LOAD_LEFT_EDGE
  1561. src[0+0*stride]=(t0 + t2 + 2*t1 + 2)>>2;
  1562. src[1+0*stride]=
  1563. src[0+1*stride]=(t1 + t3 + 2*t2 + 2)>>2;
  1564. src[2+0*stride]=
  1565. src[1+1*stride]=
  1566. src[0+2*stride]=(t2 + t4 + 2*t3 + 2)>>2;
  1567. src[3+0*stride]=
  1568. src[2+1*stride]=
  1569. src[1+2*stride]=
  1570. src[0+3*stride]=(t3 + t5 + 2*t4 + 2)>>2;
  1571. src[3+1*stride]=
  1572. src[2+2*stride]=
  1573. src[1+3*stride]=(t4 + t6 + 2*t5 + 2)>>2;
  1574. src[3+2*stride]=
  1575. src[2+3*stride]=(t5 + t7 + 2*t6 + 2)>>2;
  1576. src[3+3*stride]=(t6 + 3*t7 + 2)>>2;
  1577. }
  1578. static void pred4x4_vertical_right_c(uint8_t *src, uint8_t *topright, int stride){
  1579. const int lt= src[-1-1*stride];
  1580. LOAD_TOP_EDGE
  1581. LOAD_LEFT_EDGE
  1582. const __attribute__((unused)) int unu= l3;
  1583. src[0+0*stride]=
  1584. src[1+2*stride]=(lt + t0 + 1)>>1;
  1585. src[1+0*stride]=
  1586. src[2+2*stride]=(t0 + t1 + 1)>>1;
  1587. src[2+0*stride]=
  1588. src[3+2*stride]=(t1 + t2 + 1)>>1;
  1589. src[3+0*stride]=(t2 + t3 + 1)>>1;
  1590. src[0+1*stride]=
  1591. src[1+3*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1592. src[1+1*stride]=
  1593. src[2+3*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1594. src[2+1*stride]=
  1595. src[3+3*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1596. src[3+1*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1597. src[0+2*stride]=(lt + 2*l0 + l1 + 2)>>2;
  1598. src[0+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1599. }
  1600. static void pred4x4_vertical_left_c(uint8_t *src, uint8_t *topright, int stride){
  1601. LOAD_TOP_EDGE
  1602. LOAD_TOP_RIGHT_EDGE
  1603. const __attribute__((unused)) int unu= t7;
  1604. src[0+0*stride]=(t0 + t1 + 1)>>1;
  1605. src[1+0*stride]=
  1606. src[0+2*stride]=(t1 + t2 + 1)>>1;
  1607. src[2+0*stride]=
  1608. src[1+2*stride]=(t2 + t3 + 1)>>1;
  1609. src[3+0*stride]=
  1610. src[2+2*stride]=(t3 + t4+ 1)>>1;
  1611. src[3+2*stride]=(t4 + t5+ 1)>>1;
  1612. src[0+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1613. src[1+1*stride]=
  1614. src[0+3*stride]=(t1 + 2*t2 + t3 + 2)>>2;
  1615. src[2+1*stride]=
  1616. src[1+3*stride]=(t2 + 2*t3 + t4 + 2)>>2;
  1617. src[3+1*stride]=
  1618. src[2+3*stride]=(t3 + 2*t4 + t5 + 2)>>2;
  1619. src[3+3*stride]=(t4 + 2*t5 + t6 + 2)>>2;
  1620. }
  1621. static void pred4x4_horizontal_up_c(uint8_t *src, uint8_t *topright, int stride){
  1622. LOAD_LEFT_EDGE
  1623. src[0+0*stride]=(l0 + l1 + 1)>>1;
  1624. src[1+0*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1625. src[2+0*stride]=
  1626. src[0+1*stride]=(l1 + l2 + 1)>>1;
  1627. src[3+0*stride]=
  1628. src[1+1*stride]=(l1 + 2*l2 + l3 + 2)>>2;
  1629. src[2+1*stride]=
  1630. src[0+2*stride]=(l2 + l3 + 1)>>1;
  1631. src[3+1*stride]=
  1632. src[1+2*stride]=(l2 + 2*l3 + l3 + 2)>>2;
  1633. src[3+2*stride]=
  1634. src[1+3*stride]=
  1635. src[0+3*stride]=
  1636. src[2+2*stride]=
  1637. src[2+3*stride]=
  1638. src[3+3*stride]=l3;
  1639. }
  1640. static void pred4x4_horizontal_down_c(uint8_t *src, uint8_t *topright, int stride){
  1641. const int lt= src[-1-1*stride];
  1642. LOAD_TOP_EDGE
  1643. LOAD_LEFT_EDGE
  1644. const __attribute__((unused)) int unu= t3;
  1645. src[0+0*stride]=
  1646. src[2+1*stride]=(lt + l0 + 1)>>1;
  1647. src[1+0*stride]=
  1648. src[3+1*stride]=(l0 + 2*lt + t0 + 2)>>2;
  1649. src[2+0*stride]=(lt + 2*t0 + t1 + 2)>>2;
  1650. src[3+0*stride]=(t0 + 2*t1 + t2 + 2)>>2;
  1651. src[0+1*stride]=
  1652. src[2+2*stride]=(l0 + l1 + 1)>>1;
  1653. src[1+1*stride]=
  1654. src[3+2*stride]=(lt + 2*l0 + l1 + 2)>>2;
  1655. src[0+2*stride]=
  1656. src[2+3*stride]=(l1 + l2+ 1)>>1;
  1657. src[1+2*stride]=
  1658. src[3+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;
  1659. src[0+3*stride]=(l2 + l3 + 1)>>1;
  1660. src[1+3*stride]=(l1 + 2*l2 + l3 + 2)>>2;
  1661. }
  1662. static void pred16x16_vertical_c(uint8_t *src, int stride){
  1663. int i;
  1664. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1665. const uint32_t b= ((uint32_t*)(src-stride))[1];
  1666. const uint32_t c= ((uint32_t*)(src-stride))[2];
  1667. const uint32_t d= ((uint32_t*)(src-stride))[3];
  1668. for(i=0; i<16; i++){
  1669. ((uint32_t*)(src+i*stride))[0]= a;
  1670. ((uint32_t*)(src+i*stride))[1]= b;
  1671. ((uint32_t*)(src+i*stride))[2]= c;
  1672. ((uint32_t*)(src+i*stride))[3]= d;
  1673. }
  1674. }
  1675. static void pred16x16_horizontal_c(uint8_t *src, int stride){
  1676. int i;
  1677. for(i=0; i<16; i++){
  1678. ((uint32_t*)(src+i*stride))[0]=
  1679. ((uint32_t*)(src+i*stride))[1]=
  1680. ((uint32_t*)(src+i*stride))[2]=
  1681. ((uint32_t*)(src+i*stride))[3]= src[-1+i*stride]*0x01010101;
  1682. }
  1683. }
  1684. static void pred16x16_dc_c(uint8_t *src, int stride){
  1685. int i, dc=0;
  1686. for(i=0;i<16; i++){
  1687. dc+= src[-1+i*stride];
  1688. }
  1689. for(i=0;i<16; i++){
  1690. dc+= src[i-stride];
  1691. }
  1692. dc= 0x01010101*((dc + 16)>>5);
  1693. for(i=0; i<16; i++){
  1694. ((uint32_t*)(src+i*stride))[0]=
  1695. ((uint32_t*)(src+i*stride))[1]=
  1696. ((uint32_t*)(src+i*stride))[2]=
  1697. ((uint32_t*)(src+i*stride))[3]= dc;
  1698. }
  1699. }
  1700. static void pred16x16_left_dc_c(uint8_t *src, int stride){
  1701. int i, dc=0;
  1702. for(i=0;i<16; i++){
  1703. dc+= src[-1+i*stride];
  1704. }
  1705. dc= 0x01010101*((dc + 8)>>4);
  1706. for(i=0; i<16; i++){
  1707. ((uint32_t*)(src+i*stride))[0]=
  1708. ((uint32_t*)(src+i*stride))[1]=
  1709. ((uint32_t*)(src+i*stride))[2]=
  1710. ((uint32_t*)(src+i*stride))[3]= dc;
  1711. }
  1712. }
  1713. static void pred16x16_top_dc_c(uint8_t *src, int stride){
  1714. int i, dc=0;
  1715. for(i=0;i<16; i++){
  1716. dc+= src[i-stride];
  1717. }
  1718. dc= 0x01010101*((dc + 8)>>4);
  1719. for(i=0; i<16; i++){
  1720. ((uint32_t*)(src+i*stride))[0]=
  1721. ((uint32_t*)(src+i*stride))[1]=
  1722. ((uint32_t*)(src+i*stride))[2]=
  1723. ((uint32_t*)(src+i*stride))[3]= dc;
  1724. }
  1725. }
  1726. static void pred16x16_128_dc_c(uint8_t *src, int stride){
  1727. int i;
  1728. for(i=0; i<16; i++){
  1729. ((uint32_t*)(src+i*stride))[0]=
  1730. ((uint32_t*)(src+i*stride))[1]=
  1731. ((uint32_t*)(src+i*stride))[2]=
  1732. ((uint32_t*)(src+i*stride))[3]= 0x01010101U*128U;
  1733. }
  1734. }
  1735. static inline void pred16x16_plane_compat_c(uint8_t *src, int stride, const int svq3){
  1736. int i, j, k;
  1737. int a;
  1738. uint8_t *cm = cropTbl + MAX_NEG_CROP;
  1739. const uint8_t * const src0 = src+7-stride;
  1740. const uint8_t *src1 = src+8*stride-1;
  1741. const uint8_t *src2 = src1-2*stride; // == src+6*stride-1;
  1742. int H = src0[1] - src0[-1];
  1743. int V = src1[0] - src2[ 0];
  1744. for(k=2; k<=8; ++k) {
  1745. src1 += stride; src2 -= stride;
  1746. H += k*(src0[k] - src0[-k]);
  1747. V += k*(src1[0] - src2[ 0]);
  1748. }
  1749. if(svq3){
  1750. H = ( 5*(H/4) ) / 16;
  1751. V = ( 5*(V/4) ) / 16;
  1752. /* required for 100% accuracy */
  1753. i = H; H = V; V = i;
  1754. }else{
  1755. H = ( 5*H+32 ) >> 6;
  1756. V = ( 5*V+32 ) >> 6;
  1757. }
  1758. a = 16*(src1[0] + src2[16] + 1) - 7*(V+H);
  1759. for(j=16; j>0; --j) {
  1760. int b = a;
  1761. a += V;
  1762. for(i=-16; i<0; i+=4) {
  1763. src[16+i] = cm[ (b ) >> 5 ];
  1764. src[17+i] = cm[ (b+ H) >> 5 ];
  1765. src[18+i] = cm[ (b+2*H) >> 5 ];
  1766. src[19+i] = cm[ (b+3*H) >> 5 ];
  1767. b += 4*H;
  1768. }
  1769. src += stride;
  1770. }
  1771. }
  1772. static void pred16x16_plane_c(uint8_t *src, int stride){
  1773. pred16x16_plane_compat_c(src, stride, 0);
  1774. }
  1775. static void pred8x8_vertical_c(uint8_t *src, int stride){
  1776. int i;
  1777. const uint32_t a= ((uint32_t*)(src-stride))[0];
  1778. const uint32_t b= ((uint32_t*)(src-stride))[1];
  1779. for(i=0; i<8; i++){
  1780. ((uint32_t*)(src+i*stride))[0]= a;
  1781. ((uint32_t*)(src+i*stride))[1]= b;
  1782. }
  1783. }
  1784. static void pred8x8_horizontal_c(uint8_t *src, int stride){
  1785. int i;
  1786. for(i=0; i<8; i++){
  1787. ((uint32_t*)(src+i*stride))[0]=
  1788. ((uint32_t*)(src+i*stride))[1]= src[-1+i*stride]*0x01010101;
  1789. }
  1790. }
  1791. static void pred8x8_128_dc_c(uint8_t *src, int stride){
  1792. int i;
  1793. for(i=0; i<4; i++){
  1794. ((uint32_t*)(src+i*stride))[0]=
  1795. ((uint32_t*)(src+i*stride))[1]= 0x01010101U*128U;
  1796. }
  1797. for(i=4; i<8; i++){
  1798. ((uint32_t*)(src+i*stride))[0]=
  1799. ((uint32_t*)(src+i*stride))[1]= 0x01010101U*128U;
  1800. }
  1801. }
  1802. static void pred8x8_left_dc_c(uint8_t *src, int stride){
  1803. int i;
  1804. int dc0, dc2;
  1805. dc0=dc2=0;
  1806. for(i=0;i<4; i++){
  1807. dc0+= src[-1+i*stride];
  1808. dc2+= src[-1+(i+4)*stride];
  1809. }
  1810. dc0= 0x01010101*((dc0 + 2)>>2);
  1811. dc2= 0x01010101*((dc2 + 2)>>2);
  1812. for(i=0; i<4; i++){
  1813. ((uint32_t*)(src+i*stride))[0]=
  1814. ((uint32_t*)(src+i*stride))[1]= dc0;
  1815. }
  1816. for(i=4; i<8; i++){
  1817. ((uint32_t*)(src+i*stride))[0]=
  1818. ((uint32_t*)(src+i*stride))[1]= dc2;
  1819. }
  1820. }
  1821. static void pred8x8_top_dc_c(uint8_t *src, int stride){
  1822. int i;
  1823. int dc0, dc1;
  1824. dc0=dc1=0;
  1825. for(i=0;i<4; i++){
  1826. dc0+= src[i-stride];
  1827. dc1+= src[4+i-stride];
  1828. }
  1829. dc0= 0x01010101*((dc0 + 2)>>2);
  1830. dc1= 0x01010101*((dc1 + 2)>>2);
  1831. for(i=0; i<4; i++){
  1832. ((uint32_t*)(src+i*stride))[0]= dc0;
  1833. ((uint32_t*)(src+i*stride))[1]= dc1;
  1834. }
  1835. for(i=4; i<8; i++){
  1836. ((uint32_t*)(src+i*stride))[0]= dc0;
  1837. ((uint32_t*)(src+i*stride))[1]= dc1;
  1838. }
  1839. }
  1840. static void pred8x8_dc_c(uint8_t *src, int stride){
  1841. int i;
  1842. int dc0, dc1, dc2, dc3;
  1843. dc0=dc1=dc2=0;
  1844. for(i=0;i<4; i++){
  1845. dc0+= src[-1+i*stride] + src[i-stride];
  1846. dc1+= src[4+i-stride];
  1847. dc2+= src[-1+(i+4)*stride];
  1848. }
  1849. dc3= 0x01010101*((dc1 + dc2 + 4)>>3);
  1850. dc0= 0x01010101*((dc0 + 4)>>3);
  1851. dc1= 0x01010101*((dc1 + 2)>>2);
  1852. dc2= 0x01010101*((dc2 + 2)>>2);
  1853. for(i=0; i<4; i++){
  1854. ((uint32_t*)(src+i*stride))[0]= dc0;
  1855. ((uint32_t*)(src+i*stride))[1]= dc1;
  1856. }
  1857. for(i=4; i<8; i++){
  1858. ((uint32_t*)(src+i*stride))[0]= dc2;
  1859. ((uint32_t*)(src+i*stride))[1]= dc3;
  1860. }
  1861. }
  1862. static void pred8x8_plane_c(uint8_t *src, int stride){
  1863. int j, k;
  1864. int a;
  1865. uint8_t *cm = cropTbl + MAX_NEG_CROP;
  1866. const uint8_t * const src0 = src+3-stride;
  1867. const uint8_t *src1 = src+4*stride-1;
  1868. const uint8_t *src2 = src1-2*stride; // == src+2*stride-1;
  1869. int H = src0[1] - src0[-1];
  1870. int V = src1[0] - src2[ 0];
  1871. for(k=2; k<=4; ++k) {
  1872. src1 += stride; src2 -= stride;
  1873. H += k*(src0[k] - src0[-k]);
  1874. V += k*(src1[0] - src2[ 0]);
  1875. }
  1876. H = ( 17*H+16 ) >> 5;
  1877. V = ( 17*V+16 ) >> 5;
  1878. a = 16*(src1[0] + src2[8]+1) - 3*(V+H);
  1879. for(j=8; j>0; --j) {
  1880. int b = a;
  1881. a += V;
  1882. src[0] = cm[ (b ) >> 5 ];
  1883. src[1] = cm[ (b+ H) >> 5 ];
  1884. src[2] = cm[ (b+2*H) >> 5 ];
  1885. src[3] = cm[ (b+3*H) >> 5 ];
  1886. src[4] = cm[ (b+4*H) >> 5 ];
  1887. src[5] = cm[ (b+5*H) >> 5 ];
  1888. src[6] = cm[ (b+6*H) >> 5 ];
  1889. src[7] = cm[ (b+7*H) >> 5 ];
  1890. src += stride;
  1891. }
  1892. }
  1893. static inline void mc_dir_part(H264Context *h, Picture *pic, int n, int square, int chroma_height, int delta, int list,
  1894. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1895. int src_x_offset, int src_y_offset,
  1896. qpel_mc_func *qpix_op, h264_chroma_mc_func chroma_op){
  1897. MpegEncContext * const s = &h->s;
  1898. const int mx= h->mv_cache[list][ scan8[n] ][0] + src_x_offset*8;
  1899. const int my= h->mv_cache[list][ scan8[n] ][1] + src_y_offset*8;
  1900. const int luma_xy= (mx&3) + ((my&3)<<2);
  1901. uint8_t * src_y = pic->data[0] + (mx>>2) + (my>>2)*s->linesize;
  1902. uint8_t * src_cb= pic->data[1] + (mx>>3) + (my>>3)*s->uvlinesize;
  1903. uint8_t * src_cr= pic->data[2] + (mx>>3) + (my>>3)*s->uvlinesize;
  1904. int extra_width= (s->flags&CODEC_FLAG_EMU_EDGE) ? 0 : 16; //FIXME increase edge?, IMHO not worth it
  1905. int extra_height= extra_width;
  1906. int emu=0;
  1907. const int full_mx= mx>>2;
  1908. const int full_my= my>>2;
  1909. assert(pic->data[0]);
  1910. if(mx&7) extra_width -= 3;
  1911. if(my&7) extra_height -= 3;
  1912. if( full_mx < 0-extra_width
  1913. || full_my < 0-extra_height
  1914. || full_mx + 16/*FIXME*/ > s->width + extra_width
  1915. || full_my + 16/*FIXME*/ > s->height + extra_height){
  1916. ff_emulated_edge_mc(s->edge_emu_buffer, src_y - 2 - 2*s->linesize, s->linesize, 16+5, 16+5/*FIXME*/, full_mx-2, full_my-2, s->width, s->height);
  1917. src_y= s->edge_emu_buffer + 2 + 2*s->linesize;
  1918. emu=1;
  1919. }
  1920. qpix_op[luma_xy](dest_y, src_y, s->linesize); //FIXME try variable height perhaps?
  1921. if(!square){
  1922. qpix_op[luma_xy](dest_y + delta, src_y + delta, s->linesize);
  1923. }
  1924. if(s->flags&CODEC_FLAG_GRAY) return;
  1925. if(emu){
  1926. ff_emulated_edge_mc(s->edge_emu_buffer, src_cb, s->uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), s->width>>1, s->height>>1);
  1927. src_cb= s->edge_emu_buffer;
  1928. }
  1929. chroma_op(dest_cb, src_cb, s->uvlinesize, chroma_height, mx&7, my&7);
  1930. if(emu){
  1931. ff_emulated_edge_mc(s->edge_emu_buffer, src_cr, s->uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), s->width>>1, s->height>>1);
  1932. src_cr= s->edge_emu_buffer;
  1933. }
  1934. chroma_op(dest_cr, src_cr, s->uvlinesize, chroma_height, mx&7, my&7);
  1935. }
  1936. static inline void mc_part_std(H264Context *h, int n, int square, int chroma_height, int delta,
  1937. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1938. int x_offset, int y_offset,
  1939. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  1940. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  1941. int list0, int list1){
  1942. MpegEncContext * const s = &h->s;
  1943. qpel_mc_func *qpix_op= qpix_put;
  1944. h264_chroma_mc_func chroma_op= chroma_put;
  1945. dest_y += 2*x_offset + 2*y_offset*s-> linesize;
  1946. dest_cb += x_offset + y_offset*s->uvlinesize;
  1947. dest_cr += x_offset + y_offset*s->uvlinesize;
  1948. x_offset += 8*s->mb_x;
  1949. y_offset += 8*s->mb_y;
  1950. if(list0){
  1951. Picture *ref= &h->ref_list[0][ h->ref_cache[0][ scan8[n] ] ];
  1952. mc_dir_part(h, ref, n, square, chroma_height, delta, 0,
  1953. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1954. qpix_op, chroma_op);
  1955. qpix_op= qpix_avg;
  1956. chroma_op= chroma_avg;
  1957. }
  1958. if(list1){
  1959. Picture *ref= &h->ref_list[1][ h->ref_cache[1][ scan8[n] ] ];
  1960. mc_dir_part(h, ref, n, square, chroma_height, delta, 1,
  1961. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  1962. qpix_op, chroma_op);
  1963. }
  1964. }
  1965. static inline void mc_part_weighted(H264Context *h, int n, int square, int chroma_height, int delta,
  1966. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  1967. int x_offset, int y_offset,
  1968. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  1969. h264_weight_func luma_weight_op, h264_weight_func chroma_weight_op,
  1970. h264_biweight_func luma_weight_avg, h264_biweight_func chroma_weight_avg,
  1971. int list0, int list1){
  1972. MpegEncContext * const s = &h->s;
  1973. dest_y += 2*x_offset + 2*y_offset*s-> linesize;
  1974. dest_cb += x_offset + y_offset*s->uvlinesize;
  1975. dest_cr += x_offset + y_offset*s->uvlinesize;
  1976. x_offset += 8*s->mb_x;
  1977. y_offset += 8*s->mb_y;
  1978. if(list0 && list1){
  1979. /* don't optimize for luma-only case, since B-frames usually
  1980. * use implicit weights => chroma too. */
  1981. uint8_t *tmp_cb = s->obmc_scratchpad;
  1982. uint8_t *tmp_cr = tmp_cb + 8*s->uvlinesize;
  1983. uint8_t *tmp_y = tmp_cr + 8*s->uvlinesize;
  1984. int refn0 = h->ref_cache[0][ scan8[n] ];
  1985. int refn1 = h->ref_cache[1][ scan8[n] ];
  1986. mc_dir_part(h, &h->ref_list[0][refn0], n, square, chroma_height, delta, 0,
  1987. dest_y, dest_cb, dest_cr,
  1988. x_offset, y_offset, qpix_put, chroma_put);
  1989. mc_dir_part(h, &h->ref_list[1][refn1], n, square, chroma_height, delta, 1,
  1990. tmp_y, tmp_cb, tmp_cr,
  1991. x_offset, y_offset, qpix_put, chroma_put);
  1992. if(h->use_weight == 2){
  1993. int weight0 = h->implicit_weight[refn0][refn1];
  1994. int weight1 = 64 - weight0;
  1995. luma_weight_avg( dest_y, tmp_y, s-> linesize, 5, weight0, weight1, 0, 0);
  1996. chroma_weight_avg(dest_cb, tmp_cb, s->uvlinesize, 5, weight0, weight1, 0, 0);
  1997. chroma_weight_avg(dest_cr, tmp_cr, s->uvlinesize, 5, weight0, weight1, 0, 0);
  1998. }else{
  1999. luma_weight_avg(dest_y, tmp_y, s->linesize, h->luma_log2_weight_denom,
  2000. h->luma_weight[0][refn0], h->luma_weight[1][refn1],
  2001. h->luma_offset[0][refn0], h->luma_offset[1][refn1]);
  2002. chroma_weight_avg(dest_cb, tmp_cb, s->uvlinesize, h->chroma_log2_weight_denom,
  2003. h->chroma_weight[0][refn0][0], h->chroma_weight[1][refn1][0],
  2004. h->chroma_offset[0][refn0][0], h->chroma_offset[1][refn1][0]);
  2005. chroma_weight_avg(dest_cr, tmp_cr, s->uvlinesize, h->chroma_log2_weight_denom,
  2006. h->chroma_weight[0][refn0][1], h->chroma_weight[1][refn1][1],
  2007. h->chroma_offset[0][refn0][1], h->chroma_offset[1][refn1][1]);
  2008. }
  2009. }else{
  2010. int list = list1 ? 1 : 0;
  2011. int refn = h->ref_cache[list][ scan8[n] ];
  2012. Picture *ref= &h->ref_list[list][refn];
  2013. mc_dir_part(h, ref, n, square, chroma_height, delta, list,
  2014. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2015. qpix_put, chroma_put);
  2016. luma_weight_op(dest_y, s->linesize, h->luma_log2_weight_denom,
  2017. h->luma_weight[list][refn], h->luma_offset[list][refn]);
  2018. if(h->use_weight_chroma){
  2019. chroma_weight_op(dest_cb, s->uvlinesize, h->chroma_log2_weight_denom,
  2020. h->chroma_weight[list][refn][0], h->chroma_offset[list][refn][0]);
  2021. chroma_weight_op(dest_cr, s->uvlinesize, h->chroma_log2_weight_denom,
  2022. h->chroma_weight[list][refn][1], h->chroma_offset[list][refn][1]);
  2023. }
  2024. }
  2025. }
  2026. static inline void mc_part(H264Context *h, int n, int square, int chroma_height, int delta,
  2027. uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2028. int x_offset, int y_offset,
  2029. qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,
  2030. qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,
  2031. h264_weight_func *weight_op, h264_biweight_func *weight_avg,
  2032. int list0, int list1){
  2033. if((h->use_weight==2 && list0 && list1
  2034. && (h->implicit_weight[ h->ref_cache[0][scan8[n]] ][ h->ref_cache[1][scan8[n]] ] != 32))
  2035. || h->use_weight==1)
  2036. mc_part_weighted(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  2037. x_offset, y_offset, qpix_put, chroma_put,
  2038. weight_op[0], weight_op[3], weight_avg[0], weight_avg[3], list0, list1);
  2039. else
  2040. mc_part_std(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,
  2041. x_offset, y_offset, qpix_put, chroma_put, qpix_avg, chroma_avg, list0, list1);
  2042. }
  2043. static void hl_motion(H264Context *h, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,
  2044. qpel_mc_func (*qpix_put)[16], h264_chroma_mc_func (*chroma_put),
  2045. qpel_mc_func (*qpix_avg)[16], h264_chroma_mc_func (*chroma_avg),
  2046. h264_weight_func *weight_op, h264_biweight_func *weight_avg){
  2047. MpegEncContext * const s = &h->s;
  2048. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  2049. const int mb_type= s->current_picture.mb_type[mb_xy];
  2050. assert(IS_INTER(mb_type));
  2051. if(IS_16X16(mb_type)){
  2052. mc_part(h, 0, 1, 8, 0, dest_y, dest_cb, dest_cr, 0, 0,
  2053. qpix_put[0], chroma_put[0], qpix_avg[0], chroma_avg[0],
  2054. &weight_op[0], &weight_avg[0],
  2055. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2056. }else if(IS_16X8(mb_type)){
  2057. mc_part(h, 0, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 0,
  2058. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  2059. &weight_op[1], &weight_avg[1],
  2060. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2061. mc_part(h, 8, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 4,
  2062. qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],
  2063. &weight_op[1], &weight_avg[1],
  2064. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  2065. }else if(IS_8X16(mb_type)){
  2066. mc_part(h, 0, 0, 8, 8*s->linesize, dest_y, dest_cb, dest_cr, 0, 0,
  2067. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2068. &weight_op[2], &weight_avg[2],
  2069. IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));
  2070. mc_part(h, 4, 0, 8, 8*s->linesize, dest_y, dest_cb, dest_cr, 4, 0,
  2071. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2072. &weight_op[2], &weight_avg[2],
  2073. IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));
  2074. }else{
  2075. int i;
  2076. assert(IS_8X8(mb_type));
  2077. for(i=0; i<4; i++){
  2078. const int sub_mb_type= h->sub_mb_type[i];
  2079. const int n= 4*i;
  2080. int x_offset= (i&1)<<2;
  2081. int y_offset= (i&2)<<1;
  2082. if(IS_SUB_8X8(sub_mb_type)){
  2083. mc_part(h, n, 1, 4, 0, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2084. qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],
  2085. &weight_op[3], &weight_avg[3],
  2086. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2087. }else if(IS_SUB_8X4(sub_mb_type)){
  2088. mc_part(h, n , 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2089. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  2090. &weight_op[4], &weight_avg[4],
  2091. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2092. mc_part(h, n+2, 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset+2,
  2093. qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],
  2094. &weight_op[4], &weight_avg[4],
  2095. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2096. }else if(IS_SUB_4X8(sub_mb_type)){
  2097. mc_part(h, n , 0, 4, 4*s->linesize, dest_y, dest_cb, dest_cr, x_offset, y_offset,
  2098. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2099. &weight_op[5], &weight_avg[5],
  2100. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2101. mc_part(h, n+1, 0, 4, 4*s->linesize, dest_y, dest_cb, dest_cr, x_offset+2, y_offset,
  2102. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2103. &weight_op[5], &weight_avg[5],
  2104. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2105. }else{
  2106. int j;
  2107. assert(IS_SUB_4X4(sub_mb_type));
  2108. for(j=0; j<4; j++){
  2109. int sub_x_offset= x_offset + 2*(j&1);
  2110. int sub_y_offset= y_offset + (j&2);
  2111. mc_part(h, n+j, 1, 2, 0, dest_y, dest_cb, dest_cr, sub_x_offset, sub_y_offset,
  2112. qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],
  2113. &weight_op[6], &weight_avg[6],
  2114. IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));
  2115. }
  2116. }
  2117. }
  2118. }
  2119. }
  2120. static void decode_init_vlc(H264Context *h){
  2121. static int done = 0;
  2122. if (!done) {
  2123. int i;
  2124. done = 1;
  2125. init_vlc(&chroma_dc_coeff_token_vlc, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 4*5,
  2126. &chroma_dc_coeff_token_len [0], 1, 1,
  2127. &chroma_dc_coeff_token_bits[0], 1, 1, 1);
  2128. for(i=0; i<4; i++){
  2129. init_vlc(&coeff_token_vlc[i], COEFF_TOKEN_VLC_BITS, 4*17,
  2130. &coeff_token_len [i][0], 1, 1,
  2131. &coeff_token_bits[i][0], 1, 1, 1);
  2132. }
  2133. for(i=0; i<3; i++){
  2134. init_vlc(&chroma_dc_total_zeros_vlc[i], CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 4,
  2135. &chroma_dc_total_zeros_len [i][0], 1, 1,
  2136. &chroma_dc_total_zeros_bits[i][0], 1, 1, 1);
  2137. }
  2138. for(i=0; i<15; i++){
  2139. init_vlc(&total_zeros_vlc[i], TOTAL_ZEROS_VLC_BITS, 16,
  2140. &total_zeros_len [i][0], 1, 1,
  2141. &total_zeros_bits[i][0], 1, 1, 1);
  2142. }
  2143. for(i=0; i<6; i++){
  2144. init_vlc(&run_vlc[i], RUN_VLC_BITS, 7,
  2145. &run_len [i][0], 1, 1,
  2146. &run_bits[i][0], 1, 1, 1);
  2147. }
  2148. init_vlc(&run7_vlc, RUN7_VLC_BITS, 16,
  2149. &run_len [6][0], 1, 1,
  2150. &run_bits[6][0], 1, 1, 1);
  2151. }
  2152. }
  2153. /**
  2154. * Sets the intra prediction function pointers.
  2155. */
  2156. static void init_pred_ptrs(H264Context *h){
  2157. // MpegEncContext * const s = &h->s;
  2158. h->pred4x4[VERT_PRED ]= pred4x4_vertical_c;
  2159. h->pred4x4[HOR_PRED ]= pred4x4_horizontal_c;
  2160. h->pred4x4[DC_PRED ]= pred4x4_dc_c;
  2161. h->pred4x4[DIAG_DOWN_LEFT_PRED ]= pred4x4_down_left_c;
  2162. h->pred4x4[DIAG_DOWN_RIGHT_PRED]= pred4x4_down_right_c;
  2163. h->pred4x4[VERT_RIGHT_PRED ]= pred4x4_vertical_right_c;
  2164. h->pred4x4[HOR_DOWN_PRED ]= pred4x4_horizontal_down_c;
  2165. h->pred4x4[VERT_LEFT_PRED ]= pred4x4_vertical_left_c;
  2166. h->pred4x4[HOR_UP_PRED ]= pred4x4_horizontal_up_c;
  2167. h->pred4x4[LEFT_DC_PRED ]= pred4x4_left_dc_c;
  2168. h->pred4x4[TOP_DC_PRED ]= pred4x4_top_dc_c;
  2169. h->pred4x4[DC_128_PRED ]= pred4x4_128_dc_c;
  2170. h->pred8x8[DC_PRED8x8 ]= pred8x8_dc_c;
  2171. h->pred8x8[VERT_PRED8x8 ]= pred8x8_vertical_c;
  2172. h->pred8x8[HOR_PRED8x8 ]= pred8x8_horizontal_c;
  2173. h->pred8x8[PLANE_PRED8x8 ]= pred8x8_plane_c;
  2174. h->pred8x8[LEFT_DC_PRED8x8]= pred8x8_left_dc_c;
  2175. h->pred8x8[TOP_DC_PRED8x8 ]= pred8x8_top_dc_c;
  2176. h->pred8x8[DC_128_PRED8x8 ]= pred8x8_128_dc_c;
  2177. h->pred16x16[DC_PRED8x8 ]= pred16x16_dc_c;
  2178. h->pred16x16[VERT_PRED8x8 ]= pred16x16_vertical_c;
  2179. h->pred16x16[HOR_PRED8x8 ]= pred16x16_horizontal_c;
  2180. h->pred16x16[PLANE_PRED8x8 ]= pred16x16_plane_c;
  2181. h->pred16x16[LEFT_DC_PRED8x8]= pred16x16_left_dc_c;
  2182. h->pred16x16[TOP_DC_PRED8x8 ]= pred16x16_top_dc_c;
  2183. h->pred16x16[DC_128_PRED8x8 ]= pred16x16_128_dc_c;
  2184. }
  2185. static void free_tables(H264Context *h){
  2186. av_freep(&h->intra4x4_pred_mode);
  2187. av_freep(&h->chroma_pred_mode_table);
  2188. av_freep(&h->cbp_table);
  2189. av_freep(&h->mvd_table[0]);
  2190. av_freep(&h->mvd_table[1]);
  2191. av_freep(&h->direct_table);
  2192. av_freep(&h->non_zero_count);
  2193. av_freep(&h->slice_table_base);
  2194. av_freep(&h->top_border);
  2195. h->slice_table= NULL;
  2196. av_freep(&h->mb2b_xy);
  2197. av_freep(&h->mb2b8_xy);
  2198. av_freep(&h->s.obmc_scratchpad);
  2199. }
  2200. /**
  2201. * allocates tables.
  2202. * needs widzh/height
  2203. */
  2204. static int alloc_tables(H264Context *h){
  2205. MpegEncContext * const s = &h->s;
  2206. const int big_mb_num= s->mb_stride * (s->mb_height+1);
  2207. int x,y;
  2208. CHECKED_ALLOCZ(h->intra4x4_pred_mode, big_mb_num * 8 * sizeof(uint8_t))
  2209. CHECKED_ALLOCZ(h->non_zero_count , big_mb_num * 16 * sizeof(uint8_t))
  2210. CHECKED_ALLOCZ(h->slice_table_base , big_mb_num * sizeof(uint8_t))
  2211. CHECKED_ALLOCZ(h->top_border , s->mb_width * (16+8+8) * sizeof(uint8_t))
  2212. CHECKED_ALLOCZ(h->cbp_table, big_mb_num * sizeof(uint16_t))
  2213. if( h->pps.cabac ) {
  2214. CHECKED_ALLOCZ(h->chroma_pred_mode_table, big_mb_num * sizeof(uint8_t))
  2215. CHECKED_ALLOCZ(h->mvd_table[0], 32*big_mb_num * sizeof(uint16_t));
  2216. CHECKED_ALLOCZ(h->mvd_table[1], 32*big_mb_num * sizeof(uint16_t));
  2217. CHECKED_ALLOCZ(h->direct_table, 32*big_mb_num * sizeof(uint8_t));
  2218. }
  2219. memset(h->slice_table_base, -1, big_mb_num * sizeof(uint8_t));
  2220. h->slice_table= h->slice_table_base + s->mb_stride + 1;
  2221. CHECKED_ALLOCZ(h->mb2b_xy , big_mb_num * sizeof(uint16_t));
  2222. CHECKED_ALLOCZ(h->mb2b8_xy , big_mb_num * sizeof(uint16_t));
  2223. for(y=0; y<s->mb_height; y++){
  2224. for(x=0; x<s->mb_width; x++){
  2225. const int mb_xy= x + y*s->mb_stride;
  2226. const int b_xy = 4*x + 4*y*h->b_stride;
  2227. const int b8_xy= 2*x + 2*y*h->b8_stride;
  2228. h->mb2b_xy [mb_xy]= b_xy;
  2229. h->mb2b8_xy[mb_xy]= b8_xy;
  2230. }
  2231. }
  2232. s->obmc_scratchpad = NULL;
  2233. return 0;
  2234. fail:
  2235. free_tables(h);
  2236. return -1;
  2237. }
  2238. static void common_init(H264Context *h){
  2239. MpegEncContext * const s = &h->s;
  2240. s->width = s->avctx->width;
  2241. s->height = s->avctx->height;
  2242. s->codec_id= s->avctx->codec->id;
  2243. init_pred_ptrs(h);
  2244. s->unrestricted_mv=1;
  2245. s->decode=1; //FIXME
  2246. }
  2247. static int decode_init(AVCodecContext *avctx){
  2248. H264Context *h= avctx->priv_data;
  2249. MpegEncContext * const s = &h->s;
  2250. MPV_decode_defaults(s);
  2251. s->avctx = avctx;
  2252. common_init(h);
  2253. s->out_format = FMT_H264;
  2254. s->workaround_bugs= avctx->workaround_bugs;
  2255. // set defaults
  2256. // s->decode_mb= ff_h263_decode_mb;
  2257. s->low_delay= 1;
  2258. avctx->pix_fmt= PIX_FMT_YUV420P;
  2259. decode_init_vlc(h);
  2260. if(avctx->codec_tag != 0x31637661 && avctx->codec_tag != 0x31435641) // avc1
  2261. h->is_avc = 0;
  2262. else {
  2263. if((avctx->extradata_size == 0) || (avctx->extradata == NULL)) {
  2264. av_log(avctx, AV_LOG_ERROR, "AVC codec requires avcC data\n");
  2265. return -1;
  2266. }
  2267. h->is_avc = 1;
  2268. h->got_avcC = 0;
  2269. }
  2270. return 0;
  2271. }
  2272. static void frame_start(H264Context *h){
  2273. MpegEncContext * const s = &h->s;
  2274. int i;
  2275. MPV_frame_start(s, s->avctx);
  2276. ff_er_frame_start(s);
  2277. assert(s->linesize && s->uvlinesize);
  2278. for(i=0; i<16; i++){
  2279. h->block_offset[i]= 4*((scan8[i] - scan8[0])&7) + 4*s->linesize*((scan8[i] - scan8[0])>>3);
  2280. h->chroma_subblock_offset[i]= 2*((scan8[i] - scan8[0])&7) + 2*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  2281. }
  2282. for(i=0; i<4; i++){
  2283. h->block_offset[16+i]=
  2284. h->block_offset[20+i]= 4*((scan8[i] - scan8[0])&7) + 4*s->uvlinesize*((scan8[i] - scan8[0])>>3);
  2285. }
  2286. /* can't be in alloc_tables because linesize isn't known there.
  2287. * FIXME: redo bipred weight to not require extra buffer? */
  2288. if(!s->obmc_scratchpad)
  2289. s->obmc_scratchpad = av_malloc(16*s->linesize + 2*8*s->uvlinesize);
  2290. // s->decode= (s->flags&CODEC_FLAG_PSNR) || !s->encoding || s->current_picture.reference /*|| h->contains_intra*/ || 1;
  2291. }
  2292. static inline void backup_mb_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize){
  2293. MpegEncContext * const s = &h->s;
  2294. int i;
  2295. src_y -= linesize;
  2296. src_cb -= uvlinesize;
  2297. src_cr -= uvlinesize;
  2298. h->left_border[0]= h->top_border[s->mb_x][15];
  2299. for(i=1; i<17; i++){
  2300. h->left_border[i]= src_y[15+i* linesize];
  2301. }
  2302. *(uint64_t*)(h->top_border[s->mb_x]+0)= *(uint64_t*)(src_y + 16*linesize);
  2303. *(uint64_t*)(h->top_border[s->mb_x]+8)= *(uint64_t*)(src_y +8+16*linesize);
  2304. if(!(s->flags&CODEC_FLAG_GRAY)){
  2305. h->left_border[17 ]= h->top_border[s->mb_x][16+7];
  2306. h->left_border[17+9]= h->top_border[s->mb_x][24+7];
  2307. for(i=1; i<9; i++){
  2308. h->left_border[i+17 ]= src_cb[7+i*uvlinesize];
  2309. h->left_border[i+17+9]= src_cr[7+i*uvlinesize];
  2310. }
  2311. *(uint64_t*)(h->top_border[s->mb_x]+16)= *(uint64_t*)(src_cb+8*uvlinesize);
  2312. *(uint64_t*)(h->top_border[s->mb_x]+24)= *(uint64_t*)(src_cr+8*uvlinesize);
  2313. }
  2314. }
  2315. static inline void xchg_mb_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize, int xchg){
  2316. MpegEncContext * const s = &h->s;
  2317. int temp8, i;
  2318. uint64_t temp64;
  2319. int deblock_left = (s->mb_x > 0);
  2320. int deblock_top = (s->mb_y > 0);
  2321. src_y -= linesize + 1;
  2322. src_cb -= uvlinesize + 1;
  2323. src_cr -= uvlinesize + 1;
  2324. #define XCHG(a,b,t,xchg)\
  2325. t= a;\
  2326. if(xchg)\
  2327. a= b;\
  2328. b= t;
  2329. if(deblock_left){
  2330. for(i = !deblock_top; i<17; i++){
  2331. XCHG(h->left_border[i ], src_y [i* linesize], temp8, xchg);
  2332. }
  2333. }
  2334. if(deblock_top){
  2335. XCHG(*(uint64_t*)(h->top_border[s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);
  2336. XCHG(*(uint64_t*)(h->top_border[s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);
  2337. }
  2338. if(!(s->flags&CODEC_FLAG_GRAY)){
  2339. if(deblock_left){
  2340. for(i = !deblock_top; i<9; i++){
  2341. XCHG(h->left_border[i+17 ], src_cb[i*uvlinesize], temp8, xchg);
  2342. XCHG(h->left_border[i+17+9], src_cr[i*uvlinesize], temp8, xchg);
  2343. }
  2344. }
  2345. if(deblock_top){
  2346. XCHG(*(uint64_t*)(h->top_border[s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);
  2347. XCHG(*(uint64_t*)(h->top_border[s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);
  2348. }
  2349. }
  2350. }
  2351. static void hl_decode_mb(H264Context *h){
  2352. MpegEncContext * const s = &h->s;
  2353. const int mb_x= s->mb_x;
  2354. const int mb_y= s->mb_y;
  2355. const int mb_xy= mb_x + mb_y*s->mb_stride;
  2356. const int mb_type= s->current_picture.mb_type[mb_xy];
  2357. uint8_t *dest_y, *dest_cb, *dest_cr;
  2358. int linesize, uvlinesize /*dct_offset*/;
  2359. int i;
  2360. if(!s->decode)
  2361. return;
  2362. if(s->mb_skiped){
  2363. }
  2364. dest_y = s->current_picture.data[0] + (mb_y * 16* s->linesize ) + mb_x * 16;
  2365. dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2366. dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;
  2367. if (h->mb_field_decoding_flag) {
  2368. linesize = s->linesize * 2;
  2369. uvlinesize = s->uvlinesize * 2;
  2370. if(mb_y&1){ //FIXME move out of this func?
  2371. dest_y -= s->linesize*15;
  2372. dest_cb-= s->linesize*7;
  2373. dest_cr-= s->linesize*7;
  2374. }
  2375. } else {
  2376. linesize = s->linesize;
  2377. uvlinesize = s->uvlinesize;
  2378. // dct_offset = s->linesize * 16;
  2379. }
  2380. if(IS_INTRA(mb_type)){
  2381. if(h->deblocking_filter)
  2382. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 1);
  2383. if(!(s->flags&CODEC_FLAG_GRAY)){
  2384. h->pred8x8[ h->chroma_pred_mode ](dest_cb, uvlinesize);
  2385. h->pred8x8[ h->chroma_pred_mode ](dest_cr, uvlinesize);
  2386. }
  2387. if(IS_INTRA4x4(mb_type)){
  2388. if(!s->encoding){
  2389. for(i=0; i<16; i++){
  2390. uint8_t * const ptr= dest_y + h->block_offset[i];
  2391. uint8_t *topright;
  2392. const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];
  2393. int tr;
  2394. if(dir == DIAG_DOWN_LEFT_PRED || dir == VERT_LEFT_PRED){
  2395. const int topright_avail= (h->topright_samples_available<<i)&0x8000;
  2396. assert(mb_y || linesize <= h->block_offset[i]);
  2397. if(!topright_avail){
  2398. tr= ptr[3 - linesize]*0x01010101;
  2399. topright= (uint8_t*) &tr;
  2400. }else if(i==5 && h->deblocking_filter){
  2401. tr= *(uint32_t*)h->top_border[mb_x+1];
  2402. topright= (uint8_t*) &tr;
  2403. }else
  2404. topright= ptr + 4 - linesize;
  2405. }else
  2406. topright= NULL;
  2407. h->pred4x4[ dir ](ptr, topright, linesize);
  2408. if(h->non_zero_count_cache[ scan8[i] ]){
  2409. if(s->codec_id == CODEC_ID_H264)
  2410. s->dsp.h264_idct_add(ptr, h->mb + i*16, linesize);
  2411. else
  2412. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, 0);
  2413. }
  2414. }
  2415. }
  2416. }else{
  2417. h->pred16x16[ h->intra16x16_pred_mode ](dest_y , linesize);
  2418. if(s->codec_id == CODEC_ID_H264)
  2419. h264_luma_dc_dequant_idct_c(h->mb, s->qscale);
  2420. else
  2421. svq3_luma_dc_dequant_idct_c(h->mb, s->qscale);
  2422. }
  2423. if(h->deblocking_filter)
  2424. xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 0);
  2425. }else if(s->codec_id == CODEC_ID_H264){
  2426. hl_motion(h, dest_y, dest_cb, dest_cr,
  2427. s->dsp.put_h264_qpel_pixels_tab, s->dsp.put_h264_chroma_pixels_tab,
  2428. s->dsp.avg_h264_qpel_pixels_tab, s->dsp.avg_h264_chroma_pixels_tab,
  2429. s->dsp.weight_h264_pixels_tab, s->dsp.biweight_h264_pixels_tab);
  2430. }
  2431. if(!IS_INTRA4x4(mb_type)){
  2432. if(s->codec_id == CODEC_ID_H264){
  2433. for(i=0; i<16; i++){
  2434. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){ //FIXME benchmark weird rule, & below
  2435. uint8_t * const ptr= dest_y + h->block_offset[i];
  2436. s->dsp.h264_idct_add(ptr, h->mb + i*16, linesize);
  2437. }
  2438. }
  2439. }else{
  2440. for(i=0; i<16; i++){
  2441. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){ //FIXME benchmark weird rule, & below
  2442. uint8_t * const ptr= dest_y + h->block_offset[i];
  2443. svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, IS_INTRA(mb_type) ? 1 : 0);
  2444. }
  2445. }
  2446. }
  2447. }
  2448. if(!(s->flags&CODEC_FLAG_GRAY)){
  2449. chroma_dc_dequant_idct_c(h->mb + 16*16, h->chroma_qp);
  2450. chroma_dc_dequant_idct_c(h->mb + 16*16+4*16, h->chroma_qp);
  2451. if(s->codec_id == CODEC_ID_H264){
  2452. for(i=16; i<16+4; i++){
  2453. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  2454. uint8_t * const ptr= dest_cb + h->block_offset[i];
  2455. s->dsp.h264_idct_add(ptr, h->mb + i*16, uvlinesize);
  2456. }
  2457. }
  2458. for(i=20; i<20+4; i++){
  2459. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  2460. uint8_t * const ptr= dest_cr + h->block_offset[i];
  2461. s->dsp.h264_idct_add(ptr, h->mb + i*16, uvlinesize);
  2462. }
  2463. }
  2464. }else{
  2465. for(i=16; i<16+4; i++){
  2466. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  2467. uint8_t * const ptr= dest_cb + h->block_offset[i];
  2468. svq3_add_idct_c(ptr, h->mb + i*16, uvlinesize, chroma_qp[s->qscale + 12] - 12, 2);
  2469. }
  2470. }
  2471. for(i=20; i<20+4; i++){
  2472. if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){
  2473. uint8_t * const ptr= dest_cr + h->block_offset[i];
  2474. svq3_add_idct_c(ptr, h->mb + i*16, uvlinesize, chroma_qp[s->qscale + 12] - 12, 2);
  2475. }
  2476. }
  2477. }
  2478. }
  2479. if(h->deblocking_filter) {
  2480. backup_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize);
  2481. fill_caches(h, mb_type, 1); //FIXME dont fill stuff which isnt used by filter_mb
  2482. filter_mb(h, mb_x, mb_y, dest_y, dest_cb, dest_cr);
  2483. }
  2484. }
  2485. /**
  2486. * fills the default_ref_list.
  2487. */
  2488. static int fill_default_ref_list(H264Context *h){
  2489. MpegEncContext * const s = &h->s;
  2490. int i;
  2491. int smallest_poc_greater_than_current = -1;
  2492. Picture sorted_short_ref[16];
  2493. if(h->slice_type==B_TYPE){
  2494. int out_i;
  2495. int limit= -1;
  2496. /* sort frame according to poc in B slice */
  2497. for(out_i=0; out_i<h->short_ref_count; out_i++){
  2498. int best_i=-1;
  2499. int best_poc=INT_MAX;
  2500. for(i=0; i<h->short_ref_count; i++){
  2501. const int poc= h->short_ref[i]->poc;
  2502. if(poc > limit && poc < best_poc){
  2503. best_poc= poc;
  2504. best_i= i;
  2505. }
  2506. }
  2507. assert(best_i != -1);
  2508. limit= best_poc;
  2509. sorted_short_ref[out_i]= *h->short_ref[best_i];
  2510. tprintf("sorted poc: %d->%d poc:%d fn:%d\n", best_i, out_i, sorted_short_ref[out_i].poc, sorted_short_ref[out_i].frame_num);
  2511. if (-1 == smallest_poc_greater_than_current) {
  2512. if (h->short_ref[best_i]->poc >= s->current_picture_ptr->poc) {
  2513. smallest_poc_greater_than_current = out_i;
  2514. }
  2515. }
  2516. }
  2517. }
  2518. if(s->picture_structure == PICT_FRAME){
  2519. if(h->slice_type==B_TYPE){
  2520. int list;
  2521. tprintf("current poc: %d, smallest_poc_greater_than_current: %d\n", s->current_picture_ptr->poc, smallest_poc_greater_than_current);
  2522. // find the largest poc
  2523. for(list=0; list<2; list++){
  2524. int index = 0;
  2525. int j= -99;
  2526. int step= list ? -1 : 1;
  2527. for(i=0; i<h->short_ref_count && index < h->ref_count[list]; i++, j+=step) {
  2528. while(j<0 || j>= h->short_ref_count){
  2529. step = -step;
  2530. j= smallest_poc_greater_than_current + (step>>1);
  2531. }
  2532. if(sorted_short_ref[j].reference != 3) continue;
  2533. h->default_ref_list[list][index ]= sorted_short_ref[j];
  2534. h->default_ref_list[list][index++].pic_id= sorted_short_ref[j].frame_num;
  2535. }
  2536. for(i = 0; i < 16 && index < h->ref_count[ list ]; i++){
  2537. if(h->long_ref[i] == NULL) continue;
  2538. if(h->long_ref[i]->reference != 3) continue;
  2539. h->default_ref_list[ list ][index ]= *h->long_ref[i];
  2540. h->default_ref_list[ list ][index++].pic_id= i;;
  2541. }
  2542. if(list && (smallest_poc_greater_than_current<=0 || smallest_poc_greater_than_current>=h->short_ref_count) && (1 < index)){
  2543. // swap the two first elements of L1 when
  2544. // L0 and L1 are identical
  2545. Picture temp= h->default_ref_list[1][0];
  2546. h->default_ref_list[1][0] = h->default_ref_list[1][1];
  2547. h->default_ref_list[1][0] = temp;
  2548. }
  2549. if(index < h->ref_count[ list ])
  2550. memset(&h->default_ref_list[list][index], 0, sizeof(Picture)*(h->ref_count[ list ] - index));
  2551. }
  2552. }else{
  2553. int index=0;
  2554. for(i=0; i<h->short_ref_count && index < h->ref_count[0]; i++){
  2555. if(h->short_ref[i]->reference != 3) continue; //FIXME refernce field shit
  2556. h->default_ref_list[0][index ]= *h->short_ref[i];
  2557. h->default_ref_list[0][index++].pic_id= h->short_ref[i]->frame_num;
  2558. }
  2559. for(i = 0; i < 16 && index < h->ref_count[0]; i++){
  2560. if(h->long_ref[i] == NULL) continue;
  2561. if(h->long_ref[i]->reference != 3) continue;
  2562. h->default_ref_list[0][index ]= *h->long_ref[i];
  2563. h->default_ref_list[0][index++].pic_id= i;;
  2564. }
  2565. if(index < h->ref_count[0])
  2566. memset(&h->default_ref_list[0][index], 0, sizeof(Picture)*(h->ref_count[0] - index));
  2567. }
  2568. }else{ //FIELD
  2569. if(h->slice_type==B_TYPE){
  2570. }else{
  2571. //FIXME second field balh
  2572. }
  2573. }
  2574. #ifdef TRACE
  2575. for (i=0; i<h->ref_count[0]; i++) {
  2576. tprintf("List0: %s fn:%d 0x%p\n", (h->default_ref_list[0][i].long_ref ? "LT" : "ST"), h->default_ref_list[0][i].pic_id, h->default_ref_list[0][i].data[0]);
  2577. }
  2578. if(h->slice_type==B_TYPE){
  2579. for (i=0; i<h->ref_count[1]; i++) {
  2580. tprintf("List1: %s fn:%d 0x%p\n", (h->default_ref_list[1][i].long_ref ? "LT" : "ST"), h->default_ref_list[1][i].pic_id, h->default_ref_list[0][i].data[0]);
  2581. }
  2582. }
  2583. #endif
  2584. return 0;
  2585. }
  2586. static void print_short_term(H264Context *h);
  2587. static void print_long_term(H264Context *h);
  2588. static int decode_ref_pic_list_reordering(H264Context *h){
  2589. MpegEncContext * const s = &h->s;
  2590. int list;
  2591. print_short_term(h);
  2592. print_long_term(h);
  2593. if(h->slice_type==I_TYPE || h->slice_type==SI_TYPE) return 0; //FIXME move beofre func
  2594. for(list=0; list<2; list++){
  2595. memcpy(h->ref_list[list], h->default_ref_list[list], sizeof(Picture)*h->ref_count[list]);
  2596. if(get_bits1(&s->gb)){
  2597. int pred= h->curr_pic_num;
  2598. int index;
  2599. for(index=0; ; index++){
  2600. int reordering_of_pic_nums_idc= get_ue_golomb(&s->gb);
  2601. int pic_id;
  2602. int i;
  2603. if(reordering_of_pic_nums_idc==3)
  2604. break;
  2605. if(index >= h->ref_count[list]){
  2606. av_log(h->s.avctx, AV_LOG_ERROR, "reference count overflow\n");
  2607. return -1;
  2608. }
  2609. if(reordering_of_pic_nums_idc<3){
  2610. if(reordering_of_pic_nums_idc<2){
  2611. const int abs_diff_pic_num= get_ue_golomb(&s->gb) + 1;
  2612. if(abs_diff_pic_num >= h->max_pic_num){
  2613. av_log(h->s.avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");
  2614. return -1;
  2615. }
  2616. if(reordering_of_pic_nums_idc == 0) pred-= abs_diff_pic_num;
  2617. else pred+= abs_diff_pic_num;
  2618. pred &= h->max_pic_num - 1;
  2619. for(i= h->ref_count[list]-1; i>=index; i--){
  2620. if(h->ref_list[list][i].pic_id == pred && h->ref_list[list][i].long_ref==0)
  2621. break;
  2622. }
  2623. }else{
  2624. pic_id= get_ue_golomb(&s->gb); //long_term_pic_idx
  2625. for(i= h->ref_count[list]-1; i>=index; i--){
  2626. if(h->ref_list[list][i].pic_id == pic_id && h->ref_list[list][i].long_ref==1)
  2627. break;
  2628. }
  2629. }
  2630. if(i < index){
  2631. av_log(h->s.avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");
  2632. memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME
  2633. }else if(i > index){
  2634. Picture tmp= h->ref_list[list][i];
  2635. for(; i>index; i--){
  2636. h->ref_list[list][i]= h->ref_list[list][i-1];
  2637. }
  2638. h->ref_list[list][index]= tmp;
  2639. }
  2640. }else{
  2641. av_log(h->s.avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");
  2642. return -1;
  2643. }
  2644. }
  2645. }
  2646. if(h->slice_type!=B_TYPE) break;
  2647. }
  2648. if(h->slice_type==B_TYPE && !h->direct_spatial_mv_pred)
  2649. direct_dist_scale_factor(h);
  2650. return 0;
  2651. }
  2652. static int pred_weight_table(H264Context *h){
  2653. MpegEncContext * const s = &h->s;
  2654. int list, i;
  2655. int luma_def, chroma_def;
  2656. h->use_weight= 0;
  2657. h->use_weight_chroma= 0;
  2658. h->luma_log2_weight_denom= get_ue_golomb(&s->gb);
  2659. h->chroma_log2_weight_denom= get_ue_golomb(&s->gb);
  2660. luma_def = 1<<h->luma_log2_weight_denom;
  2661. chroma_def = 1<<h->chroma_log2_weight_denom;
  2662. for(list=0; list<2; list++){
  2663. for(i=0; i<h->ref_count[list]; i++){
  2664. int luma_weight_flag, chroma_weight_flag;
  2665. luma_weight_flag= get_bits1(&s->gb);
  2666. if(luma_weight_flag){
  2667. h->luma_weight[list][i]= get_se_golomb(&s->gb);
  2668. h->luma_offset[list][i]= get_se_golomb(&s->gb);
  2669. if( h->luma_weight[list][i] != luma_def
  2670. || h->luma_offset[list][i] != 0)
  2671. h->use_weight= 1;
  2672. }else{
  2673. h->luma_weight[list][i]= luma_def;
  2674. h->luma_offset[list][i]= 0;
  2675. }
  2676. chroma_weight_flag= get_bits1(&s->gb);
  2677. if(chroma_weight_flag){
  2678. int j;
  2679. for(j=0; j<2; j++){
  2680. h->chroma_weight[list][i][j]= get_se_golomb(&s->gb);
  2681. h->chroma_offset[list][i][j]= get_se_golomb(&s->gb);
  2682. if( h->chroma_weight[list][i][j] != chroma_def
  2683. || h->chroma_offset[list][i][j] != 0)
  2684. h->use_weight_chroma= 1;
  2685. }
  2686. }else{
  2687. int j;
  2688. for(j=0; j<2; j++){
  2689. h->chroma_weight[list][i][j]= chroma_def;
  2690. h->chroma_offset[list][i][j]= 0;
  2691. }
  2692. }
  2693. }
  2694. if(h->slice_type != B_TYPE) break;
  2695. }
  2696. h->use_weight= h->use_weight || h->use_weight_chroma;
  2697. return 0;
  2698. }
  2699. static void implicit_weight_table(H264Context *h){
  2700. MpegEncContext * const s = &h->s;
  2701. int ref0, ref1;
  2702. int cur_poc = s->current_picture_ptr->poc;
  2703. if( h->ref_count[0] == 1 && h->ref_count[1] == 1
  2704. && h->ref_list[0][0].poc + h->ref_list[1][0].poc == 2*cur_poc){
  2705. h->use_weight= 0;
  2706. h->use_weight_chroma= 0;
  2707. return;
  2708. }
  2709. h->use_weight= 2;
  2710. h->use_weight_chroma= 2;
  2711. h->luma_log2_weight_denom= 5;
  2712. h->chroma_log2_weight_denom= 5;
  2713. /* FIXME: MBAFF */
  2714. for(ref0=0; ref0 < h->ref_count[0]; ref0++){
  2715. int poc0 = h->ref_list[0][ref0].poc;
  2716. for(ref1=0; ref1 < h->ref_count[1]; ref1++){
  2717. int poc1 = h->ref_list[0][ref1].poc;
  2718. int td = clip(poc1 - poc0, -128, 127);
  2719. if(td){
  2720. int tb = clip(cur_poc - poc0, -128, 127);
  2721. int tx = (16384 + (ABS(td) >> 1)) / td;
  2722. int dist_scale_factor = clip((tb*tx + 32) >> 6, -1024, 1023) >> 2;
  2723. if(dist_scale_factor < -64 || dist_scale_factor > 128)
  2724. h->implicit_weight[ref0][ref1] = 32;
  2725. else
  2726. h->implicit_weight[ref0][ref1] = 64 - dist_scale_factor;
  2727. }else
  2728. h->implicit_weight[ref0][ref1] = 32;
  2729. }
  2730. }
  2731. }
  2732. /**
  2733. * instantaneous decoder refresh.
  2734. */
  2735. static void idr(H264Context *h){
  2736. int i,j;
  2737. #define CHECK_DELAY(pic) \
  2738. for(j = 0; h->delayed_pic[j]; j++) \
  2739. if(pic == h->delayed_pic[j]){ \
  2740. pic->reference=1; \
  2741. break; \
  2742. }
  2743. for(i=0; i<h->long_ref_count; i++){
  2744. h->long_ref[i]->reference=0;
  2745. CHECK_DELAY(h->long_ref[i]);
  2746. h->long_ref[i]= NULL;
  2747. }
  2748. h->long_ref_count=0;
  2749. for(i=0; i<h->short_ref_count; i++){
  2750. h->short_ref[i]->reference=0;
  2751. CHECK_DELAY(h->short_ref[i]);
  2752. h->short_ref[i]= NULL;
  2753. }
  2754. h->short_ref_count=0;
  2755. }
  2756. #undef CHECK_DELAY
  2757. /**
  2758. *
  2759. * @return the removed picture or NULL if an error occures
  2760. */
  2761. static Picture * remove_short(H264Context *h, int frame_num){
  2762. MpegEncContext * const s = &h->s;
  2763. int i;
  2764. if(s->avctx->debug&FF_DEBUG_MMCO)
  2765. av_log(h->s.avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);
  2766. for(i=0; i<h->short_ref_count; i++){
  2767. Picture *pic= h->short_ref[i];
  2768. if(s->avctx->debug&FF_DEBUG_MMCO)
  2769. av_log(h->s.avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);
  2770. if(pic->frame_num == frame_num){
  2771. h->short_ref[i]= NULL;
  2772. memmove(&h->short_ref[i], &h->short_ref[i+1], (h->short_ref_count - i - 1)*sizeof(Picture*));
  2773. h->short_ref_count--;
  2774. return pic;
  2775. }
  2776. }
  2777. return NULL;
  2778. }
  2779. /**
  2780. *
  2781. * @return the removed picture or NULL if an error occures
  2782. */
  2783. static Picture * remove_long(H264Context *h, int i){
  2784. Picture *pic;
  2785. pic= h->long_ref[i];
  2786. h->long_ref[i]= NULL;
  2787. if(pic) h->long_ref_count--;
  2788. return pic;
  2789. }
  2790. /**
  2791. * print short term list
  2792. */
  2793. static void print_short_term(H264Context *h) {
  2794. uint32_t i;
  2795. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  2796. av_log(h->s.avctx, AV_LOG_DEBUG, "short term list:\n");
  2797. for(i=0; i<h->short_ref_count; i++){
  2798. Picture *pic= h->short_ref[i];
  2799. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  2800. }
  2801. }
  2802. }
  2803. /**
  2804. * print long term list
  2805. */
  2806. static void print_long_term(H264Context *h) {
  2807. uint32_t i;
  2808. if(h->s.avctx->debug&FF_DEBUG_MMCO) {
  2809. av_log(h->s.avctx, AV_LOG_DEBUG, "long term list:\n");
  2810. for(i = 0; i < 16; i++){
  2811. Picture *pic= h->long_ref[i];
  2812. if (pic) {
  2813. av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);
  2814. }
  2815. }
  2816. }
  2817. }
  2818. /**
  2819. * Executes the reference picture marking (memory management control operations).
  2820. */
  2821. static int execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count){
  2822. MpegEncContext * const s = &h->s;
  2823. int i, j;
  2824. int current_is_long=0;
  2825. Picture *pic;
  2826. if((s->avctx->debug&FF_DEBUG_MMCO) && mmco_count==0)
  2827. av_log(h->s.avctx, AV_LOG_DEBUG, "no mmco here\n");
  2828. for(i=0; i<mmco_count; i++){
  2829. if(s->avctx->debug&FF_DEBUG_MMCO)
  2830. av_log(h->s.avctx, AV_LOG_DEBUG, "mmco:%d %d %d\n", h->mmco[i].opcode, h->mmco[i].short_frame_num, h->mmco[i].long_index);
  2831. switch(mmco[i].opcode){
  2832. case MMCO_SHORT2UNUSED:
  2833. pic= remove_short(h, mmco[i].short_frame_num);
  2834. if(pic==NULL) return -1;
  2835. pic->reference= 0;
  2836. break;
  2837. case MMCO_SHORT2LONG:
  2838. pic= remove_long(h, mmco[i].long_index);
  2839. if(pic) pic->reference=0;
  2840. h->long_ref[ mmco[i].long_index ]= remove_short(h, mmco[i].short_frame_num);
  2841. h->long_ref[ mmco[i].long_index ]->long_ref=1;
  2842. break;
  2843. case MMCO_LONG2UNUSED:
  2844. pic= remove_long(h, mmco[i].long_index);
  2845. if(pic==NULL) return -1;
  2846. pic->reference= 0;
  2847. break;
  2848. case MMCO_LONG:
  2849. pic= remove_long(h, mmco[i].long_index);
  2850. if(pic) pic->reference=0;
  2851. h->long_ref[ mmco[i].long_index ]= s->current_picture_ptr;
  2852. h->long_ref[ mmco[i].long_index ]->long_ref=1;
  2853. h->long_ref_count++;
  2854. current_is_long=1;
  2855. break;
  2856. case MMCO_SET_MAX_LONG:
  2857. assert(mmco[i].long_index <= 16);
  2858. // just remove the long term which index is greater than new max
  2859. for(j = mmco[i].long_index; j<16; j++){
  2860. pic = remove_long(h, j);
  2861. if (pic) pic->reference=0;
  2862. }
  2863. break;
  2864. case MMCO_RESET:
  2865. while(h->short_ref_count){
  2866. pic= remove_short(h, h->short_ref[0]->frame_num);
  2867. pic->reference=0;
  2868. }
  2869. for(j = 0; j < 16; j++) {
  2870. pic= remove_long(h, j);
  2871. if(pic) pic->reference=0;
  2872. }
  2873. break;
  2874. default: assert(0);
  2875. }
  2876. }
  2877. if(!current_is_long){
  2878. pic= remove_short(h, s->current_picture_ptr->frame_num);
  2879. if(pic){
  2880. pic->reference=0;
  2881. av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");
  2882. }
  2883. if(h->short_ref_count)
  2884. memmove(&h->short_ref[1], &h->short_ref[0], h->short_ref_count*sizeof(Picture*));
  2885. h->short_ref[0]= s->current_picture_ptr;
  2886. h->short_ref[0]->long_ref=0;
  2887. h->short_ref_count++;
  2888. }
  2889. print_short_term(h);
  2890. print_long_term(h);
  2891. return 0;
  2892. }
  2893. static int decode_ref_pic_marking(H264Context *h){
  2894. MpegEncContext * const s = &h->s;
  2895. int i;
  2896. if(h->nal_unit_type == NAL_IDR_SLICE){ //FIXME fields
  2897. s->broken_link= get_bits1(&s->gb) -1;
  2898. h->mmco[0].long_index= get_bits1(&s->gb) - 1; // current_long_term_idx
  2899. if(h->mmco[0].long_index == -1)
  2900. h->mmco_index= 0;
  2901. else{
  2902. h->mmco[0].opcode= MMCO_LONG;
  2903. h->mmco_index= 1;
  2904. }
  2905. }else{
  2906. if(get_bits1(&s->gb)){ // adaptive_ref_pic_marking_mode_flag
  2907. for(i= 0; i<MAX_MMCO_COUNT; i++) {
  2908. MMCOOpcode opcode= get_ue_golomb(&s->gb);;
  2909. h->mmco[i].opcode= opcode;
  2910. if(opcode==MMCO_SHORT2UNUSED || opcode==MMCO_SHORT2LONG){
  2911. h->mmco[i].short_frame_num= (h->frame_num - get_ue_golomb(&s->gb) - 1) & ((1<<h->sps.log2_max_frame_num)-1); //FIXME fields
  2912. /* if(h->mmco[i].short_frame_num >= h->short_ref_count || h->short_ref[ h->mmco[i].short_frame_num ] == NULL){
  2913. fprintf(stderr, "illegal short ref in memory management control operation %d\n", mmco);
  2914. return -1;
  2915. }*/
  2916. }
  2917. if(opcode==MMCO_SHORT2LONG || opcode==MMCO_LONG2UNUSED || opcode==MMCO_LONG || opcode==MMCO_SET_MAX_LONG){
  2918. h->mmco[i].long_index= get_ue_golomb(&s->gb);
  2919. if(/*h->mmco[i].long_index >= h->long_ref_count || h->long_ref[ h->mmco[i].long_index ] == NULL*/ h->mmco[i].long_index >= 16){
  2920. av_log(h->s.avctx, AV_LOG_ERROR, "illegal long ref in memory management control operation %d\n", opcode);
  2921. return -1;
  2922. }
  2923. }
  2924. if(opcode > MMCO_LONG){
  2925. av_log(h->s.avctx, AV_LOG_ERROR, "illegal memory management control operation %d\n", opcode);
  2926. return -1;
  2927. }
  2928. if(opcode == MMCO_END)
  2929. break;
  2930. }
  2931. h->mmco_index= i;
  2932. }else{
  2933. assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);
  2934. if(h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count){ //FIXME fields
  2935. h->mmco[0].opcode= MMCO_SHORT2UNUSED;
  2936. h->mmco[0].short_frame_num= h->short_ref[ h->short_ref_count - 1 ]->frame_num;
  2937. h->mmco_index= 1;
  2938. }else
  2939. h->mmco_index= 0;
  2940. }
  2941. }
  2942. return 0;
  2943. }
  2944. static int init_poc(H264Context *h){
  2945. MpegEncContext * const s = &h->s;
  2946. const int max_frame_num= 1<<h->sps.log2_max_frame_num;
  2947. int field_poc[2];
  2948. if(h->nal_unit_type == NAL_IDR_SLICE){
  2949. h->frame_num_offset= 0;
  2950. }else{
  2951. if(h->frame_num < h->prev_frame_num)
  2952. h->frame_num_offset= h->prev_frame_num_offset + max_frame_num;
  2953. else
  2954. h->frame_num_offset= h->prev_frame_num_offset;
  2955. }
  2956. if(h->sps.poc_type==0){
  2957. const int max_poc_lsb= 1<<h->sps.log2_max_poc_lsb;
  2958. if (h->poc_lsb < h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb >= max_poc_lsb/2)
  2959. h->poc_msb = h->prev_poc_msb + max_poc_lsb;
  2960. else if(h->poc_lsb > h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb < -max_poc_lsb/2)
  2961. h->poc_msb = h->prev_poc_msb - max_poc_lsb;
  2962. else
  2963. h->poc_msb = h->prev_poc_msb;
  2964. //printf("poc: %d %d\n", h->poc_msb, h->poc_lsb);
  2965. field_poc[0] =
  2966. field_poc[1] = h->poc_msb + h->poc_lsb;
  2967. if(s->picture_structure == PICT_FRAME)
  2968. field_poc[1] += h->delta_poc_bottom;
  2969. }else if(h->sps.poc_type==1){
  2970. int abs_frame_num, expected_delta_per_poc_cycle, expectedpoc;
  2971. int i;
  2972. if(h->sps.poc_cycle_length != 0)
  2973. abs_frame_num = h->frame_num_offset + h->frame_num;
  2974. else
  2975. abs_frame_num = 0;
  2976. if(h->nal_ref_idc==0 && abs_frame_num > 0)
  2977. abs_frame_num--;
  2978. expected_delta_per_poc_cycle = 0;
  2979. for(i=0; i < h->sps.poc_cycle_length; i++)
  2980. expected_delta_per_poc_cycle += h->sps.offset_for_ref_frame[ i ]; //FIXME integrate during sps parse
  2981. if(abs_frame_num > 0){
  2982. int poc_cycle_cnt = (abs_frame_num - 1) / h->sps.poc_cycle_length;
  2983. int frame_num_in_poc_cycle = (abs_frame_num - 1) % h->sps.poc_cycle_length;
  2984. expectedpoc = poc_cycle_cnt * expected_delta_per_poc_cycle;
  2985. for(i = 0; i <= frame_num_in_poc_cycle; i++)
  2986. expectedpoc = expectedpoc + h->sps.offset_for_ref_frame[ i ];
  2987. } else
  2988. expectedpoc = 0;
  2989. if(h->nal_ref_idc == 0)
  2990. expectedpoc = expectedpoc + h->sps.offset_for_non_ref_pic;
  2991. field_poc[0] = expectedpoc + h->delta_poc[0];
  2992. field_poc[1] = field_poc[0] + h->sps.offset_for_top_to_bottom_field;
  2993. if(s->picture_structure == PICT_FRAME)
  2994. field_poc[1] += h->delta_poc[1];
  2995. }else{
  2996. int poc;
  2997. if(h->nal_unit_type == NAL_IDR_SLICE){
  2998. poc= 0;
  2999. }else{
  3000. if(h->nal_ref_idc) poc= 2*(h->frame_num_offset + h->frame_num);
  3001. else poc= 2*(h->frame_num_offset + h->frame_num) - 1;
  3002. }
  3003. field_poc[0]= poc;
  3004. field_poc[1]= poc;
  3005. }
  3006. if(s->picture_structure != PICT_BOTTOM_FIELD)
  3007. s->current_picture_ptr->field_poc[0]= field_poc[0];
  3008. if(s->picture_structure != PICT_TOP_FIELD)
  3009. s->current_picture_ptr->field_poc[1]= field_poc[1];
  3010. if(s->picture_structure == PICT_FRAME) // FIXME field pix?
  3011. s->current_picture_ptr->poc= FFMIN(field_poc[0], field_poc[1]);
  3012. return 0;
  3013. }
  3014. /**
  3015. * decodes a slice header.
  3016. * this will allso call MPV_common_init() and frame_start() as needed
  3017. */
  3018. static int decode_slice_header(H264Context *h){
  3019. MpegEncContext * const s = &h->s;
  3020. int first_mb_in_slice, pps_id;
  3021. int num_ref_idx_active_override_flag;
  3022. static const uint8_t slice_type_map[5]= {P_TYPE, B_TYPE, I_TYPE, SP_TYPE, SI_TYPE};
  3023. s->current_picture.reference= h->nal_ref_idc != 0;
  3024. first_mb_in_slice= get_ue_golomb(&s->gb);
  3025. h->slice_type= get_ue_golomb(&s->gb);
  3026. if(h->slice_type > 9){
  3027. av_log(h->s.avctx, AV_LOG_ERROR, "slice type too large (%d) at %d %d\n", h->slice_type, s->mb_x, s->mb_y);
  3028. return -1;
  3029. }
  3030. if(h->slice_type > 4){
  3031. h->slice_type -= 5;
  3032. h->slice_type_fixed=1;
  3033. }else
  3034. h->slice_type_fixed=0;
  3035. h->slice_type= slice_type_map[ h->slice_type ];
  3036. s->pict_type= h->slice_type; // to make a few old func happy, its wrong though
  3037. pps_id= get_ue_golomb(&s->gb);
  3038. if(pps_id>255){
  3039. av_log(h->s.avctx, AV_LOG_ERROR, "pps_id out of range\n");
  3040. return -1;
  3041. }
  3042. h->pps= h->pps_buffer[pps_id];
  3043. if(h->pps.slice_group_count == 0){
  3044. av_log(h->s.avctx, AV_LOG_ERROR, "non existing PPS referenced\n");
  3045. return -1;
  3046. }
  3047. h->sps= h->sps_buffer[ h->pps.sps_id ];
  3048. if(h->sps.log2_max_frame_num == 0){
  3049. av_log(h->s.avctx, AV_LOG_ERROR, "non existing SPS referenced\n");
  3050. return -1;
  3051. }
  3052. s->mb_width= h->sps.mb_width;
  3053. s->mb_height= h->sps.mb_height;
  3054. h->b_stride= s->mb_width*4 + 1;
  3055. h->b8_stride= s->mb_width*2 + 1;
  3056. s->resync_mb_x = s->mb_x = first_mb_in_slice % s->mb_width;
  3057. s->resync_mb_y = s->mb_y = first_mb_in_slice / s->mb_width; //FIXME AFFW
  3058. s->width = 16*s->mb_width - 2*(h->sps.crop_left + h->sps.crop_right );
  3059. if(h->sps.frame_mbs_only_flag)
  3060. s->height= 16*s->mb_height - 2*(h->sps.crop_top + h->sps.crop_bottom);
  3061. else
  3062. s->height= 16*s->mb_height - 4*(h->sps.crop_top + h->sps.crop_bottom); //FIXME recheck
  3063. if (s->context_initialized
  3064. && ( s->width != s->avctx->width || s->height != s->avctx->height)) {
  3065. free_tables(h);
  3066. MPV_common_end(s);
  3067. }
  3068. if (!s->context_initialized) {
  3069. if (MPV_common_init(s) < 0)
  3070. return -1;
  3071. alloc_tables(h);
  3072. s->avctx->width = s->width;
  3073. s->avctx->height = s->height;
  3074. s->avctx->sample_aspect_ratio= h->sps.sar;
  3075. if(!s->avctx->sample_aspect_ratio.den)
  3076. s->avctx->sample_aspect_ratio.den = 1;
  3077. if(h->sps.timing_info_present_flag && h->sps.fixed_frame_rate_flag){
  3078. s->avctx->frame_rate = h->sps.time_scale;
  3079. s->avctx->frame_rate_base = h->sps.num_units_in_tick;
  3080. }
  3081. }
  3082. if(h->slice_num == 0){
  3083. frame_start(h);
  3084. }
  3085. s->current_picture_ptr->frame_num= //FIXME frame_num cleanup
  3086. h->frame_num= get_bits(&s->gb, h->sps.log2_max_frame_num);
  3087. if(h->sps.frame_mbs_only_flag){
  3088. s->picture_structure= PICT_FRAME;
  3089. }else{
  3090. if(get_bits1(&s->gb)) //field_pic_flag
  3091. s->picture_structure= PICT_TOP_FIELD + get_bits1(&s->gb); //bottom_field_flag
  3092. else
  3093. s->picture_structure= PICT_FRAME;
  3094. }
  3095. if(s->picture_structure==PICT_FRAME){
  3096. h->curr_pic_num= h->frame_num;
  3097. h->max_pic_num= 1<< h->sps.log2_max_frame_num;
  3098. }else{
  3099. h->curr_pic_num= 2*h->frame_num;
  3100. h->max_pic_num= 1<<(h->sps.log2_max_frame_num + 1);
  3101. }
  3102. if(h->nal_unit_type == NAL_IDR_SLICE){
  3103. get_ue_golomb(&s->gb); /* idr_pic_id */
  3104. }
  3105. if(h->sps.poc_type==0){
  3106. h->poc_lsb= get_bits(&s->gb, h->sps.log2_max_poc_lsb);
  3107. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME){
  3108. h->delta_poc_bottom= get_se_golomb(&s->gb);
  3109. }
  3110. }
  3111. if(h->sps.poc_type==1 && !h->sps.delta_pic_order_always_zero_flag){
  3112. h->delta_poc[0]= get_se_golomb(&s->gb);
  3113. if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME)
  3114. h->delta_poc[1]= get_se_golomb(&s->gb);
  3115. }
  3116. init_poc(h);
  3117. if(h->pps.redundant_pic_cnt_present){
  3118. h->redundant_pic_count= get_ue_golomb(&s->gb);
  3119. }
  3120. //set defaults, might be overriden a few line later
  3121. h->ref_count[0]= h->pps.ref_count[0];
  3122. h->ref_count[1]= h->pps.ref_count[1];
  3123. if(h->slice_type == P_TYPE || h->slice_type == SP_TYPE || h->slice_type == B_TYPE){
  3124. if(h->slice_type == B_TYPE){
  3125. h->direct_spatial_mv_pred= get_bits1(&s->gb);
  3126. }
  3127. num_ref_idx_active_override_flag= get_bits1(&s->gb);
  3128. if(num_ref_idx_active_override_flag){
  3129. h->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  3130. if(h->slice_type==B_TYPE)
  3131. h->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  3132. if(h->ref_count[0] > 32 || h->ref_count[1] > 32){
  3133. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow\n");
  3134. return -1;
  3135. }
  3136. }
  3137. }
  3138. if(h->slice_num == 0){
  3139. fill_default_ref_list(h);
  3140. }
  3141. decode_ref_pic_list_reordering(h);
  3142. if( (h->pps.weighted_pred && (h->slice_type == P_TYPE || h->slice_type == SP_TYPE ))
  3143. || (h->pps.weighted_bipred_idc==1 && h->slice_type==B_TYPE ) )
  3144. pred_weight_table(h);
  3145. else if(h->pps.weighted_bipred_idc==2 && h->slice_type==B_TYPE)
  3146. implicit_weight_table(h);
  3147. else
  3148. h->use_weight = 0;
  3149. if(s->current_picture.reference)
  3150. decode_ref_pic_marking(h);
  3151. if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE && h->pps.cabac )
  3152. h->cabac_init_idc = get_ue_golomb(&s->gb);
  3153. h->last_qscale_diff = 0;
  3154. s->qscale = h->pps.init_qp + get_se_golomb(&s->gb);
  3155. if(s->qscale<0 || s->qscale>51){
  3156. av_log(s->avctx, AV_LOG_ERROR, "QP %d out of range\n", s->qscale);
  3157. return -1;
  3158. }
  3159. h->chroma_qp = get_chroma_qp(h, s->qscale);
  3160. //FIXME qscale / qp ... stuff
  3161. if(h->slice_type == SP_TYPE){
  3162. get_bits1(&s->gb); /* sp_for_switch_flag */
  3163. }
  3164. if(h->slice_type==SP_TYPE || h->slice_type == SI_TYPE){
  3165. get_se_golomb(&s->gb); /* slice_qs_delta */
  3166. }
  3167. h->deblocking_filter = 1;
  3168. h->slice_alpha_c0_offset = 0;
  3169. h->slice_beta_offset = 0;
  3170. if( h->pps.deblocking_filter_parameters_present ) {
  3171. h->deblocking_filter= get_ue_golomb(&s->gb);
  3172. if(h->deblocking_filter < 2)
  3173. h->deblocking_filter^= 1; // 1<->0
  3174. if( h->deblocking_filter ) {
  3175. h->slice_alpha_c0_offset = get_se_golomb(&s->gb) << 1;
  3176. h->slice_beta_offset = get_se_golomb(&s->gb) << 1;
  3177. }
  3178. }
  3179. #if 0 //FMO
  3180. if( h->pps.num_slice_groups > 1 && h->pps.mb_slice_group_map_type >= 3 && h->pps.mb_slice_group_map_type <= 5)
  3181. slice_group_change_cycle= get_bits(&s->gb, ?);
  3182. #endif
  3183. h->slice_num++;
  3184. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  3185. av_log(h->s.avctx, AV_LOG_DEBUG, "slice:%d mb:%d %c pps:%d frame:%d poc:%d/%d ref:%d/%d qp:%d loop:%d weight:%d%s\n",
  3186. h->slice_num, first_mb_in_slice,
  3187. av_get_pict_type_char(h->slice_type),
  3188. pps_id, h->frame_num,
  3189. s->current_picture_ptr->field_poc[0], s->current_picture_ptr->field_poc[1],
  3190. h->ref_count[0], h->ref_count[1],
  3191. s->qscale,
  3192. h->deblocking_filter,
  3193. h->use_weight,
  3194. h->use_weight==1 && h->use_weight_chroma ? "c" : ""
  3195. );
  3196. }
  3197. return 0;
  3198. }
  3199. /**
  3200. *
  3201. */
  3202. static inline int get_level_prefix(GetBitContext *gb){
  3203. unsigned int buf;
  3204. int log;
  3205. OPEN_READER(re, gb);
  3206. UPDATE_CACHE(re, gb);
  3207. buf=GET_CACHE(re, gb);
  3208. log= 32 - av_log2(buf);
  3209. #ifdef TRACE
  3210. print_bin(buf>>(32-log), log);
  3211. av_log(NULL, AV_LOG_DEBUG, "%5d %2d %3d lpr @%5d in %s get_level_prefix\n", buf>>(32-log), log, log-1, get_bits_count(gb), __FILE__);
  3212. #endif
  3213. LAST_SKIP_BITS(re, gb, log);
  3214. CLOSE_READER(re, gb);
  3215. return log-1;
  3216. }
  3217. /**
  3218. * decodes a residual block.
  3219. * @param n block index
  3220. * @param scantable scantable
  3221. * @param max_coeff number of coefficients in the block
  3222. * @return <0 if an error occured
  3223. */
  3224. static int decode_residual(H264Context *h, GetBitContext *gb, DCTELEM *block, int n, const uint8_t *scantable, int qp, int max_coeff){
  3225. MpegEncContext * const s = &h->s;
  3226. const uint16_t *qmul= dequant_coeff[qp];
  3227. static const int coeff_token_table_index[17]= {0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3};
  3228. int level[16], run[16];
  3229. int suffix_length, zeros_left, coeff_num, coeff_token, total_coeff, i, trailing_ones;
  3230. //FIXME put trailing_onex into the context
  3231. if(n == CHROMA_DC_BLOCK_INDEX){
  3232. coeff_token= get_vlc2(gb, chroma_dc_coeff_token_vlc.table, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 1);
  3233. total_coeff= coeff_token>>2;
  3234. }else{
  3235. if(n == LUMA_DC_BLOCK_INDEX){
  3236. total_coeff= pred_non_zero_count(h, 0);
  3237. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  3238. total_coeff= coeff_token>>2;
  3239. }else{
  3240. total_coeff= pred_non_zero_count(h, n);
  3241. coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);
  3242. total_coeff= coeff_token>>2;
  3243. h->non_zero_count_cache[ scan8[n] ]= total_coeff;
  3244. }
  3245. }
  3246. //FIXME set last_non_zero?
  3247. if(total_coeff==0)
  3248. return 0;
  3249. trailing_ones= coeff_token&3;
  3250. tprintf("trailing:%d, total:%d\n", trailing_ones, total_coeff);
  3251. assert(total_coeff<=16);
  3252. for(i=0; i<trailing_ones; i++){
  3253. level[i]= 1 - 2*get_bits1(gb);
  3254. }
  3255. suffix_length= total_coeff > 10 && trailing_ones < 3;
  3256. for(; i<total_coeff; i++){
  3257. const int prefix= get_level_prefix(gb);
  3258. int level_code, mask;
  3259. if(prefix<14){ //FIXME try to build a large unified VLC table for all this
  3260. if(suffix_length)
  3261. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  3262. else
  3263. level_code= (prefix<<suffix_length); //part
  3264. }else if(prefix==14){
  3265. if(suffix_length)
  3266. level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part
  3267. else
  3268. level_code= prefix + get_bits(gb, 4); //part
  3269. }else if(prefix==15){
  3270. level_code= (prefix<<suffix_length) + get_bits(gb, 12); //part
  3271. if(suffix_length==0) level_code+=15; //FIXME doesnt make (much)sense
  3272. }else{
  3273. av_log(h->s.avctx, AV_LOG_ERROR, "prefix too large at %d %d\n", s->mb_x, s->mb_y);
  3274. return -1;
  3275. }
  3276. if(i==trailing_ones && i<3) level_code+= 2; //FIXME split first iteration
  3277. mask= -(level_code&1);
  3278. level[i]= (((2+level_code)>>1) ^ mask) - mask;
  3279. if(suffix_length==0) suffix_length=1; //FIXME split first iteration
  3280. #if 1
  3281. if(ABS(level[i]) > (3<<(suffix_length-1)) && suffix_length<6) suffix_length++;
  3282. #else
  3283. if((2+level_code)>>1) > (3<<(suffix_length-1)) && suffix_length<6) suffix_length++;
  3284. /* ? == prefix > 2 or sth */
  3285. #endif
  3286. tprintf("level: %d suffix_length:%d\n", level[i], suffix_length);
  3287. }
  3288. if(total_coeff == max_coeff)
  3289. zeros_left=0;
  3290. else{
  3291. if(n == CHROMA_DC_BLOCK_INDEX)
  3292. zeros_left= get_vlc2(gb, chroma_dc_total_zeros_vlc[ total_coeff-1 ].table, CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 1);
  3293. else
  3294. zeros_left= get_vlc2(gb, total_zeros_vlc[ total_coeff-1 ].table, TOTAL_ZEROS_VLC_BITS, 1);
  3295. }
  3296. for(i=0; i<total_coeff-1; i++){
  3297. if(zeros_left <=0)
  3298. break;
  3299. else if(zeros_left < 7){
  3300. run[i]= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);
  3301. }else{
  3302. run[i]= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);
  3303. }
  3304. zeros_left -= run[i];
  3305. }
  3306. if(zeros_left<0){
  3307. av_log(h->s.avctx, AV_LOG_ERROR, "negative number of zero coeffs at %d %d\n", s->mb_x, s->mb_y);
  3308. return -1;
  3309. }
  3310. for(; i<total_coeff-1; i++){
  3311. run[i]= 0;
  3312. }
  3313. run[i]= zeros_left;
  3314. coeff_num=-1;
  3315. if(n > 24){
  3316. for(i=total_coeff-1; i>=0; i--){ //FIXME merge into rundecode?
  3317. int j;
  3318. coeff_num += run[i] + 1; //FIXME add 1 earlier ?
  3319. j= scantable[ coeff_num ];
  3320. block[j]= level[i];
  3321. }
  3322. }else{
  3323. for(i=total_coeff-1; i>=0; i--){ //FIXME merge into rundecode?
  3324. int j;
  3325. coeff_num += run[i] + 1; //FIXME add 1 earlier ?
  3326. j= scantable[ coeff_num ];
  3327. block[j]= level[i] * qmul[j];
  3328. // printf("%d %d ", block[j], qmul[j]);
  3329. }
  3330. }
  3331. return 0;
  3332. }
  3333. /**
  3334. * decodes a P_SKIP or B_SKIP macroblock
  3335. */
  3336. static void decode_mb_skip(H264Context *h){
  3337. MpegEncContext * const s = &h->s;
  3338. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  3339. int mb_type;
  3340. memset(h->non_zero_count[mb_xy], 0, 16);
  3341. memset(h->non_zero_count_cache + 8, 0, 8*5); //FIXME ugly, remove pfui
  3342. if( h->slice_type == B_TYPE )
  3343. {
  3344. // just for fill_caches. pred_direct_motion will set the real mb_type
  3345. mb_type= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_SKIP;
  3346. //FIXME mbaff
  3347. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  3348. pred_direct_motion(h, &mb_type);
  3349. if(h->pps.cabac){
  3350. fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  3351. fill_rectangle(h->mvd_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  3352. }
  3353. }
  3354. else
  3355. {
  3356. int mx, my;
  3357. mb_type= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P1L0|MB_TYPE_SKIP;
  3358. if(h->sps.mb_aff && s->mb_skip_run==0 && (s->mb_y&1)==0){
  3359. h->mb_field_decoding_flag= get_bits1(&s->gb);
  3360. }
  3361. if(h->mb_field_decoding_flag)
  3362. mb_type|= MB_TYPE_INTERLACED;
  3363. fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...
  3364. pred_pskip_motion(h, &mx, &my);
  3365. fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);
  3366. fill_rectangle( h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mx,my), 4);
  3367. if(h->pps.cabac)
  3368. fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  3369. }
  3370. write_back_motion(h, mb_type);
  3371. s->current_picture.mb_type[mb_xy]= mb_type|MB_TYPE_SKIP;
  3372. s->current_picture.qscale_table[mb_xy]= s->qscale;
  3373. h->slice_table[ mb_xy ]= h->slice_num;
  3374. h->prev_mb_skiped= 1;
  3375. }
  3376. /**
  3377. * decodes a macroblock
  3378. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  3379. */
  3380. static int decode_mb_cavlc(H264Context *h){
  3381. MpegEncContext * const s = &h->s;
  3382. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  3383. int mb_type, partition_count, cbp;
  3384. s->dsp.clear_blocks(h->mb); //FIXME avoid if allready clear (move after skip handlong?
  3385. tprintf("pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  3386. cbp = 0; /* avoid warning. FIXME: find a solution without slowing
  3387. down the code */
  3388. if(h->slice_type != I_TYPE && h->slice_type != SI_TYPE){
  3389. if(s->mb_skip_run==-1)
  3390. s->mb_skip_run= get_ue_golomb(&s->gb);
  3391. if (s->mb_skip_run--) {
  3392. decode_mb_skip(h);
  3393. return 0;
  3394. }
  3395. }
  3396. if(h->sps.mb_aff /* && !field pic FIXME needed? */){
  3397. if((s->mb_y&1)==0)
  3398. h->mb_field_decoding_flag = get_bits1(&s->gb);
  3399. }else
  3400. h->mb_field_decoding_flag=0; //FIXME som ed note ?!
  3401. h->prev_mb_skiped= 0;
  3402. mb_type= get_ue_golomb(&s->gb);
  3403. if(h->slice_type == B_TYPE){
  3404. if(mb_type < 23){
  3405. partition_count= b_mb_type_info[mb_type].partition_count;
  3406. mb_type= b_mb_type_info[mb_type].type;
  3407. }else{
  3408. mb_type -= 23;
  3409. goto decode_intra_mb;
  3410. }
  3411. }else if(h->slice_type == P_TYPE /*|| h->slice_type == SP_TYPE */){
  3412. if(mb_type < 5){
  3413. partition_count= p_mb_type_info[mb_type].partition_count;
  3414. mb_type= p_mb_type_info[mb_type].type;
  3415. }else{
  3416. mb_type -= 5;
  3417. goto decode_intra_mb;
  3418. }
  3419. }else{
  3420. assert(h->slice_type == I_TYPE);
  3421. decode_intra_mb:
  3422. if(mb_type > 25){
  3423. av_log(h->s.avctx, AV_LOG_ERROR, "mb_type %d in %c slice to large at %d %d\n", mb_type, av_get_pict_type_char(h->slice_type), s->mb_x, s->mb_y);
  3424. return -1;
  3425. }
  3426. partition_count=0;
  3427. cbp= i_mb_type_info[mb_type].cbp;
  3428. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  3429. mb_type= i_mb_type_info[mb_type].type;
  3430. }
  3431. if(h->mb_field_decoding_flag)
  3432. mb_type |= MB_TYPE_INTERLACED;
  3433. s->current_picture.mb_type[mb_xy]= mb_type;
  3434. h->slice_table[ mb_xy ]= h->slice_num;
  3435. if(IS_INTRA_PCM(mb_type)){
  3436. const uint8_t *ptr;
  3437. int x, y;
  3438. // we assume these blocks are very rare so we dont optimize it
  3439. align_get_bits(&s->gb);
  3440. ptr= s->gb.buffer + get_bits_count(&s->gb);
  3441. for(y=0; y<16; y++){
  3442. const int index= 4*(y&3) + 64*(y>>2);
  3443. for(x=0; x<16; x++){
  3444. h->mb[index + (x&3) + 16*(x>>2)]= *(ptr++);
  3445. }
  3446. }
  3447. for(y=0; y<8; y++){
  3448. const int index= 256 + 4*(y&3) + 32*(y>>2);
  3449. for(x=0; x<8; x++){
  3450. h->mb[index + (x&3) + 16*(x>>2)]= *(ptr++);
  3451. }
  3452. }
  3453. for(y=0; y<8; y++){
  3454. const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);
  3455. for(x=0; x<8; x++){
  3456. h->mb[index + (x&3) + 16*(x>>2)]= *(ptr++);
  3457. }
  3458. }
  3459. skip_bits(&s->gb, 384); //FIXME check /fix the bitstream readers
  3460. //FIXME deblock filter, non_zero_count_cache init ...
  3461. memset(h->non_zero_count[mb_xy], 16, 16);
  3462. s->current_picture.qscale_table[mb_xy]= s->qscale;
  3463. return 0;
  3464. }
  3465. fill_caches(h, mb_type, 0);
  3466. //mb_pred
  3467. if(IS_INTRA(mb_type)){
  3468. // init_top_left_availability(h);
  3469. if(IS_INTRA4x4(mb_type)){
  3470. int i;
  3471. // fill_intra4x4_pred_table(h);
  3472. for(i=0; i<16; i++){
  3473. const int mode_coded= !get_bits1(&s->gb);
  3474. const int predicted_mode= pred_intra_mode(h, i);
  3475. int mode;
  3476. if(mode_coded){
  3477. const int rem_mode= get_bits(&s->gb, 3);
  3478. if(rem_mode<predicted_mode)
  3479. mode= rem_mode;
  3480. else
  3481. mode= rem_mode + 1;
  3482. }else{
  3483. mode= predicted_mode;
  3484. }
  3485. h->intra4x4_pred_mode_cache[ scan8[i] ] = mode;
  3486. }
  3487. write_back_intra_pred_mode(h);
  3488. if( check_intra4x4_pred_mode(h) < 0)
  3489. return -1;
  3490. }else{
  3491. h->intra16x16_pred_mode= check_intra_pred_mode(h, h->intra16x16_pred_mode);
  3492. if(h->intra16x16_pred_mode < 0)
  3493. return -1;
  3494. }
  3495. h->chroma_pred_mode= get_ue_golomb(&s->gb);
  3496. h->chroma_pred_mode= check_intra_pred_mode(h, h->chroma_pred_mode);
  3497. if(h->chroma_pred_mode < 0)
  3498. return -1;
  3499. }else if(partition_count==4){
  3500. int i, j, sub_partition_count[4], list, ref[2][4];
  3501. if(h->slice_type == B_TYPE){
  3502. for(i=0; i<4; i++){
  3503. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  3504. if(h->sub_mb_type[i] >=13){
  3505. av_log(h->s.avctx, AV_LOG_ERROR, "B sub_mb_type %d out of range at %d %d\n", h->sub_mb_type[i], s->mb_x, s->mb_y);
  3506. return -1;
  3507. }
  3508. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  3509. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  3510. }
  3511. if( IS_DIRECT(h->sub_mb_type[0]) || IS_DIRECT(h->sub_mb_type[1])
  3512. || IS_DIRECT(h->sub_mb_type[2]) || IS_DIRECT(h->sub_mb_type[3]))
  3513. pred_direct_motion(h, &mb_type);
  3514. }else{
  3515. assert(h->slice_type == P_TYPE || h->slice_type == SP_TYPE); //FIXME SP correct ?
  3516. for(i=0; i<4; i++){
  3517. h->sub_mb_type[i]= get_ue_golomb(&s->gb);
  3518. if(h->sub_mb_type[i] >=4){
  3519. av_log(h->s.avctx, AV_LOG_ERROR, "P sub_mb_type %d out of range at %d %d\n", h->sub_mb_type[i], s->mb_x, s->mb_y);
  3520. return -1;
  3521. }
  3522. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  3523. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  3524. }
  3525. }
  3526. for(list=0; list<2; list++){
  3527. const int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];
  3528. if(ref_count == 0) continue;
  3529. for(i=0; i<4; i++){
  3530. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  3531. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  3532. ref[list][i] = get_te0_golomb(&s->gb, ref_count); //FIXME init to 0 before and skip?
  3533. }else{
  3534. //FIXME
  3535. ref[list][i] = -1;
  3536. }
  3537. }
  3538. }
  3539. for(list=0; list<2; list++){
  3540. const int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];
  3541. if(ref_count == 0) continue;
  3542. for(i=0; i<4; i++){
  3543. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  3544. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ]=
  3545. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  3546. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  3547. const int sub_mb_type= h->sub_mb_type[i];
  3548. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  3549. for(j=0; j<sub_partition_count[i]; j++){
  3550. int mx, my;
  3551. const int index= 4*i + block_width*j;
  3552. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  3553. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mx, &my);
  3554. mx += get_se_golomb(&s->gb);
  3555. my += get_se_golomb(&s->gb);
  3556. tprintf("final mv:%d %d\n", mx, my);
  3557. if(IS_SUB_8X8(sub_mb_type)){
  3558. mv_cache[ 0 ][0]= mv_cache[ 1 ][0]=
  3559. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  3560. mv_cache[ 0 ][1]= mv_cache[ 1 ][1]=
  3561. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  3562. }else if(IS_SUB_8X4(sub_mb_type)){
  3563. mv_cache[ 0 ][0]= mv_cache[ 1 ][0]= mx;
  3564. mv_cache[ 0 ][1]= mv_cache[ 1 ][1]= my;
  3565. }else if(IS_SUB_4X8(sub_mb_type)){
  3566. mv_cache[ 0 ][0]= mv_cache[ 8 ][0]= mx;
  3567. mv_cache[ 0 ][1]= mv_cache[ 8 ][1]= my;
  3568. }else{
  3569. assert(IS_SUB_4X4(sub_mb_type));
  3570. mv_cache[ 0 ][0]= mx;
  3571. mv_cache[ 0 ][1]= my;
  3572. }
  3573. }
  3574. }else{
  3575. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  3576. p[0] = p[1]=
  3577. p[8] = p[9]= 0;
  3578. }
  3579. }
  3580. }
  3581. }else if(IS_DIRECT(mb_type)){
  3582. pred_direct_motion(h, &mb_type);
  3583. s->current_picture.mb_type[mb_xy]= mb_type;
  3584. }else{
  3585. int list, mx, my, i;
  3586. //FIXME we should set ref_idx_l? to 0 if we use that later ...
  3587. if(IS_16X16(mb_type)){
  3588. for(list=0; list<2; list++){
  3589. if(h->ref_count[list]>0){
  3590. if(IS_DIR(mb_type, 0, list)){
  3591. const int val= get_te0_golomb(&s->gb, h->ref_count[list]);
  3592. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, val, 1);
  3593. }
  3594. }
  3595. }
  3596. for(list=0; list<2; list++){
  3597. if(IS_DIR(mb_type, 0, list)){
  3598. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mx, &my);
  3599. mx += get_se_golomb(&s->gb);
  3600. my += get_se_golomb(&s->gb);
  3601. tprintf("final mv:%d %d\n", mx, my);
  3602. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);
  3603. }
  3604. }
  3605. }
  3606. else if(IS_16X8(mb_type)){
  3607. for(list=0; list<2; list++){
  3608. if(h->ref_count[list]>0){
  3609. for(i=0; i<2; i++){
  3610. if(IS_DIR(mb_type, i, list)){
  3611. const int val= get_te0_golomb(&s->gb, h->ref_count[list]);
  3612. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 1);
  3613. }else // needed only for mixed refs (e.g. B_L0_L1_16x8)
  3614. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);
  3615. }
  3616. }
  3617. }
  3618. for(list=0; list<2; list++){
  3619. for(i=0; i<2; i++){
  3620. if(IS_DIR(mb_type, i, list)){
  3621. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mx, &my);
  3622. mx += get_se_golomb(&s->gb);
  3623. my += get_se_golomb(&s->gb);
  3624. tprintf("final mv:%d %d\n", mx, my);
  3625. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);
  3626. }else
  3627. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  3628. }
  3629. }
  3630. }else{
  3631. assert(IS_8X16(mb_type));
  3632. for(list=0; list<2; list++){
  3633. if(h->ref_count[list]>0){
  3634. for(i=0; i<2; i++){
  3635. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  3636. const int val= get_te0_golomb(&s->gb, h->ref_count[list]);
  3637. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 1);
  3638. }else // needed only for mixed refs
  3639. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);
  3640. }
  3641. }
  3642. }
  3643. for(list=0; list<2; list++){
  3644. for(i=0; i<2; i++){
  3645. if(IS_DIR(mb_type, i, list)){
  3646. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mx, &my);
  3647. mx += get_se_golomb(&s->gb);
  3648. my += get_se_golomb(&s->gb);
  3649. tprintf("final mv:%d %d\n", mx, my);
  3650. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);
  3651. }else
  3652. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  3653. }
  3654. }
  3655. }
  3656. }
  3657. if(IS_INTER(mb_type))
  3658. write_back_motion(h, mb_type);
  3659. if(!IS_INTRA16x16(mb_type)){
  3660. cbp= get_ue_golomb(&s->gb);
  3661. if(cbp > 47){
  3662. av_log(h->s.avctx, AV_LOG_ERROR, "cbp too large (%d) at %d %d\n", cbp, s->mb_x, s->mb_y);
  3663. return -1;
  3664. }
  3665. if(IS_INTRA4x4(mb_type))
  3666. cbp= golomb_to_intra4x4_cbp[cbp];
  3667. else
  3668. cbp= golomb_to_inter_cbp[cbp];
  3669. }
  3670. if(cbp || IS_INTRA16x16(mb_type)){
  3671. int i8x8, i4x4, chroma_idx;
  3672. int chroma_qp, dquant;
  3673. GetBitContext *gb= IS_INTRA(mb_type) ? h->intra_gb_ptr : h->inter_gb_ptr;
  3674. const uint8_t *scan, *dc_scan;
  3675. // fill_non_zero_count_cache(h);
  3676. if(IS_INTERLACED(mb_type)){
  3677. scan= field_scan;
  3678. dc_scan= luma_dc_field_scan;
  3679. }else{
  3680. scan= zigzag_scan;
  3681. dc_scan= luma_dc_zigzag_scan;
  3682. }
  3683. dquant= get_se_golomb(&s->gb);
  3684. if( dquant > 25 || dquant < -26 ){
  3685. av_log(h->s.avctx, AV_LOG_ERROR, "dquant out of range (%d) at %d %d\n", dquant, s->mb_x, s->mb_y);
  3686. return -1;
  3687. }
  3688. s->qscale += dquant;
  3689. if(((unsigned)s->qscale) > 51){
  3690. if(s->qscale<0) s->qscale+= 52;
  3691. else s->qscale-= 52;
  3692. }
  3693. h->chroma_qp= chroma_qp= get_chroma_qp(h, s->qscale);
  3694. if(IS_INTRA16x16(mb_type)){
  3695. if( decode_residual(h, h->intra_gb_ptr, h->mb, LUMA_DC_BLOCK_INDEX, dc_scan, s->qscale, 16) < 0){
  3696. return -1; //FIXME continue if partotioned and other retirn -1 too
  3697. }
  3698. assert((cbp&15) == 0 || (cbp&15) == 15);
  3699. if(cbp&15){
  3700. for(i8x8=0; i8x8<4; i8x8++){
  3701. for(i4x4=0; i4x4<4; i4x4++){
  3702. const int index= i4x4 + 4*i8x8;
  3703. if( decode_residual(h, h->intra_gb_ptr, h->mb + 16*index, index, scan + 1, s->qscale, 15) < 0 ){
  3704. return -1;
  3705. }
  3706. }
  3707. }
  3708. }else{
  3709. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  3710. }
  3711. }else{
  3712. for(i8x8=0; i8x8<4; i8x8++){
  3713. if(cbp & (1<<i8x8)){
  3714. for(i4x4=0; i4x4<4; i4x4++){
  3715. const int index= i4x4 + 4*i8x8;
  3716. if( decode_residual(h, gb, h->mb + 16*index, index, scan, s->qscale, 16) <0 ){
  3717. return -1;
  3718. }
  3719. }
  3720. }else{
  3721. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  3722. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  3723. }
  3724. }
  3725. }
  3726. if(cbp&0x30){
  3727. for(chroma_idx=0; chroma_idx<2; chroma_idx++)
  3728. if( decode_residual(h, gb, h->mb + 256 + 16*4*chroma_idx, CHROMA_DC_BLOCK_INDEX, chroma_dc_scan, chroma_qp, 4) < 0){
  3729. return -1;
  3730. }
  3731. }
  3732. if(cbp&0x20){
  3733. for(chroma_idx=0; chroma_idx<2; chroma_idx++){
  3734. for(i4x4=0; i4x4<4; i4x4++){
  3735. const int index= 16 + 4*chroma_idx + i4x4;
  3736. if( decode_residual(h, gb, h->mb + 16*index, index, scan + 1, chroma_qp, 15) < 0){
  3737. return -1;
  3738. }
  3739. }
  3740. }
  3741. }else{
  3742. uint8_t * const nnz= &h->non_zero_count_cache[0];
  3743. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  3744. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  3745. }
  3746. }else{
  3747. uint8_t * const nnz= &h->non_zero_count_cache[0];
  3748. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  3749. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  3750. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  3751. }
  3752. s->current_picture.qscale_table[mb_xy]= s->qscale;
  3753. write_back_non_zero_count(h);
  3754. return 0;
  3755. }
  3756. static int decode_cabac_intra_mb_type(H264Context *h, int ctx_base, int intra_slice) {
  3757. uint8_t *state= &h->cabac_state[ctx_base];
  3758. int mb_type;
  3759. if(intra_slice){
  3760. MpegEncContext * const s = &h->s;
  3761. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  3762. int ctx=0;
  3763. if( s->mb_x > 0 && !IS_INTRA4x4( s->current_picture.mb_type[mb_xy-1] ) )
  3764. ctx++;
  3765. if( s->mb_y > 0 && !IS_INTRA4x4( s->current_picture.mb_type[mb_xy-s->mb_stride] ) )
  3766. ctx++;
  3767. if( get_cabac( &h->cabac, &state[ctx] ) == 0 )
  3768. return 0; /* I4x4 */
  3769. state += 2;
  3770. }else{
  3771. if( get_cabac( &h->cabac, &state[0] ) == 0 )
  3772. return 0; /* I4x4 */
  3773. }
  3774. if( get_cabac_terminate( &h->cabac ) )
  3775. return 25; /* PCM */
  3776. mb_type = 1; /* I16x16 */
  3777. if( get_cabac( &h->cabac, &state[1] ) )
  3778. mb_type += 12; /* cbp_luma != 0 */
  3779. if( get_cabac( &h->cabac, &state[2] ) ) {
  3780. if( get_cabac( &h->cabac, &state[2+intra_slice] ) )
  3781. mb_type += 4 * 2; /* cbp_chroma == 2 */
  3782. else
  3783. mb_type += 4 * 1; /* cbp_chroma == 1 */
  3784. }
  3785. if( get_cabac( &h->cabac, &state[3+intra_slice] ) )
  3786. mb_type += 2;
  3787. if( get_cabac( &h->cabac, &state[3+2*intra_slice] ) )
  3788. mb_type += 1;
  3789. return mb_type;
  3790. }
  3791. static int decode_cabac_mb_type( H264Context *h ) {
  3792. MpegEncContext * const s = &h->s;
  3793. if( h->slice_type == I_TYPE ) {
  3794. return decode_cabac_intra_mb_type(h, 3, 1);
  3795. } else if( h->slice_type == P_TYPE ) {
  3796. if( get_cabac( &h->cabac, &h->cabac_state[14] ) == 0 ) {
  3797. /* P-type */
  3798. if( get_cabac( &h->cabac, &h->cabac_state[15] ) == 0 ) {
  3799. if( get_cabac( &h->cabac, &h->cabac_state[16] ) == 0 )
  3800. return 0; /* P_L0_D16x16; */
  3801. else
  3802. return 3; /* P_8x8; */
  3803. } else {
  3804. if( get_cabac( &h->cabac, &h->cabac_state[17] ) == 0 )
  3805. return 2; /* P_L0_D8x16; */
  3806. else
  3807. return 1; /* P_L0_D16x8; */
  3808. }
  3809. } else {
  3810. return decode_cabac_intra_mb_type(h, 17, 0) + 5;
  3811. }
  3812. } else if( h->slice_type == B_TYPE ) {
  3813. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  3814. int ctx = 0;
  3815. int bits;
  3816. if( s->mb_x > 0 && !IS_SKIP( s->current_picture.mb_type[mb_xy-1] )
  3817. && !IS_DIRECT( s->current_picture.mb_type[mb_xy-1] ) )
  3818. ctx++;
  3819. if( s->mb_y > 0 && !IS_SKIP( s->current_picture.mb_type[mb_xy-s->mb_stride] )
  3820. && !IS_DIRECT( s->current_picture.mb_type[mb_xy-s->mb_stride] ) )
  3821. ctx++;
  3822. if( !get_cabac( &h->cabac, &h->cabac_state[27+ctx] ) )
  3823. return 0; /* B_Direct_16x16 */
  3824. if( !get_cabac( &h->cabac, &h->cabac_state[27+3] ) ) {
  3825. return 1 + get_cabac( &h->cabac, &h->cabac_state[27+5] ); /* B_L[01]_16x16 */
  3826. }
  3827. bits = get_cabac( &h->cabac, &h->cabac_state[27+4] ) << 3;
  3828. bits|= get_cabac( &h->cabac, &h->cabac_state[27+5] ) << 2;
  3829. bits|= get_cabac( &h->cabac, &h->cabac_state[27+5] ) << 1;
  3830. bits|= get_cabac( &h->cabac, &h->cabac_state[27+5] );
  3831. if( bits < 8 )
  3832. return bits + 3; /* B_Bi_16x16 through B_L1_L0_16x8 */
  3833. else if( bits == 13 ) {
  3834. return decode_cabac_intra_mb_type(h, 32, 0) + 23;
  3835. } else if( bits == 14 )
  3836. return 11; /* B_L1_L0_8x16 */
  3837. else if( bits == 15 )
  3838. return 22; /* B_8x8 */
  3839. bits= ( bits<<1 ) | get_cabac( &h->cabac, &h->cabac_state[27+5] );
  3840. return bits - 4; /* B_L0_Bi_* through B_Bi_Bi_* */
  3841. } else {
  3842. /* TODO SI/SP frames? */
  3843. return -1;
  3844. }
  3845. }
  3846. static int decode_cabac_mb_skip( H264Context *h) {
  3847. MpegEncContext * const s = &h->s;
  3848. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  3849. const int mba_xy = mb_xy - 1;
  3850. const int mbb_xy = mb_xy - s->mb_stride;
  3851. int ctx = 0;
  3852. if( s->mb_x > 0 && !IS_SKIP( s->current_picture.mb_type[mba_xy] ) )
  3853. ctx++;
  3854. if( s->mb_y > 0 && !IS_SKIP( s->current_picture.mb_type[mbb_xy] ) )
  3855. ctx++;
  3856. if( h->slice_type == P_TYPE || h->slice_type == SP_TYPE)
  3857. return get_cabac( &h->cabac, &h->cabac_state[11+ctx] );
  3858. else /* B-frame */
  3859. return get_cabac( &h->cabac, &h->cabac_state[24+ctx] );
  3860. }
  3861. static int decode_cabac_mb_intra4x4_pred_mode( H264Context *h, int pred_mode ) {
  3862. int mode = 0;
  3863. if( get_cabac( &h->cabac, &h->cabac_state[68] ) )
  3864. return pred_mode;
  3865. if( get_cabac( &h->cabac, &h->cabac_state[69] ) )
  3866. mode += 1;
  3867. if( get_cabac( &h->cabac, &h->cabac_state[69] ) )
  3868. mode += 2;
  3869. if( get_cabac( &h->cabac, &h->cabac_state[69] ) )
  3870. mode += 4;
  3871. if( mode >= pred_mode )
  3872. return mode + 1;
  3873. else
  3874. return mode;
  3875. }
  3876. static int decode_cabac_mb_chroma_pre_mode( H264Context *h) {
  3877. MpegEncContext * const s = &h->s;
  3878. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  3879. const int mba_xy = mb_xy - 1;
  3880. const int mbb_xy = mb_xy - s->mb_stride;
  3881. int ctx = 0;
  3882. /* No need to test for IS_INTRA4x4 and IS_INTRA16x16, as we set chroma_pred_mode_table to 0 */
  3883. if( s->mb_x > 0 && h->chroma_pred_mode_table[mba_xy] != 0 )
  3884. ctx++;
  3885. if( s->mb_y > 0 && h->chroma_pred_mode_table[mbb_xy] != 0 )
  3886. ctx++;
  3887. if( get_cabac( &h->cabac, &h->cabac_state[64+ctx] ) == 0 )
  3888. return 0;
  3889. if( get_cabac( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  3890. return 1;
  3891. if( get_cabac( &h->cabac, &h->cabac_state[64+3] ) == 0 )
  3892. return 2;
  3893. else
  3894. return 3;
  3895. }
  3896. static const uint8_t block_idx_x[16] = {
  3897. 0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3
  3898. };
  3899. static const uint8_t block_idx_y[16] = {
  3900. 0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3
  3901. };
  3902. static const uint8_t block_idx_xy[4][4] = {
  3903. { 0, 2, 8, 10},
  3904. { 1, 3, 9, 11},
  3905. { 4, 6, 12, 14},
  3906. { 5, 7, 13, 15}
  3907. };
  3908. static int decode_cabac_mb_cbp_luma( H264Context *h) {
  3909. MpegEncContext * const s = &h->s;
  3910. const int mb_xy = s->mb_x + s->mb_y*s->mb_stride;
  3911. int cbp = 0;
  3912. int i8x8;
  3913. h->cbp_table[mb_xy] = 0; /* FIXME aaahahahah beurk */
  3914. for( i8x8 = 0; i8x8 < 4; i8x8++ ) {
  3915. int mba_xy = -1;
  3916. int mbb_xy = -1;
  3917. int x, y;
  3918. int ctx = 0;
  3919. x = block_idx_x[4*i8x8];
  3920. y = block_idx_y[4*i8x8];
  3921. if( x > 0 )
  3922. mba_xy = mb_xy;
  3923. else if( s->mb_x > 0 )
  3924. mba_xy = mb_xy - 1;
  3925. if( y > 0 )
  3926. mbb_xy = mb_xy;
  3927. else if( s->mb_y > 0 )
  3928. mbb_xy = mb_xy - s->mb_stride;
  3929. /* No need to test for skip as we put 0 for skip block */
  3930. if( mba_xy >= 0 ) {
  3931. int i8x8a = block_idx_xy[(x-1)&0x03][y]/4;
  3932. if( ((h->cbp_table[mba_xy] >> i8x8a)&0x01) == 0 )
  3933. ctx++;
  3934. }
  3935. if( mbb_xy >= 0 ) {
  3936. int i8x8b = block_idx_xy[x][(y-1)&0x03]/4;
  3937. if( ((h->cbp_table[mbb_xy] >> i8x8b)&0x01) == 0 )
  3938. ctx += 2;
  3939. }
  3940. if( get_cabac( &h->cabac, &h->cabac_state[73 + ctx] ) ) {
  3941. cbp |= 1 << i8x8;
  3942. h->cbp_table[mb_xy] = cbp; /* FIXME aaahahahah beurk */
  3943. }
  3944. }
  3945. return cbp;
  3946. }
  3947. static int decode_cabac_mb_cbp_chroma( H264Context *h) {
  3948. int ctx;
  3949. int cbp_a, cbp_b;
  3950. cbp_a = (h->left_cbp>>4)&0x03;
  3951. cbp_b = (h-> top_cbp>>4)&0x03;
  3952. ctx = 0;
  3953. if( cbp_a > 0 ) ctx++;
  3954. if( cbp_b > 0 ) ctx += 2;
  3955. if( get_cabac( &h->cabac, &h->cabac_state[77 + ctx] ) == 0 )
  3956. return 0;
  3957. ctx = 4;
  3958. if( cbp_a == 2 ) ctx++;
  3959. if( cbp_b == 2 ) ctx += 2;
  3960. return 1 + get_cabac( &h->cabac, &h->cabac_state[77 + ctx] );
  3961. }
  3962. static int decode_cabac_mb_dqp( H264Context *h) {
  3963. MpegEncContext * const s = &h->s;
  3964. int mbn_xy;
  3965. int ctx = 0;
  3966. int val = 0;
  3967. if( s->mb_x > 0 )
  3968. mbn_xy = s->mb_x + s->mb_y*s->mb_stride - 1;
  3969. else
  3970. mbn_xy = s->mb_width - 1 + (s->mb_y-1)*s->mb_stride;
  3971. if( mbn_xy >= 0 && h->last_qscale_diff != 0 && ( IS_INTRA16x16(s->current_picture.mb_type[mbn_xy] ) || (h->cbp_table[mbn_xy]&0x3f) ) )
  3972. ctx++;
  3973. while( get_cabac( &h->cabac, &h->cabac_state[60 + ctx] ) ) {
  3974. if( ctx < 2 )
  3975. ctx = 2;
  3976. else
  3977. ctx = 3;
  3978. val++;
  3979. }
  3980. if( val&0x01 )
  3981. return (val + 1)/2;
  3982. else
  3983. return -(val + 1)/2;
  3984. }
  3985. static int decode_cabac_p_mb_sub_type( H264Context *h ) {
  3986. if( get_cabac( &h->cabac, &h->cabac_state[21] ) )
  3987. return 0; /* 8x8 */
  3988. if( !get_cabac( &h->cabac, &h->cabac_state[22] ) )
  3989. return 1; /* 8x4 */
  3990. if( get_cabac( &h->cabac, &h->cabac_state[23] ) )
  3991. return 2; /* 4x8 */
  3992. return 3; /* 4x4 */
  3993. }
  3994. static int decode_cabac_b_mb_sub_type( H264Context *h ) {
  3995. int type;
  3996. if( !get_cabac( &h->cabac, &h->cabac_state[36] ) )
  3997. return 0; /* B_Direct_8x8 */
  3998. if( !get_cabac( &h->cabac, &h->cabac_state[37] ) )
  3999. return 1 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L0_8x8, B_L1_8x8 */
  4000. type = 3;
  4001. if( get_cabac( &h->cabac, &h->cabac_state[38] ) ) {
  4002. if( get_cabac( &h->cabac, &h->cabac_state[39] ) )
  4003. return 11 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L1_4x4, B_Bi_4x4 */
  4004. type += 4;
  4005. }
  4006. type += 2*get_cabac( &h->cabac, &h->cabac_state[39] );
  4007. type += get_cabac( &h->cabac, &h->cabac_state[39] );
  4008. return type;
  4009. }
  4010. static int decode_cabac_mb_ref( H264Context *h, int list, int n ) {
  4011. int refa = h->ref_cache[list][scan8[n] - 1];
  4012. int refb = h->ref_cache[list][scan8[n] - 8];
  4013. int ref = 0;
  4014. int ctx = 0;
  4015. if( h->slice_type == B_TYPE) {
  4016. if( refa > 0 && !h->direct_cache[scan8[n] - 1] )
  4017. ctx++;
  4018. if( refb > 0 && !h->direct_cache[scan8[n] - 8] )
  4019. ctx += 2;
  4020. } else {
  4021. if( refa > 0 )
  4022. ctx++;
  4023. if( refb > 0 )
  4024. ctx += 2;
  4025. }
  4026. while( get_cabac( &h->cabac, &h->cabac_state[54+ctx] ) ) {
  4027. ref++;
  4028. if( ctx < 4 )
  4029. ctx = 4;
  4030. else
  4031. ctx = 5;
  4032. }
  4033. return ref;
  4034. }
  4035. static int decode_cabac_mb_mvd( H264Context *h, int list, int n, int l ) {
  4036. int amvd = abs( h->mvd_cache[list][scan8[n] - 1][l] ) +
  4037. abs( h->mvd_cache[list][scan8[n] - 8][l] );
  4038. int ctxbase = (l == 0) ? 40 : 47;
  4039. int ctx, mvd;
  4040. if( amvd < 3 )
  4041. ctx = 0;
  4042. else if( amvd > 32 )
  4043. ctx = 2;
  4044. else
  4045. ctx = 1;
  4046. if(!get_cabac(&h->cabac, &h->cabac_state[ctxbase+ctx]))
  4047. return 0;
  4048. mvd= 1;
  4049. ctx= 3;
  4050. while( mvd < 9 && get_cabac( &h->cabac, &h->cabac_state[ctxbase+ctx] ) ) {
  4051. mvd++;
  4052. if( ctx < 6 )
  4053. ctx++;
  4054. }
  4055. if( mvd >= 9 ) {
  4056. int k = 3;
  4057. while( get_cabac_bypass( &h->cabac ) ) {
  4058. mvd += 1 << k;
  4059. k++;
  4060. }
  4061. while( k-- ) {
  4062. if( get_cabac_bypass( &h->cabac ) )
  4063. mvd += 1 << k;
  4064. }
  4065. }
  4066. if( get_cabac_bypass( &h->cabac ) ) return -mvd;
  4067. else return mvd;
  4068. }
  4069. static int inline get_cabac_cbf_ctx( H264Context *h, int cat, int idx ) {
  4070. int nza, nzb;
  4071. int ctx = 0;
  4072. if( cat == 0 ) {
  4073. nza = h->left_cbp&0x100;
  4074. nzb = h-> top_cbp&0x100;
  4075. } else if( cat == 1 || cat == 2 ) {
  4076. nza = h->non_zero_count_cache[scan8[idx] - 1];
  4077. nzb = h->non_zero_count_cache[scan8[idx] - 8];
  4078. } else if( cat == 3 ) {
  4079. nza = (h->left_cbp>>(6+idx))&0x01;
  4080. nzb = (h-> top_cbp>>(6+idx))&0x01;
  4081. } else {
  4082. assert(cat == 4);
  4083. nza = h->non_zero_count_cache[scan8[16+idx] - 1];
  4084. nzb = h->non_zero_count_cache[scan8[16+idx] - 8];
  4085. }
  4086. if( nza > 0 )
  4087. ctx++;
  4088. if( nzb > 0 )
  4089. ctx += 2;
  4090. return ctx + 4 * cat;
  4091. }
  4092. static int inline decode_cabac_residual( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, int qp, int max_coeff) {
  4093. const int mb_xy = h->s.mb_x + h->s.mb_y*h->s.mb_stride;
  4094. const uint16_t *qmul= dequant_coeff[qp];
  4095. static const int significant_coeff_flag_offset[5] = { 0, 15, 29, 44, 47 };
  4096. static const int coeff_abs_level_m1_offset[5] = {227+ 0, 227+10, 227+20, 227+30, 227+39 };
  4097. int index[16];
  4098. int i, last;
  4099. int coeff_count = 0;
  4100. int abslevel1 = 1;
  4101. int abslevelgt1 = 0;
  4102. /* cat: 0-> DC 16x16 n = 0
  4103. * 1-> AC 16x16 n = luma4x4idx
  4104. * 2-> Luma4x4 n = luma4x4idx
  4105. * 3-> DC Chroma n = iCbCr
  4106. * 4-> AC Chroma n = 4 * iCbCr + chroma4x4idx
  4107. */
  4108. /* read coded block flag */
  4109. if( get_cabac( &h->cabac, &h->cabac_state[85 + get_cabac_cbf_ctx( h, cat, n ) ] ) == 0 ) {
  4110. if( cat == 1 || cat == 2 )
  4111. h->non_zero_count_cache[scan8[n]] = 0;
  4112. else if( cat == 4 )
  4113. h->non_zero_count_cache[scan8[16+n]] = 0;
  4114. return 0;
  4115. }
  4116. for(last= 0; last < max_coeff - 1; last++) {
  4117. if( get_cabac( &h->cabac, &h->cabac_state[105+significant_coeff_flag_offset[cat]+last] )) {
  4118. index[coeff_count++] = last;
  4119. if( get_cabac( &h->cabac, &h->cabac_state[166+significant_coeff_flag_offset[cat]+last] ) ) {
  4120. last= max_coeff;
  4121. break;
  4122. }
  4123. }
  4124. }
  4125. if( last == max_coeff -1 ) {
  4126. index[coeff_count++] = last;
  4127. }
  4128. assert(coeff_count > 0);
  4129. if( cat == 0 )
  4130. h->cbp_table[mb_xy] |= 0x100;
  4131. else if( cat == 1 || cat == 2 )
  4132. h->non_zero_count_cache[scan8[n]] = coeff_count;
  4133. else if( cat == 3 )
  4134. h->cbp_table[mb_xy] |= 0x40 << n;
  4135. else {
  4136. assert( cat == 4 );
  4137. h->non_zero_count_cache[scan8[16+n]] = coeff_count;
  4138. }
  4139. for( i = coeff_count - 1; i >= 0; i-- ) {
  4140. int ctx = (abslevelgt1 != 0 ? 0 : FFMIN( 4, abslevel1 )) + coeff_abs_level_m1_offset[cat];
  4141. int j= scantable[index[i]];
  4142. if( get_cabac( &h->cabac, &h->cabac_state[ctx] ) == 0 ) {
  4143. if( cat == 0 || cat == 3 ) {
  4144. if( get_cabac_bypass( &h->cabac ) ) block[j] = -1;
  4145. else block[j] = 1;
  4146. }else{
  4147. if( get_cabac_bypass( &h->cabac ) ) block[j] = -qmul[j];
  4148. else block[j] = qmul[j];
  4149. }
  4150. abslevel1++;
  4151. } else {
  4152. int coeff_abs = 2;
  4153. ctx = 5 + FFMIN( 4, abslevelgt1 ) + coeff_abs_level_m1_offset[cat];
  4154. while( coeff_abs < 15 && get_cabac( &h->cabac, &h->cabac_state[ctx] ) ) {
  4155. coeff_abs++;
  4156. }
  4157. if( coeff_abs >= 15 ) {
  4158. int j = 0;
  4159. while( get_cabac_bypass( &h->cabac ) ) {
  4160. coeff_abs += 1 << j;
  4161. j++;
  4162. }
  4163. while( j-- ) {
  4164. if( get_cabac_bypass( &h->cabac ) )
  4165. coeff_abs += 1 << j ;
  4166. }
  4167. }
  4168. if( cat == 0 || cat == 3 ) {
  4169. if( get_cabac_bypass( &h->cabac ) ) block[j] = -coeff_abs;
  4170. else block[j] = coeff_abs;
  4171. }else{
  4172. if( get_cabac_bypass( &h->cabac ) ) block[j] = -coeff_abs * qmul[j];
  4173. else block[j] = coeff_abs * qmul[j];
  4174. }
  4175. abslevelgt1++;
  4176. }
  4177. }
  4178. return 0;
  4179. }
  4180. /**
  4181. * decodes a macroblock
  4182. * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed
  4183. */
  4184. static int decode_mb_cabac(H264Context *h) {
  4185. MpegEncContext * const s = &h->s;
  4186. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  4187. int mb_type, partition_count, cbp = 0;
  4188. s->dsp.clear_blocks(h->mb); //FIXME avoid if allready clear (move after skip handlong?)
  4189. if( h->sps.mb_aff ) {
  4190. av_log( h->s.avctx, AV_LOG_ERROR, "Fields not supported with CABAC\n" );
  4191. return -1;
  4192. }
  4193. tprintf("pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);
  4194. if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE ) {
  4195. /* read skip flags */
  4196. if( decode_cabac_mb_skip( h ) ) {
  4197. decode_mb_skip(h);
  4198. h->cbp_table[mb_xy] = 0;
  4199. h->chroma_pred_mode_table[mb_xy] = 0;
  4200. h->last_qscale_diff = 0;
  4201. return 0;
  4202. }
  4203. }
  4204. h->prev_mb_skiped = 0;
  4205. if( ( mb_type = decode_cabac_mb_type( h ) ) < 0 ) {
  4206. av_log( h->s.avctx, AV_LOG_ERROR, "decode_cabac_mb_type failed\n" );
  4207. return -1;
  4208. }
  4209. if( h->slice_type == B_TYPE ) {
  4210. if( mb_type < 23 ){
  4211. partition_count= b_mb_type_info[mb_type].partition_count;
  4212. mb_type= b_mb_type_info[mb_type].type;
  4213. }else{
  4214. mb_type -= 23;
  4215. goto decode_intra_mb;
  4216. }
  4217. } else if( h->slice_type == P_TYPE ) {
  4218. if( mb_type < 5) {
  4219. partition_count= p_mb_type_info[mb_type].partition_count;
  4220. mb_type= p_mb_type_info[mb_type].type;
  4221. } else {
  4222. mb_type -= 5;
  4223. goto decode_intra_mb;
  4224. }
  4225. } else {
  4226. assert(h->slice_type == I_TYPE);
  4227. decode_intra_mb:
  4228. partition_count = 0;
  4229. cbp= i_mb_type_info[mb_type].cbp;
  4230. h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;
  4231. mb_type= i_mb_type_info[mb_type].type;
  4232. }
  4233. #if 0
  4234. if(h->mb_field_decoding_flag)
  4235. mb_type |= MB_TYPE_INTERLACED;
  4236. #endif
  4237. s->current_picture.mb_type[mb_xy]= mb_type;
  4238. h->slice_table[ mb_xy ]= h->slice_num;
  4239. if(IS_INTRA_PCM(mb_type)) {
  4240. /* TODO */
  4241. assert(0);
  4242. h->cbp_table[mb_xy] = 0xf +4*2; //FIXME ?!
  4243. h->cbp_table[mb_xy] |= 0x1C0;
  4244. h->chroma_pred_mode_table[mb_xy] = 0;
  4245. s->current_picture.qscale_table[mb_xy]= s->qscale;
  4246. return -1;
  4247. }
  4248. fill_caches(h, mb_type, 0);
  4249. if( IS_INTRA( mb_type ) ) {
  4250. if( IS_INTRA4x4( mb_type ) ) {
  4251. int i;
  4252. for( i = 0; i < 16; i++ ) {
  4253. int pred = pred_intra_mode( h, i );
  4254. h->intra4x4_pred_mode_cache[ scan8[i] ] = decode_cabac_mb_intra4x4_pred_mode( h, pred );
  4255. //av_log( s->avctx, AV_LOG_ERROR, "i4x4 pred=%d mode=%d\n", pred, h->intra4x4_pred_mode_cache[ scan8[i] ] );
  4256. }
  4257. write_back_intra_pred_mode(h);
  4258. if( check_intra4x4_pred_mode(h) < 0 ) return -1;
  4259. } else {
  4260. h->intra16x16_pred_mode= check_intra_pred_mode( h, h->intra16x16_pred_mode );
  4261. if( h->intra16x16_pred_mode < 0 ) return -1;
  4262. }
  4263. h->chroma_pred_mode_table[mb_xy] =
  4264. h->chroma_pred_mode = decode_cabac_mb_chroma_pre_mode( h );
  4265. h->chroma_pred_mode= check_intra_pred_mode( h, h->chroma_pred_mode );
  4266. if( h->chroma_pred_mode < 0 ) return -1;
  4267. } else if( partition_count == 4 ) {
  4268. int i, j, sub_partition_count[4], list, ref[2][4];
  4269. if( h->slice_type == B_TYPE ) {
  4270. for( i = 0; i < 4; i++ ) {
  4271. h->sub_mb_type[i] = decode_cabac_b_mb_sub_type( h );
  4272. sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4273. h->sub_mb_type[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4274. }
  4275. if( IS_DIRECT(h->sub_mb_type[0]) || IS_DIRECT(h->sub_mb_type[1])
  4276. || IS_DIRECT(h->sub_mb_type[2]) || IS_DIRECT(h->sub_mb_type[3])) {
  4277. pred_direct_motion(h, &mb_type);
  4278. if( h->ref_count[0] > 1 || h->ref_count[1] > 1 ) {
  4279. for( i = 0; i < 4; i++ )
  4280. if( IS_DIRECT(h->sub_mb_type[i]) )
  4281. fill_rectangle( &h->direct_cache[scan8[4*i]], 2, 2, 8, 1, 1 );
  4282. }
  4283. }
  4284. } else {
  4285. for( i = 0; i < 4; i++ ) {
  4286. h->sub_mb_type[i] = decode_cabac_p_mb_sub_type( h );
  4287. sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;
  4288. h->sub_mb_type[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].type;
  4289. }
  4290. }
  4291. for( list = 0; list < 2; list++ ) {
  4292. if( h->ref_count[list] > 0 ) {
  4293. for( i = 0; i < 4; i++ ) {
  4294. if(IS_DIRECT(h->sub_mb_type[i])) continue;
  4295. if(IS_DIR(h->sub_mb_type[i], 0, list)){
  4296. if( h->ref_count[list] > 1 )
  4297. ref[list][i] = decode_cabac_mb_ref( h, list, 4*i );
  4298. else
  4299. ref[list][i] = 0;
  4300. } else {
  4301. ref[list][i] = -1;
  4302. }
  4303. h->ref_cache[list][ scan8[4*i]+1 ]=
  4304. h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];
  4305. }
  4306. }
  4307. }
  4308. for(list=0; list<2; list++){
  4309. for(i=0; i<4; i++){
  4310. if(IS_DIRECT(h->sub_mb_type[i])){
  4311. fill_rectangle(h->mvd_cache[list][scan8[4*i]], 2, 2, 8, 0, 4);
  4312. continue;
  4313. }
  4314. h->ref_cache[list][ scan8[4*i] ]=h->ref_cache[list][ scan8[4*i]+1 ];
  4315. if(IS_DIR(h->sub_mb_type[i], 0, list) && !IS_DIRECT(h->sub_mb_type[i])){
  4316. const int sub_mb_type= h->sub_mb_type[i];
  4317. const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;
  4318. for(j=0; j<sub_partition_count[i]; j++){
  4319. int mpx, mpy;
  4320. int mx, my;
  4321. const int index= 4*i + block_width*j;
  4322. int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];
  4323. int16_t (* mvd_cache)[2]= &h->mvd_cache[list][ scan8[index] ];
  4324. pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mpx, &mpy);
  4325. mx = mpx + decode_cabac_mb_mvd( h, list, index, 0 );
  4326. my = mpy + decode_cabac_mb_mvd( h, list, index, 1 );
  4327. tprintf("final mv:%d %d\n", mx, my);
  4328. if(IS_SUB_8X8(sub_mb_type)){
  4329. mv_cache[ 0 ][0]= mv_cache[ 1 ][0]=
  4330. mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;
  4331. mv_cache[ 0 ][1]= mv_cache[ 1 ][1]=
  4332. mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;
  4333. mvd_cache[ 0 ][0]= mvd_cache[ 1 ][0]=
  4334. mvd_cache[ 8 ][0]= mvd_cache[ 9 ][0]= mx - mpx;
  4335. mvd_cache[ 0 ][1]= mvd_cache[ 1 ][1]=
  4336. mvd_cache[ 8 ][1]= mvd_cache[ 9 ][1]= my - mpy;
  4337. }else if(IS_SUB_8X4(sub_mb_type)){
  4338. mv_cache[ 0 ][0]= mv_cache[ 1 ][0]= mx;
  4339. mv_cache[ 0 ][1]= mv_cache[ 1 ][1]= my;
  4340. mvd_cache[ 0 ][0]= mvd_cache[ 1 ][0]= mx- mpx;
  4341. mvd_cache[ 0 ][1]= mvd_cache[ 1 ][1]= my - mpy;
  4342. }else if(IS_SUB_4X8(sub_mb_type)){
  4343. mv_cache[ 0 ][0]= mv_cache[ 8 ][0]= mx;
  4344. mv_cache[ 0 ][1]= mv_cache[ 8 ][1]= my;
  4345. mvd_cache[ 0 ][0]= mvd_cache[ 8 ][0]= mx - mpx;
  4346. mvd_cache[ 0 ][1]= mvd_cache[ 8 ][1]= my - mpy;
  4347. }else{
  4348. assert(IS_SUB_4X4(sub_mb_type));
  4349. mv_cache[ 0 ][0]= mx;
  4350. mv_cache[ 0 ][1]= my;
  4351. mvd_cache[ 0 ][0]= mx - mpx;
  4352. mvd_cache[ 0 ][1]= my - mpy;
  4353. }
  4354. }
  4355. }else{
  4356. uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];
  4357. uint32_t *pd= (uint32_t *)&h->mvd_cache[list][ scan8[4*i] ][0];
  4358. p[0] = p[1] = p[8] = p[9] = 0;
  4359. pd[0]= pd[1]= pd[8]= pd[9]= 0;
  4360. }
  4361. }
  4362. }
  4363. } else if( IS_DIRECT(mb_type) ) {
  4364. pred_direct_motion(h, &mb_type);
  4365. s->current_picture.mb_type[mb_xy]= mb_type;
  4366. fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);
  4367. fill_rectangle(h->mvd_cache[1][scan8[0]], 4, 4, 8, 0, 4);
  4368. } else {
  4369. int list, mx, my, i, mpx, mpy;
  4370. if(IS_16X16(mb_type)){
  4371. for(list=0; list<2; list++){
  4372. if(IS_DIR(mb_type, 0, list)){
  4373. if(h->ref_count[list] > 0 ){
  4374. const int ref = h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 0 ) : 0;
  4375. fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, ref, 1);
  4376. }
  4377. }
  4378. }
  4379. for(list=0; list<2; list++){
  4380. if(IS_DIR(mb_type, 0, list)){
  4381. pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mpx, &mpy);
  4382. mx = mpx + decode_cabac_mb_mvd( h, list, 0, 0 );
  4383. my = mpy + decode_cabac_mb_mvd( h, list, 0, 1 );
  4384. tprintf("final mv:%d %d\n", mx, my);
  4385. fill_rectangle(h->mvd_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  4386. fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);
  4387. }
  4388. }
  4389. }
  4390. else if(IS_16X8(mb_type)){
  4391. for(list=0; list<2; list++){
  4392. if(h->ref_count[list]>0){
  4393. for(i=0; i<2; i++){
  4394. if(IS_DIR(mb_type, i, list)){
  4395. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 8*i ) : 0;
  4396. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, ref, 1);
  4397. }else
  4398. fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);
  4399. }
  4400. }
  4401. }
  4402. for(list=0; list<2; list++){
  4403. for(i=0; i<2; i++){
  4404. if(IS_DIR(mb_type, i, list)){
  4405. pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mpx, &mpy);
  4406. mx = mpx + decode_cabac_mb_mvd( h, list, 8*i, 0 );
  4407. my = mpy + decode_cabac_mb_mvd( h, list, 8*i, 1 );
  4408. tprintf("final mv:%d %d\n", mx, my);
  4409. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx-mpx,my-mpy), 4);
  4410. fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);
  4411. }else{ // needed only for mixed refs
  4412. fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  4413. fill_rectangle(h-> mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);
  4414. }
  4415. }
  4416. }
  4417. }else{
  4418. assert(IS_8X16(mb_type));
  4419. for(list=0; list<2; list++){
  4420. if(h->ref_count[list]>0){
  4421. for(i=0; i<2; i++){
  4422. if(IS_DIR(mb_type, i, list)){ //FIXME optimize
  4423. const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 4*i ) : 0;
  4424. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, ref, 1);
  4425. }else
  4426. fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);
  4427. }
  4428. }
  4429. }
  4430. for(list=0; list<2; list++){
  4431. for(i=0; i<2; i++){
  4432. if(IS_DIR(mb_type, i, list)){
  4433. pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mpx, &mpy);
  4434. mx = mpx + decode_cabac_mb_mvd( h, list, 4*i, 0 );
  4435. my = mpy + decode_cabac_mb_mvd( h, list, 4*i, 1 );
  4436. tprintf("final mv:%d %d\n", mx, my);
  4437. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx-mpx,my-mpy), 4);
  4438. fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);
  4439. }else{ // needed only for mixed refs
  4440. fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  4441. fill_rectangle(h-> mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);
  4442. }
  4443. }
  4444. }
  4445. }
  4446. }
  4447. if( IS_INTER( mb_type ) ) {
  4448. h->chroma_pred_mode_table[mb_xy] = 0;
  4449. write_back_motion( h, mb_type );
  4450. }
  4451. if( !IS_INTRA16x16( mb_type ) ) {
  4452. cbp = decode_cabac_mb_cbp_luma( h );
  4453. cbp |= decode_cabac_mb_cbp_chroma( h ) << 4;
  4454. }
  4455. h->cbp_table[mb_xy] = cbp;
  4456. if( cbp || IS_INTRA16x16( mb_type ) ) {
  4457. const uint8_t *scan, *dc_scan;
  4458. int dqp;
  4459. if(IS_INTERLACED(mb_type)){
  4460. scan= field_scan;
  4461. dc_scan= luma_dc_field_scan;
  4462. }else{
  4463. scan= zigzag_scan;
  4464. dc_scan= luma_dc_zigzag_scan;
  4465. }
  4466. h->last_qscale_diff = dqp = decode_cabac_mb_dqp( h );
  4467. s->qscale += dqp;
  4468. if(((unsigned)s->qscale) > 51){
  4469. if(s->qscale<0) s->qscale+= 52;
  4470. else s->qscale-= 52;
  4471. }
  4472. h->chroma_qp = get_chroma_qp(h, s->qscale);
  4473. if( IS_INTRA16x16( mb_type ) ) {
  4474. int i;
  4475. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 DC\n" );
  4476. if( decode_cabac_residual( h, h->mb, 0, 0, dc_scan, s->qscale, 16) < 0)
  4477. return -1;
  4478. if( cbp&15 ) {
  4479. for( i = 0; i < 16; i++ ) {
  4480. //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 AC:%d\n", i );
  4481. if( decode_cabac_residual(h, h->mb + 16*i, 1, i, scan + 1, s->qscale, 15) < 0 )
  4482. return -1;
  4483. }
  4484. } else {
  4485. fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);
  4486. }
  4487. } else {
  4488. int i8x8, i4x4;
  4489. for( i8x8 = 0; i8x8 < 4; i8x8++ ) {
  4490. if( cbp & (1<<i8x8) ) {
  4491. for( i4x4 = 0; i4x4 < 4; i4x4++ ) {
  4492. const int index = 4*i8x8 + i4x4;
  4493. //av_log( s->avctx, AV_LOG_ERROR, "Luma4x4: %d\n", index );
  4494. if( decode_cabac_residual(h, h->mb + 16*index, 2, index, scan, s->qscale, 16) < 0 )
  4495. return -1;
  4496. }
  4497. } else {
  4498. uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];
  4499. nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;
  4500. }
  4501. }
  4502. }
  4503. if( cbp&0x30 ){
  4504. int c;
  4505. for( c = 0; c < 2; c++ ) {
  4506. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-DC\n",c );
  4507. if( decode_cabac_residual(h, h->mb + 256 + 16*4*c, 3, c, chroma_dc_scan, h->chroma_qp, 4) < 0)
  4508. return -1;
  4509. }
  4510. }
  4511. if( cbp&0x20 ) {
  4512. int c, i;
  4513. for( c = 0; c < 2; c++ ) {
  4514. for( i = 0; i < 4; i++ ) {
  4515. const int index = 16 + 4 * c + i;
  4516. //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-AC %d\n",c, index - 16 );
  4517. if( decode_cabac_residual(h, h->mb + 16*index, 4, index - 16, scan + 1, h->chroma_qp, 15) < 0)
  4518. return -1;
  4519. }
  4520. }
  4521. } else {
  4522. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4523. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4524. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4525. }
  4526. } else {
  4527. uint8_t * const nnz= &h->non_zero_count_cache[0];
  4528. fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);
  4529. nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =
  4530. nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;
  4531. }
  4532. s->current_picture.qscale_table[mb_xy]= s->qscale;
  4533. write_back_non_zero_count(h);
  4534. return 0;
  4535. }
  4536. static void filter_mb_edgev( H264Context *h, uint8_t *pix, int stride, int bS[4], int qp ) {
  4537. int i, d;
  4538. const int index_a = clip( qp + h->slice_alpha_c0_offset, 0, 51 );
  4539. const int alpha = alpha_table[index_a];
  4540. const int beta = beta_table[clip( qp + h->slice_beta_offset, 0, 51 )];
  4541. for( i = 0; i < 4; i++ ) {
  4542. if( bS[i] == 0 ) {
  4543. pix += 4 * stride;
  4544. continue;
  4545. }
  4546. if( bS[i] < 4 ) {
  4547. const int tc0 = tc0_table[index_a][bS[i] - 1];
  4548. /* 4px edge length */
  4549. for( d = 0; d < 4; d++ ) {
  4550. const int p0 = pix[-1];
  4551. const int p1 = pix[-2];
  4552. const int p2 = pix[-3];
  4553. const int q0 = pix[0];
  4554. const int q1 = pix[1];
  4555. const int q2 = pix[2];
  4556. if( ABS( p0 - q0 ) < alpha &&
  4557. ABS( p1 - p0 ) < beta &&
  4558. ABS( q1 - q0 ) < beta ) {
  4559. int tc = tc0;
  4560. int i_delta;
  4561. if( ABS( p2 - p0 ) < beta ) {
  4562. pix[-2] = p1 + clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );
  4563. tc++;
  4564. }
  4565. if( ABS( q2 - q0 ) < beta ) {
  4566. pix[1] = q1 + clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );
  4567. tc++;
  4568. }
  4569. i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  4570. pix[-1] = clip_uint8( p0 + i_delta ); /* p0' */
  4571. pix[0] = clip_uint8( q0 - i_delta ); /* q0' */
  4572. }
  4573. pix += stride;
  4574. }
  4575. }else{
  4576. /* 4px edge length */
  4577. for( d = 0; d < 4; d++ ) {
  4578. const int p0 = pix[-1];
  4579. const int p1 = pix[-2];
  4580. const int p2 = pix[-3];
  4581. const int q0 = pix[0];
  4582. const int q1 = pix[1];
  4583. const int q2 = pix[2];
  4584. if( ABS( p0 - q0 ) < alpha &&
  4585. ABS( p1 - p0 ) < beta &&
  4586. ABS( q1 - q0 ) < beta ) {
  4587. if(ABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  4588. if( ABS( p2 - p0 ) < beta)
  4589. {
  4590. const int p3 = pix[-4];
  4591. /* p0', p1', p2' */
  4592. pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  4593. pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  4594. pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  4595. } else {
  4596. /* p0' */
  4597. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  4598. }
  4599. if( ABS( q2 - q0 ) < beta)
  4600. {
  4601. const int q3 = pix[3];
  4602. /* q0', q1', q2' */
  4603. pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  4604. pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  4605. pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  4606. } else {
  4607. /* q0' */
  4608. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  4609. }
  4610. }else{
  4611. /* p0', q0' */
  4612. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  4613. pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  4614. }
  4615. }
  4616. pix += stride;
  4617. }
  4618. }
  4619. }
  4620. }
  4621. static void filter_mb_edgecv( H264Context *h, uint8_t *pix, int stride, int bS[4], int qp ) {
  4622. int i, d;
  4623. const int index_a = clip( qp + h->slice_alpha_c0_offset, 0, 51 );
  4624. const int alpha = alpha_table[index_a];
  4625. const int beta = beta_table[clip( qp + h->slice_beta_offset, 0, 51 )];
  4626. for( i = 0; i < 4; i++ ) {
  4627. if( bS[i] == 0 ) {
  4628. pix += 2 * stride;
  4629. continue;
  4630. }
  4631. if( bS[i] < 4 ) {
  4632. const int tc = tc0_table[index_a][bS[i] - 1] + 1;
  4633. /* 2px edge length (because we use same bS than the one for luma) */
  4634. for( d = 0; d < 2; d++ ){
  4635. const int p0 = pix[-1];
  4636. const int p1 = pix[-2];
  4637. const int q0 = pix[0];
  4638. const int q1 = pix[1];
  4639. if( ABS( p0 - q0 ) < alpha &&
  4640. ABS( p1 - p0 ) < beta &&
  4641. ABS( q1 - q0 ) < beta ) {
  4642. const int i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  4643. pix[-1] = clip_uint8( p0 + i_delta ); /* p0' */
  4644. pix[0] = clip_uint8( q0 - i_delta ); /* q0' */
  4645. //tprintf("filter_mb_edgecv i:%d d:%d, qp:%d, indexA:%d, alpha:%d, beta:%d, tc:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, qp, index_a, alpha, beta, tc, bS[i], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);
  4646. }
  4647. pix += stride;
  4648. }
  4649. }else{
  4650. /* 2px edge length (because we use same bS than the one for luma) */
  4651. for( d = 0; d < 2; d++ ){
  4652. const int p0 = pix[-1];
  4653. const int p1 = pix[-2];
  4654. const int q0 = pix[0];
  4655. const int q1 = pix[1];
  4656. if( ABS( p0 - q0 ) < alpha &&
  4657. ABS( p1 - p0 ) < beta &&
  4658. ABS( q1 - q0 ) < beta ) {
  4659. pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2; /* p0' */
  4660. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2; /* q0' */
  4661. //tprintf("filter_mb_edgecv i:%d d:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);
  4662. }
  4663. pix += stride;
  4664. }
  4665. }
  4666. }
  4667. }
  4668. static void filter_mb_edgeh( H264Context *h, uint8_t *pix, int stride, int bS[4], int qp ) {
  4669. int i, d;
  4670. const int index_a = clip( qp + h->slice_alpha_c0_offset, 0, 51 );
  4671. const int alpha = alpha_table[index_a];
  4672. const int beta = beta_table[clip( qp + h->slice_beta_offset, 0, 51 )];
  4673. const int pix_next = stride;
  4674. for( i = 0; i < 4; i++ ) {
  4675. if( bS[i] == 0 ) {
  4676. pix += 4;
  4677. continue;
  4678. }
  4679. if( bS[i] < 4 ) {
  4680. const int tc0 = tc0_table[index_a][bS[i] - 1];
  4681. /* 4px edge length */
  4682. for( d = 0; d < 4; d++ ) {
  4683. const int p0 = pix[-1*pix_next];
  4684. const int p1 = pix[-2*pix_next];
  4685. const int p2 = pix[-3*pix_next];
  4686. const int q0 = pix[0];
  4687. const int q1 = pix[1*pix_next];
  4688. const int q2 = pix[2*pix_next];
  4689. if( ABS( p0 - q0 ) < alpha &&
  4690. ABS( p1 - p0 ) < beta &&
  4691. ABS( q1 - q0 ) < beta ) {
  4692. int tc = tc0;
  4693. int i_delta;
  4694. if( ABS( p2 - p0 ) < beta ) {
  4695. pix[-2*pix_next] = p1 + clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );
  4696. tc++;
  4697. }
  4698. if( ABS( q2 - q0 ) < beta ) {
  4699. pix[pix_next] = q1 + clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );
  4700. tc++;
  4701. }
  4702. i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  4703. pix[-pix_next] = clip_uint8( p0 + i_delta ); /* p0' */
  4704. pix[0] = clip_uint8( q0 - i_delta ); /* q0' */
  4705. }
  4706. pix++;
  4707. }
  4708. }else{
  4709. /* 4px edge length */
  4710. for( d = 0; d < 4; d++ ) {
  4711. const int p0 = pix[-1*pix_next];
  4712. const int p1 = pix[-2*pix_next];
  4713. const int p2 = pix[-3*pix_next];
  4714. const int q0 = pix[0];
  4715. const int q1 = pix[1*pix_next];
  4716. const int q2 = pix[2*pix_next];
  4717. if( ABS( p0 - q0 ) < alpha &&
  4718. ABS( p1 - p0 ) < beta &&
  4719. ABS( q1 - q0 ) < beta ) {
  4720. const int p3 = pix[-4*pix_next];
  4721. const int q3 = pix[ 3*pix_next];
  4722. if(ABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){
  4723. if( ABS( p2 - p0 ) < beta) {
  4724. /* p0', p1', p2' */
  4725. pix[-1*pix_next] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;
  4726. pix[-2*pix_next] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;
  4727. pix[-3*pix_next] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;
  4728. } else {
  4729. /* p0' */
  4730. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  4731. }
  4732. if( ABS( q2 - q0 ) < beta) {
  4733. /* q0', q1', q2' */
  4734. pix[0*pix_next] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;
  4735. pix[1*pix_next] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;
  4736. pix[2*pix_next] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;
  4737. } else {
  4738. /* q0' */
  4739. pix[0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  4740. }
  4741. }else{
  4742. /* p0', q0' */
  4743. pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;
  4744. pix[ 0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;
  4745. }
  4746. }
  4747. pix++;
  4748. }
  4749. }
  4750. }
  4751. }
  4752. static void filter_mb_edgech( H264Context *h, uint8_t *pix, int stride, int bS[4], int qp ) {
  4753. int i, d;
  4754. const int index_a = clip( qp + h->slice_alpha_c0_offset, 0, 51 );
  4755. const int alpha = alpha_table[index_a];
  4756. const int beta = beta_table[clip( qp + h->slice_beta_offset, 0, 51 )];
  4757. const int pix_next = stride;
  4758. for( i = 0; i < 4; i++ )
  4759. {
  4760. if( bS[i] == 0 ) {
  4761. pix += 2;
  4762. continue;
  4763. }
  4764. if( bS[i] < 4 ) {
  4765. int tc = tc0_table[index_a][bS[i] - 1] + 1;
  4766. /* 2px edge length (see deblocking_filter_edgecv) */
  4767. for( d = 0; d < 2; d++ ) {
  4768. const int p0 = pix[-1*pix_next];
  4769. const int p1 = pix[-2*pix_next];
  4770. const int q0 = pix[0];
  4771. const int q1 = pix[1*pix_next];
  4772. if( ABS( p0 - q0 ) < alpha &&
  4773. ABS( p1 - p0 ) < beta &&
  4774. ABS( q1 - q0 ) < beta ) {
  4775. int i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );
  4776. pix[-pix_next] = clip_uint8( p0 + i_delta ); /* p0' */
  4777. pix[0] = clip_uint8( q0 - i_delta ); /* q0' */
  4778. }
  4779. pix++;
  4780. }
  4781. }else{
  4782. /* 2px edge length (see deblocking_filter_edgecv) */
  4783. for( d = 0; d < 2; d++ ) {
  4784. const int p0 = pix[-1*pix_next];
  4785. const int p1 = pix[-2*pix_next];
  4786. const int q0 = pix[0];
  4787. const int q1 = pix[1*pix_next];
  4788. if( ABS( p0 - q0 ) < alpha &&
  4789. ABS( p1 - p0 ) < beta &&
  4790. ABS( q1 - q0 ) < beta ) {
  4791. pix[-pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2; /* p0' */
  4792. pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2; /* q0' */
  4793. }
  4794. pix++;
  4795. }
  4796. }
  4797. }
  4798. }
  4799. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr) {
  4800. MpegEncContext * const s = &h->s;
  4801. const int mb_xy= mb_x + mb_y*s->mb_stride;
  4802. int linesize, uvlinesize;
  4803. int dir;
  4804. /* FIXME Implement deblocking filter for field MB */
  4805. if( h->sps.mb_aff ) {
  4806. return;
  4807. }
  4808. linesize = s->linesize;
  4809. uvlinesize = s->uvlinesize;
  4810. /* dir : 0 -> vertical edge, 1 -> horizontal edge */
  4811. for( dir = 0; dir < 2; dir++ )
  4812. {
  4813. int edge;
  4814. const int mbm_xy = dir == 0 ? mb_xy -1 : mb_xy - s->mb_stride;
  4815. int start = h->slice_table[mbm_xy] == 255 ? 1 : 0;
  4816. if (h->deblocking_filter==2 && h->slice_table[mbm_xy] != h->slice_table[mb_xy])
  4817. start = 1;
  4818. /* Calculate bS */
  4819. for( edge = start; edge < 4; edge++ ) {
  4820. /* mbn_xy: neighbour macroblock (how that works for field ?) */
  4821. int mbn_xy = edge > 0 ? mb_xy : mbm_xy;
  4822. int bS[4];
  4823. int qp;
  4824. if( IS_INTRA( s->current_picture.mb_type[mb_xy] ) ||
  4825. IS_INTRA( s->current_picture.mb_type[mbn_xy] ) ) {
  4826. bS[0] = bS[1] = bS[2] = bS[3] = ( edge == 0 ? 4 : 3 );
  4827. } else {
  4828. int i;
  4829. for( i = 0; i < 4; i++ ) {
  4830. int x = dir == 0 ? edge : i;
  4831. int y = dir == 0 ? i : edge;
  4832. int b_idx= 8 + 4 + x + 8*y;
  4833. int bn_idx= b_idx - (dir ? 8:1);
  4834. if( h->non_zero_count_cache[b_idx] != 0 ||
  4835. h->non_zero_count_cache[bn_idx] != 0 ) {
  4836. bS[i] = 2;
  4837. }
  4838. else if( h->slice_type == P_TYPE ) {
  4839. if( h->ref_cache[0][b_idx] != h->ref_cache[0][bn_idx] ||
  4840. ABS( h->mv_cache[0][b_idx][0] - h->mv_cache[0][bn_idx][0] ) >= 4 ||
  4841. ABS( h->mv_cache[0][b_idx][1] - h->mv_cache[0][bn_idx][1] ) >= 4 )
  4842. bS[i] = 1;
  4843. else
  4844. bS[i] = 0;
  4845. } else {
  4846. /* FIXME Add support for B frame */
  4847. return;
  4848. }
  4849. }
  4850. if(bS[0]+bS[1]+bS[2]+bS[3] == 0)
  4851. continue;
  4852. }
  4853. /* Filter edge */
  4854. qp = ( s->qscale + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;
  4855. //tprintf("filter mb:%d/%d dir:%d edge:%d, QPy:%d, QPc:%d, QPcn:%d\n", mb_x, mb_y, dir, edge, qp, h->chroma_qp, s->current_picture.qscale_table[mbn_xy]);
  4856. if( dir == 0 ) {
  4857. filter_mb_edgev( h, &img_y[4*edge], linesize, bS, qp );
  4858. if( (edge&1) == 0 ) {
  4859. int chroma_qp = ( h->chroma_qp +
  4860. get_chroma_qp( h, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1;
  4861. filter_mb_edgecv( h, &img_cb[2*edge], uvlinesize, bS, chroma_qp );
  4862. filter_mb_edgecv( h, &img_cr[2*edge], uvlinesize, bS, chroma_qp );
  4863. }
  4864. } else {
  4865. filter_mb_edgeh( h, &img_y[4*edge*linesize], linesize, bS, qp );
  4866. if( (edge&1) == 0 ) {
  4867. int chroma_qp = ( h->chroma_qp +
  4868. get_chroma_qp( h, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1;
  4869. filter_mb_edgech( h, &img_cb[2*edge*uvlinesize], uvlinesize, bS, chroma_qp );
  4870. filter_mb_edgech( h, &img_cr[2*edge*uvlinesize], uvlinesize, bS, chroma_qp );
  4871. }
  4872. }
  4873. }
  4874. }
  4875. }
  4876. static int decode_slice(H264Context *h){
  4877. MpegEncContext * const s = &h->s;
  4878. const int part_mask= s->partitioned_frame ? (AC_END|AC_ERROR) : 0x7F;
  4879. s->mb_skip_run= -1;
  4880. if( h->pps.cabac ) {
  4881. int i;
  4882. /* realign */
  4883. align_get_bits( &s->gb );
  4884. /* init cabac */
  4885. ff_init_cabac_states( &h->cabac, ff_h264_lps_range, ff_h264_mps_state, ff_h264_lps_state, 64 );
  4886. ff_init_cabac_decoder( &h->cabac,
  4887. s->gb.buffer + get_bits_count(&s->gb)/8,
  4888. ( s->gb.size_in_bits - get_bits_count(&s->gb) + 7)/8);
  4889. /* calculate pre-state */
  4890. for( i= 0; i < 399; i++ ) {
  4891. int pre;
  4892. if( h->slice_type == I_TYPE )
  4893. pre = clip( ((cabac_context_init_I[i][0] * s->qscale) >>4 ) + cabac_context_init_I[i][1], 1, 126 );
  4894. else
  4895. pre = clip( ((cabac_context_init_PB[h->cabac_init_idc][i][0] * s->qscale) >>4 ) + cabac_context_init_PB[h->cabac_init_idc][i][1], 1, 126 );
  4896. if( pre <= 63 )
  4897. h->cabac_state[i] = 2 * ( 63 - pre ) + 0;
  4898. else
  4899. h->cabac_state[i] = 2 * ( pre - 64 ) + 1;
  4900. }
  4901. for(;;){
  4902. int ret = decode_mb_cabac(h);
  4903. int eos = get_cabac_terminate( &h->cabac ); /* End of Slice flag */
  4904. if(ret>=0) hl_decode_mb(h);
  4905. /* XXX: useless as decode_mb_cabac it doesn't support that ... */
  4906. if( ret >= 0 && h->sps.mb_aff ) { //FIXME optimal? or let mb_decode decode 16x32 ?
  4907. s->mb_y++;
  4908. if(ret>=0) ret = decode_mb_cabac(h);
  4909. eos = get_cabac_terminate( &h->cabac );
  4910. hl_decode_mb(h);
  4911. s->mb_y--;
  4912. }
  4913. if( ret < 0 || h->cabac.bytestream > h->cabac.bytestream_end + 1) {
  4914. av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  4915. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  4916. return -1;
  4917. }
  4918. if( ++s->mb_x >= s->mb_width ) {
  4919. s->mb_x = 0;
  4920. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  4921. ++s->mb_y;
  4922. }
  4923. if( eos || s->mb_y >= s->mb_height ) {
  4924. tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  4925. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4926. return 0;
  4927. }
  4928. #if 0
  4929. /* TODO test over-reading in cabac code */
  4930. else if( read too much in h->cabac ) {
  4931. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  4932. return -1;
  4933. }
  4934. #endif
  4935. }
  4936. } else {
  4937. for(;;){
  4938. int ret = decode_mb_cavlc(h);
  4939. if(ret>=0) hl_decode_mb(h);
  4940. if(ret>=0 && h->sps.mb_aff){ //FIXME optimal? or let mb_decode decode 16x32 ?
  4941. s->mb_y++;
  4942. ret = decode_mb_cavlc(h);
  4943. if(ret>=0) hl_decode_mb(h);
  4944. s->mb_y--;
  4945. }
  4946. if(ret<0){
  4947. av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  4948. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  4949. return -1;
  4950. }
  4951. if(++s->mb_x >= s->mb_width){
  4952. s->mb_x=0;
  4953. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  4954. if(++s->mb_y >= s->mb_height){
  4955. tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  4956. if(get_bits_count(&s->gb) == s->gb.size_in_bits ) {
  4957. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4958. return 0;
  4959. }else{
  4960. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4961. return -1;
  4962. }
  4963. }
  4964. }
  4965. if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->mb_skip_run<=0){
  4966. tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);
  4967. if(get_bits_count(&s->gb) == s->gb.size_in_bits ){
  4968. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4969. return 0;
  4970. }else{
  4971. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  4972. return -1;
  4973. }
  4974. }
  4975. }
  4976. }
  4977. #if 0
  4978. for(;s->mb_y < s->mb_height; s->mb_y++){
  4979. for(;s->mb_x < s->mb_width; s->mb_x++){
  4980. int ret= decode_mb(h);
  4981. hl_decode_mb(h);
  4982. if(ret<0){
  4983. fprintf(stderr, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);
  4984. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  4985. return -1;
  4986. }
  4987. if(++s->mb_x >= s->mb_width){
  4988. s->mb_x=0;
  4989. if(++s->mb_y >= s->mb_height){
  4990. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  4991. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4992. return 0;
  4993. }else{
  4994. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  4995. return -1;
  4996. }
  4997. }
  4998. }
  4999. if(get_bits_count(s->?gb) >= s->gb?.size_in_bits){
  5000. if(get_bits_count(s->gb) == s->gb.size_in_bits){
  5001. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x-1, s->mb_y, (AC_END|DC_END|MV_END)&part_mask);
  5002. return 0;
  5003. }else{
  5004. ff_er_add_slice(s, s->resync_mb_x, s->resync_mb_y, s->mb_x, s->mb_y, (AC_ERROR|DC_ERROR|MV_ERROR)&part_mask);
  5005. return -1;
  5006. }
  5007. }
  5008. }
  5009. s->mb_x=0;
  5010. ff_draw_horiz_band(s, 16*s->mb_y, 16);
  5011. }
  5012. #endif
  5013. return -1; //not reached
  5014. }
  5015. static inline int decode_vui_parameters(H264Context *h, SPS *sps){
  5016. MpegEncContext * const s = &h->s;
  5017. int aspect_ratio_info_present_flag, aspect_ratio_idc;
  5018. aspect_ratio_info_present_flag= get_bits1(&s->gb);
  5019. if( aspect_ratio_info_present_flag ) {
  5020. aspect_ratio_idc= get_bits(&s->gb, 8);
  5021. if( aspect_ratio_idc == EXTENDED_SAR ) {
  5022. sps->sar.num= get_bits(&s->gb, 16);
  5023. sps->sar.den= get_bits(&s->gb, 16);
  5024. }else if(aspect_ratio_idc < 16){
  5025. sps->sar= pixel_aspect[aspect_ratio_idc];
  5026. }else{
  5027. av_log(h->s.avctx, AV_LOG_ERROR, "illegal aspect ratio\n");
  5028. return -1;
  5029. }
  5030. }else{
  5031. sps->sar.num=
  5032. sps->sar.den= 0;
  5033. }
  5034. // s->avctx->aspect_ratio= sar_width*s->width / (float)(s->height*sar_height);
  5035. if(get_bits1(&s->gb)){ /* overscan_info_present_flag */
  5036. get_bits1(&s->gb); /* overscan_appropriate_flag */
  5037. }
  5038. if(get_bits1(&s->gb)){ /* video_signal_type_present_flag */
  5039. get_bits(&s->gb, 3); /* video_format */
  5040. get_bits1(&s->gb); /* video_full_range_flag */
  5041. if(get_bits1(&s->gb)){ /* colour_description_present_flag */
  5042. get_bits(&s->gb, 8); /* colour_primaries */
  5043. get_bits(&s->gb, 8); /* transfer_characteristics */
  5044. get_bits(&s->gb, 8); /* matrix_coefficients */
  5045. }
  5046. }
  5047. if(get_bits1(&s->gb)){ /* chroma_location_info_present_flag */
  5048. get_ue_golomb(&s->gb); /* chroma_sample_location_type_top_field */
  5049. get_ue_golomb(&s->gb); /* chroma_sample_location_type_bottom_field */
  5050. }
  5051. sps->timing_info_present_flag = get_bits1(&s->gb);
  5052. if(sps->timing_info_present_flag){
  5053. sps->num_units_in_tick = get_bits_long(&s->gb, 32);
  5054. sps->time_scale = get_bits_long(&s->gb, 32);
  5055. sps->fixed_frame_rate_flag = get_bits1(&s->gb);
  5056. }
  5057. #if 0
  5058. | nal_hrd_parameters_present_flag |0 |u(1) |
  5059. | if( nal_hrd_parameters_present_flag = = 1) | | |
  5060. | hrd_parameters( ) | | |
  5061. | vcl_hrd_parameters_present_flag |0 |u(1) |
  5062. | if( vcl_hrd_parameters_present_flag = = 1) | | |
  5063. | hrd_parameters( ) | | |
  5064. | if( ( nal_hrd_parameters_present_flag = = 1 | || | |
  5065. | | | |
  5066. |( vcl_hrd_parameters_present_flag = = 1 ) ) | | |
  5067. | low_delay_hrd_flag |0 |u(1) |
  5068. | bitstream_restriction_flag |0 |u(1) |
  5069. | if( bitstream_restriction_flag ) { |0 |u(1) |
  5070. | motion_vectors_over_pic_boundaries_flag |0 |u(1) |
  5071. | max_bytes_per_pic_denom |0 |ue(v) |
  5072. | max_bits_per_mb_denom |0 |ue(v) |
  5073. | log2_max_mv_length_horizontal |0 |ue(v) |
  5074. | log2_max_mv_length_vertical |0 |ue(v) |
  5075. | num_reorder_frames |0 |ue(v) |
  5076. | max_dec_frame_buffering |0 |ue(v) |
  5077. | } | | |
  5078. |} | | |
  5079. #endif
  5080. return 0;
  5081. }
  5082. static inline int decode_seq_parameter_set(H264Context *h){
  5083. MpegEncContext * const s = &h->s;
  5084. int profile_idc, level_idc;
  5085. int sps_id, i;
  5086. SPS *sps;
  5087. profile_idc= get_bits(&s->gb, 8);
  5088. get_bits1(&s->gb); //constraint_set0_flag
  5089. get_bits1(&s->gb); //constraint_set1_flag
  5090. get_bits1(&s->gb); //constraint_set2_flag
  5091. get_bits1(&s->gb); //constraint_set3_flag
  5092. get_bits(&s->gb, 4); // reserved
  5093. level_idc= get_bits(&s->gb, 8);
  5094. sps_id= get_ue_golomb(&s->gb);
  5095. sps= &h->sps_buffer[ sps_id ];
  5096. sps->profile_idc= profile_idc;
  5097. sps->level_idc= level_idc;
  5098. sps->log2_max_frame_num= get_ue_golomb(&s->gb) + 4;
  5099. sps->poc_type= get_ue_golomb(&s->gb);
  5100. if(sps->poc_type == 0){ //FIXME #define
  5101. sps->log2_max_poc_lsb= get_ue_golomb(&s->gb) + 4;
  5102. } else if(sps->poc_type == 1){//FIXME #define
  5103. sps->delta_pic_order_always_zero_flag= get_bits1(&s->gb);
  5104. sps->offset_for_non_ref_pic= get_se_golomb(&s->gb);
  5105. sps->offset_for_top_to_bottom_field= get_se_golomb(&s->gb);
  5106. sps->poc_cycle_length= get_ue_golomb(&s->gb);
  5107. for(i=0; i<sps->poc_cycle_length; i++)
  5108. sps->offset_for_ref_frame[i]= get_se_golomb(&s->gb);
  5109. }
  5110. if(sps->poc_type > 2){
  5111. av_log(h->s.avctx, AV_LOG_ERROR, "illegal POC type %d\n", sps->poc_type);
  5112. return -1;
  5113. }
  5114. sps->ref_frame_count= get_ue_golomb(&s->gb);
  5115. if(sps->ref_frame_count > MAX_PICTURE_COUNT-2){
  5116. av_log(h->s.avctx, AV_LOG_ERROR, "too many reference frames\n");
  5117. }
  5118. sps->gaps_in_frame_num_allowed_flag= get_bits1(&s->gb);
  5119. sps->mb_width= get_ue_golomb(&s->gb) + 1;
  5120. sps->mb_height= get_ue_golomb(&s->gb) + 1;
  5121. if((unsigned)sps->mb_width >= INT_MAX/16 || (unsigned)sps->mb_height >= INT_MAX/16 ||
  5122. avcodec_check_dimensions(NULL, 16*sps->mb_width, 16*sps->mb_height))
  5123. return -1;
  5124. sps->frame_mbs_only_flag= get_bits1(&s->gb);
  5125. if(!sps->frame_mbs_only_flag)
  5126. sps->mb_aff= get_bits1(&s->gb);
  5127. else
  5128. sps->mb_aff= 0;
  5129. sps->direct_8x8_inference_flag= get_bits1(&s->gb);
  5130. sps->crop= get_bits1(&s->gb);
  5131. if(sps->crop){
  5132. sps->crop_left = get_ue_golomb(&s->gb);
  5133. sps->crop_right = get_ue_golomb(&s->gb);
  5134. sps->crop_top = get_ue_golomb(&s->gb);
  5135. sps->crop_bottom= get_ue_golomb(&s->gb);
  5136. if(sps->crop_left || sps->crop_top){
  5137. av_log(h->s.avctx, AV_LOG_ERROR, "insane cropping not completly supported, this could look slightly wrong ...\n");
  5138. }
  5139. }else{
  5140. sps->crop_left =
  5141. sps->crop_right =
  5142. sps->crop_top =
  5143. sps->crop_bottom= 0;
  5144. }
  5145. sps->vui_parameters_present_flag= get_bits1(&s->gb);
  5146. if( sps->vui_parameters_present_flag )
  5147. decode_vui_parameters(h, sps);
  5148. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  5149. av_log(h->s.avctx, AV_LOG_DEBUG, "sps:%d profile:%d/%d poc:%d ref:%d %dx%d %s %s crop:%d/%d/%d/%d %s\n",
  5150. sps_id, sps->profile_idc, sps->level_idc,
  5151. sps->poc_type,
  5152. sps->ref_frame_count,
  5153. sps->mb_width, sps->mb_height,
  5154. sps->frame_mbs_only_flag ? "FRM" : (sps->mb_aff ? "MB-AFF" : "PIC-AFF"),
  5155. sps->direct_8x8_inference_flag ? "8B8" : "",
  5156. sps->crop_left, sps->crop_right,
  5157. sps->crop_top, sps->crop_bottom,
  5158. sps->vui_parameters_present_flag ? "VUI" : ""
  5159. );
  5160. }
  5161. return 0;
  5162. }
  5163. static inline int decode_picture_parameter_set(H264Context *h){
  5164. MpegEncContext * const s = &h->s;
  5165. int pps_id= get_ue_golomb(&s->gb);
  5166. PPS *pps= &h->pps_buffer[pps_id];
  5167. pps->sps_id= get_ue_golomb(&s->gb);
  5168. pps->cabac= get_bits1(&s->gb);
  5169. pps->pic_order_present= get_bits1(&s->gb);
  5170. pps->slice_group_count= get_ue_golomb(&s->gb) + 1;
  5171. if(pps->slice_group_count > 1 ){
  5172. pps->mb_slice_group_map_type= get_ue_golomb(&s->gb);
  5173. av_log(h->s.avctx, AV_LOG_ERROR, "FMO not supported\n");
  5174. switch(pps->mb_slice_group_map_type){
  5175. case 0:
  5176. #if 0
  5177. | for( i = 0; i <= num_slice_groups_minus1; i++ ) | | |
  5178. | run_length[ i ] |1 |ue(v) |
  5179. #endif
  5180. break;
  5181. case 2:
  5182. #if 0
  5183. | for( i = 0; i < num_slice_groups_minus1; i++ ) | | |
  5184. |{ | | |
  5185. | top_left_mb[ i ] |1 |ue(v) |
  5186. | bottom_right_mb[ i ] |1 |ue(v) |
  5187. | } | | |
  5188. #endif
  5189. break;
  5190. case 3:
  5191. case 4:
  5192. case 5:
  5193. #if 0
  5194. | slice_group_change_direction_flag |1 |u(1) |
  5195. | slice_group_change_rate_minus1 |1 |ue(v) |
  5196. #endif
  5197. break;
  5198. case 6:
  5199. #if 0
  5200. | slice_group_id_cnt_minus1 |1 |ue(v) |
  5201. | for( i = 0; i <= slice_group_id_cnt_minus1; i++ | | |
  5202. |) | | |
  5203. | slice_group_id[ i ] |1 |u(v) |
  5204. #endif
  5205. break;
  5206. }
  5207. }
  5208. pps->ref_count[0]= get_ue_golomb(&s->gb) + 1;
  5209. pps->ref_count[1]= get_ue_golomb(&s->gb) + 1;
  5210. if(pps->ref_count[0] > 32 || pps->ref_count[1] > 32){
  5211. av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow (pps)\n");
  5212. return -1;
  5213. }
  5214. pps->weighted_pred= get_bits1(&s->gb);
  5215. pps->weighted_bipred_idc= get_bits(&s->gb, 2);
  5216. pps->init_qp= get_se_golomb(&s->gb) + 26;
  5217. pps->init_qs= get_se_golomb(&s->gb) + 26;
  5218. pps->chroma_qp_index_offset= get_se_golomb(&s->gb);
  5219. pps->deblocking_filter_parameters_present= get_bits1(&s->gb);
  5220. pps->constrained_intra_pred= get_bits1(&s->gb);
  5221. pps->redundant_pic_cnt_present = get_bits1(&s->gb);
  5222. if(s->avctx->debug&FF_DEBUG_PICT_INFO){
  5223. av_log(h->s.avctx, AV_LOG_DEBUG, "pps:%d sps:%d %s slice_groups:%d ref:%d/%d %s qp:%d/%d/%d %s %s %s\n",
  5224. pps_id, pps->sps_id,
  5225. pps->cabac ? "CABAC" : "CAVLC",
  5226. pps->slice_group_count,
  5227. pps->ref_count[0], pps->ref_count[1],
  5228. pps->weighted_pred ? "weighted" : "",
  5229. pps->init_qp, pps->init_qs, pps->chroma_qp_index_offset,
  5230. pps->deblocking_filter_parameters_present ? "LPAR" : "",
  5231. pps->constrained_intra_pred ? "CONSTR" : "",
  5232. pps->redundant_pic_cnt_present ? "REDU" : ""
  5233. );
  5234. }
  5235. return 0;
  5236. }
  5237. /**
  5238. * finds the end of the current frame in the bitstream.
  5239. * @return the position of the first byte of the next frame, or -1
  5240. */
  5241. static int find_frame_end(H264Context *h, const uint8_t *buf, int buf_size){
  5242. int i;
  5243. uint32_t state;
  5244. ParseContext *pc = &(h->s.parse_context);
  5245. //printf("first %02X%02X%02X%02X\n", buf[0], buf[1],buf[2],buf[3]);
  5246. // mb_addr= pc->mb_addr - 1;
  5247. state= pc->state;
  5248. for(i=0; i<=buf_size; i++){
  5249. if((state&0xFFFFFF1F) == 0x101 || (state&0xFFFFFF1F) == 0x102 || (state&0xFFFFFF1F) == 0x105){
  5250. tprintf("find_frame_end new startcode = %08x, frame_start_found = %d, pos = %d\n", state, pc->frame_start_found, i);
  5251. if(pc->frame_start_found){
  5252. // If there isn't one more byte in the buffer
  5253. // the test on first_mb_in_slice cannot be done yet
  5254. // do it at next call.
  5255. if (i >= buf_size) break;
  5256. if (buf[i] & 0x80) {
  5257. // first_mb_in_slice is 0, probably the first nal of a new
  5258. // slice
  5259. tprintf("find_frame_end frame_end_found, state = %08x, pos = %d\n", state, i);
  5260. pc->state=-1;
  5261. pc->frame_start_found= 0;
  5262. return i-4;
  5263. }
  5264. }
  5265. pc->frame_start_found = 1;
  5266. }
  5267. if (i<buf_size)
  5268. state= (state<<8) | buf[i];
  5269. }
  5270. pc->state= state;
  5271. return END_NOT_FOUND;
  5272. }
  5273. static int h264_parse(AVCodecParserContext *s,
  5274. AVCodecContext *avctx,
  5275. uint8_t **poutbuf, int *poutbuf_size,
  5276. const uint8_t *buf, int buf_size)
  5277. {
  5278. H264Context *h = s->priv_data;
  5279. ParseContext *pc = &h->s.parse_context;
  5280. int next;
  5281. next= find_frame_end(h, buf, buf_size);
  5282. if (ff_combine_frame(pc, next, (uint8_t **)&buf, &buf_size) < 0) {
  5283. *poutbuf = NULL;
  5284. *poutbuf_size = 0;
  5285. return buf_size;
  5286. }
  5287. *poutbuf = (uint8_t *)buf;
  5288. *poutbuf_size = buf_size;
  5289. return next;
  5290. }
  5291. static int decode_nal_units(H264Context *h, uint8_t *buf, int buf_size){
  5292. MpegEncContext * const s = &h->s;
  5293. AVCodecContext * const avctx= s->avctx;
  5294. int buf_index=0;
  5295. #if 0
  5296. int i;
  5297. for(i=0; i<32; i++){
  5298. printf("%X ", buf[i]);
  5299. }
  5300. #endif
  5301. h->slice_num = 0;
  5302. for(;;){
  5303. int consumed;
  5304. int dst_length;
  5305. int bit_length;
  5306. uint8_t *ptr;
  5307. int i, nalsize = 0;
  5308. if(h->is_avc) {
  5309. if(buf_index >= buf_size) break;
  5310. nalsize = 0;
  5311. for(i = 0; i < h->nal_length_size; i++)
  5312. nalsize = (nalsize << 8) | buf[buf_index++];
  5313. } else {
  5314. // start code prefix search
  5315. for(; buf_index + 3 < buf_size; buf_index++){
  5316. // this should allways succeed in the first iteration
  5317. if(buf[buf_index] == 0 && buf[buf_index+1] == 0 && buf[buf_index+2] == 1)
  5318. break;
  5319. }
  5320. if(buf_index+3 >= buf_size) break;
  5321. buf_index+=3;
  5322. }
  5323. ptr= decode_nal(h, buf + buf_index, &dst_length, &consumed, h->is_avc ? nalsize : buf_size - buf_index);
  5324. if(ptr[dst_length - 1] == 0) dst_length--;
  5325. bit_length= 8*dst_length - decode_rbsp_trailing(ptr + dst_length - 1);
  5326. if(s->avctx->debug&FF_DEBUG_STARTCODE){
  5327. av_log(h->s.avctx, AV_LOG_DEBUG, "NAL %d at %d/%d length %d\n", h->nal_unit_type, buf_index, buf_size, dst_length);
  5328. }
  5329. if (h->is_avc && (nalsize != consumed))
  5330. av_log(h->s.avctx, AV_LOG_ERROR, "AVC: Consumed only %d bytes instead of %d\n", consumed, nalsize);
  5331. buf_index += consumed;
  5332. if( s->hurry_up == 1 && h->nal_ref_idc == 0 )
  5333. continue;
  5334. switch(h->nal_unit_type){
  5335. case NAL_IDR_SLICE:
  5336. idr(h); //FIXME ensure we dont loose some frames if there is reordering
  5337. case NAL_SLICE:
  5338. init_get_bits(&s->gb, ptr, bit_length);
  5339. h->intra_gb_ptr=
  5340. h->inter_gb_ptr= &s->gb;
  5341. s->data_partitioning = 0;
  5342. if(decode_slice_header(h) < 0) return -1;
  5343. if(h->redundant_pic_count==0 && s->hurry_up < 5 )
  5344. decode_slice(h);
  5345. break;
  5346. case NAL_DPA:
  5347. init_get_bits(&s->gb, ptr, bit_length);
  5348. h->intra_gb_ptr=
  5349. h->inter_gb_ptr= NULL;
  5350. s->data_partitioning = 1;
  5351. if(decode_slice_header(h) < 0) return -1;
  5352. break;
  5353. case NAL_DPB:
  5354. init_get_bits(&h->intra_gb, ptr, bit_length);
  5355. h->intra_gb_ptr= &h->intra_gb;
  5356. break;
  5357. case NAL_DPC:
  5358. init_get_bits(&h->inter_gb, ptr, bit_length);
  5359. h->inter_gb_ptr= &h->inter_gb;
  5360. if(h->redundant_pic_count==0 && h->intra_gb_ptr && s->data_partitioning && s->hurry_up < 5 )
  5361. decode_slice(h);
  5362. break;
  5363. case NAL_SEI:
  5364. break;
  5365. case NAL_SPS:
  5366. init_get_bits(&s->gb, ptr, bit_length);
  5367. decode_seq_parameter_set(h);
  5368. if(s->flags& CODEC_FLAG_LOW_DELAY)
  5369. s->low_delay=1;
  5370. avctx->has_b_frames= !s->low_delay;
  5371. break;
  5372. case NAL_PPS:
  5373. init_get_bits(&s->gb, ptr, bit_length);
  5374. decode_picture_parameter_set(h);
  5375. break;
  5376. case NAL_PICTURE_DELIMITER:
  5377. break;
  5378. case NAL_FILTER_DATA:
  5379. break;
  5380. default:
  5381. av_log(avctx, AV_LOG_ERROR, "Unknown NAL code: %d\n", h->nal_unit_type);
  5382. }
  5383. //FIXME move after where irt is set
  5384. s->current_picture.pict_type= s->pict_type;
  5385. s->current_picture.key_frame= s->pict_type == I_TYPE;
  5386. }
  5387. if(!s->current_picture_ptr) return buf_index; //no frame
  5388. h->prev_frame_num_offset= h->frame_num_offset;
  5389. h->prev_frame_num= h->frame_num;
  5390. if(s->current_picture_ptr->reference){
  5391. h->prev_poc_msb= h->poc_msb;
  5392. h->prev_poc_lsb= h->poc_lsb;
  5393. }
  5394. if(s->current_picture_ptr->reference)
  5395. execute_ref_pic_marking(h, h->mmco, h->mmco_index);
  5396. ff_er_frame_end(s);
  5397. MPV_frame_end(s);
  5398. return buf_index;
  5399. }
  5400. /**
  5401. * retunrs the number of bytes consumed for building the current frame
  5402. */
  5403. static int get_consumed_bytes(MpegEncContext *s, int pos, int buf_size){
  5404. if(s->flags&CODEC_FLAG_TRUNCATED){
  5405. pos -= s->parse_context.last_index;
  5406. if(pos<0) pos=0; // FIXME remove (uneeded?)
  5407. return pos;
  5408. }else{
  5409. if(pos==0) pos=1; //avoid infinite loops (i doubt thats needed but ...)
  5410. if(pos+10>buf_size) pos=buf_size; // oops ;)
  5411. return pos;
  5412. }
  5413. }
  5414. static int decode_frame(AVCodecContext *avctx,
  5415. void *data, int *data_size,
  5416. uint8_t *buf, int buf_size)
  5417. {
  5418. H264Context *h = avctx->priv_data;
  5419. MpegEncContext *s = &h->s;
  5420. AVFrame *pict = data;
  5421. int buf_index;
  5422. s->flags= avctx->flags;
  5423. s->flags2= avctx->flags2;
  5424. /* no supplementary picture */
  5425. if (buf_size == 0) {
  5426. return 0;
  5427. }
  5428. if(s->flags&CODEC_FLAG_TRUNCATED){
  5429. int next= find_frame_end(h, buf, buf_size);
  5430. if( ff_combine_frame(&s->parse_context, next, &buf, &buf_size) < 0 )
  5431. return buf_size;
  5432. //printf("next:%d buf_size:%d last_index:%d\n", next, buf_size, s->parse_context.last_index);
  5433. }
  5434. if(h->is_avc && !h->got_avcC) {
  5435. int i, cnt, nalsize;
  5436. unsigned char *p = avctx->extradata;
  5437. if(avctx->extradata_size < 7) {
  5438. av_log(avctx, AV_LOG_ERROR, "avcC too short\n");
  5439. return -1;
  5440. }
  5441. if(*p != 1) {
  5442. av_log(avctx, AV_LOG_ERROR, "Unknown avcC version %d\n", *p);
  5443. return -1;
  5444. }
  5445. /* sps and pps in the avcC always have length coded with 2 bytes,
  5446. so put a fake nal_length_size = 2 while parsing them */
  5447. h->nal_length_size = 2;
  5448. // Decode sps from avcC
  5449. cnt = *(p+5) & 0x1f; // Number of sps
  5450. p += 6;
  5451. for (i = 0; i < cnt; i++) {
  5452. nalsize = BE_16(p) + 2;
  5453. if(decode_nal_units(h, p, nalsize) != nalsize) {
  5454. av_log(avctx, AV_LOG_ERROR, "Decoding sps %d from avcC failed\n", i);
  5455. return -1;
  5456. }
  5457. p += nalsize;
  5458. }
  5459. // Decode pps from avcC
  5460. cnt = *(p++); // Number of pps
  5461. for (i = 0; i < cnt; i++) {
  5462. nalsize = BE_16(p) + 2;
  5463. if(decode_nal_units(h, p, nalsize) != nalsize) {
  5464. av_log(avctx, AV_LOG_ERROR, "Decoding pps %d from avcC failed\n", i);
  5465. return -1;
  5466. }
  5467. p += nalsize;
  5468. }
  5469. // Now store right nal length size, that will be use to parse all other nals
  5470. h->nal_length_size = ((*(((char*)(avctx->extradata))+4))&0x03)+1;
  5471. // Do not reparse avcC
  5472. h->got_avcC = 1;
  5473. }
  5474. if(!h->is_avc && s->avctx->extradata_size && s->picture_number==0){
  5475. if(0 < decode_nal_units(h, s->avctx->extradata, s->avctx->extradata_size) )
  5476. return -1;
  5477. }
  5478. buf_index=decode_nal_units(h, buf, buf_size);
  5479. if(buf_index < 0)
  5480. return -1;
  5481. //FIXME do something with unavailable reference frames
  5482. // if(ret==FRAME_SKIPED) return get_consumed_bytes(s, buf_index, buf_size);
  5483. if(!s->current_picture_ptr){
  5484. av_log(h->s.avctx, AV_LOG_DEBUG, "error, NO frame\n");
  5485. return -1;
  5486. }
  5487. {
  5488. //#define DECODE_ORDER
  5489. Picture *out = s->current_picture_ptr;
  5490. #ifndef DECODE_ORDER
  5491. /* Sort B-frames into display order
  5492. * FIXME doesn't allow for multiple delayed frames */
  5493. Picture *cur = s->current_picture_ptr;
  5494. Picture *prev = h->delayed_pic[0];
  5495. if(s->low_delay
  5496. && (cur->pict_type == B_TYPE
  5497. || (!h->sps.gaps_in_frame_num_allowed_flag
  5498. && prev && cur->poc - prev->poc > 2))){
  5499. s->low_delay = 0;
  5500. s->avctx->has_b_frames = 1;
  5501. if(prev && prev->poc > cur->poc)
  5502. // too late to display this frame
  5503. cur = prev;
  5504. }
  5505. if(s->low_delay || !prev || cur->pict_type == B_TYPE)
  5506. out = cur;
  5507. else
  5508. out = prev;
  5509. if(s->low_delay || !prev || out == prev){
  5510. if(prev && prev->reference == 1)
  5511. prev->reference = 0;
  5512. h->delayed_pic[0] = cur;
  5513. }
  5514. #endif
  5515. *pict= *(AVFrame*)out;
  5516. }
  5517. ff_print_debug_info(s, pict);
  5518. assert(pict->data[0]);
  5519. //printf("out %d\n", (int)pict->data[0]);
  5520. #if 0 //?
  5521. /* Return the Picture timestamp as the frame number */
  5522. /* we substract 1 because it is added on utils.c */
  5523. avctx->frame_number = s->picture_number - 1;
  5524. #endif
  5525. #if 0
  5526. /* dont output the last pic after seeking */
  5527. if(s->last_picture_ptr || s->low_delay)
  5528. //Note this isnt a issue as a IDR pic should flush the buffers
  5529. #endif
  5530. *data_size = sizeof(AVFrame);
  5531. return get_consumed_bytes(s, buf_index, buf_size);
  5532. }
  5533. #if 0
  5534. static inline void fill_mb_avail(H264Context *h){
  5535. MpegEncContext * const s = &h->s;
  5536. const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;
  5537. if(s->mb_y){
  5538. h->mb_avail[0]= s->mb_x && h->slice_table[mb_xy - s->mb_stride - 1] == h->slice_num;
  5539. h->mb_avail[1]= h->slice_table[mb_xy - s->mb_stride ] == h->slice_num;
  5540. h->mb_avail[2]= s->mb_x+1 < s->mb_width && h->slice_table[mb_xy - s->mb_stride + 1] == h->slice_num;
  5541. }else{
  5542. h->mb_avail[0]=
  5543. h->mb_avail[1]=
  5544. h->mb_avail[2]= 0;
  5545. }
  5546. h->mb_avail[3]= s->mb_x && h->slice_table[mb_xy - 1] == h->slice_num;
  5547. h->mb_avail[4]= 1; //FIXME move out
  5548. h->mb_avail[5]= 0; //FIXME move out
  5549. }
  5550. #endif
  5551. #if 0 //selftest
  5552. #define COUNT 8000
  5553. #define SIZE (COUNT*40)
  5554. int main(){
  5555. int i;
  5556. uint8_t temp[SIZE];
  5557. PutBitContext pb;
  5558. GetBitContext gb;
  5559. // int int_temp[10000];
  5560. DSPContext dsp;
  5561. AVCodecContext avctx;
  5562. dsputil_init(&dsp, &avctx);
  5563. init_put_bits(&pb, temp, SIZE);
  5564. printf("testing unsigned exp golomb\n");
  5565. for(i=0; i<COUNT; i++){
  5566. START_TIMER
  5567. set_ue_golomb(&pb, i);
  5568. STOP_TIMER("set_ue_golomb");
  5569. }
  5570. flush_put_bits(&pb);
  5571. init_get_bits(&gb, temp, 8*SIZE);
  5572. for(i=0; i<COUNT; i++){
  5573. int j, s;
  5574. s= show_bits(&gb, 24);
  5575. START_TIMER
  5576. j= get_ue_golomb(&gb);
  5577. if(j != i){
  5578. printf("missmatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  5579. // return -1;
  5580. }
  5581. STOP_TIMER("get_ue_golomb");
  5582. }
  5583. init_put_bits(&pb, temp, SIZE);
  5584. printf("testing signed exp golomb\n");
  5585. for(i=0; i<COUNT; i++){
  5586. START_TIMER
  5587. set_se_golomb(&pb, i - COUNT/2);
  5588. STOP_TIMER("set_se_golomb");
  5589. }
  5590. flush_put_bits(&pb);
  5591. init_get_bits(&gb, temp, 8*SIZE);
  5592. for(i=0; i<COUNT; i++){
  5593. int j, s;
  5594. s= show_bits(&gb, 24);
  5595. START_TIMER
  5596. j= get_se_golomb(&gb);
  5597. if(j != i - COUNT/2){
  5598. printf("missmatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);
  5599. // return -1;
  5600. }
  5601. STOP_TIMER("get_se_golomb");
  5602. }
  5603. printf("testing 4x4 (I)DCT\n");
  5604. DCTELEM block[16];
  5605. uint8_t src[16], ref[16];
  5606. uint64_t error= 0, max_error=0;
  5607. for(i=0; i<COUNT; i++){
  5608. int j;
  5609. // printf("%d %d %d\n", r1, r2, (r2-r1)*16);
  5610. for(j=0; j<16; j++){
  5611. ref[j]= random()%255;
  5612. src[j]= random()%255;
  5613. }
  5614. h264_diff_dct_c(block, src, ref, 4);
  5615. //normalize
  5616. for(j=0; j<16; j++){
  5617. // printf("%d ", block[j]);
  5618. block[j]= block[j]*4;
  5619. if(j&1) block[j]= (block[j]*4 + 2)/5;
  5620. if(j&4) block[j]= (block[j]*4 + 2)/5;
  5621. }
  5622. // printf("\n");
  5623. s->dsp.h264_idct_add(ref, block, 4);
  5624. /* for(j=0; j<16; j++){
  5625. printf("%d ", ref[j]);
  5626. }
  5627. printf("\n");*/
  5628. for(j=0; j<16; j++){
  5629. int diff= ABS(src[j] - ref[j]);
  5630. error+= diff*diff;
  5631. max_error= FFMAX(max_error, diff);
  5632. }
  5633. }
  5634. printf("error=%f max_error=%d\n", ((float)error)/COUNT/16, (int)max_error );
  5635. #if 0
  5636. printf("testing quantizer\n");
  5637. for(qp=0; qp<52; qp++){
  5638. for(i=0; i<16; i++)
  5639. src1_block[i]= src2_block[i]= random()%255;
  5640. }
  5641. #endif
  5642. printf("Testing NAL layer\n");
  5643. uint8_t bitstream[COUNT];
  5644. uint8_t nal[COUNT*2];
  5645. H264Context h;
  5646. memset(&h, 0, sizeof(H264Context));
  5647. for(i=0; i<COUNT; i++){
  5648. int zeros= i;
  5649. int nal_length;
  5650. int consumed;
  5651. int out_length;
  5652. uint8_t *out;
  5653. int j;
  5654. for(j=0; j<COUNT; j++){
  5655. bitstream[j]= (random() % 255) + 1;
  5656. }
  5657. for(j=0; j<zeros; j++){
  5658. int pos= random() % COUNT;
  5659. while(bitstream[pos] == 0){
  5660. pos++;
  5661. pos %= COUNT;
  5662. }
  5663. bitstream[pos]=0;
  5664. }
  5665. START_TIMER
  5666. nal_length= encode_nal(&h, nal, bitstream, COUNT, COUNT*2);
  5667. if(nal_length<0){
  5668. printf("encoding failed\n");
  5669. return -1;
  5670. }
  5671. out= decode_nal(&h, nal, &out_length, &consumed, nal_length);
  5672. STOP_TIMER("NAL")
  5673. if(out_length != COUNT){
  5674. printf("incorrect length %d %d\n", out_length, COUNT);
  5675. return -1;
  5676. }
  5677. if(consumed != nal_length){
  5678. printf("incorrect consumed length %d %d\n", nal_length, consumed);
  5679. return -1;
  5680. }
  5681. if(memcmp(bitstream, out, COUNT)){
  5682. printf("missmatch\n");
  5683. return -1;
  5684. }
  5685. }
  5686. printf("Testing RBSP\n");
  5687. return 0;
  5688. }
  5689. #endif
  5690. static int decode_end(AVCodecContext *avctx)
  5691. {
  5692. H264Context *h = avctx->priv_data;
  5693. MpegEncContext *s = &h->s;
  5694. free_tables(h); //FIXME cleanup init stuff perhaps
  5695. MPV_common_end(s);
  5696. // memset(h, 0, sizeof(H264Context));
  5697. return 0;
  5698. }
  5699. AVCodec h264_decoder = {
  5700. "h264",
  5701. CODEC_TYPE_VIDEO,
  5702. CODEC_ID_H264,
  5703. sizeof(H264Context),
  5704. decode_init,
  5705. NULL,
  5706. decode_end,
  5707. decode_frame,
  5708. /*CODEC_CAP_DRAW_HORIZ_BAND |*/ CODEC_CAP_DR1 | CODEC_CAP_TRUNCATED | CODEC_CAP_DELAY,
  5709. };
  5710. AVCodecParser h264_parser = {
  5711. { CODEC_ID_H264 },
  5712. sizeof(H264Context),
  5713. NULL,
  5714. h264_parse,
  5715. ff_parse_close,
  5716. };
  5717. #include "svq3.c"