falkTX
/
FFmpeg
mirror of https://github.com/falkTX/FFmpeg.git
1
0
Fork 0
Code Issues 0 Releases 338 Wiki Activity
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.
7850 Commits
32 Branches
294MB
Tree: a0dc1ccd29
Branches Tags
${ item.name }
Create branch ${ searchTerm }
from 'a0dc1ccd29'
${ noResults }
FFmpeg/libavcodec/h264.c

8547 lines
321KB
Raw Blame History 

  1. /*

  2.  * H.26L/H.264/AVC/JVT/14496-10/... encoder/decoder

  3.  * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>

  4.  *

  5.  * This file is part of FFmpeg.

  6.  *

  7.  * FFmpeg is free software; you can redistribute it and/or

  8.  * modify it under the terms of the GNU Lesser General Public

  9.  * License as published by the Free Software Foundation; either

  10.  * version 2.1 of the License, or (at your option) any later version.

  11.  *

  12.  * FFmpeg is distributed in the hope that it will be useful,

  13.  * but WITHOUT ANY WARRANTY; without even the implied warranty of

  14.  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU

  15.  * Lesser General Public License for more details.

  16.  *

  17.  * You should have received a copy of the GNU Lesser General Public

  18.  * License along with FFmpeg; if not, write to the Free Software

  19.  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA

  20.  *

  21.  */

  22. 

  23. /**

  24.  * @file h264.c

  25.  * H.264 / AVC / MPEG4 part10 codec.

  26.  * @author Michael Niedermayer <michaelni@gmx.at>

  27.  */

  28. 

  29. #include "common.h"

  30. #include "dsputil.h"

  31. #include "avcodec.h"

  32. #include "mpegvideo.h"

  33. #include "h264data.h"

  34. #include "golomb.h"

  35. 

  36. #include "cabac.h"

  37. 

  38. //#undef NDEBUG

  39. #include <assert.h>

  40. 

  41. #define interlaced_dct interlaced_dct_is_a_bad_name

  42. #define mb_intra mb_intra_isnt_initalized_see_mb_type

  43. 

  44. #define LUMA_DC_BLOCK_INDEX   25

  45. #define CHROMA_DC_BLOCK_INDEX 26

  46. 

  47. #define CHROMA_DC_COEFF_TOKEN_VLC_BITS 8

  48. #define COEFF_TOKEN_VLC_BITS           8

  49. #define TOTAL_ZEROS_VLC_BITS           9

  50. #define CHROMA_DC_TOTAL_ZEROS_VLC_BITS 3

  51. #define RUN_VLC_BITS                   3

  52. #define RUN7_VLC_BITS                  6

  53. 

  54. #define MAX_SPS_COUNT 32

  55. #define MAX_PPS_COUNT 256

  56. 

  57. #define MAX_MMCO_COUNT 66

  58. 

  59. /* Compiling in interlaced support reduces the speed

  60.  * of progressive decoding by about 2%. */

  61. #define ALLOW_INTERLACE

  62. 

  63. #ifdef ALLOW_INTERLACE

  64. #define MB_MBAFF h->mb_mbaff

  65. #define MB_FIELD h->mb_field_decoding_flag

  66. #define FRAME_MBAFF h->mb_aff_frame

  67. #else

  68. #define MB_MBAFF 0

  69. #define MB_FIELD 0

  70. #define FRAME_MBAFF 0

  71. #undef  IS_INTERLACED

  72. #define IS_INTERLACED(mb_type) 0

  73. #endif

  74. 

  75. /**

  76.  * Sequence parameter set

  77.  */

  78. typedef struct SPS{

  79. 

  80.     int profile_idc;

  81.     int level_idc;

  82.     int transform_bypass;              ///< qpprime_y_zero_transform_bypass_flag

  83.     int log2_max_frame_num;            ///< log2_max_frame_num_minus4 + 4

  84.     int poc_type;                      ///< pic_order_cnt_type

  85.     int log2_max_poc_lsb;              ///< log2_max_pic_order_cnt_lsb_minus4

  86.     int delta_pic_order_always_zero_flag;

  87.     int offset_for_non_ref_pic;

  88.     int offset_for_top_to_bottom_field;

  89.     int poc_cycle_length;              ///< num_ref_frames_in_pic_order_cnt_cycle

  90.     int ref_frame_count;               ///< num_ref_frames

  91.     int gaps_in_frame_num_allowed_flag;

  92.     int mb_width;                      ///< frame_width_in_mbs_minus1 + 1

  93.     int mb_height;                     ///< frame_height_in_mbs_minus1 + 1

  94.     int frame_mbs_only_flag;

  95.     int mb_aff;                        ///<mb_adaptive_frame_field_flag

  96.     int direct_8x8_inference_flag;

  97.     int crop;                   ///< frame_cropping_flag

  98.     int crop_left;              ///< frame_cropping_rect_left_offset

  99.     int crop_right;             ///< frame_cropping_rect_right_offset

  100.     int crop_top;               ///< frame_cropping_rect_top_offset

  101.     int crop_bottom;            ///< frame_cropping_rect_bottom_offset

  102.     int vui_parameters_present_flag;

  103.     AVRational sar;

  104.     int timing_info_present_flag;

  105.     uint32_t num_units_in_tick;

  106.     uint32_t time_scale;

  107.     int fixed_frame_rate_flag;

  108.     short offset_for_ref_frame[256]; //FIXME dyn aloc?

  109.     int bitstream_restriction_flag;

  110.     int num_reorder_frames;

  111.     int scaling_matrix_present;

  112.     uint8_t scaling_matrix4[6][16];

  113.     uint8_t scaling_matrix8[2][64];

  114. }SPS;

  115. 

  116. /**

  117.  * Picture parameter set

  118.  */

  119. typedef struct PPS{

  120.     int sps_id;

  121.     int cabac;                  ///< entropy_coding_mode_flag

  122.     int pic_order_present;      ///< pic_order_present_flag

  123.     int slice_group_count;      ///< num_slice_groups_minus1 + 1

  124.     int mb_slice_group_map_type;

  125.     int ref_count[2];           ///< num_ref_idx_l0/1_active_minus1 + 1

  126.     int weighted_pred;          ///< weighted_pred_flag

  127.     int weighted_bipred_idc;

  128.     int init_qp;                ///< pic_init_qp_minus26 + 26

  129.     int init_qs;                ///< pic_init_qs_minus26 + 26

  130.     int chroma_qp_index_offset;

  131.     int deblocking_filter_parameters_present; ///< deblocking_filter_parameters_present_flag

  132.     int constrained_intra_pred; ///< constrained_intra_pred_flag

  133.     int redundant_pic_cnt_present; ///< redundant_pic_cnt_present_flag

  134.     int transform_8x8_mode;     ///< transform_8x8_mode_flag

  135.     uint8_t scaling_matrix4[6][16];

  136.     uint8_t scaling_matrix8[2][64];

  137. }PPS;

  138. 

  139. /**

  140.  * Memory management control operation opcode.

  141.  */

  142. typedef enum MMCOOpcode{

  143.     MMCO_END=0,

  144.     MMCO_SHORT2UNUSED,

  145.     MMCO_LONG2UNUSED,

  146.     MMCO_SHORT2LONG,

  147.     MMCO_SET_MAX_LONG,

  148.     MMCO_RESET,

  149.     MMCO_LONG,

  150. } MMCOOpcode;

  151. 

  152. /**

  153.  * Memory management control operation.

  154.  */

  155. typedef struct MMCO{

  156.     MMCOOpcode opcode;

  157.     int short_frame_num;

  158.     int long_index;

  159. } MMCO;

  160. 

  161. /**

  162.  * H264Context

  163.  */

  164. typedef struct H264Context{

  165.     MpegEncContext s;

  166.     int nal_ref_idc;

  167.     int nal_unit_type;

  168.     uint8_t *rbsp_buffer;

  169.     unsigned int rbsp_buffer_size;

  170. 

  171.     /**

  172.       * Used to parse AVC variant of h264

  173.       */

  174.     int is_avc; ///< this flag is != 0 if codec is avc1

  175.     int got_avcC; ///< flag used to parse avcC data only once

  176.     int nal_length_size; ///< Number of bytes used for nal length (1, 2 or 4)

  177. 

  178.     int chroma_qp; //QPc

  179. 

  180.     int prev_mb_skipped;

  181.     int next_mb_skipped;

  182. 

  183.     //prediction stuff

  184.     int chroma_pred_mode;

  185.     int intra16x16_pred_mode;

  186. 

  187.     int top_mb_xy;

  188.     int left_mb_xy[2];

  189. 

  190.     int8_t intra4x4_pred_mode_cache[5*8];

  191.     int8_t (*intra4x4_pred_mode)[8];

  192.     void (*pred4x4  [9+3])(uint8_t *src, uint8_t *topright, int stride);//FIXME move to dsp?

  193.     void (*pred8x8l [9+3])(uint8_t *src, int topleft, int topright, int stride);

  194.     void (*pred8x8  [4+3])(uint8_t *src, int stride);

  195.     void (*pred16x16[4+3])(uint8_t *src, int stride);

  196.     unsigned int topleft_samples_available;

  197.     unsigned int top_samples_available;

  198.     unsigned int topright_samples_available;

  199.     unsigned int left_samples_available;

  200.     uint8_t (*top_borders[2])[16+2*8];

  201.     uint8_t left_border[2*(17+2*9)];

  202. 

  203.     /**

  204.      * non zero coeff count cache.

  205.      * is 64 if not available.

  206.      */

  207.     DECLARE_ALIGNED_8(uint8_t, non_zero_count_cache[6*8]);

  208.     uint8_t (*non_zero_count)[16];

  209. 

  210.     /**

  211.      * Motion vector cache.

  212.      */

  213.     DECLARE_ALIGNED_8(int16_t, mv_cache[2][5*8][2]);

  214.     DECLARE_ALIGNED_8(int8_t, ref_cache[2][5*8]);

  215. #define LIST_NOT_USED -1 //FIXME rename?

  216. #define PART_NOT_AVAILABLE -2

  217. 

  218.     /**

  219.      * is 1 if the specific list MV&references are set to 0,0,-2.

  220.      */

  221.     int mv_cache_clean[2];

  222. 

  223.     /**

  224.      * number of neighbors (top and/or left) that used 8x8 dct

  225.      */

  226.     int neighbor_transform_size;

  227. 

  228.     /**

  229.      * block_offset[ 0..23] for frame macroblocks

  230.      * block_offset[24..47] for field macroblocks

  231.      */

  232.     int block_offset[2*(16+8)];

  233. 

  234.     uint32_t *mb2b_xy; //FIXME are these 4 a good idea?

  235.     uint32_t *mb2b8_xy;

  236.     int b_stride; //FIXME use s->b4_stride

  237.     int b8_stride;

  238. 

  239.     int mb_linesize;   ///< may be equal to s->linesize or s->linesize*2, for mbaff

  240.     int mb_uvlinesize;

  241. 

  242.     int emu_edge_width;

  243.     int emu_edge_height;

  244. 

  245.     int halfpel_flag;

  246.     int thirdpel_flag;

  247. 

  248.     int unknown_svq3_flag;

  249.     int next_slice_index;

  250. 

  251.     SPS sps_buffer[MAX_SPS_COUNT];

  252.     SPS sps; ///< current sps

  253. 

  254.     PPS pps_buffer[MAX_PPS_COUNT];

  255.     /**

  256.      * current pps

  257.      */

  258.     PPS pps; //FIXME move to Picture perhaps? (->no) do we need that?

  259. 

  260.     uint32_t dequant4_buffer[6][52][16];

  261.     uint32_t dequant8_buffer[2][52][64];

  262.     uint32_t (*dequant4_coeff[6])[16];

  263.     uint32_t (*dequant8_coeff[2])[64];

  264.     int dequant_coeff_pps;     ///< reinit tables when pps changes

  265. 

  266.     int slice_num;

  267.     uint8_t *slice_table_base;

  268.     uint8_t *slice_table;      ///< slice_table_base + 2*mb_stride + 1

  269.     int slice_type;

  270.     int slice_type_fixed;

  271. 

  272.     //interlacing specific flags

  273.     int mb_aff_frame;

  274.     int mb_field_decoding_flag;

  275.     int mb_mbaff;              ///< mb_aff_frame && mb_field_decoding_flag

  276. 

  277.     int sub_mb_type[4];

  278. 

  279.     //POC stuff

  280.     int poc_lsb;

  281.     int poc_msb;

  282.     int delta_poc_bottom;

  283.     int delta_poc[2];

  284.     int frame_num;

  285.     int prev_poc_msb;             ///< poc_msb of the last reference pic for POC type 0

  286.     int prev_poc_lsb;             ///< poc_lsb of the last reference pic for POC type 0

  287.     int frame_num_offset;         ///< for POC type 2

  288.     int prev_frame_num_offset;    ///< for POC type 2

  289.     int prev_frame_num;           ///< frame_num of the last pic for POC type 1/2

  290. 

  291.     /**

  292.      * frame_num for frames or 2*frame_num for field pics.

  293.      */

  294.     int curr_pic_num;

  295. 

  296.     /**

  297.      * max_frame_num or 2*max_frame_num for field pics.

  298.      */

  299.     int max_pic_num;

  300. 

  301.     //Weighted pred stuff

  302.     int use_weight;

  303.     int use_weight_chroma;

  304.     int luma_log2_weight_denom;

  305.     int chroma_log2_weight_denom;

  306.     int luma_weight[2][48];

  307.     int luma_offset[2][48];

  308.     int chroma_weight[2][48][2];

  309.     int chroma_offset[2][48][2];

  310.     int implicit_weight[48][48];

  311. 

  312.     //deblock

  313.     int deblocking_filter;         ///< disable_deblocking_filter_idc with 1<->0

  314.     int slice_alpha_c0_offset;

  315.     int slice_beta_offset;

  316. 

  317.     int redundant_pic_count;

  318. 

  319.     int direct_spatial_mv_pred;

  320.     int dist_scale_factor[16];

  321.     int dist_scale_factor_field[32];

  322.     int map_col_to_list0[2][16];

  323.     int map_col_to_list0_field[2][32];

  324. 

  325.     /**

  326.      * num_ref_idx_l0/1_active_minus1 + 1

  327.      */

  328.     int ref_count[2];            ///< counts frames or fields, depending on current mb mode

  329.     Picture *short_ref[32];

  330.     Picture *long_ref[32];

  331.     Picture default_ref_list[2][32];

  332.     Picture ref_list[2][48];     ///< 0..15: frame refs, 16..47: mbaff field refs

  333.     Picture *delayed_pic[16]; //FIXME size?

  334.     Picture *delayed_output_pic;

  335. 

  336.     /**

  337.      * memory management control operations buffer.

  338.      */

  339.     MMCO mmco[MAX_MMCO_COUNT];

  340.     int mmco_index;

  341. 

  342.     int long_ref_count;  ///< number of actual long term references

  343.     int short_ref_count; ///< number of actual short term references

  344. 

  345.     //data partitioning

  346.     GetBitContext intra_gb;

  347.     GetBitContext inter_gb;

  348.     GetBitContext *intra_gb_ptr;

  349.     GetBitContext *inter_gb_ptr;

  350. 

  351.     DECLARE_ALIGNED_8(DCTELEM, mb[16*24]);

  352. 

  353.     /**

  354.      * Cabac

  355.      */

  356.     CABACContext cabac;

  357.     uint8_t      cabac_state[460];

  358.     int          cabac_init_idc;

  359. 

  360.     /* 0x100 -> non null luma_dc, 0x80/0x40 -> non null chroma_dc (cb/cr), 0x?0 -> chroma_cbp(0,1,2), 0x0? luma_cbp */

  361.     uint16_t     *cbp_table;

  362.     int cbp;

  363.     int top_cbp;

  364.     int left_cbp;

  365.     /* chroma_pred_mode for i4x4 or i16x16, else 0 */

  366.     uint8_t     *chroma_pred_mode_table;

  367.     int         last_qscale_diff;

  368.     int16_t     (*mvd_table[2])[2];

  369.     DECLARE_ALIGNED_8(int16_t, mvd_cache[2][5*8][2]);

  370.     uint8_t     *direct_table;

  371.     uint8_t     direct_cache[5*8];

  372. 

  373.     uint8_t zigzag_scan[16];

  374.     uint8_t zigzag_scan8x8[64];

  375.     uint8_t zigzag_scan8x8_cavlc[64];

  376.     uint8_t field_scan[16];

  377.     uint8_t field_scan8x8[64];

  378.     uint8_t field_scan8x8_cavlc[64];

  379.     const uint8_t *zigzag_scan_q0;

  380.     const uint8_t *zigzag_scan8x8_q0;

  381.     const uint8_t *zigzag_scan8x8_cavlc_q0;

  382.     const uint8_t *field_scan_q0;

  383.     const uint8_t *field_scan8x8_q0;

  384.     const uint8_t *field_scan8x8_cavlc_q0;

  385. 

  386.     int x264_build;

  387. }H264Context;

  388. 

  389. static VLC coeff_token_vlc[4];

  390. static VLC chroma_dc_coeff_token_vlc;

  391. 

  392. static VLC total_zeros_vlc[15];

  393. static VLC chroma_dc_total_zeros_vlc[3];

  394. 

  395. static VLC run_vlc[6];

  396. static VLC run7_vlc;

  397. 

  398. static void svq3_luma_dc_dequant_idct_c(DCTELEM *block, int qp);

  399. static void svq3_add_idct_c(uint8_t *dst, DCTELEM *block, int stride, int qp, int dc);

  400. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize);

  401. static void filter_mb_fast( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize);

  402. 

  403. static av_always_inline uint32_t pack16to32(int a, int b){

  404. #ifdef WORDS_BIGENDIAN

  405.    return (b&0xFFFF) + (a<<16);

  406. #else

  407.    return (a&0xFFFF) + (b<<16);

  408. #endif

  409. }

  410. 

  411. const uint8_t ff_rem6[52]={

  412. 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3,

  413. };

  414. 

  415. const uint8_t ff_div6[52]={

  416. 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8,

  417. };

  418. 

  419. 

  420. /**

  421.  * fill a rectangle.

  422.  * @param h height of the rectangle, should be a constant

  423.  * @param w width of the rectangle, should be a constant

  424.  * @param size the size of val (1 or 4), should be a constant

  425.  */

  426. static av_always_inline void fill_rectangle(void *vp, int w, int h, int stride, uint32_t val, int size){

  427.     uint8_t *p= (uint8_t*)vp;

  428.     assert(size==1 || size==4);

  429.     assert(w<=4);

  430. 

  431.     w      *= size;

  432.     stride *= size;

  433. 

  434.     assert((((long)vp)&(FFMIN(w, STRIDE_ALIGN)-1)) == 0);

  435.     assert((stride&(w-1))==0);

  436.     if(w==2){

  437.         const uint16_t v= size==4 ? val : val*0x0101;

  438.         *(uint16_t*)(p + 0*stride)= v;

  439.         if(h==1) return;

  440.         *(uint16_t*)(p + 1*stride)= v;

  441.         if(h==2) return;

  442.         *(uint16_t*)(p + 2*stride)=

  443.         *(uint16_t*)(p + 3*stride)= v;

  444.     }else if(w==4){

  445.         const uint32_t v= size==4 ? val : val*0x01010101;

  446.         *(uint32_t*)(p + 0*stride)= v;

  447.         if(h==1) return;

  448.         *(uint32_t*)(p + 1*stride)= v;

  449.         if(h==2) return;

  450.         *(uint32_t*)(p + 2*stride)=

  451.         *(uint32_t*)(p + 3*stride)= v;

  452.     }else if(w==8){

  453.     //gcc can't optimize 64bit math on x86_32

  454. #if defined(ARCH_X86_64) || (defined(MP_WORDSIZE) && MP_WORDSIZE >= 64)

  455.         const uint64_t v= val*0x0100000001ULL;

  456.         *(uint64_t*)(p + 0*stride)= v;

  457.         if(h==1) return;

  458.         *(uint64_t*)(p + 1*stride)= v;

  459.         if(h==2) return;

  460.         *(uint64_t*)(p + 2*stride)=

  461.         *(uint64_t*)(p + 3*stride)= v;

  462.     }else if(w==16){

  463.         const uint64_t v= val*0x0100000001ULL;

  464.         *(uint64_t*)(p + 0+0*stride)=

  465.         *(uint64_t*)(p + 8+0*stride)=

  466.         *(uint64_t*)(p + 0+1*stride)=

  467.         *(uint64_t*)(p + 8+1*stride)= v;

  468.         if(h==2) return;

  469.         *(uint64_t*)(p + 0+2*stride)=

  470.         *(uint64_t*)(p + 8+2*stride)=

  471.         *(uint64_t*)(p + 0+3*stride)=

  472.         *(uint64_t*)(p + 8+3*stride)= v;

  473. #else

  474.         *(uint32_t*)(p + 0+0*stride)=

  475.         *(uint32_t*)(p + 4+0*stride)= val;

  476.         if(h==1) return;

  477.         *(uint32_t*)(p + 0+1*stride)=

  478.         *(uint32_t*)(p + 4+1*stride)= val;

  479.         if(h==2) return;

  480.         *(uint32_t*)(p + 0+2*stride)=

  481.         *(uint32_t*)(p + 4+2*stride)=

  482.         *(uint32_t*)(p + 0+3*stride)=

  483.         *(uint32_t*)(p + 4+3*stride)= val;

  484.     }else if(w==16){

  485.         *(uint32_t*)(p + 0+0*stride)=

  486.         *(uint32_t*)(p + 4+0*stride)=

  487.         *(uint32_t*)(p + 8+0*stride)=

  488.         *(uint32_t*)(p +12+0*stride)=

  489.         *(uint32_t*)(p + 0+1*stride)=

  490.         *(uint32_t*)(p + 4+1*stride)=

  491.         *(uint32_t*)(p + 8+1*stride)=

  492.         *(uint32_t*)(p +12+1*stride)= val;

  493.         if(h==2) return;

  494.         *(uint32_t*)(p + 0+2*stride)=

  495.         *(uint32_t*)(p + 4+2*stride)=

  496.         *(uint32_t*)(p + 8+2*stride)=

  497.         *(uint32_t*)(p +12+2*stride)=

  498.         *(uint32_t*)(p + 0+3*stride)=

  499.         *(uint32_t*)(p + 4+3*stride)=

  500.         *(uint32_t*)(p + 8+3*stride)=

  501.         *(uint32_t*)(p +12+3*stride)= val;

  502. #endif

  503.     }else

  504.         assert(0);

  505.     assert(h==4);

  506. }

  507. 

  508. static void fill_caches(H264Context *h, int mb_type, int for_deblock){

  509.     MpegEncContext * const s = &h->s;

  510.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  511.     int topleft_xy, top_xy, topright_xy, left_xy[2];

  512.     int topleft_type, top_type, topright_type, left_type[2];

  513.     int left_block[8];

  514.     int i;

  515. 

  516.     //FIXME deblocking could skip the intra and nnz parts.

  517.     if(for_deblock && (h->slice_num == 1 || h->slice_table[mb_xy] == h->slice_table[mb_xy-s->mb_stride]) && !FRAME_MBAFF)

  518.         return;

  519. 

  520.     //wow what a mess, why didn't they simplify the interlacing&intra stuff, i can't imagine that these complex rules are worth it

  521. 

  522.     top_xy     = mb_xy  - s->mb_stride;

  523.     topleft_xy = top_xy - 1;

  524.     topright_xy= top_xy + 1;

  525.     left_xy[1] = left_xy[0] = mb_xy-1;

  526.     left_block[0]= 0;

  527.     left_block[1]= 1;

  528.     left_block[2]= 2;

  529.     left_block[3]= 3;

  530.     left_block[4]= 7;

  531.     left_block[5]= 10;

  532.     left_block[6]= 8;

  533.     left_block[7]= 11;

  534.     if(FRAME_MBAFF){

  535.         const int pair_xy          = s->mb_x     + (s->mb_y & ~1)*s->mb_stride;

  536.         const int top_pair_xy      = pair_xy     - s->mb_stride;

  537.         const int topleft_pair_xy  = top_pair_xy - 1;

  538.         const int topright_pair_xy = top_pair_xy + 1;

  539.         const int topleft_mb_frame_flag  = !IS_INTERLACED(s->current_picture.mb_type[topleft_pair_xy]);

  540.         const int top_mb_frame_flag      = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);

  541.         const int topright_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[topright_pair_xy]);

  542.         const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);

  543.         const int curr_mb_frame_flag = !IS_INTERLACED(mb_type);

  544.         const int bottom = (s->mb_y & 1);

  545.         tprintf("fill_caches: curr_mb_frame_flag:%d, left_mb_frame_flag:%d, topleft_mb_frame_flag:%d, top_mb_frame_flag:%d, topright_mb_frame_flag:%d\n", curr_mb_frame_flag, left_mb_frame_flag, topleft_mb_frame_flag, top_mb_frame_flag, topright_mb_frame_flag);

  546.         if (bottom

  547.                 ? !curr_mb_frame_flag // bottom macroblock

  548.                 : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock

  549.                 ) {

  550.             top_xy -= s->mb_stride;

  551.         }

  552.         if (bottom

  553.                 ? !curr_mb_frame_flag // bottom macroblock

  554.                 : (!curr_mb_frame_flag && !topleft_mb_frame_flag) // top macroblock

  555.                 ) {

  556.             topleft_xy -= s->mb_stride;

  557.         }

  558.         if (bottom

  559.                 ? !curr_mb_frame_flag // bottom macroblock

  560.                 : (!curr_mb_frame_flag && !topright_mb_frame_flag) // top macroblock

  561.                 ) {

  562.             topright_xy -= s->mb_stride;

  563.         }

  564.         if (left_mb_frame_flag != curr_mb_frame_flag) {

  565.             left_xy[1] = left_xy[0] = pair_xy - 1;

  566.             if (curr_mb_frame_flag) {

  567.                 if (bottom) {

  568.                     left_block[0]= 2;

  569.                     left_block[1]= 2;

  570.                     left_block[2]= 3;

  571.                     left_block[3]= 3;

  572.                     left_block[4]= 8;

  573.                     left_block[5]= 11;

  574.                     left_block[6]= 8;

  575.                     left_block[7]= 11;

  576.                 } else {

  577.                     left_block[0]= 0;

  578.                     left_block[1]= 0;

  579.                     left_block[2]= 1;

  580.                     left_block[3]= 1;

  581.                     left_block[4]= 7;

  582.                     left_block[5]= 10;

  583.                     left_block[6]= 7;

  584.                     left_block[7]= 10;

  585.                 }

  586.             } else {

  587.                 left_xy[1] += s->mb_stride;

  588.                 //left_block[0]= 0;

  589.                 left_block[1]= 2;

  590.                 left_block[2]= 0;

  591.                 left_block[3]= 2;

  592.                 //left_block[4]= 7;

  593.                 left_block[5]= 10;

  594.                 left_block[6]= 7;

  595.                 left_block[7]= 10;

  596.             }

  597.         }

  598.     }

  599. 

  600.     h->top_mb_xy = top_xy;

  601.     h->left_mb_xy[0] = left_xy[0];

  602.     h->left_mb_xy[1] = left_xy[1];

  603.     if(for_deblock){

  604.         topleft_type = 0;

  605.         topright_type = 0;

  606.         top_type     = h->slice_table[top_xy     ] < 255 ? s->current_picture.mb_type[top_xy]     : 0;

  607.         left_type[0] = h->slice_table[left_xy[0] ] < 255 ? s->current_picture.mb_type[left_xy[0]] : 0;

  608.         left_type[1] = h->slice_table[left_xy[1] ] < 255 ? s->current_picture.mb_type[left_xy[1]] : 0;

  609. 

  610.         if(FRAME_MBAFF && !IS_INTRA(mb_type)){

  611.             int list;

  612.             int v = *(uint16_t*)&h->non_zero_count[mb_xy][14];

  613.             for(i=0; i<16; i++)

  614.                 h->non_zero_count_cache[scan8[i]] = (v>>i)&1;

  615.             for(list=0; list<1+(h->slice_type==B_TYPE); list++){

  616.                 if(USES_LIST(mb_type,list)){

  617.                     uint32_t *src = (uint32_t*)s->current_picture.motion_val[list][h->mb2b_xy[mb_xy]];

  618.                     uint32_t *dst = (uint32_t*)h->mv_cache[list][scan8[0]];

  619.                     int8_t *ref = &s->current_picture.ref_index[list][h->mb2b8_xy[mb_xy]];

  620.                     for(i=0; i<4; i++, dst+=8, src+=h->b_stride){

  621.                         dst[0] = src[0];

  622.                         dst[1] = src[1];

  623.                         dst[2] = src[2];

  624.                         dst[3] = src[3];

  625.                     }

  626.                     *(uint32_t*)&h->ref_cache[list][scan8[ 0]] =

  627.                     *(uint32_t*)&h->ref_cache[list][scan8[ 2]] = pack16to32(ref[0],ref[1])*0x0101;

  628.                     ref += h->b8_stride;

  629.                     *(uint32_t*)&h->ref_cache[list][scan8[ 8]] =

  630.                     *(uint32_t*)&h->ref_cache[list][scan8[10]] = pack16to32(ref[0],ref[1])*0x0101;

  631.                 }else{

  632.                     fill_rectangle(&h-> mv_cache[list][scan8[ 0]], 4, 4, 8, 0, 4);

  633.                     fill_rectangle(&h->ref_cache[list][scan8[ 0]], 4, 4, 8, (uint8_t)LIST_NOT_USED, 1);

  634.                 }

  635.             }

  636.         }

  637.     }else{

  638.         topleft_type = h->slice_table[topleft_xy ] == h->slice_num ? s->current_picture.mb_type[topleft_xy] : 0;

  639.         top_type     = h->slice_table[top_xy     ] == h->slice_num ? s->current_picture.mb_type[top_xy]     : 0;

  640.         topright_type= h->slice_table[topright_xy] == h->slice_num ? s->current_picture.mb_type[topright_xy]: 0;

  641.         left_type[0] = h->slice_table[left_xy[0] ] == h->slice_num ? s->current_picture.mb_type[left_xy[0]] : 0;

  642.         left_type[1] = h->slice_table[left_xy[1] ] == h->slice_num ? s->current_picture.mb_type[left_xy[1]] : 0;

  643.     }

  644. 

  645.     if(IS_INTRA(mb_type)){

  646.         h->topleft_samples_available=

  647.         h->top_samples_available=

  648.         h->left_samples_available= 0xFFFF;

  649.         h->topright_samples_available= 0xEEEA;

  650. 

  651.         if(!IS_INTRA(top_type) && (top_type==0 || h->pps.constrained_intra_pred)){

  652.             h->topleft_samples_available= 0xB3FF;

  653.             h->top_samples_available= 0x33FF;

  654.             h->topright_samples_available= 0x26EA;

  655.         }

  656.         for(i=0; i<2; i++){

  657.             if(!IS_INTRA(left_type[i]) && (left_type[i]==0 || h->pps.constrained_intra_pred)){

  658.                 h->topleft_samples_available&= 0xDF5F;

  659.                 h->left_samples_available&= 0x5F5F;

  660.             }

  661.         }

  662. 

  663.         if(!IS_INTRA(topleft_type) && (topleft_type==0 || h->pps.constrained_intra_pred))

  664.             h->topleft_samples_available&= 0x7FFF;

  665. 

  666.         if(!IS_INTRA(topright_type) && (topright_type==0 || h->pps.constrained_intra_pred))

  667.             h->topright_samples_available&= 0xFBFF;

  668. 

  669.         if(IS_INTRA4x4(mb_type)){

  670.             if(IS_INTRA4x4(top_type)){

  671.                 h->intra4x4_pred_mode_cache[4+8*0]= h->intra4x4_pred_mode[top_xy][4];

  672.                 h->intra4x4_pred_mode_cache[5+8*0]= h->intra4x4_pred_mode[top_xy][5];

  673.                 h->intra4x4_pred_mode_cache[6+8*0]= h->intra4x4_pred_mode[top_xy][6];

  674.                 h->intra4x4_pred_mode_cache[7+8*0]= h->intra4x4_pred_mode[top_xy][3];

  675.             }else{

  676.                 int pred;

  677.                 if(!top_type || (IS_INTER(top_type) && h->pps.constrained_intra_pred))

  678.                     pred= -1;

  679.                 else{

  680.                     pred= 2;

  681.                 }

  682.                 h->intra4x4_pred_mode_cache[4+8*0]=

  683.                 h->intra4x4_pred_mode_cache[5+8*0]=

  684.                 h->intra4x4_pred_mode_cache[6+8*0]=

  685.                 h->intra4x4_pred_mode_cache[7+8*0]= pred;

  686.             }

  687.             for(i=0; i<2; i++){

  688.                 if(IS_INTRA4x4(left_type[i])){

  689.                     h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[0+2*i]];

  690.                     h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= h->intra4x4_pred_mode[left_xy[i]][left_block[1+2*i]];

  691.                 }else{

  692.                     int pred;

  693.                     if(!left_type[i] || (IS_INTER(left_type[i]) && h->pps.constrained_intra_pred))

  694.                         pred= -1;

  695.                     else{

  696.                         pred= 2;

  697.                     }

  698.                     h->intra4x4_pred_mode_cache[3+8*1 + 2*8*i]=

  699.                     h->intra4x4_pred_mode_cache[3+8*2 + 2*8*i]= pred;

  700.                 }

  701.             }

  702.         }

  703.     }

  704. 

  705. 

  706. /*

  707. 0 . T T. T T T T

  708. 1 L . .L . . . .

  709. 2 L . .L . . . .

  710. 3 . T TL . . . .

  711. 4 L . .L . . . .

  712. 5 L . .. . . . .

  713. */

  714. //FIXME constraint_intra_pred & partitioning & nnz (lets hope this is just a typo in the spec)

  715.     if(top_type){

  716.         h->non_zero_count_cache[4+8*0]= h->non_zero_count[top_xy][4];

  717.         h->non_zero_count_cache[5+8*0]= h->non_zero_count[top_xy][5];

  718.         h->non_zero_count_cache[6+8*0]= h->non_zero_count[top_xy][6];

  719.         h->non_zero_count_cache[7+8*0]= h->non_zero_count[top_xy][3];

  720. 

  721.         h->non_zero_count_cache[1+8*0]= h->non_zero_count[top_xy][9];

  722.         h->non_zero_count_cache[2+8*0]= h->non_zero_count[top_xy][8];

  723. 

  724.         h->non_zero_count_cache[1+8*3]= h->non_zero_count[top_xy][12];

  725.         h->non_zero_count_cache[2+8*3]= h->non_zero_count[top_xy][11];

  726. 

  727.     }else{

  728.         h->non_zero_count_cache[4+8*0]=

  729.         h->non_zero_count_cache[5+8*0]=

  730.         h->non_zero_count_cache[6+8*0]=

  731.         h->non_zero_count_cache[7+8*0]=

  732. 

  733.         h->non_zero_count_cache[1+8*0]=

  734.         h->non_zero_count_cache[2+8*0]=

  735. 

  736.         h->non_zero_count_cache[1+8*3]=

  737.         h->non_zero_count_cache[2+8*3]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;

  738. 

  739.     }

  740. 

  741.     for (i=0; i<2; i++) {

  742.         if(left_type[i]){

  743.             h->non_zero_count_cache[3+8*1 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[0+2*i]];

  744.             h->non_zero_count_cache[3+8*2 + 2*8*i]= h->non_zero_count[left_xy[i]][left_block[1+2*i]];

  745.             h->non_zero_count_cache[0+8*1 +   8*i]= h->non_zero_count[left_xy[i]][left_block[4+2*i]];

  746.             h->non_zero_count_cache[0+8*4 +   8*i]= h->non_zero_count[left_xy[i]][left_block[5+2*i]];

  747.         }else{

  748.             h->non_zero_count_cache[3+8*1 + 2*8*i]=

  749.             h->non_zero_count_cache[3+8*2 + 2*8*i]=

  750.             h->non_zero_count_cache[0+8*1 +   8*i]=

  751.             h->non_zero_count_cache[0+8*4 +   8*i]= h->pps.cabac && !IS_INTRA(mb_type) ? 0 : 64;

  752.         }

  753.     }

  754. 

  755.     if( h->pps.cabac ) {

  756.         // top_cbp

  757.         if(top_type) {

  758.             h->top_cbp = h->cbp_table[top_xy];

  759.         } else if(IS_INTRA(mb_type)) {

  760.             h->top_cbp = 0x1C0;

  761.         } else {

  762.             h->top_cbp = 0;

  763.         }

  764.         // left_cbp

  765.         if (left_type[0]) {

  766.             h->left_cbp = h->cbp_table[left_xy[0]] & 0x1f0;

  767.         } else if(IS_INTRA(mb_type)) {

  768.             h->left_cbp = 0x1C0;

  769.         } else {

  770.             h->left_cbp = 0;

  771.         }

  772.         if (left_type[0]) {

  773.             h->left_cbp |= ((h->cbp_table[left_xy[0]]>>((left_block[0]&(~1))+1))&0x1) << 1;

  774.         }

  775.         if (left_type[1]) {

  776.             h->left_cbp |= ((h->cbp_table[left_xy[1]]>>((left_block[2]&(~1))+1))&0x1) << 3;

  777.         }

  778.     }

  779. 

  780. #if 1

  781.     if(IS_INTER(mb_type) || IS_DIRECT(mb_type)){

  782.         int list;

  783.         for(list=0; list<1+(h->slice_type==B_TYPE); list++){

  784.             if(!USES_LIST(mb_type, list) && !IS_DIRECT(mb_type) && !h->deblocking_filter){

  785.                 /*if(!h->mv_cache_clean[list]){

  786.                     memset(h->mv_cache [list],  0, 8*5*2*sizeof(int16_t)); //FIXME clean only input? clean at all?

  787.                     memset(h->ref_cache[list], PART_NOT_AVAILABLE, 8*5*sizeof(int8_t));

  788.                     h->mv_cache_clean[list]= 1;

  789.                 }*/

  790.                 continue;

  791.             }

  792.             h->mv_cache_clean[list]= 0;

  793. 

  794.             if(USES_LIST(top_type, list)){

  795.                 const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;

  796.                 const int b8_xy= h->mb2b8_xy[top_xy] + h->b8_stride;

  797.                 *(uint32_t*)h->mv_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 0];

  798.                 *(uint32_t*)h->mv_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 1];

  799.                 *(uint32_t*)h->mv_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 2];

  800.                 *(uint32_t*)h->mv_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy + 3];

  801.                 h->ref_cache[list][scan8[0] + 0 - 1*8]=

  802.                 h->ref_cache[list][scan8[0] + 1 - 1*8]= s->current_picture.ref_index[list][b8_xy + 0];

  803.                 h->ref_cache[list][scan8[0] + 2 - 1*8]=

  804.                 h->ref_cache[list][scan8[0] + 3 - 1*8]= s->current_picture.ref_index[list][b8_xy + 1];

  805.             }else{

  806.                 *(uint32_t*)h->mv_cache [list][scan8[0] + 0 - 1*8]=

  807.                 *(uint32_t*)h->mv_cache [list][scan8[0] + 1 - 1*8]=

  808.                 *(uint32_t*)h->mv_cache [list][scan8[0] + 2 - 1*8]=

  809.                 *(uint32_t*)h->mv_cache [list][scan8[0] + 3 - 1*8]= 0;

  810.                 *(uint32_t*)&h->ref_cache[list][scan8[0] + 0 - 1*8]= ((top_type ? LIST_NOT_USED : PART_NOT_AVAILABLE)&0xFF)*0x01010101;

  811.             }

  812. 

  813.             //FIXME unify cleanup or sth

  814.             if(USES_LIST(left_type[0], list)){

  815.                 const int b_xy= h->mb2b_xy[left_xy[0]] + 3;

  816.                 const int b8_xy= h->mb2b8_xy[left_xy[0]] + 1;

  817.                 *(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]];

  818.                 *(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]];

  819.                 h->ref_cache[list][scan8[0] - 1 + 0*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[0]>>1)];

  820.                 h->ref_cache[list][scan8[0] - 1 + 1*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[1]>>1)];

  821.             }else{

  822.                 *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 0*8]=

  823.                 *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 1*8]= 0;

  824.                 h->ref_cache[list][scan8[0] - 1 + 0*8]=

  825.                 h->ref_cache[list][scan8[0] - 1 + 1*8]= left_type[0] ? LIST_NOT_USED : PART_NOT_AVAILABLE;

  826.             }

  827. 

  828.             if(USES_LIST(left_type[1], list)){

  829.                 const int b_xy= h->mb2b_xy[left_xy[1]] + 3;

  830.                 const int b8_xy= h->mb2b8_xy[left_xy[1]] + 1;

  831.                 *(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]];

  832.                 *(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]];

  833.                 h->ref_cache[list][scan8[0] - 1 + 2*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[2]>>1)];

  834.                 h->ref_cache[list][scan8[0] - 1 + 3*8]= s->current_picture.ref_index[list][b8_xy + h->b8_stride*(left_block[3]>>1)];

  835.             }else{

  836.                 *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 2*8]=

  837.                 *(uint32_t*)h->mv_cache [list][scan8[0] - 1 + 3*8]= 0;

  838.                 h->ref_cache[list][scan8[0] - 1 + 2*8]=

  839.                 h->ref_cache[list][scan8[0] - 1 + 3*8]= left_type[0] ? LIST_NOT_USED : PART_NOT_AVAILABLE;

  840.                 assert((!left_type[0]) == (!left_type[1]));

  841.             }

  842. 

  843.             if((for_deblock || (IS_DIRECT(mb_type) && !h->direct_spatial_mv_pred)) && !FRAME_MBAFF)

  844.                 continue;

  845. 

  846.             if(USES_LIST(topleft_type, list)){

  847.                 const int b_xy = h->mb2b_xy[topleft_xy] + 3 + 3*h->b_stride;

  848.                 const int b8_xy= h->mb2b8_xy[topleft_xy] + 1 + h->b8_stride;

  849.                 *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];

  850.                 h->ref_cache[list][scan8[0] - 1 - 1*8]= s->current_picture.ref_index[list][b8_xy];

  851.             }else{

  852.                 *(uint32_t*)h->mv_cache[list][scan8[0] - 1 - 1*8]= 0;

  853.                 h->ref_cache[list][scan8[0] - 1 - 1*8]= topleft_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;

  854.             }

  855. 

  856.             if(USES_LIST(topright_type, list)){

  857.                 const int b_xy= h->mb2b_xy[topright_xy] + 3*h->b_stride;

  858.                 const int b8_xy= h->mb2b8_xy[topright_xy] + h->b8_stride;

  859.                 *(uint32_t*)h->mv_cache[list][scan8[0] + 4 - 1*8]= *(uint32_t*)s->current_picture.motion_val[list][b_xy];

  860.                 h->ref_cache[list][scan8[0] + 4 - 1*8]= s->current_picture.ref_index[list][b8_xy];

  861.             }else{

  862.                 *(uint32_t*)h->mv_cache [list][scan8[0] + 4 - 1*8]= 0;

  863.                 h->ref_cache[list][scan8[0] + 4 - 1*8]= topright_type ? LIST_NOT_USED : PART_NOT_AVAILABLE;

  864.             }

  865. 

  866.             if((IS_SKIP(mb_type) || IS_DIRECT(mb_type)) && !FRAME_MBAFF)

  867.                 continue;

  868. 

  869.             h->ref_cache[list][scan8[5 ]+1] =

  870.             h->ref_cache[list][scan8[7 ]+1] =

  871.             h->ref_cache[list][scan8[13]+1] =  //FIXME remove past 3 (init somewhere else)

  872.             h->ref_cache[list][scan8[4 ]] =

  873.             h->ref_cache[list][scan8[12]] = PART_NOT_AVAILABLE;

  874.             *(uint32_t*)h->mv_cache [list][scan8[5 ]+1]=

  875.             *(uint32_t*)h->mv_cache [list][scan8[7 ]+1]=

  876.             *(uint32_t*)h->mv_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)

  877.             *(uint32_t*)h->mv_cache [list][scan8[4 ]]=

  878.             *(uint32_t*)h->mv_cache [list][scan8[12]]= 0;

  879. 

  880.             if( h->pps.cabac ) {

  881.                 /* XXX beurk, Load mvd */

  882.                 if(USES_LIST(top_type, list)){

  883.                     const int b_xy= h->mb2b_xy[top_xy] + 3*h->b_stride;

  884.                     *(uint32_t*)h->mvd_cache[list][scan8[0] + 0 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 0];

  885.                     *(uint32_t*)h->mvd_cache[list][scan8[0] + 1 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 1];

  886.                     *(uint32_t*)h->mvd_cache[list][scan8[0] + 2 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 2];

  887.                     *(uint32_t*)h->mvd_cache[list][scan8[0] + 3 - 1*8]= *(uint32_t*)h->mvd_table[list][b_xy + 3];

  888.                 }else{

  889.                     *(uint32_t*)h->mvd_cache [list][scan8[0] + 0 - 1*8]=

  890.                     *(uint32_t*)h->mvd_cache [list][scan8[0] + 1 - 1*8]=

  891.                     *(uint32_t*)h->mvd_cache [list][scan8[0] + 2 - 1*8]=

  892.                     *(uint32_t*)h->mvd_cache [list][scan8[0] + 3 - 1*8]= 0;

  893.                 }

  894.                 if(USES_LIST(left_type[0], list)){

  895.                     const int b_xy= h->mb2b_xy[left_xy[0]] + 3;

  896.                     *(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]];

  897.                     *(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]];

  898.                 }else{

  899.                     *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 0*8]=

  900.                     *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 1*8]= 0;

  901.                 }

  902.                 if(USES_LIST(left_type[1], list)){

  903.                     const int b_xy= h->mb2b_xy[left_xy[1]] + 3;

  904.                     *(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]];

  905.                     *(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]];

  906.                 }else{

  907.                     *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 2*8]=

  908.                     *(uint32_t*)h->mvd_cache [list][scan8[0] - 1 + 3*8]= 0;

  909.                 }

  910.                 *(uint32_t*)h->mvd_cache [list][scan8[5 ]+1]=

  911.                 *(uint32_t*)h->mvd_cache [list][scan8[7 ]+1]=

  912.                 *(uint32_t*)h->mvd_cache [list][scan8[13]+1]= //FIXME remove past 3 (init somewhere else)

  913.                 *(uint32_t*)h->mvd_cache [list][scan8[4 ]]=

  914.                 *(uint32_t*)h->mvd_cache [list][scan8[12]]= 0;

  915. 

  916.                 if(h->slice_type == B_TYPE){

  917.                     fill_rectangle(&h->direct_cache[scan8[0]], 4, 4, 8, 0, 1);

  918. 

  919.                     if(IS_DIRECT(top_type)){

  920.                         *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0x01010101;

  921.                     }else if(IS_8X8(top_type)){

  922.                         int b8_xy = h->mb2b8_xy[top_xy] + h->b8_stride;

  923.                         h->direct_cache[scan8[0] + 0 - 1*8]= h->direct_table[b8_xy];

  924.                         h->direct_cache[scan8[0] + 2 - 1*8]= h->direct_table[b8_xy + 1];

  925.                     }else{

  926.                         *(uint32_t*)&h->direct_cache[scan8[0] - 1*8]= 0;

  927.                     }

  928. 

  929.                     if(IS_DIRECT(left_type[0]))

  930.                         h->direct_cache[scan8[0] - 1 + 0*8]= 1;

  931.                     else if(IS_8X8(left_type[0]))

  932.                         h->direct_cache[scan8[0] - 1 + 0*8]= h->direct_table[h->mb2b8_xy[left_xy[0]] + 1 + h->b8_stride*(left_block[0]>>1)];

  933.                     else

  934.                         h->direct_cache[scan8[0] - 1 + 0*8]= 0;

  935. 

  936.                     if(IS_DIRECT(left_type[1]))

  937.                         h->direct_cache[scan8[0] - 1 + 2*8]= 1;

  938.                     else if(IS_8X8(left_type[1]))

  939.                         h->direct_cache[scan8[0] - 1 + 2*8]= h->direct_table[h->mb2b8_xy[left_xy[1]] + 1 + h->b8_stride*(left_block[2]>>1)];

  940.                     else

  941.                         h->direct_cache[scan8[0] - 1 + 2*8]= 0;

  942.                 }

  943.             }

  944. 

  945.             if(FRAME_MBAFF){

  946. #define MAP_MVS\

  947.                     MAP_F2F(scan8[0] - 1 - 1*8, topleft_type)\

  948.                     MAP_F2F(scan8[0] + 0 - 1*8, top_type)\

  949.                     MAP_F2F(scan8[0] + 1 - 1*8, top_type)\

  950.                     MAP_F2F(scan8[0] + 2 - 1*8, top_type)\

  951.                     MAP_F2F(scan8[0] + 3 - 1*8, top_type)\

  952.                     MAP_F2F(scan8[0] + 4 - 1*8, topright_type)\

  953.                     MAP_F2F(scan8[0] - 1 + 0*8, left_type[0])\

  954.                     MAP_F2F(scan8[0] - 1 + 1*8, left_type[0])\

  955.                     MAP_F2F(scan8[0] - 1 + 2*8, left_type[1])\

  956.                     MAP_F2F(scan8[0] - 1 + 3*8, left_type[1])

  957.                 if(MB_FIELD){

  958. #define MAP_F2F(idx, mb_type)\

  959.                     if(!IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\

  960.                         h->ref_cache[list][idx] <<= 1;\

  961.                         h->mv_cache[list][idx][1] /= 2;\

  962.                         h->mvd_cache[list][idx][1] /= 2;\

  963.                     }

  964.                     MAP_MVS

  965. #undef MAP_F2F

  966.                 }else{

  967. #define MAP_F2F(idx, mb_type)\

  968.                     if(IS_INTERLACED(mb_type) && h->ref_cache[list][idx] >= 0){\

  969.                         h->ref_cache[list][idx] >>= 1;\

  970.                         h->mv_cache[list][idx][1] <<= 1;\

  971.                         h->mvd_cache[list][idx][1] <<= 1;\

  972.                     }

  973.                     MAP_MVS

  974. #undef MAP_F2F

  975.                 }

  976.             }

  977.         }

  978.     }

  979. #endif

  980. 

  981.     h->neighbor_transform_size= !!IS_8x8DCT(top_type) + !!IS_8x8DCT(left_type[0]);

  982. }

  983. 

  984. static inline void write_back_intra_pred_mode(H264Context *h){

  985.     MpegEncContext * const s = &h->s;

  986.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  987. 

  988.     h->intra4x4_pred_mode[mb_xy][0]= h->intra4x4_pred_mode_cache[7+8*1];

  989.     h->intra4x4_pred_mode[mb_xy][1]= h->intra4x4_pred_mode_cache[7+8*2];

  990.     h->intra4x4_pred_mode[mb_xy][2]= h->intra4x4_pred_mode_cache[7+8*3];

  991.     h->intra4x4_pred_mode[mb_xy][3]= h->intra4x4_pred_mode_cache[7+8*4];

  992.     h->intra4x4_pred_mode[mb_xy][4]= h->intra4x4_pred_mode_cache[4+8*4];

  993.     h->intra4x4_pred_mode[mb_xy][5]= h->intra4x4_pred_mode_cache[5+8*4];

  994.     h->intra4x4_pred_mode[mb_xy][6]= h->intra4x4_pred_mode_cache[6+8*4];

  995. }

  996. 

  997. /**

  998.  * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.

  999.  */

  1000. static inline int check_intra4x4_pred_mode(H264Context *h){

  1001.     MpegEncContext * const s = &h->s;

  1002.     static const int8_t top [12]= {-1, 0,LEFT_DC_PRED,-1,-1,-1,-1,-1, 0};

  1003.     static const int8_t left[12]= { 0,-1, TOP_DC_PRED, 0,-1,-1,-1, 0,-1,DC_128_PRED};

  1004.     int i;

  1005. 

  1006.     if(!(h->top_samples_available&0x8000)){

  1007.         for(i=0; i<4; i++){

  1008.             int status= top[ h->intra4x4_pred_mode_cache[scan8[0] + i] ];

  1009.             if(status<0){

  1010.                 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);

  1011.                 return -1;

  1012.             } else if(status){

  1013.                 h->intra4x4_pred_mode_cache[scan8[0] + i]= status;

  1014.             }

  1015.         }

  1016.     }

  1017. 

  1018.     if(!(h->left_samples_available&0x8000)){

  1019.         for(i=0; i<4; i++){

  1020.             int status= left[ h->intra4x4_pred_mode_cache[scan8[0] + 8*i] ];

  1021.             if(status<0){

  1022.                 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);

  1023.                 return -1;

  1024.             } else if(status){

  1025.                 h->intra4x4_pred_mode_cache[scan8[0] + 8*i]= status;

  1026.             }

  1027.         }

  1028.     }

  1029. 

  1030.     return 0;

  1031. } //FIXME cleanup like next

  1032. 

  1033. /**

  1034.  * checks if the top & left blocks are available if needed & changes the dc mode so it only uses the available blocks.

  1035.  */

  1036. static inline int check_intra_pred_mode(H264Context *h, int mode){

  1037.     MpegEncContext * const s = &h->s;

  1038.     static const int8_t top [7]= {LEFT_DC_PRED8x8, 1,-1,-1};

  1039.     static const int8_t left[7]= { TOP_DC_PRED8x8,-1, 2,-1,DC_128_PRED8x8};

  1040. 

  1041.     if(mode < 0 || mode > 6) {

  1042.         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);

  1043.         return -1;

  1044.     }

  1045. 

  1046.     if(!(h->top_samples_available&0x8000)){

  1047.         mode= top[ mode ];

  1048.         if(mode<0){

  1049.             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);

  1050.             return -1;

  1051.         }

  1052.     }

  1053. 

  1054.     if(!(h->left_samples_available&0x8000)){

  1055.         mode= left[ mode ];

  1056.         if(mode<0){

  1057.             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);

  1058.             return -1;

  1059.         }

  1060.     }

  1061. 

  1062.     return mode;

  1063. }

  1064. 

  1065. /**

  1066.  * gets the predicted intra4x4 prediction mode.

  1067.  */

  1068. static inline int pred_intra_mode(H264Context *h, int n){

  1069.     const int index8= scan8[n];

  1070.     const int left= h->intra4x4_pred_mode_cache[index8 - 1];

  1071.     const int top = h->intra4x4_pred_mode_cache[index8 - 8];

  1072.     const int min= FFMIN(left, top);

  1073. 

  1074.     tprintf("mode:%d %d min:%d\n", left ,top, min);

  1075. 

  1076.     if(min<0) return DC_PRED;

  1077.     else      return min;

  1078. }

  1079. 

  1080. static inline void write_back_non_zero_count(H264Context *h){

  1081.     MpegEncContext * const s = &h->s;

  1082.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  1083. 

  1084.     h->non_zero_count[mb_xy][0]= h->non_zero_count_cache[7+8*1];

  1085.     h->non_zero_count[mb_xy][1]= h->non_zero_count_cache[7+8*2];

  1086.     h->non_zero_count[mb_xy][2]= h->non_zero_count_cache[7+8*3];

  1087.     h->non_zero_count[mb_xy][3]= h->non_zero_count_cache[7+8*4];

  1088.     h->non_zero_count[mb_xy][4]= h->non_zero_count_cache[4+8*4];

  1089.     h->non_zero_count[mb_xy][5]= h->non_zero_count_cache[5+8*4];

  1090.     h->non_zero_count[mb_xy][6]= h->non_zero_count_cache[6+8*4];

  1091. 

  1092.     h->non_zero_count[mb_xy][9]= h->non_zero_count_cache[1+8*2];

  1093.     h->non_zero_count[mb_xy][8]= h->non_zero_count_cache[2+8*2];

  1094.     h->non_zero_count[mb_xy][7]= h->non_zero_count_cache[2+8*1];

  1095. 

  1096.     h->non_zero_count[mb_xy][12]=h->non_zero_count_cache[1+8*5];

  1097.     h->non_zero_count[mb_xy][11]=h->non_zero_count_cache[2+8*5];

  1098.     h->non_zero_count[mb_xy][10]=h->non_zero_count_cache[2+8*4];

  1099. 

  1100.     if(FRAME_MBAFF){

  1101.         // store all luma nnzs, for deblocking

  1102.         int v = 0, i;

  1103.         for(i=0; i<16; i++)

  1104.             v += (!!h->non_zero_count_cache[scan8[i]]) << i;

  1105.         *(uint16_t*)&h->non_zero_count[mb_xy][14] = v;

  1106.     }

  1107. }

  1108. 

  1109. /**

  1110.  * gets the predicted number of non zero coefficients.

  1111.  * @param n block index

  1112.  */

  1113. static inline int pred_non_zero_count(H264Context *h, int n){

  1114.     const int index8= scan8[n];

  1115.     const int left= h->non_zero_count_cache[index8 - 1];

  1116.     const int top = h->non_zero_count_cache[index8 - 8];

  1117.     int i= left + top;

  1118. 

  1119.     if(i<64) i= (i+1)>>1;

  1120. 

  1121.     tprintf("pred_nnz L%X T%X n%d s%d P%X\n", left, top, n, scan8[n], i&31);

  1122. 

  1123.     return i&31;

  1124. }

  1125. 

  1126. static inline int fetch_diagonal_mv(H264Context *h, const int16_t **C, int i, int list, int part_width){

  1127.     const int topright_ref= h->ref_cache[list][ i - 8 + part_width ];

  1128. 

  1129.     /* there is no consistent mapping of mvs to neighboring locations that will

  1130.      * make mbaff happy, so we can't move all this logic to fill_caches */

  1131.     if(FRAME_MBAFF){

  1132.         MpegEncContext *s = &h->s;

  1133.         const uint32_t *mb_types = s->current_picture_ptr->mb_type;

  1134.         const int16_t *mv;

  1135.         *(uint32_t*)h->mv_cache[list][scan8[0]-2] = 0;

  1136.         *C = h->mv_cache[list][scan8[0]-2];

  1137. 

  1138.         if(!MB_FIELD

  1139.            && (s->mb_y&1) && i < scan8[0]+8 && topright_ref != PART_NOT_AVAILABLE){

  1140.             int topright_xy = s->mb_x + (s->mb_y-1)*s->mb_stride + (i == scan8[0]+3);

  1141.             if(IS_INTERLACED(mb_types[topright_xy])){

  1142. #define SET_DIAG_MV(MV_OP, REF_OP, X4, Y4)\

  1143.                 const int x4 = X4, y4 = Y4;\

  1144.                 const int mb_type = mb_types[(x4>>2)+(y4>>2)*s->mb_stride];\

  1145.                 if(!USES_LIST(mb_type,list) && !IS_8X8(mb_type))\

  1146.                     return LIST_NOT_USED;\

  1147.                 mv = s->current_picture_ptr->motion_val[list][x4 + y4*h->b_stride];\

  1148.                 h->mv_cache[list][scan8[0]-2][0] = mv[0];\

  1149.                 h->mv_cache[list][scan8[0]-2][1] = mv[1] MV_OP;\

  1150.                 return s->current_picture_ptr->ref_index[list][(x4>>1) + (y4>>1)*h->b8_stride] REF_OP;

  1151. 

  1152.                 SET_DIAG_MV(*2, >>1, s->mb_x*4+(i&7)-4+part_width, s->mb_y*4-1);

  1153.             }

  1154.         }

  1155.         if(topright_ref == PART_NOT_AVAILABLE

  1156.            && ((s->mb_y&1) || i >= scan8[0]+8) && (i&7)==4

  1157.            && h->ref_cache[list][scan8[0]-1] != PART_NOT_AVAILABLE){

  1158.             if(!MB_FIELD

  1159.                && IS_INTERLACED(mb_types[h->left_mb_xy[0]])){

  1160.                 SET_DIAG_MV(*2, >>1, s->mb_x*4-1, (s->mb_y|1)*4+(s->mb_y&1)*2+(i>>4)-1);

  1161.             }

  1162.             if(MB_FIELD

  1163.                && !IS_INTERLACED(mb_types[h->left_mb_xy[0]])

  1164.                && i >= scan8[0]+8){

  1165.                 // leftshift will turn LIST_NOT_USED into PART_NOT_AVAILABLE, but that's ok.

  1166.                 SET_DIAG_MV(>>1, <<1, s->mb_x*4-1, (s->mb_y&~1)*4 - 1 + ((i-scan8[0])>>3)*2);

  1167.             }

  1168.         }

  1169. #undef SET_DIAG_MV

  1170.     }

  1171. 

  1172.     if(topright_ref != PART_NOT_AVAILABLE){

  1173.         *C= h->mv_cache[list][ i - 8 + part_width ];

  1174.         return topright_ref;

  1175.     }else{

  1176.         tprintf("topright MV not available\n");

  1177. 

  1178.         *C= h->mv_cache[list][ i - 8 - 1 ];

  1179.         return h->ref_cache[list][ i - 8 - 1 ];

  1180.     }

  1181. }

  1182. 

  1183. /**

  1184.  * gets the predicted MV.

  1185.  * @param n the block index

  1186.  * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)

  1187.  * @param mx the x component of the predicted motion vector

  1188.  * @param my the y component of the predicted motion vector

  1189.  */

  1190. static inline void pred_motion(H264Context * const h, int n, int part_width, int list, int ref, int * const mx, int * const my){

  1191.     const int index8= scan8[n];

  1192.     const int top_ref=      h->ref_cache[list][ index8 - 8 ];

  1193.     const int left_ref=     h->ref_cache[list][ index8 - 1 ];

  1194.     const int16_t * const A= h->mv_cache[list][ index8 - 1 ];

  1195.     const int16_t * const B= h->mv_cache[list][ index8 - 8 ];

  1196.     const int16_t * C;

  1197.     int diagonal_ref, match_count;

  1198. 

  1199.     assert(part_width==1 || part_width==2 || part_width==4);

  1200. 

  1201. /* mv_cache

  1202.   B . . A T T T T

  1203.   U . . L . . , .

  1204.   U . . L . . . .

  1205.   U . . L . . , .

  1206.   . . . L . . . .

  1207. */

  1208. 

  1209.     diagonal_ref= fetch_diagonal_mv(h, &C, index8, list, part_width);

  1210.     match_count= (diagonal_ref==ref) + (top_ref==ref) + (left_ref==ref);

  1211.     tprintf("pred_motion match_count=%d\n", match_count);

  1212.     if(match_count > 1){ //most common

  1213.         *mx= mid_pred(A[0], B[0], C[0]);

  1214.         *my= mid_pred(A[1], B[1], C[1]);

  1215.     }else if(match_count==1){

  1216.         if(left_ref==ref){

  1217.             *mx= A[0];

  1218.             *my= A[1];

  1219.         }else if(top_ref==ref){

  1220.             *mx= B[0];

  1221.             *my= B[1];

  1222.         }else{

  1223.             *mx= C[0];

  1224.             *my= C[1];

  1225.         }

  1226.     }else{

  1227.         if(top_ref == PART_NOT_AVAILABLE && diagonal_ref == PART_NOT_AVAILABLE && left_ref != PART_NOT_AVAILABLE){

  1228.             *mx= A[0];

  1229.             *my= A[1];

  1230.         }else{

  1231.             *mx= mid_pred(A[0], B[0], C[0]);

  1232.             *my= mid_pred(A[1], B[1], C[1]);

  1233.         }

  1234.     }

  1235. 

  1236.     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);

  1237. }

  1238. 

  1239. /**

  1240.  * gets the directionally predicted 16x8 MV.

  1241.  * @param n the block index

  1242.  * @param mx the x component of the predicted motion vector

  1243.  * @param my the y component of the predicted motion vector

  1244.  */

  1245. static inline void pred_16x8_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){

  1246.     if(n==0){

  1247.         const int top_ref=      h->ref_cache[list][ scan8[0] - 8 ];

  1248.         const int16_t * const B= h->mv_cache[list][ scan8[0] - 8 ];

  1249. 

  1250.         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);

  1251. 

  1252.         if(top_ref == ref){

  1253.             *mx= B[0];

  1254.             *my= B[1];

  1255.             return;

  1256.         }

  1257.     }else{

  1258.         const int left_ref=     h->ref_cache[list][ scan8[8] - 1 ];

  1259.         const int16_t * const A= h->mv_cache[list][ scan8[8] - 1 ];

  1260. 

  1261.         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);

  1262. 

  1263.         if(left_ref == ref){

  1264.             *mx= A[0];

  1265.             *my= A[1];

  1266.             return;

  1267.         }

  1268.     }

  1269. 

  1270.     //RARE

  1271.     pred_motion(h, n, 4, list, ref, mx, my);

  1272. }

  1273. 

  1274. /**

  1275.  * gets the directionally predicted 8x16 MV.

  1276.  * @param n the block index

  1277.  * @param mx the x component of the predicted motion vector

  1278.  * @param my the y component of the predicted motion vector

  1279.  */

  1280. static inline void pred_8x16_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){

  1281.     if(n==0){

  1282.         const int left_ref=      h->ref_cache[list][ scan8[0] - 1 ];

  1283.         const int16_t * const A=  h->mv_cache[list][ scan8[0] - 1 ];

  1284. 

  1285.         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);

  1286. 

  1287.         if(left_ref == ref){

  1288.             *mx= A[0];

  1289.             *my= A[1];

  1290.             return;

  1291.         }

  1292.     }else{

  1293.         const int16_t * C;

  1294.         int diagonal_ref;

  1295. 

  1296.         diagonal_ref= fetch_diagonal_mv(h, &C, scan8[4], list, 2);

  1297. 

  1298.         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);

  1299. 

  1300.         if(diagonal_ref == ref){

  1301.             *mx= C[0];

  1302.             *my= C[1];

  1303.             return;

  1304.         }

  1305.     }

  1306. 

  1307.     //RARE

  1308.     pred_motion(h, n, 2, list, ref, mx, my);

  1309. }

  1310. 

  1311. static inline void pred_pskip_motion(H264Context * const h, int * const mx, int * const my){

  1312.     const int top_ref = h->ref_cache[0][ scan8[0] - 8 ];

  1313.     const int left_ref= h->ref_cache[0][ scan8[0] - 1 ];

  1314. 

  1315.     tprintf("pred_pskip: (%d) (%d) at %2d %2d\n", top_ref, left_ref, h->s.mb_x, h->s.mb_y);

  1316. 

  1317.     if(top_ref == PART_NOT_AVAILABLE || left_ref == PART_NOT_AVAILABLE

  1318.        || (top_ref == 0  && *(uint32_t*)h->mv_cache[0][ scan8[0] - 8 ] == 0)

  1319.        || (left_ref == 0 && *(uint32_t*)h->mv_cache[0][ scan8[0] - 1 ] == 0)){

  1320. 

  1321.         *mx = *my = 0;

  1322.         return;

  1323.     }

  1324. 

  1325.     pred_motion(h, 0, 4, 0, 0, mx, my);

  1326. 

  1327.     return;

  1328. }

  1329. 

  1330. static inline void direct_dist_scale_factor(H264Context * const h){

  1331.     const int poc = h->s.current_picture_ptr->poc;

  1332.     const int poc1 = h->ref_list[1][0].poc;

  1333.     int i;

  1334.     for(i=0; i<h->ref_count[0]; i++){

  1335.         int poc0 = h->ref_list[0][i].poc;

  1336.         int td = clip(poc1 - poc0, -128, 127);

  1337.         if(td == 0 /* FIXME || pic0 is a long-term ref */){

  1338.             h->dist_scale_factor[i] = 256;

  1339.         }else{

  1340.             int tb = clip(poc - poc0, -128, 127);

  1341.             int tx = (16384 + (FFABS(td) >> 1)) / td;

  1342.             h->dist_scale_factor[i] = clip((tb*tx + 32) >> 6, -1024, 1023);

  1343.         }

  1344.     }

  1345.     if(FRAME_MBAFF){

  1346.         for(i=0; i<h->ref_count[0]; i++){

  1347.             h->dist_scale_factor_field[2*i] =

  1348.             h->dist_scale_factor_field[2*i+1] = h->dist_scale_factor[i];

  1349.         }

  1350.     }

  1351. }

  1352. static inline void direct_ref_list_init(H264Context * const h){

  1353.     MpegEncContext * const s = &h->s;

  1354.     Picture * const ref1 = &h->ref_list[1][0];

  1355.     Picture * const cur = s->current_picture_ptr;

  1356.     int list, i, j;

  1357.     if(cur->pict_type == I_TYPE)

  1358.         cur->ref_count[0] = 0;

  1359.     if(cur->pict_type != B_TYPE)

  1360.         cur->ref_count[1] = 0;

  1361.     for(list=0; list<2; list++){

  1362.         cur->ref_count[list] = h->ref_count[list];

  1363.         for(j=0; j<h->ref_count[list]; j++)

  1364.             cur->ref_poc[list][j] = h->ref_list[list][j].poc;

  1365.     }

  1366.     if(cur->pict_type != B_TYPE || h->direct_spatial_mv_pred)

  1367.         return;

  1368.     for(list=0; list<2; list++){

  1369.         for(i=0; i<ref1->ref_count[list]; i++){

  1370.             const int poc = ref1->ref_poc[list][i];

  1371.             h->map_col_to_list0[list][i] = 0; /* bogus; fills in for missing frames */

  1372.             for(j=0; j<h->ref_count[list]; j++)

  1373.                 if(h->ref_list[list][j].poc == poc){

  1374.                     h->map_col_to_list0[list][i] = j;

  1375.                     break;

  1376.                 }

  1377.         }

  1378.     }

  1379.     if(FRAME_MBAFF){

  1380.         for(list=0; list<2; list++){

  1381.             for(i=0; i<ref1->ref_count[list]; i++){

  1382.                 j = h->map_col_to_list0[list][i];

  1383.                 h->map_col_to_list0_field[list][2*i] = 2*j;

  1384.                 h->map_col_to_list0_field[list][2*i+1] = 2*j+1;

  1385.             }

  1386.         }

  1387.     }

  1388. }

  1389. 

  1390. static inline void pred_direct_motion(H264Context * const h, int *mb_type){

  1391.     MpegEncContext * const s = &h->s;

  1392.     const int mb_xy =   s->mb_x +   s->mb_y*s->mb_stride;

  1393.     const int b8_xy = 2*s->mb_x + 2*s->mb_y*h->b8_stride;

  1394.     const int b4_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;

  1395.     const int mb_type_col = h->ref_list[1][0].mb_type[mb_xy];

  1396.     const int16_t (*l1mv0)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[0][b4_xy];

  1397.     const int16_t (*l1mv1)[2] = (const int16_t (*)[2]) &h->ref_list[1][0].motion_val[1][b4_xy];

  1398.     const int8_t *l1ref0 = &h->ref_list[1][0].ref_index[0][b8_xy];

  1399.     const int8_t *l1ref1 = &h->ref_list[1][0].ref_index[1][b8_xy];

  1400.     const int is_b8x8 = IS_8X8(*mb_type);

  1401.     int sub_mb_type;

  1402.     int i8, i4;

  1403. 

  1404. #define MB_TYPE_16x16_OR_INTRA (MB_TYPE_16x16|MB_TYPE_INTRA4x4|MB_TYPE_INTRA16x16|MB_TYPE_INTRA_PCM)

  1405.     if(IS_8X8(mb_type_col) && !h->sps.direct_8x8_inference_flag){

  1406.         /* FIXME save sub mb types from previous frames (or derive from MVs)

  1407.          * so we know exactly what block size to use */

  1408.         sub_mb_type = MB_TYPE_8x8|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_4x4 */

  1409.         *mb_type =    MB_TYPE_8x8|MB_TYPE_L0L1;

  1410.     }else if(!is_b8x8 && (mb_type_col & MB_TYPE_16x16_OR_INTRA)){

  1411.         sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  1412.         *mb_type =    MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_16x16 */

  1413.     }else{

  1414.         sub_mb_type = MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2; /* B_SUB_8x8 */

  1415.         *mb_type =    MB_TYPE_8x8|MB_TYPE_L0L1;

  1416.     }

  1417.     if(!is_b8x8)

  1418.         *mb_type |= MB_TYPE_DIRECT2;

  1419.     if(MB_FIELD)

  1420.         *mb_type |= MB_TYPE_INTERLACED;

  1421. 

  1422.     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);

  1423. 

  1424.     if(h->direct_spatial_mv_pred){

  1425.         int ref[2];

  1426.         int mv[2][2];

  1427.         int list;

  1428. 

  1429.         /* FIXME interlacing + spatial direct uses wrong colocated block positions */

  1430. 

  1431.         /* ref = min(neighbors) */

  1432.         for(list=0; list<2; list++){

  1433.             int refa = h->ref_cache[list][scan8[0] - 1];

  1434.             int refb = h->ref_cache[list][scan8[0] - 8];

  1435.             int refc = h->ref_cache[list][scan8[0] - 8 + 4];

  1436.             if(refc == -2)

  1437.                 refc = h->ref_cache[list][scan8[0] - 8 - 1];

  1438.             ref[list] = refa;

  1439.             if(ref[list] < 0 || (refb < ref[list] && refb >= 0))

  1440.                 ref[list] = refb;

  1441.             if(ref[list] < 0 || (refc < ref[list] && refc >= 0))

  1442.                 ref[list] = refc;

  1443.             if(ref[list] < 0)

  1444.                 ref[list] = -1;

  1445.         }

  1446. 

  1447.         if(ref[0] < 0 && ref[1] < 0){

  1448.             ref[0] = ref[1] = 0;

  1449.             mv[0][0] = mv[0][1] =

  1450.             mv[1][0] = mv[1][1] = 0;

  1451.         }else{

  1452.             for(list=0; list<2; list++){

  1453.                 if(ref[list] >= 0)

  1454.                     pred_motion(h, 0, 4, list, ref[list], &mv[list][0], &mv[list][1]);

  1455.                 else

  1456.                     mv[list][0] = mv[list][1] = 0;

  1457.             }

  1458.         }

  1459. 

  1460.         if(ref[1] < 0){

  1461.             *mb_type &= ~MB_TYPE_P0L1;

  1462.             sub_mb_type &= ~MB_TYPE_P0L1;

  1463.         }else if(ref[0] < 0){

  1464.             *mb_type &= ~MB_TYPE_P0L0;

  1465.             sub_mb_type &= ~MB_TYPE_P0L0;

  1466.         }

  1467. 

  1468.         if(IS_16X16(*mb_type)){

  1469.             fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, (uint8_t)ref[0], 1);

  1470.             fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, (uint8_t)ref[1], 1);

  1471.             if(!IS_INTRA(mb_type_col)

  1472.                && (   (l1ref0[0] == 0 && FFABS(l1mv0[0][0]) <= 1 && FFABS(l1mv0[0][1]) <= 1)

  1473.                    || (l1ref0[0]  < 0 && l1ref1[0] == 0 && FFABS(l1mv1[0][0]) <= 1 && FFABS(l1mv1[0][1]) <= 1

  1474.                        && (h->x264_build>33 || !h->x264_build)))){

  1475.                 if(ref[0] > 0)

  1476.                     fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv[0][0],mv[0][1]), 4);

  1477.                 else

  1478.                     fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, 0, 4);

  1479.                 if(ref[1] > 0)

  1480.                     fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, pack16to32(mv[1][0],mv[1][1]), 4);

  1481.                 else

  1482.                     fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, 0, 4);

  1483.             }else{

  1484.                 fill_rectangle(&h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv[0][0],mv[0][1]), 4);

  1485.                 fill_rectangle(&h->mv_cache[1][scan8[0]], 4, 4, 8, pack16to32(mv[1][0],mv[1][1]), 4);

  1486.             }

  1487.         }else{

  1488.             for(i8=0; i8<4; i8++){

  1489.                 const int x8 = i8&1;

  1490.                 const int y8 = i8>>1;

  1491. 

  1492.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  1493.                     continue;

  1494.                 h->sub_mb_type[i8] = sub_mb_type;

  1495. 

  1496.                 fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mv[0][0],mv[0][1]), 4);

  1497.                 fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mv[1][0],mv[1][1]), 4);

  1498.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[0], 1);

  1499.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, (uint8_t)ref[1], 1);

  1500. 

  1501.                 /* col_zero_flag */

  1502.                 if(!IS_INTRA(mb_type_col) && (   l1ref0[x8 + y8*h->b8_stride] == 0

  1503.                                               || (l1ref0[x8 + y8*h->b8_stride] < 0 && l1ref1[x8 + y8*h->b8_stride] == 0

  1504.                                                   && (h->x264_build>33 || !h->x264_build)))){

  1505.                     const int16_t (*l1mv)[2]= l1ref0[x8 + y8*h->b8_stride] == 0 ? l1mv0 : l1mv1;

  1506.                     if(IS_SUB_8X8(sub_mb_type)){

  1507.                         const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];

  1508.                         if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){

  1509.                             if(ref[0] == 0)

  1510.                                 fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  1511.                             if(ref[1] == 0)

  1512.                                 fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  1513.                         }

  1514.                     }else

  1515.                     for(i4=0; i4<4; i4++){

  1516.                         const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];

  1517.                         if(FFABS(mv_col[0]) <= 1 && FFABS(mv_col[1]) <= 1){

  1518.                             if(ref[0] == 0)

  1519.                                 *(uint32_t*)h->mv_cache[0][scan8[i8*4+i4]] = 0;

  1520.                             if(ref[1] == 0)

  1521.                                 *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] = 0;

  1522.                         }

  1523.                     }

  1524.                 }

  1525.             }

  1526.         }

  1527.     }else{ /* direct temporal mv pred */

  1528.         const int *map_col_to_list0[2] = {h->map_col_to_list0[0], h->map_col_to_list0[1]};

  1529.         const int *dist_scale_factor = h->dist_scale_factor;

  1530. 

  1531.         if(FRAME_MBAFF){

  1532.             if(IS_INTERLACED(*mb_type)){

  1533.                 map_col_to_list0[0] = h->map_col_to_list0_field[0];

  1534.                 map_col_to_list0[1] = h->map_col_to_list0_field[1];

  1535.                 dist_scale_factor = h->dist_scale_factor_field;

  1536.             }

  1537.             if(IS_INTERLACED(*mb_type) != IS_INTERLACED(mb_type_col)){

  1538.                 /* FIXME assumes direct_8x8_inference == 1 */

  1539.                 const int pair_xy = s->mb_x + (s->mb_y&~1)*s->mb_stride;

  1540.                 int mb_types_col[2];

  1541.                 int y_shift;

  1542. 

  1543.                 *mb_type = MB_TYPE_8x8|MB_TYPE_L0L1

  1544.                          | (is_b8x8 ? 0 : MB_TYPE_DIRECT2)

  1545.                          | (*mb_type & MB_TYPE_INTERLACED);

  1546.                 sub_mb_type = MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_16x16;

  1547. 

  1548.                 if(IS_INTERLACED(*mb_type)){

  1549.                     /* frame to field scaling */

  1550.                     mb_types_col[0] = h->ref_list[1][0].mb_type[pair_xy];

  1551.                     mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];

  1552.                     if(s->mb_y&1){

  1553.                         l1ref0 -= 2*h->b8_stride;

  1554.                         l1ref1 -= 2*h->b8_stride;

  1555.                         l1mv0 -= 4*h->b_stride;

  1556.                         l1mv1 -= 4*h->b_stride;

  1557.                     }

  1558.                     y_shift = 0;

  1559. 

  1560.                     if(   (mb_types_col[0] & MB_TYPE_16x16_OR_INTRA)

  1561.                        && (mb_types_col[1] & MB_TYPE_16x16_OR_INTRA)

  1562.                        && !is_b8x8)

  1563.                         *mb_type |= MB_TYPE_16x8;

  1564.                     else

  1565.                         *mb_type |= MB_TYPE_8x8;

  1566.                 }else{

  1567.                     /* field to frame scaling */

  1568.                     /* col_mb_y = (mb_y&~1) + (topAbsDiffPOC < bottomAbsDiffPOC ? 0 : 1)

  1569.                      * but in MBAFF, top and bottom POC are equal */

  1570.                     int dy = (s->mb_y&1) ? 1 : 2;

  1571.                     mb_types_col[0] =

  1572.                     mb_types_col[1] = h->ref_list[1][0].mb_type[pair_xy+s->mb_stride];

  1573.                     l1ref0 += dy*h->b8_stride;

  1574.                     l1ref1 += dy*h->b8_stride;

  1575.                     l1mv0 += 2*dy*h->b_stride;

  1576.                     l1mv1 += 2*dy*h->b_stride;

  1577.                     y_shift = 2;

  1578. 

  1579.                     if((mb_types_col[0] & (MB_TYPE_16x16_OR_INTRA|MB_TYPE_16x8))

  1580.                        && !is_b8x8)

  1581.                         *mb_type |= MB_TYPE_16x16;

  1582.                     else

  1583.                         *mb_type |= MB_TYPE_8x8;

  1584.                 }

  1585. 

  1586.                 for(i8=0; i8<4; i8++){

  1587.                     const int x8 = i8&1;

  1588.                     const int y8 = i8>>1;

  1589.                     int ref0, scale;

  1590.                     const int16_t (*l1mv)[2]= l1mv0;

  1591. 

  1592.                     if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  1593.                         continue;

  1594.                     h->sub_mb_type[i8] = sub_mb_type;

  1595. 

  1596.                     fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);

  1597.                     if(IS_INTRA(mb_types_col[y8])){

  1598.                         fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);

  1599.                         fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  1600.                         fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  1601.                         continue;

  1602.                     }

  1603. 

  1604.                     ref0 = l1ref0[x8 + (y8*2>>y_shift)*h->b8_stride];

  1605.                     if(ref0 >= 0)

  1606.                         ref0 = map_col_to_list0[0][ref0*2>>y_shift];

  1607.                     else{

  1608.                         ref0 = map_col_to_list0[1][l1ref1[x8 + (y8*2>>y_shift)*h->b8_stride]*2>>y_shift];

  1609.                         l1mv= l1mv1;

  1610.                     }

  1611.                     scale = dist_scale_factor[ref0];

  1612.                     fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);

  1613. 

  1614.                     {

  1615.                         const int16_t *mv_col = l1mv[x8*3 + (y8*6>>y_shift)*h->b_stride];

  1616.                         int my_col = (mv_col[1]<<y_shift)/2;

  1617.                         int mx = (scale * mv_col[0] + 128) >> 8;

  1618.                         int my = (scale * my_col + 128) >> 8;

  1619.                         fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);

  1620.                         fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-my_col), 4);

  1621.                     }

  1622.                 }

  1623.                 return;

  1624.             }

  1625.         }

  1626. 

  1627.         /* one-to-one mv scaling */

  1628. 

  1629.         if(IS_16X16(*mb_type)){

  1630.             fill_rectangle(&h->ref_cache[1][scan8[0]], 4, 4, 8, 0, 1);

  1631.             if(IS_INTRA(mb_type_col)){

  1632.                 fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);

  1633.                 fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, 0, 4);

  1634.                 fill_rectangle(&h-> mv_cache[1][scan8[0]], 4, 4, 8, 0, 4);

  1635.             }else{

  1636.                 const int ref0 = l1ref0[0] >= 0 ? map_col_to_list0[0][l1ref0[0]]

  1637.                                                 : map_col_to_list0[1][l1ref1[0]];

  1638.                 const int scale = dist_scale_factor[ref0];

  1639.                 const int16_t *mv_col = l1ref0[0] >= 0 ? l1mv0[0] : l1mv1[0];

  1640.                 int mv_l0[2];

  1641.                 mv_l0[0] = (scale * mv_col[0] + 128) >> 8;

  1642.                 mv_l0[1] = (scale * mv_col[1] + 128) >> 8;

  1643.                 fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, ref0, 1);

  1644.                 fill_rectangle(&h-> mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mv_l0[0],mv_l0[1]), 4);

  1645.                 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);

  1646.             }

  1647.         }else{

  1648.             for(i8=0; i8<4; i8++){

  1649.                 const int x8 = i8&1;

  1650.                 const int y8 = i8>>1;

  1651.                 int ref0, scale;

  1652.                 const int16_t (*l1mv)[2]= l1mv0;

  1653. 

  1654.                 if(is_b8x8 && !IS_DIRECT(h->sub_mb_type[i8]))

  1655.                     continue;

  1656.                 h->sub_mb_type[i8] = sub_mb_type;

  1657.                 fill_rectangle(&h->ref_cache[1][scan8[i8*4]], 2, 2, 8, 0, 1);

  1658.                 if(IS_INTRA(mb_type_col)){

  1659.                     fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, 0, 1);

  1660.                     fill_rectangle(&h-> mv_cache[0][scan8[i8*4]], 2, 2, 8, 0, 4);

  1661.                     fill_rectangle(&h-> mv_cache[1][scan8[i8*4]], 2, 2, 8, 0, 4);

  1662.                     continue;

  1663.                 }

  1664. 

  1665.                 ref0 = l1ref0[x8 + y8*h->b8_stride];

  1666.                 if(ref0 >= 0)

  1667.                     ref0 = map_col_to_list0[0][ref0];

  1668.                 else{

  1669.                     ref0 = map_col_to_list0[1][l1ref1[x8 + y8*h->b8_stride]];

  1670.                     l1mv= l1mv1;

  1671.                 }

  1672.                 scale = dist_scale_factor[ref0];

  1673. 

  1674.                 fill_rectangle(&h->ref_cache[0][scan8[i8*4]], 2, 2, 8, ref0, 1);

  1675.                 if(IS_SUB_8X8(sub_mb_type)){

  1676.                     const int16_t *mv_col = l1mv[x8*3 + y8*3*h->b_stride];

  1677.                     int mx = (scale * mv_col[0] + 128) >> 8;

  1678.                     int my = (scale * mv_col[1] + 128) >> 8;

  1679.                     fill_rectangle(&h->mv_cache[0][scan8[i8*4]], 2, 2, 8, pack16to32(mx,my), 4);

  1680.                     fill_rectangle(&h->mv_cache[1][scan8[i8*4]], 2, 2, 8, pack16to32(mx-mv_col[0],my-mv_col[1]), 4);

  1681.                 }else

  1682.                 for(i4=0; i4<4; i4++){

  1683.                     const int16_t *mv_col = l1mv[x8*2 + (i4&1) + (y8*2 + (i4>>1))*h->b_stride];

  1684.                     int16_t *mv_l0 = h->mv_cache[0][scan8[i8*4+i4]];

  1685.                     mv_l0[0] = (scale * mv_col[0] + 128) >> 8;

  1686.                     mv_l0[1] = (scale * mv_col[1] + 128) >> 8;

  1687.                     *(uint32_t*)h->mv_cache[1][scan8[i8*4+i4]] =

  1688.                         pack16to32(mv_l0[0]-mv_col[0],mv_l0[1]-mv_col[1]);

  1689.                 }

  1690.             }

  1691.         }

  1692.     }

  1693. }

  1694. 

  1695. static inline void write_back_motion(H264Context *h, int mb_type){

  1696.     MpegEncContext * const s = &h->s;

  1697.     const int b_xy = 4*s->mb_x + 4*s->mb_y*h->b_stride;

  1698.     const int b8_xy= 2*s->mb_x + 2*s->mb_y*h->b8_stride;

  1699.     int list;

  1700. 

  1701.     if(!USES_LIST(mb_type, 0))

  1702.         fill_rectangle(&s->current_picture.ref_index[0][b8_xy], 2, 2, h->b8_stride, (uint8_t)LIST_NOT_USED, 1);

  1703. 

  1704.     for(list=0; list<2; list++){

  1705.         int y;

  1706.         if(!USES_LIST(mb_type, list))

  1707.             continue;

  1708. 

  1709.         for(y=0; y<4; y++){

  1710.             *(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];

  1711.             *(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];

  1712.         }

  1713.         if( h->pps.cabac ) {

  1714.             if(IS_SKIP(mb_type))

  1715.                 fill_rectangle(h->mvd_table[list][b_xy], 4, 4, h->b_stride, 0, 4);

  1716.             else

  1717.             for(y=0; y<4; y++){

  1718.                 *(uint64_t*)h->mvd_table[list][b_xy + 0 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+0 + 8*y];

  1719.                 *(uint64_t*)h->mvd_table[list][b_xy + 2 + y*h->b_stride]= *(uint64_t*)h->mvd_cache[list][scan8[0]+2 + 8*y];

  1720.             }

  1721.         }

  1722. 

  1723.         {

  1724.             int8_t *ref_index = &s->current_picture.ref_index[list][b8_xy];

  1725.             ref_index[0+0*h->b8_stride]= h->ref_cache[list][scan8[0]];

  1726.             ref_index[1+0*h->b8_stride]= h->ref_cache[list][scan8[4]];

  1727.             ref_index[0+1*h->b8_stride]= h->ref_cache[list][scan8[8]];

  1728.             ref_index[1+1*h->b8_stride]= h->ref_cache[list][scan8[12]];

  1729.         }

  1730.     }

  1731. 

  1732.     if(h->slice_type == B_TYPE && h->pps.cabac){

  1733.         if(IS_8X8(mb_type)){

  1734.             uint8_t *direct_table = &h->direct_table[b8_xy];

  1735.             direct_table[1+0*h->b8_stride] = IS_DIRECT(h->sub_mb_type[1]) ? 1 : 0;

  1736.             direct_table[0+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[2]) ? 1 : 0;

  1737.             direct_table[1+1*h->b8_stride] = IS_DIRECT(h->sub_mb_type[3]) ? 1 : 0;

  1738.         }

  1739.     }

  1740. }

  1741. 

  1742. /**

  1743.  * Decodes a network abstraction layer unit.

  1744.  * @param consumed is the number of bytes used as input

  1745.  * @param length is the length of the array

  1746.  * @param dst_length is the number of decoded bytes FIXME here or a decode rbsp tailing?

  1747.  * @returns decoded bytes, might be src+1 if no escapes

  1748.  */

  1749. static uint8_t *decode_nal(H264Context *h, uint8_t *src, int *dst_length, int *consumed, int length){

  1750.     int i, si, di;

  1751.     uint8_t *dst;

  1752. 

  1753. //    src[0]&0x80;                //forbidden bit

  1754.     h->nal_ref_idc= src[0]>>5;

  1755.     h->nal_unit_type= src[0]&0x1F;

  1756. 

  1757.     src++; length--;

  1758. #if 0

  1759.     for(i=0; i<length; i++)

  1760.         printf("%2X ", src[i]);

  1761. #endif

  1762.     for(i=0; i+1<length; i+=2){

  1763.         if(src[i]) continue;

  1764.         if(i>0 && src[i-1]==0) i--;

  1765.         if(i+2<length && src[i+1]==0 && src[i+2]<=3){

  1766.             if(src[i+2]!=3){

  1767.                 /* startcode, so we must be past the end */

  1768.                 length=i;

  1769.             }

  1770.             break;

  1771.         }

  1772.     }

  1773. 

  1774.     if(i>=length-1){ //no escaped 0

  1775.         *dst_length= length;

  1776.         *consumed= length+1; //+1 for the header

  1777.         return src;

  1778.     }

  1779. 

  1780.     h->rbsp_buffer= av_fast_realloc(h->rbsp_buffer, &h->rbsp_buffer_size, length);

  1781.     dst= h->rbsp_buffer;

  1782. 

  1783. //printf("decoding esc\n");

  1784.     si=di=0;

  1785.     while(si<length){

  1786.         //remove escapes (very rare 1:2^22)

  1787.         if(si+2<length && src[si]==0 && src[si+1]==0 && src[si+2]<=3){

  1788.             if(src[si+2]==3){ //escape

  1789.                 dst[di++]= 0;

  1790.                 dst[di++]= 0;

  1791.                 si+=3;

  1792.                 continue;

  1793.             }else //next start code

  1794.                 break;

  1795.         }

  1796. 

  1797.         dst[di++]= src[si++];

  1798.     }

  1799. 

  1800.     *dst_length= di;

  1801.     *consumed= si + 1;//+1 for the header

  1802. //FIXME store exact number of bits in the getbitcontext (its needed for decoding)

  1803.     return dst;

  1804. }

  1805. 

  1806. /**

  1807.  * identifies the exact end of the bitstream

  1808.  * @return the length of the trailing, or 0 if damaged

  1809.  */

  1810. static int decode_rbsp_trailing(uint8_t *src){

  1811.     int v= *src;

  1812.     int r;

  1813. 

  1814.     tprintf("rbsp trailing %X\n", v);

  1815. 

  1816.     for(r=1; r<9; r++){

  1817.         if(v&1) return r;

  1818.         v>>=1;

  1819.     }

  1820.     return 0;

  1821. }

  1822. 

  1823. /**

  1824.  * idct tranforms the 16 dc values and dequantize them.

  1825.  * @param qp quantization parameter

  1826.  */

  1827. static void h264_luma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){

  1828. #define stride 16

  1829.     int i;

  1830.     int temp[16]; //FIXME check if this is a good idea

  1831.     static const int x_offset[4]={0, 1*stride, 4* stride,  5*stride};

  1832.     static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};

  1833. 

  1834. //memset(block, 64, 2*256);

  1835. //return;

  1836.     for(i=0; i<4; i++){

  1837.         const int offset= y_offset[i];

  1838.         const int z0= block[offset+stride*0] + block[offset+stride*4];

  1839.         const int z1= block[offset+stride*0] - block[offset+stride*4];

  1840.         const int z2= block[offset+stride*1] - block[offset+stride*5];

  1841.         const int z3= block[offset+stride*1] + block[offset+stride*5];

  1842. 

  1843.         temp[4*i+0]= z0+z3;

  1844.         temp[4*i+1]= z1+z2;

  1845.         temp[4*i+2]= z1-z2;

  1846.         temp[4*i+3]= z0-z3;

  1847.     }

  1848. 

  1849.     for(i=0; i<4; i++){

  1850.         const int offset= x_offset[i];

  1851.         const int z0= temp[4*0+i] + temp[4*2+i];

  1852.         const int z1= temp[4*0+i] - temp[4*2+i];

  1853.         const int z2= temp[4*1+i] - temp[4*3+i];

  1854.         const int z3= temp[4*1+i] + temp[4*3+i];

  1855. 

  1856.         block[stride*0 +offset]= ((((z0 + z3)*qmul + 128 ) >> 8)); //FIXME think about merging this into decode_resdual

  1857.         block[stride*2 +offset]= ((((z1 + z2)*qmul + 128 ) >> 8));

  1858.         block[stride*8 +offset]= ((((z1 - z2)*qmul + 128 ) >> 8));

  1859.         block[stride*10+offset]= ((((z0 - z3)*qmul + 128 ) >> 8));

  1860.     }

  1861. }

  1862. 

  1863. #if 0

  1864. /**

  1865.  * dct tranforms the 16 dc values.

  1866.  * @param qp quantization parameter ??? FIXME

  1867.  */

  1868. static void h264_luma_dc_dct_c(DCTELEM *block/*, int qp*/){

  1869. //    const int qmul= dequant_coeff[qp][0];

  1870.     int i;

  1871.     int temp[16]; //FIXME check if this is a good idea

  1872.     static const int x_offset[4]={0, 1*stride, 4* stride,  5*stride};

  1873.     static const int y_offset[4]={0, 2*stride, 8* stride, 10*stride};

  1874. 

  1875.     for(i=0; i<4; i++){

  1876.         const int offset= y_offset[i];

  1877.         const int z0= block[offset+stride*0] + block[offset+stride*4];

  1878.         const int z1= block[offset+stride*0] - block[offset+stride*4];

  1879.         const int z2= block[offset+stride*1] - block[offset+stride*5];

  1880.         const int z3= block[offset+stride*1] + block[offset+stride*5];

  1881. 

  1882.         temp[4*i+0]= z0+z3;

  1883.         temp[4*i+1]= z1+z2;

  1884.         temp[4*i+2]= z1-z2;

  1885.         temp[4*i+3]= z0-z3;

  1886.     }

  1887. 

  1888.     for(i=0; i<4; i++){

  1889.         const int offset= x_offset[i];

  1890.         const int z0= temp[4*0+i] + temp[4*2+i];

  1891.         const int z1= temp[4*0+i] - temp[4*2+i];

  1892.         const int z2= temp[4*1+i] - temp[4*3+i];

  1893.         const int z3= temp[4*1+i] + temp[4*3+i];

  1894. 

  1895.         block[stride*0 +offset]= (z0 + z3)>>1;

  1896.         block[stride*2 +offset]= (z1 + z2)>>1;

  1897.         block[stride*8 +offset]= (z1 - z2)>>1;

  1898.         block[stride*10+offset]= (z0 - z3)>>1;

  1899.     }

  1900. }

  1901. #endif

  1902. 

  1903. #undef xStride

  1904. #undef stride

  1905. 

  1906. static void chroma_dc_dequant_idct_c(DCTELEM *block, int qp, int qmul){

  1907.     const int stride= 16*2;

  1908.     const int xStride= 16;

  1909.     int a,b,c,d,e;

  1910. 

  1911.     a= block[stride*0 + xStride*0];

  1912.     b= block[stride*0 + xStride*1];

  1913.     c= block[stride*1 + xStride*0];

  1914.     d= block[stride*1 + xStride*1];

  1915. 

  1916.     e= a-b;

  1917.     a= a+b;

  1918.     b= c-d;

  1919.     c= c+d;

  1920. 

  1921.     block[stride*0 + xStride*0]= ((a+c)*qmul) >> 7;

  1922.     block[stride*0 + xStride*1]= ((e+b)*qmul) >> 7;

  1923.     block[stride*1 + xStride*0]= ((a-c)*qmul) >> 7;

  1924.     block[stride*1 + xStride*1]= ((e-b)*qmul) >> 7;

  1925. }

  1926. 

  1927. #if 0

  1928. static void chroma_dc_dct_c(DCTELEM *block){

  1929.     const int stride= 16*2;

  1930.     const int xStride= 16;

  1931.     int a,b,c,d,e;

  1932. 

  1933.     a= block[stride*0 + xStride*0];

  1934.     b= block[stride*0 + xStride*1];

  1935.     c= block[stride*1 + xStride*0];

  1936.     d= block[stride*1 + xStride*1];

  1937. 

  1938.     e= a-b;

  1939.     a= a+b;

  1940.     b= c-d;

  1941.     c= c+d;

  1942. 

  1943.     block[stride*0 + xStride*0]= (a+c);

  1944.     block[stride*0 + xStride*1]= (e+b);

  1945.     block[stride*1 + xStride*0]= (a-c);

  1946.     block[stride*1 + xStride*1]= (e-b);

  1947. }

  1948. #endif

  1949. 

  1950. /**

  1951.  * gets the chroma qp.

  1952.  */

  1953. static inline int get_chroma_qp(int chroma_qp_index_offset, int qscale){

  1954. 

  1955.     return chroma_qp[clip(qscale + chroma_qp_index_offset, 0, 51)];

  1956. }

  1957. 

  1958. //FIXME need to check that this doesnt overflow signed 32 bit for low qp, i am not sure, it's very close

  1959. //FIXME check that gcc inlines this (and optimizes intra & seperate_dc stuff away)

  1960. static inline int quantize_c(DCTELEM *block, uint8_t *scantable, int qscale, int intra, int seperate_dc){

  1961.     int i;

  1962.     const int * const quant_table= quant_coeff[qscale];

  1963.     const int bias= intra ? (1<<QUANT_SHIFT)/3 : (1<<QUANT_SHIFT)/6;

  1964.     const unsigned int threshold1= (1<<QUANT_SHIFT) - bias - 1;

  1965.     const unsigned int threshold2= (threshold1<<1);

  1966.     int last_non_zero;

  1967. 

  1968.     if(seperate_dc){

  1969.         if(qscale<=18){

  1970.             //avoid overflows

  1971.             const int dc_bias= intra ? (1<<(QUANT_SHIFT-2))/3 : (1<<(QUANT_SHIFT-2))/6;

  1972.             const unsigned int dc_threshold1= (1<<(QUANT_SHIFT-2)) - dc_bias - 1;

  1973.             const unsigned int dc_threshold2= (dc_threshold1<<1);

  1974. 

  1975.             int level= block[0]*quant_coeff[qscale+18][0];

  1976.             if(((unsigned)(level+dc_threshold1))>dc_threshold2){

  1977.                 if(level>0){

  1978.                     level= (dc_bias + level)>>(QUANT_SHIFT-2);

  1979.                     block[0]= level;

  1980.                 }else{

  1981.                     level= (dc_bias - level)>>(QUANT_SHIFT-2);

  1982.                     block[0]= -level;

  1983.                 }

  1984. //                last_non_zero = i;

  1985.             }else{

  1986.                 block[0]=0;

  1987.             }

  1988.         }else{

  1989.             const int dc_bias= intra ? (1<<(QUANT_SHIFT+1))/3 : (1<<(QUANT_SHIFT+1))/6;

  1990.             const unsigned int dc_threshold1= (1<<(QUANT_SHIFT+1)) - dc_bias - 1;

  1991.             const unsigned int dc_threshold2= (dc_threshold1<<1);

  1992. 

  1993.             int level= block[0]*quant_table[0];

  1994.             if(((unsigned)(level+dc_threshold1))>dc_threshold2){

  1995.                 if(level>0){

  1996.                     level= (dc_bias + level)>>(QUANT_SHIFT+1);

  1997.                     block[0]= level;

  1998.                 }else{

  1999.                     level= (dc_bias - level)>>(QUANT_SHIFT+1);

  2000.                     block[0]= -level;

  2001.                 }

  2002. //                last_non_zero = i;

  2003.             }else{

  2004.                 block[0]=0;

  2005.             }

  2006.         }

  2007.         last_non_zero= 0;

  2008.         i=1;

  2009.     }else{

  2010.         last_non_zero= -1;

  2011.         i=0;

  2012.     }

  2013. 

  2014.     for(; i<16; i++){

  2015.         const int j= scantable[i];

  2016.         int level= block[j]*quant_table[j];

  2017. 

  2018. //        if(   bias+level >= (1<<(QMAT_SHIFT - 3))

  2019. //           || bias-level >= (1<<(QMAT_SHIFT - 3))){

  2020.         if(((unsigned)(level+threshold1))>threshold2){

  2021.             if(level>0){

  2022.                 level= (bias + level)>>QUANT_SHIFT;

  2023.                 block[j]= level;

  2024.             }else{

  2025.                 level= (bias - level)>>QUANT_SHIFT;

  2026.                 block[j]= -level;

  2027.             }

  2028.             last_non_zero = i;

  2029.         }else{

  2030.             block[j]=0;

  2031.         }

  2032.     }

  2033. 

  2034.     return last_non_zero;

  2035. }

  2036. 

  2037. static void pred4x4_vertical_c(uint8_t *src, uint8_t *topright, int stride){

  2038.     const uint32_t a= ((uint32_t*)(src-stride))[0];

  2039.     ((uint32_t*)(src+0*stride))[0]= a;

  2040.     ((uint32_t*)(src+1*stride))[0]= a;

  2041.     ((uint32_t*)(src+2*stride))[0]= a;

  2042.     ((uint32_t*)(src+3*stride))[0]= a;

  2043. }

  2044. 

  2045. static void pred4x4_horizontal_c(uint8_t *src, uint8_t *topright, int stride){

  2046.     ((uint32_t*)(src+0*stride))[0]= src[-1+0*stride]*0x01010101;

  2047.     ((uint32_t*)(src+1*stride))[0]= src[-1+1*stride]*0x01010101;

  2048.     ((uint32_t*)(src+2*stride))[0]= src[-1+2*stride]*0x01010101;

  2049.     ((uint32_t*)(src+3*stride))[0]= src[-1+3*stride]*0x01010101;

  2050. }

  2051. 

  2052. static void pred4x4_dc_c(uint8_t *src, uint8_t *topright, int stride){

  2053.     const int dc= (  src[-stride] + src[1-stride] + src[2-stride] + src[3-stride]

  2054.                    + src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 4) >>3;

  2055. 

  2056.     ((uint32_t*)(src+0*stride))[0]=

  2057.     ((uint32_t*)(src+1*stride))[0]=

  2058.     ((uint32_t*)(src+2*stride))[0]=

  2059.     ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;

  2060. }

  2061. 

  2062. static void pred4x4_left_dc_c(uint8_t *src, uint8_t *topright, int stride){

  2063.     const int dc= (  src[-1+0*stride] + src[-1+1*stride] + src[-1+2*stride] + src[-1+3*stride] + 2) >>2;

  2064. 

  2065.     ((uint32_t*)(src+0*stride))[0]=

  2066.     ((uint32_t*)(src+1*stride))[0]=

  2067.     ((uint32_t*)(src+2*stride))[0]=

  2068.     ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;

  2069. }

  2070. 

  2071. static void pred4x4_top_dc_c(uint8_t *src, uint8_t *topright, int stride){

  2072.     const int dc= (  src[-stride] + src[1-stride] + src[2-stride] + src[3-stride] + 2) >>2;

  2073. 

  2074.     ((uint32_t*)(src+0*stride))[0]=

  2075.     ((uint32_t*)(src+1*stride))[0]=

  2076.     ((uint32_t*)(src+2*stride))[0]=

  2077.     ((uint32_t*)(src+3*stride))[0]= dc* 0x01010101;

  2078. }

  2079. 

  2080. static void pred4x4_128_dc_c(uint8_t *src, uint8_t *topright, int stride){

  2081.     ((uint32_t*)(src+0*stride))[0]=

  2082.     ((uint32_t*)(src+1*stride))[0]=

  2083.     ((uint32_t*)(src+2*stride))[0]=

  2084.     ((uint32_t*)(src+3*stride))[0]= 128U*0x01010101U;

  2085. }

  2086. 

  2087. 

  2088. #define LOAD_TOP_RIGHT_EDGE\

  2089.     const int t4= topright[0];\

  2090.     const int t5= topright[1];\

  2091.     const int t6= topright[2];\

  2092.     const int t7= topright[3];\

  2093. 

  2094. #define LOAD_LEFT_EDGE\

  2095.     const int l0= src[-1+0*stride];\

  2096.     const int l1= src[-1+1*stride];\

  2097.     const int l2= src[-1+2*stride];\

  2098.     const int l3= src[-1+3*stride];\

  2099. 

  2100. #define LOAD_TOP_EDGE\

  2101.     const int t0= src[ 0-1*stride];\

  2102.     const int t1= src[ 1-1*stride];\

  2103.     const int t2= src[ 2-1*stride];\

  2104.     const int t3= src[ 3-1*stride];\

  2105. 

  2106. static void pred4x4_down_right_c(uint8_t *src, uint8_t *topright, int stride){

  2107.     const int lt= src[-1-1*stride];

  2108.     LOAD_TOP_EDGE

  2109.     LOAD_LEFT_EDGE

  2110. 

  2111.     src[0+3*stride]=(l3 + 2*l2 + l1 + 2)>>2;

  2112.     src[0+2*stride]=

  2113.     src[1+3*stride]=(l2 + 2*l1 + l0 + 2)>>2;

  2114.     src[0+1*stride]=

  2115.     src[1+2*stride]=

  2116.     src[2+3*stride]=(l1 + 2*l0 + lt + 2)>>2;

  2117.     src[0+0*stride]=

  2118.     src[1+1*stride]=

  2119.     src[2+2*stride]=

  2120.     src[3+3*stride]=(l0 + 2*lt + t0 + 2)>>2;

  2121.     src[1+0*stride]=

  2122.     src[2+1*stride]=

  2123.     src[3+2*stride]=(lt + 2*t0 + t1 + 2)>>2;

  2124.     src[2+0*stride]=

  2125.     src[3+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;

  2126.     src[3+0*stride]=(t1 + 2*t2 + t3 + 2)>>2;

  2127. }

  2128. 

  2129. static void pred4x4_down_left_c(uint8_t *src, uint8_t *topright, int stride){

  2130.     LOAD_TOP_EDGE

  2131.     LOAD_TOP_RIGHT_EDGE

  2132. //    LOAD_LEFT_EDGE

  2133. 

  2134.     src[0+0*stride]=(t0 + t2 + 2*t1 + 2)>>2;

  2135.     src[1+0*stride]=

  2136.     src[0+1*stride]=(t1 + t3 + 2*t2 + 2)>>2;

  2137.     src[2+0*stride]=

  2138.     src[1+1*stride]=

  2139.     src[0+2*stride]=(t2 + t4 + 2*t3 + 2)>>2;

  2140.     src[3+0*stride]=

  2141.     src[2+1*stride]=

  2142.     src[1+2*stride]=

  2143.     src[0+3*stride]=(t3 + t5 + 2*t4 + 2)>>2;

  2144.     src[3+1*stride]=

  2145.     src[2+2*stride]=

  2146.     src[1+3*stride]=(t4 + t6 + 2*t5 + 2)>>2;

  2147.     src[3+2*stride]=

  2148.     src[2+3*stride]=(t5 + t7 + 2*t6 + 2)>>2;

  2149.     src[3+3*stride]=(t6 + 3*t7 + 2)>>2;

  2150. }

  2151. 

  2152. static void pred4x4_vertical_right_c(uint8_t *src, uint8_t *topright, int stride){

  2153.     const int lt= src[-1-1*stride];

  2154.     LOAD_TOP_EDGE

  2155.     LOAD_LEFT_EDGE

  2156.     const __attribute__((unused)) int unu= l3;

  2157. 

  2158.     src[0+0*stride]=

  2159.     src[1+2*stride]=(lt + t0 + 1)>>1;

  2160.     src[1+0*stride]=

  2161.     src[2+2*stride]=(t0 + t1 + 1)>>1;

  2162.     src[2+0*stride]=

  2163.     src[3+2*stride]=(t1 + t2 + 1)>>1;

  2164.     src[3+0*stride]=(t2 + t3 + 1)>>1;

  2165.     src[0+1*stride]=

  2166.     src[1+3*stride]=(l0 + 2*lt + t0 + 2)>>2;

  2167.     src[1+1*stride]=

  2168.     src[2+3*stride]=(lt + 2*t0 + t1 + 2)>>2;

  2169.     src[2+1*stride]=

  2170.     src[3+3*stride]=(t0 + 2*t1 + t2 + 2)>>2;

  2171.     src[3+1*stride]=(t1 + 2*t2 + t3 + 2)>>2;

  2172.     src[0+2*stride]=(lt + 2*l0 + l1 + 2)>>2;

  2173.     src[0+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;

  2174. }

  2175. 

  2176. static void pred4x4_vertical_left_c(uint8_t *src, uint8_t *topright, int stride){

  2177.     LOAD_TOP_EDGE

  2178.     LOAD_TOP_RIGHT_EDGE

  2179.     const __attribute__((unused)) int unu= t7;

  2180. 

  2181.     src[0+0*stride]=(t0 + t1 + 1)>>1;

  2182.     src[1+0*stride]=

  2183.     src[0+2*stride]=(t1 + t2 + 1)>>1;

  2184.     src[2+0*stride]=

  2185.     src[1+2*stride]=(t2 + t3 + 1)>>1;

  2186.     src[3+0*stride]=

  2187.     src[2+2*stride]=(t3 + t4+ 1)>>1;

  2188.     src[3+2*stride]=(t4 + t5+ 1)>>1;

  2189.     src[0+1*stride]=(t0 + 2*t1 + t2 + 2)>>2;

  2190.     src[1+1*stride]=

  2191.     src[0+3*stride]=(t1 + 2*t2 + t3 + 2)>>2;

  2192.     src[2+1*stride]=

  2193.     src[1+3*stride]=(t2 + 2*t3 + t4 + 2)>>2;

  2194.     src[3+1*stride]=

  2195.     src[2+3*stride]=(t3 + 2*t4 + t5 + 2)>>2;

  2196.     src[3+3*stride]=(t4 + 2*t5 + t6 + 2)>>2;

  2197. }

  2198. 

  2199. static void pred4x4_horizontal_up_c(uint8_t *src, uint8_t *topright, int stride){

  2200.     LOAD_LEFT_EDGE

  2201. 

  2202.     src[0+0*stride]=(l0 + l1 + 1)>>1;

  2203.     src[1+0*stride]=(l0 + 2*l1 + l2 + 2)>>2;

  2204.     src[2+0*stride]=

  2205.     src[0+1*stride]=(l1 + l2 + 1)>>1;

  2206.     src[3+0*stride]=

  2207.     src[1+1*stride]=(l1 + 2*l2 + l3 + 2)>>2;

  2208.     src[2+1*stride]=

  2209.     src[0+2*stride]=(l2 + l3 + 1)>>1;

  2210.     src[3+1*stride]=

  2211.     src[1+2*stride]=(l2 + 2*l3 + l3 + 2)>>2;

  2212.     src[3+2*stride]=

  2213.     src[1+3*stride]=

  2214.     src[0+3*stride]=

  2215.     src[2+2*stride]=

  2216.     src[2+3*stride]=

  2217.     src[3+3*stride]=l3;

  2218. }

  2219. 

  2220. static void pred4x4_horizontal_down_c(uint8_t *src, uint8_t *topright, int stride){

  2221.     const int lt= src[-1-1*stride];

  2222.     LOAD_TOP_EDGE

  2223.     LOAD_LEFT_EDGE

  2224.     const __attribute__((unused)) int unu= t3;

  2225. 

  2226.     src[0+0*stride]=

  2227.     src[2+1*stride]=(lt + l0 + 1)>>1;

  2228.     src[1+0*stride]=

  2229.     src[3+1*stride]=(l0 + 2*lt + t0 + 2)>>2;

  2230.     src[2+0*stride]=(lt + 2*t0 + t1 + 2)>>2;

  2231.     src[3+0*stride]=(t0 + 2*t1 + t2 + 2)>>2;

  2232.     src[0+1*stride]=

  2233.     src[2+2*stride]=(l0 + l1 + 1)>>1;

  2234.     src[1+1*stride]=

  2235.     src[3+2*stride]=(lt + 2*l0 + l1 + 2)>>2;

  2236.     src[0+2*stride]=

  2237.     src[2+3*stride]=(l1 + l2+ 1)>>1;

  2238.     src[1+2*stride]=

  2239.     src[3+3*stride]=(l0 + 2*l1 + l2 + 2)>>2;

  2240.     src[0+3*stride]=(l2 + l3 + 1)>>1;

  2241.     src[1+3*stride]=(l1 + 2*l2 + l3 + 2)>>2;

  2242. }

  2243. 

  2244. void ff_pred16x16_vertical_c(uint8_t *src, int stride){

  2245.     int i;

  2246.     const uint32_t a= ((uint32_t*)(src-stride))[0];

  2247.     const uint32_t b= ((uint32_t*)(src-stride))[1];

  2248.     const uint32_t c= ((uint32_t*)(src-stride))[2];

  2249.     const uint32_t d= ((uint32_t*)(src-stride))[3];

  2250. 

  2251.     for(i=0; i<16; i++){

  2252.         ((uint32_t*)(src+i*stride))[0]= a;

  2253.         ((uint32_t*)(src+i*stride))[1]= b;

  2254.         ((uint32_t*)(src+i*stride))[2]= c;

  2255.         ((uint32_t*)(src+i*stride))[3]= d;

  2256.     }

  2257. }

  2258. 

  2259. void ff_pred16x16_horizontal_c(uint8_t *src, int stride){

  2260.     int i;

  2261. 

  2262.     for(i=0; i<16; i++){

  2263.         ((uint32_t*)(src+i*stride))[0]=

  2264.         ((uint32_t*)(src+i*stride))[1]=

  2265.         ((uint32_t*)(src+i*stride))[2]=

  2266.         ((uint32_t*)(src+i*stride))[3]= src[-1+i*stride]*0x01010101;

  2267.     }

  2268. }

  2269. 

  2270. void ff_pred16x16_dc_c(uint8_t *src, int stride){

  2271.     int i, dc=0;

  2272. 

  2273.     for(i=0;i<16; i++){

  2274.         dc+= src[-1+i*stride];

  2275.     }

  2276. 

  2277.     for(i=0;i<16; i++){

  2278.         dc+= src[i-stride];

  2279.     }

  2280. 

  2281.     dc= 0x01010101*((dc + 16)>>5);

  2282. 

  2283.     for(i=0; i<16; i++){

  2284.         ((uint32_t*)(src+i*stride))[0]=

  2285.         ((uint32_t*)(src+i*stride))[1]=

  2286.         ((uint32_t*)(src+i*stride))[2]=

  2287.         ((uint32_t*)(src+i*stride))[3]= dc;

  2288.     }

  2289. }

  2290. 

  2291. static void pred16x16_left_dc_c(uint8_t *src, int stride){

  2292.     int i, dc=0;

  2293. 

  2294.     for(i=0;i<16; i++){

  2295.         dc+= src[-1+i*stride];

  2296.     }

  2297. 

  2298.     dc= 0x01010101*((dc + 8)>>4);

  2299. 

  2300.     for(i=0; i<16; i++){

  2301.         ((uint32_t*)(src+i*stride))[0]=

  2302.         ((uint32_t*)(src+i*stride))[1]=

  2303.         ((uint32_t*)(src+i*stride))[2]=

  2304.         ((uint32_t*)(src+i*stride))[3]= dc;

  2305.     }

  2306. }

  2307. 

  2308. static void pred16x16_top_dc_c(uint8_t *src, int stride){

  2309.     int i, dc=0;

  2310. 

  2311.     for(i=0;i<16; i++){

  2312.         dc+= src[i-stride];

  2313.     }

  2314.     dc= 0x01010101*((dc + 8)>>4);

  2315. 

  2316.     for(i=0; i<16; i++){

  2317.         ((uint32_t*)(src+i*stride))[0]=

  2318.         ((uint32_t*)(src+i*stride))[1]=

  2319.         ((uint32_t*)(src+i*stride))[2]=

  2320.         ((uint32_t*)(src+i*stride))[3]= dc;

  2321.     }

  2322. }

  2323. 

  2324. void ff_pred16x16_128_dc_c(uint8_t *src, int stride){

  2325.     int i;

  2326. 

  2327.     for(i=0; i<16; i++){

  2328.         ((uint32_t*)(src+i*stride))[0]=

  2329.         ((uint32_t*)(src+i*stride))[1]=

  2330.         ((uint32_t*)(src+i*stride))[2]=

  2331.         ((uint32_t*)(src+i*stride))[3]= 0x01010101U*128U;

  2332.     }

  2333. }

  2334. 

  2335. static inline void pred16x16_plane_compat_c(uint8_t *src, int stride, const int svq3){

  2336.   int i, j, k;

  2337.   int a;

  2338.   uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  2339.   const uint8_t * const src0 = src+7-stride;

  2340.   const uint8_t *src1 = src+8*stride-1;

  2341.   const uint8_t *src2 = src1-2*stride;      // == src+6*stride-1;

  2342.   int H = src0[1] - src0[-1];

  2343.   int V = src1[0] - src2[ 0];

  2344.   for(k=2; k<=8; ++k) {

  2345.     src1 += stride; src2 -= stride;

  2346.     H += k*(src0[k] - src0[-k]);

  2347.     V += k*(src1[0] - src2[ 0]);

  2348.   }

  2349.   if(svq3){

  2350.     H = ( 5*(H/4) ) / 16;

  2351.     V = ( 5*(V/4) ) / 16;

  2352. 

  2353.     /* required for 100% accuracy */

  2354.     i = H; H = V; V = i;

  2355.   }else{

  2356.     H = ( 5*H+32 ) >> 6;

  2357.     V = ( 5*V+32 ) >> 6;

  2358.   }

  2359. 

  2360.   a = 16*(src1[0] + src2[16] + 1) - 7*(V+H);

  2361.   for(j=16; j>0; --j) {

  2362.     int b = a;

  2363.     a += V;

  2364.     for(i=-16; i<0; i+=4) {

  2365.       src[16+i] = cm[ (b    ) >> 5 ];

  2366.       src[17+i] = cm[ (b+  H) >> 5 ];

  2367.       src[18+i] = cm[ (b+2*H) >> 5 ];

  2368.       src[19+i] = cm[ (b+3*H) >> 5 ];

  2369.       b += 4*H;

  2370.     }

  2371.     src += stride;

  2372.   }

  2373. }

  2374. 

  2375. void ff_pred16x16_plane_c(uint8_t *src, int stride){

  2376.     pred16x16_plane_compat_c(src, stride, 0);

  2377. }

  2378. 

  2379. void ff_pred8x8_vertical_c(uint8_t *src, int stride){

  2380.     int i;

  2381.     const uint32_t a= ((uint32_t*)(src-stride))[0];

  2382.     const uint32_t b= ((uint32_t*)(src-stride))[1];

  2383. 

  2384.     for(i=0; i<8; i++){

  2385.         ((uint32_t*)(src+i*stride))[0]= a;

  2386.         ((uint32_t*)(src+i*stride))[1]= b;

  2387.     }

  2388. }

  2389. 

  2390. void ff_pred8x8_horizontal_c(uint8_t *src, int stride){

  2391.     int i;

  2392. 

  2393.     for(i=0; i<8; i++){

  2394.         ((uint32_t*)(src+i*stride))[0]=

  2395.         ((uint32_t*)(src+i*stride))[1]= src[-1+i*stride]*0x01010101;

  2396.     }

  2397. }

  2398. 

  2399. void ff_pred8x8_128_dc_c(uint8_t *src, int stride){

  2400.     int i;

  2401. 

  2402.     for(i=0; i<8; i++){

  2403.         ((uint32_t*)(src+i*stride))[0]=

  2404.         ((uint32_t*)(src+i*stride))[1]= 0x01010101U*128U;

  2405.     }

  2406. }

  2407. 

  2408. static void pred8x8_left_dc_c(uint8_t *src, int stride){

  2409.     int i;

  2410.     int dc0, dc2;

  2411. 

  2412.     dc0=dc2=0;

  2413.     for(i=0;i<4; i++){

  2414.         dc0+= src[-1+i*stride];

  2415.         dc2+= src[-1+(i+4)*stride];

  2416.     }

  2417.     dc0= 0x01010101*((dc0 + 2)>>2);

  2418.     dc2= 0x01010101*((dc2 + 2)>>2);

  2419. 

  2420.     for(i=0; i<4; i++){

  2421.         ((uint32_t*)(src+i*stride))[0]=

  2422.         ((uint32_t*)(src+i*stride))[1]= dc0;

  2423.     }

  2424.     for(i=4; i<8; i++){

  2425.         ((uint32_t*)(src+i*stride))[0]=

  2426.         ((uint32_t*)(src+i*stride))[1]= dc2;

  2427.     }

  2428. }

  2429. 

  2430. static void pred8x8_top_dc_c(uint8_t *src, int stride){

  2431.     int i;

  2432.     int dc0, dc1;

  2433. 

  2434.     dc0=dc1=0;

  2435.     for(i=0;i<4; i++){

  2436.         dc0+= src[i-stride];

  2437.         dc1+= src[4+i-stride];

  2438.     }

  2439.     dc0= 0x01010101*((dc0 + 2)>>2);

  2440.     dc1= 0x01010101*((dc1 + 2)>>2);

  2441. 

  2442.     for(i=0; i<4; i++){

  2443.         ((uint32_t*)(src+i*stride))[0]= dc0;

  2444.         ((uint32_t*)(src+i*stride))[1]= dc1;

  2445.     }

  2446.     for(i=4; i<8; i++){

  2447.         ((uint32_t*)(src+i*stride))[0]= dc0;

  2448.         ((uint32_t*)(src+i*stride))[1]= dc1;

  2449.     }

  2450. }

  2451. 

  2452. 

  2453. void ff_pred8x8_dc_c(uint8_t *src, int stride){

  2454.     int i;

  2455.     int dc0, dc1, dc2, dc3;

  2456. 

  2457.     dc0=dc1=dc2=0;

  2458.     for(i=0;i<4; i++){

  2459.         dc0+= src[-1+i*stride] + src[i-stride];

  2460.         dc1+= src[4+i-stride];

  2461.         dc2+= src[-1+(i+4)*stride];

  2462.     }

  2463.     dc3= 0x01010101*((dc1 + dc2 + 4)>>3);

  2464.     dc0= 0x01010101*((dc0 + 4)>>3);

  2465.     dc1= 0x01010101*((dc1 + 2)>>2);

  2466.     dc2= 0x01010101*((dc2 + 2)>>2);

  2467. 

  2468.     for(i=0; i<4; i++){

  2469.         ((uint32_t*)(src+i*stride))[0]= dc0;

  2470.         ((uint32_t*)(src+i*stride))[1]= dc1;

  2471.     }

  2472.     for(i=4; i<8; i++){

  2473.         ((uint32_t*)(src+i*stride))[0]= dc2;

  2474.         ((uint32_t*)(src+i*stride))[1]= dc3;

  2475.     }

  2476. }

  2477. 

  2478. void ff_pred8x8_plane_c(uint8_t *src, int stride){

  2479.   int j, k;

  2480.   int a;

  2481.   uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;

  2482.   const uint8_t * const src0 = src+3-stride;

  2483.   const uint8_t *src1 = src+4*stride-1;

  2484.   const uint8_t *src2 = src1-2*stride;      // == src+2*stride-1;

  2485.   int H = src0[1] - src0[-1];

  2486.   int V = src1[0] - src2[ 0];

  2487.   for(k=2; k<=4; ++k) {

  2488.     src1 += stride; src2 -= stride;

  2489.     H += k*(src0[k] - src0[-k]);

  2490.     V += k*(src1[0] - src2[ 0]);

  2491.   }

  2492.   H = ( 17*H+16 ) >> 5;

  2493.   V = ( 17*V+16 ) >> 5;

  2494. 

  2495.   a = 16*(src1[0] + src2[8]+1) - 3*(V+H);

  2496.   for(j=8; j>0; --j) {

  2497.     int b = a;

  2498.     a += V;

  2499.     src[0] = cm[ (b    ) >> 5 ];

  2500.     src[1] = cm[ (b+  H) >> 5 ];

  2501.     src[2] = cm[ (b+2*H) >> 5 ];

  2502.     src[3] = cm[ (b+3*H) >> 5 ];

  2503.     src[4] = cm[ (b+4*H) >> 5 ];

  2504.     src[5] = cm[ (b+5*H) >> 5 ];

  2505.     src[6] = cm[ (b+6*H) >> 5 ];

  2506.     src[7] = cm[ (b+7*H) >> 5 ];

  2507.     src += stride;

  2508.   }

  2509. }

  2510. 

  2511. #define SRC(x,y) src[(x)+(y)*stride]

  2512. #define PL(y) \

  2513.     const int l##y = (SRC(-1,y-1) + 2*SRC(-1,y) + SRC(-1,y+1) + 2) >> 2;

  2514. #define PREDICT_8x8_LOAD_LEFT \

  2515.     const int l0 = ((has_topleft ? SRC(-1,-1) : SRC(-1,0)) \

  2516.                      + 2*SRC(-1,0) + SRC(-1,1) + 2) >> 2; \

  2517.     PL(1) PL(2) PL(3) PL(4) PL(5) PL(6) \

  2518.     const int l7 attribute_unused = (SRC(-1,6) + 3*SRC(-1,7) + 2) >> 2

  2519. 

  2520. #define PT(x) \

  2521.     const int t##x = (SRC(x-1,-1) + 2*SRC(x,-1) + SRC(x+1,-1) + 2) >> 2;

  2522. #define PREDICT_8x8_LOAD_TOP \

  2523.     const int t0 = ((has_topleft ? SRC(-1,-1) : SRC(0,-1)) \

  2524.                      + 2*SRC(0,-1) + SRC(1,-1) + 2) >> 2; \

  2525.     PT(1) PT(2) PT(3) PT(4) PT(5) PT(6) \

  2526.     const int t7 attribute_unused = ((has_topright ? SRC(8,-1) : SRC(7,-1)) \

  2527.                      + 2*SRC(7,-1) + SRC(6,-1) + 2) >> 2

  2528. 

  2529. #define PTR(x) \

  2530.     t##x = (SRC(x-1,-1) + 2*SRC(x,-1) + SRC(x+1,-1) + 2) >> 2;

  2531. #define PREDICT_8x8_LOAD_TOPRIGHT \

  2532.     int t8, t9, t10, t11, t12, t13, t14, t15; \

  2533.     if(has_topright) { \

  2534.         PTR(8) PTR(9) PTR(10) PTR(11) PTR(12) PTR(13) PTR(14) \

  2535.         t15 = (SRC(14,-1) + 3*SRC(15,-1) + 2) >> 2; \

  2536.     } else t8=t9=t10=t11=t12=t13=t14=t15= SRC(7,-1);

  2537. 

  2538. #define PREDICT_8x8_LOAD_TOPLEFT \

  2539.     const int lt = (SRC(-1,0) + 2*SRC(-1,-1) + SRC(0,-1) + 2) >> 2

  2540. 

  2541. #define PREDICT_8x8_DC(v) \

  2542.     int y; \

  2543.     for( y = 0; y < 8; y++ ) { \

  2544.         ((uint32_t*)src)[0] = \

  2545.         ((uint32_t*)src)[1] = v; \

  2546.         src += stride; \

  2547.     }

  2548. 

  2549. static void pred8x8l_128_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2550. {

  2551.     PREDICT_8x8_DC(0x80808080);

  2552. }

  2553. static void pred8x8l_left_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2554. {

  2555.     PREDICT_8x8_LOAD_LEFT;

  2556.     const uint32_t dc = ((l0+l1+l2+l3+l4+l5+l6+l7+4) >> 3) * 0x01010101;

  2557.     PREDICT_8x8_DC(dc);

  2558. }

  2559. static void pred8x8l_top_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2560. {

  2561.     PREDICT_8x8_LOAD_TOP;

  2562.     const uint32_t dc = ((t0+t1+t2+t3+t4+t5+t6+t7+4) >> 3) * 0x01010101;

  2563.     PREDICT_8x8_DC(dc);

  2564. }

  2565. static void pred8x8l_dc_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2566. {

  2567.     PREDICT_8x8_LOAD_LEFT;

  2568.     PREDICT_8x8_LOAD_TOP;

  2569.     const uint32_t dc = ((l0+l1+l2+l3+l4+l5+l6+l7

  2570.                          +t0+t1+t2+t3+t4+t5+t6+t7+8) >> 4) * 0x01010101;

  2571.     PREDICT_8x8_DC(dc);

  2572. }

  2573. static void pred8x8l_horizontal_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2574. {

  2575.     PREDICT_8x8_LOAD_LEFT;

  2576. #define ROW(y) ((uint32_t*)(src+y*stride))[0] =\

  2577.                ((uint32_t*)(src+y*stride))[1] = 0x01010101 * l##y

  2578.     ROW(0); ROW(1); ROW(2); ROW(3); ROW(4); ROW(5); ROW(6); ROW(7);

  2579. #undef ROW

  2580. }

  2581. static void pred8x8l_vertical_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2582. {

  2583.     int y;

  2584.     PREDICT_8x8_LOAD_TOP;

  2585.     src[0] = t0;

  2586.     src[1] = t1;

  2587.     src[2] = t2;

  2588.     src[3] = t3;

  2589.     src[4] = t4;

  2590.     src[5] = t5;

  2591.     src[6] = t6;

  2592.     src[7] = t7;

  2593.     for( y = 1; y < 8; y++ )

  2594.         *(uint64_t*)(src+y*stride) = *(uint64_t*)src;

  2595. }

  2596. static void pred8x8l_down_left_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2597. {

  2598.     PREDICT_8x8_LOAD_TOP;

  2599.     PREDICT_8x8_LOAD_TOPRIGHT;

  2600.     SRC(0,0)= (t0 + 2*t1 + t2 + 2) >> 2;

  2601.     SRC(0,1)=SRC(1,0)= (t1 + 2*t2 + t3 + 2) >> 2;

  2602.     SRC(0,2)=SRC(1,1)=SRC(2,0)= (t2 + 2*t3 + t4 + 2) >> 2;

  2603.     SRC(0,3)=SRC(1,2)=SRC(2,1)=SRC(3,0)= (t3 + 2*t4 + t5 + 2) >> 2;

  2604.     SRC(0,4)=SRC(1,3)=SRC(2,2)=SRC(3,1)=SRC(4,0)= (t4 + 2*t5 + t6 + 2) >> 2;

  2605.     SRC(0,5)=SRC(1,4)=SRC(2,3)=SRC(3,2)=SRC(4,1)=SRC(5,0)= (t5 + 2*t6 + t7 + 2) >> 2;

  2606.     SRC(0,6)=SRC(1,5)=SRC(2,4)=SRC(3,3)=SRC(4,2)=SRC(5,1)=SRC(6,0)= (t6 + 2*t7 + t8 + 2) >> 2;

  2607.     SRC(0,7)=SRC(1,6)=SRC(2,5)=SRC(3,4)=SRC(4,3)=SRC(5,2)=SRC(6,1)=SRC(7,0)= (t7 + 2*t8 + t9 + 2) >> 2;

  2608.     SRC(1,7)=SRC(2,6)=SRC(3,5)=SRC(4,4)=SRC(5,3)=SRC(6,2)=SRC(7,1)= (t8 + 2*t9 + t10 + 2) >> 2;

  2609.     SRC(2,7)=SRC(3,6)=SRC(4,5)=SRC(5,4)=SRC(6,3)=SRC(7,2)= (t9 + 2*t10 + t11 + 2) >> 2;

  2610.     SRC(3,7)=SRC(4,6)=SRC(5,5)=SRC(6,4)=SRC(7,3)= (t10 + 2*t11 + t12 + 2) >> 2;

  2611.     SRC(4,7)=SRC(5,6)=SRC(6,5)=SRC(7,4)= (t11 + 2*t12 + t13 + 2) >> 2;

  2612.     SRC(5,7)=SRC(6,6)=SRC(7,5)= (t12 + 2*t13 + t14 + 2) >> 2;

  2613.     SRC(6,7)=SRC(7,6)= (t13 + 2*t14 + t15 + 2) >> 2;

  2614.     SRC(7,7)= (t14 + 3*t15 + 2) >> 2;

  2615. }

  2616. static void pred8x8l_down_right_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2617. {

  2618.     PREDICT_8x8_LOAD_TOP;

  2619.     PREDICT_8x8_LOAD_LEFT;

  2620.     PREDICT_8x8_LOAD_TOPLEFT;

  2621.     SRC(0,7)= (l7 + 2*l6 + l5 + 2) >> 2;

  2622.     SRC(0,6)=SRC(1,7)= (l6 + 2*l5 + l4 + 2) >> 2;

  2623.     SRC(0,5)=SRC(1,6)=SRC(2,7)= (l5 + 2*l4 + l3 + 2) >> 2;

  2624.     SRC(0,4)=SRC(1,5)=SRC(2,6)=SRC(3,7)= (l4 + 2*l3 + l2 + 2) >> 2;

  2625.     SRC(0,3)=SRC(1,4)=SRC(2,5)=SRC(3,6)=SRC(4,7)= (l3 + 2*l2 + l1 + 2) >> 2;

  2626.     SRC(0,2)=SRC(1,3)=SRC(2,4)=SRC(3,5)=SRC(4,6)=SRC(5,7)= (l2 + 2*l1 + l0 + 2) >> 2;

  2627.     SRC(0,1)=SRC(1,2)=SRC(2,3)=SRC(3,4)=SRC(4,5)=SRC(5,6)=SRC(6,7)= (l1 + 2*l0 + lt + 2) >> 2;

  2628.     SRC(0,0)=SRC(1,1)=SRC(2,2)=SRC(3,3)=SRC(4,4)=SRC(5,5)=SRC(6,6)=SRC(7,7)= (l0 + 2*lt + t0 + 2) >> 2;

  2629.     SRC(1,0)=SRC(2,1)=SRC(3,2)=SRC(4,3)=SRC(5,4)=SRC(6,5)=SRC(7,6)= (lt + 2*t0 + t1 + 2) >> 2;

  2630.     SRC(2,0)=SRC(3,1)=SRC(4,2)=SRC(5,3)=SRC(6,4)=SRC(7,5)= (t0 + 2*t1 + t2 + 2) >> 2;

  2631.     SRC(3,0)=SRC(4,1)=SRC(5,2)=SRC(6,3)=SRC(7,4)= (t1 + 2*t2 + t3 + 2) >> 2;

  2632.     SRC(4,0)=SRC(5,1)=SRC(6,2)=SRC(7,3)= (t2 + 2*t3 + t4 + 2) >> 2;

  2633.     SRC(5,0)=SRC(6,1)=SRC(7,2)= (t3 + 2*t4 + t5 + 2) >> 2;

  2634.     SRC(6,0)=SRC(7,1)= (t4 + 2*t5 + t6 + 2) >> 2;

  2635.     SRC(7,0)= (t5 + 2*t6 + t7 + 2) >> 2;

  2636. 

  2637. }

  2638. static void pred8x8l_vertical_right_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2639. {

  2640.     PREDICT_8x8_LOAD_TOP;

  2641.     PREDICT_8x8_LOAD_LEFT;

  2642.     PREDICT_8x8_LOAD_TOPLEFT;

  2643.     SRC(0,6)= (l5 + 2*l4 + l3 + 2) >> 2;

  2644.     SRC(0,7)= (l6 + 2*l5 + l4 + 2) >> 2;

  2645.     SRC(0,4)=SRC(1,6)= (l3 + 2*l2 + l1 + 2) >> 2;

  2646.     SRC(0,5)=SRC(1,7)= (l4 + 2*l3 + l2 + 2) >> 2;

  2647.     SRC(0,2)=SRC(1,4)=SRC(2,6)= (l1 + 2*l0 + lt + 2) >> 2;

  2648.     SRC(0,3)=SRC(1,5)=SRC(2,7)= (l2 + 2*l1 + l0 + 2) >> 2;

  2649.     SRC(0,1)=SRC(1,3)=SRC(2,5)=SRC(3,7)= (l0 + 2*lt + t0 + 2) >> 2;

  2650.     SRC(0,0)=SRC(1,2)=SRC(2,4)=SRC(3,6)= (lt + t0 + 1) >> 1;

  2651.     SRC(1,1)=SRC(2,3)=SRC(3,5)=SRC(4,7)= (lt + 2*t0 + t1 + 2) >> 2;

  2652.     SRC(1,0)=SRC(2,2)=SRC(3,4)=SRC(4,6)= (t0 + t1 + 1) >> 1;

  2653.     SRC(2,1)=SRC(3,3)=SRC(4,5)=SRC(5,7)= (t0 + 2*t1 + t2 + 2) >> 2;

  2654.     SRC(2,0)=SRC(3,2)=SRC(4,4)=SRC(5,6)= (t1 + t2 + 1) >> 1;

  2655.     SRC(3,1)=SRC(4,3)=SRC(5,5)=SRC(6,7)= (t1 + 2*t2 + t3 + 2) >> 2;

  2656.     SRC(3,0)=SRC(4,2)=SRC(5,4)=SRC(6,6)= (t2 + t3 + 1) >> 1;

  2657.     SRC(4,1)=SRC(5,3)=SRC(6,5)=SRC(7,7)= (t2 + 2*t3 + t4 + 2) >> 2;

  2658.     SRC(4,0)=SRC(5,2)=SRC(6,4)=SRC(7,6)= (t3 + t4 + 1) >> 1;

  2659.     SRC(5,1)=SRC(6,3)=SRC(7,5)= (t3 + 2*t4 + t5 + 2) >> 2;

  2660.     SRC(5,0)=SRC(6,2)=SRC(7,4)= (t4 + t5 + 1) >> 1;

  2661.     SRC(6,1)=SRC(7,3)= (t4 + 2*t5 + t6 + 2) >> 2;

  2662.     SRC(6,0)=SRC(7,2)= (t5 + t6 + 1) >> 1;

  2663.     SRC(7,1)= (t5 + 2*t6 + t7 + 2) >> 2;

  2664.     SRC(7,0)= (t6 + t7 + 1) >> 1;

  2665. }

  2666. static void pred8x8l_horizontal_down_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2667. {

  2668.     PREDICT_8x8_LOAD_TOP;

  2669.     PREDICT_8x8_LOAD_LEFT;

  2670.     PREDICT_8x8_LOAD_TOPLEFT;

  2671.     SRC(0,7)= (l6 + l7 + 1) >> 1;

  2672.     SRC(1,7)= (l5 + 2*l6 + l7 + 2) >> 2;

  2673.     SRC(0,6)=SRC(2,7)= (l5 + l6 + 1) >> 1;

  2674.     SRC(1,6)=SRC(3,7)= (l4 + 2*l5 + l6 + 2) >> 2;

  2675.     SRC(0,5)=SRC(2,6)=SRC(4,7)= (l4 + l5 + 1) >> 1;

  2676.     SRC(1,5)=SRC(3,6)=SRC(5,7)= (l3 + 2*l4 + l5 + 2) >> 2;

  2677.     SRC(0,4)=SRC(2,5)=SRC(4,6)=SRC(6,7)= (l3 + l4 + 1) >> 1;

  2678.     SRC(1,4)=SRC(3,5)=SRC(5,6)=SRC(7,7)= (l2 + 2*l3 + l4 + 2) >> 2;

  2679.     SRC(0,3)=SRC(2,4)=SRC(4,5)=SRC(6,6)= (l2 + l3 + 1) >> 1;

  2680.     SRC(1,3)=SRC(3,4)=SRC(5,5)=SRC(7,6)= (l1 + 2*l2 + l3 + 2) >> 2;

  2681.     SRC(0,2)=SRC(2,3)=SRC(4,4)=SRC(6,5)= (l1 + l2 + 1) >> 1;

  2682.     SRC(1,2)=SRC(3,3)=SRC(5,4)=SRC(7,5)= (l0 + 2*l1 + l2 + 2) >> 2;

  2683.     SRC(0,1)=SRC(2,2)=SRC(4,3)=SRC(6,4)= (l0 + l1 + 1) >> 1;

  2684.     SRC(1,1)=SRC(3,2)=SRC(5,3)=SRC(7,4)= (lt + 2*l0 + l1 + 2) >> 2;

  2685.     SRC(0,0)=SRC(2,1)=SRC(4,2)=SRC(6,3)= (lt + l0 + 1) >> 1;

  2686.     SRC(1,0)=SRC(3,1)=SRC(5,2)=SRC(7,3)= (l0 + 2*lt + t0 + 2) >> 2;

  2687.     SRC(2,0)=SRC(4,1)=SRC(6,2)= (t1 + 2*t0 + lt + 2) >> 2;

  2688.     SRC(3,0)=SRC(5,1)=SRC(7,2)= (t2 + 2*t1 + t0 + 2) >> 2;

  2689.     SRC(4,0)=SRC(6,1)= (t3 + 2*t2 + t1 + 2) >> 2;

  2690.     SRC(5,0)=SRC(7,1)= (t4 + 2*t3 + t2 + 2) >> 2;

  2691.     SRC(6,0)= (t5 + 2*t4 + t3 + 2) >> 2;

  2692.     SRC(7,0)= (t6 + 2*t5 + t4 + 2) >> 2;

  2693. }

  2694. static void pred8x8l_vertical_left_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2695. {

  2696.     PREDICT_8x8_LOAD_TOP;

  2697.     PREDICT_8x8_LOAD_TOPRIGHT;

  2698.     SRC(0,0)= (t0 + t1 + 1) >> 1;

  2699.     SRC(0,1)= (t0 + 2*t1 + t2 + 2) >> 2;

  2700.     SRC(0,2)=SRC(1,0)= (t1 + t2 + 1) >> 1;

  2701.     SRC(0,3)=SRC(1,1)= (t1 + 2*t2 + t3 + 2) >> 2;

  2702.     SRC(0,4)=SRC(1,2)=SRC(2,0)= (t2 + t3 + 1) >> 1;

  2703.     SRC(0,5)=SRC(1,3)=SRC(2,1)= (t2 + 2*t3 + t4 + 2) >> 2;

  2704.     SRC(0,6)=SRC(1,4)=SRC(2,2)=SRC(3,0)= (t3 + t4 + 1) >> 1;

  2705.     SRC(0,7)=SRC(1,5)=SRC(2,3)=SRC(3,1)= (t3 + 2*t4 + t5 + 2) >> 2;

  2706.     SRC(1,6)=SRC(2,4)=SRC(3,2)=SRC(4,0)= (t4 + t5 + 1) >> 1;

  2707.     SRC(1,7)=SRC(2,5)=SRC(3,3)=SRC(4,1)= (t4 + 2*t5 + t6 + 2) >> 2;

  2708.     SRC(2,6)=SRC(3,4)=SRC(4,2)=SRC(5,0)= (t5 + t6 + 1) >> 1;

  2709.     SRC(2,7)=SRC(3,5)=SRC(4,3)=SRC(5,1)= (t5 + 2*t6 + t7 + 2) >> 2;

  2710.     SRC(3,6)=SRC(4,4)=SRC(5,2)=SRC(6,0)= (t6 + t7 + 1) >> 1;

  2711.     SRC(3,7)=SRC(4,5)=SRC(5,3)=SRC(6,1)= (t6 + 2*t7 + t8 + 2) >> 2;

  2712.     SRC(4,6)=SRC(5,4)=SRC(6,2)=SRC(7,0)= (t7 + t8 + 1) >> 1;

  2713.     SRC(4,7)=SRC(5,5)=SRC(6,3)=SRC(7,1)= (t7 + 2*t8 + t9 + 2) >> 2;

  2714.     SRC(5,6)=SRC(6,4)=SRC(7,2)= (t8 + t9 + 1) >> 1;

  2715.     SRC(5,7)=SRC(6,5)=SRC(7,3)= (t8 + 2*t9 + t10 + 2) >> 2;

  2716.     SRC(6,6)=SRC(7,4)= (t9 + t10 + 1) >> 1;

  2717.     SRC(6,7)=SRC(7,5)= (t9 + 2*t10 + t11 + 2) >> 2;

  2718.     SRC(7,6)= (t10 + t11 + 1) >> 1;

  2719.     SRC(7,7)= (t10 + 2*t11 + t12 + 2) >> 2;

  2720. }

  2721. static void pred8x8l_horizontal_up_c(uint8_t *src, int has_topleft, int has_topright, int stride)

  2722. {

  2723.     PREDICT_8x8_LOAD_LEFT;

  2724.     SRC(0,0)= (l0 + l1 + 1) >> 1;

  2725.     SRC(1,0)= (l0 + 2*l1 + l2 + 2) >> 2;

  2726.     SRC(0,1)=SRC(2,0)= (l1 + l2 + 1) >> 1;

  2727.     SRC(1,1)=SRC(3,0)= (l1 + 2*l2 + l3 + 2) >> 2;

  2728.     SRC(0,2)=SRC(2,1)=SRC(4,0)= (l2 + l3 + 1) >> 1;

  2729.     SRC(1,2)=SRC(3,1)=SRC(5,0)= (l2 + 2*l3 + l4 + 2) >> 2;

  2730.     SRC(0,3)=SRC(2,2)=SRC(4,1)=SRC(6,0)= (l3 + l4 + 1) >> 1;

  2731.     SRC(1,3)=SRC(3,2)=SRC(5,1)=SRC(7,0)= (l3 + 2*l4 + l5 + 2) >> 2;

  2732.     SRC(0,4)=SRC(2,3)=SRC(4,2)=SRC(6,1)= (l4 + l5 + 1) >> 1;

  2733.     SRC(1,4)=SRC(3,3)=SRC(5,2)=SRC(7,1)= (l4 + 2*l5 + l6 + 2) >> 2;

  2734.     SRC(0,5)=SRC(2,4)=SRC(4,3)=SRC(6,2)= (l5 + l6 + 1) >> 1;

  2735.     SRC(1,5)=SRC(3,4)=SRC(5,3)=SRC(7,2)= (l5 + 2*l6 + l7 + 2) >> 2;

  2736.     SRC(0,6)=SRC(2,5)=SRC(4,4)=SRC(6,3)= (l6 + l7 + 1) >> 1;

  2737.     SRC(1,6)=SRC(3,5)=SRC(5,4)=SRC(7,3)= (l6 + 3*l7 + 2) >> 2;

  2738.     SRC(0,7)=SRC(1,7)=SRC(2,6)=SRC(2,7)=SRC(3,6)=

  2739.     SRC(3,7)=SRC(4,5)=SRC(4,6)=SRC(4,7)=SRC(5,5)=

  2740.     SRC(5,6)=SRC(5,7)=SRC(6,4)=SRC(6,5)=SRC(6,6)=

  2741.     SRC(6,7)=SRC(7,4)=SRC(7,5)=SRC(7,6)=SRC(7,7)= l7;

  2742. }

  2743. #undef PREDICT_8x8_LOAD_LEFT

  2744. #undef PREDICT_8x8_LOAD_TOP

  2745. #undef PREDICT_8x8_LOAD_TOPLEFT

  2746. #undef PREDICT_8x8_LOAD_TOPRIGHT

  2747. #undef PREDICT_8x8_DC

  2748. #undef PTR

  2749. #undef PT

  2750. #undef PL

  2751. #undef SRC

  2752. 

  2753. static inline void mc_dir_part(H264Context *h, Picture *pic, int n, int square, int chroma_height, int delta, int list,

  2754.                            uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,

  2755.                            int src_x_offset, int src_y_offset,

  2756.                            qpel_mc_func *qpix_op, h264_chroma_mc_func chroma_op){

  2757.     MpegEncContext * const s = &h->s;

  2758.     const int mx= h->mv_cache[list][ scan8[n] ][0] + src_x_offset*8;

  2759.     int my=       h->mv_cache[list][ scan8[n] ][1] + src_y_offset*8;

  2760.     const int luma_xy= (mx&3) + ((my&3)<<2);

  2761.     uint8_t * src_y = pic->data[0] + (mx>>2) + (my>>2)*h->mb_linesize;

  2762.     uint8_t * src_cb, * src_cr;

  2763.     int extra_width= h->emu_edge_width;

  2764.     int extra_height= h->emu_edge_height;

  2765.     int emu=0;

  2766.     const int full_mx= mx>>2;

  2767.     const int full_my= my>>2;

  2768.     const int pic_width  = 16*s->mb_width;

  2769.     const int pic_height = 16*s->mb_height >> MB_MBAFF;

  2770. 

  2771.     if(!pic->data[0])

  2772.         return;

  2773. 

  2774.     if(mx&7) extra_width -= 3;

  2775.     if(my&7) extra_height -= 3;

  2776. 

  2777.     if(   full_mx < 0-extra_width

  2778.        || full_my < 0-extra_height

  2779.        || full_mx + 16/*FIXME*/ > pic_width + extra_width

  2780.        || full_my + 16/*FIXME*/ > pic_height + extra_height){

  2781.         ff_emulated_edge_mc(s->edge_emu_buffer, src_y - 2 - 2*h->mb_linesize, h->mb_linesize, 16+5, 16+5/*FIXME*/, full_mx-2, full_my-2, pic_width, pic_height);

  2782.             src_y= s->edge_emu_buffer + 2 + 2*h->mb_linesize;

  2783.         emu=1;

  2784.     }

  2785. 

  2786.     qpix_op[luma_xy](dest_y, src_y, h->mb_linesize); //FIXME try variable height perhaps?

  2787.     if(!square){

  2788.         qpix_op[luma_xy](dest_y + delta, src_y + delta, h->mb_linesize);

  2789.     }

  2790. 

  2791.     if(s->flags&CODEC_FLAG_GRAY) return;

  2792. 

  2793.     if(MB_MBAFF){

  2794.         // chroma offset when predicting from a field of opposite parity

  2795.         my += 2 * ((s->mb_y & 1) - (h->ref_cache[list][scan8[n]] & 1));

  2796.         emu |= (my>>3) < 0 || (my>>3) + 8 >= (pic_height>>1);

  2797.     }

  2798.     src_cb= pic->data[1] + (mx>>3) + (my>>3)*h->mb_uvlinesize;

  2799.     src_cr= pic->data[2] + (mx>>3) + (my>>3)*h->mb_uvlinesize;

  2800. 

  2801.     if(emu){

  2802.         ff_emulated_edge_mc(s->edge_emu_buffer, src_cb, h->mb_uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);

  2803.             src_cb= s->edge_emu_buffer;

  2804.     }

  2805.     chroma_op(dest_cb, src_cb, h->mb_uvlinesize, chroma_height, mx&7, my&7);

  2806. 

  2807.     if(emu){

  2808.         ff_emulated_edge_mc(s->edge_emu_buffer, src_cr, h->mb_uvlinesize, 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);

  2809.             src_cr= s->edge_emu_buffer;

  2810.     }

  2811.     chroma_op(dest_cr, src_cr, h->mb_uvlinesize, chroma_height, mx&7, my&7);

  2812. }

  2813. 

  2814. static inline void mc_part_std(H264Context *h, int n, int square, int chroma_height, int delta,

  2815.                            uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,

  2816.                            int x_offset, int y_offset,

  2817.                            qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,

  2818.                            qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,

  2819.                            int list0, int list1){

  2820.     MpegEncContext * const s = &h->s;

  2821.     qpel_mc_func *qpix_op=  qpix_put;

  2822.     h264_chroma_mc_func chroma_op= chroma_put;

  2823. 

  2824.     dest_y  += 2*x_offset + 2*y_offset*h->  mb_linesize;

  2825.     dest_cb +=   x_offset +   y_offset*h->mb_uvlinesize;

  2826.     dest_cr +=   x_offset +   y_offset*h->mb_uvlinesize;

  2827.     x_offset += 8*s->mb_x;

  2828.     y_offset += 8*(s->mb_y >> MB_MBAFF);

  2829. 

  2830.     if(list0){

  2831.         Picture *ref= &h->ref_list[0][ h->ref_cache[0][ scan8[n] ] ];

  2832.         mc_dir_part(h, ref, n, square, chroma_height, delta, 0,

  2833.                            dest_y, dest_cb, dest_cr, x_offset, y_offset,

  2834.                            qpix_op, chroma_op);

  2835. 

  2836.         qpix_op=  qpix_avg;

  2837.         chroma_op= chroma_avg;

  2838.     }

  2839. 

  2840.     if(list1){

  2841.         Picture *ref= &h->ref_list[1][ h->ref_cache[1][ scan8[n] ] ];

  2842.         mc_dir_part(h, ref, n, square, chroma_height, delta, 1,

  2843.                            dest_y, dest_cb, dest_cr, x_offset, y_offset,

  2844.                            qpix_op, chroma_op);

  2845.     }

  2846. }

  2847. 

  2848. static inline void mc_part_weighted(H264Context *h, int n, int square, int chroma_height, int delta,

  2849.                            uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,

  2850.                            int x_offset, int y_offset,

  2851.                            qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,

  2852.                            h264_weight_func luma_weight_op, h264_weight_func chroma_weight_op,

  2853.                            h264_biweight_func luma_weight_avg, h264_biweight_func chroma_weight_avg,

  2854.                            int list0, int list1){

  2855.     MpegEncContext * const s = &h->s;

  2856. 

  2857.     dest_y  += 2*x_offset + 2*y_offset*h->  mb_linesize;

  2858.     dest_cb +=   x_offset +   y_offset*h->mb_uvlinesize;

  2859.     dest_cr +=   x_offset +   y_offset*h->mb_uvlinesize;

  2860.     x_offset += 8*s->mb_x;

  2861.     y_offset += 8*(s->mb_y >> MB_MBAFF);

  2862. 

  2863.     if(list0 && list1){

  2864.         /* don't optimize for luma-only case, since B-frames usually

  2865.          * use implicit weights => chroma too. */

  2866.         uint8_t *tmp_cb = s->obmc_scratchpad;

  2867.         uint8_t *tmp_cr = s->obmc_scratchpad + 8;

  2868.         uint8_t *tmp_y  = s->obmc_scratchpad + 8*h->mb_uvlinesize;

  2869.         int refn0 = h->ref_cache[0][ scan8[n] ];

  2870.         int refn1 = h->ref_cache[1][ scan8[n] ];

  2871. 

  2872.         mc_dir_part(h, &h->ref_list[0][refn0], n, square, chroma_height, delta, 0,

  2873.                     dest_y, dest_cb, dest_cr,

  2874.                     x_offset, y_offset, qpix_put, chroma_put);

  2875.         mc_dir_part(h, &h->ref_list[1][refn1], n, square, chroma_height, delta, 1,

  2876.                     tmp_y, tmp_cb, tmp_cr,

  2877.                     x_offset, y_offset, qpix_put, chroma_put);

  2878. 

  2879.         if(h->use_weight == 2){

  2880.             int weight0 = h->implicit_weight[refn0][refn1];

  2881.             int weight1 = 64 - weight0;

  2882.             luma_weight_avg(  dest_y,  tmp_y,  h->  mb_linesize, 5, weight0, weight1, 0);

  2883.             chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, 5, weight0, weight1, 0);

  2884.             chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, 5, weight0, weight1, 0);

  2885.         }else{

  2886.             luma_weight_avg(dest_y, tmp_y, h->mb_linesize, h->luma_log2_weight_denom,

  2887.                             h->luma_weight[0][refn0], h->luma_weight[1][refn1],

  2888.                             h->luma_offset[0][refn0] + h->luma_offset[1][refn1]);

  2889.             chroma_weight_avg(dest_cb, tmp_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,

  2890.                             h->chroma_weight[0][refn0][0], h->chroma_weight[1][refn1][0],

  2891.                             h->chroma_offset[0][refn0][0] + h->chroma_offset[1][refn1][0]);

  2892.             chroma_weight_avg(dest_cr, tmp_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,

  2893.                             h->chroma_weight[0][refn0][1], h->chroma_weight[1][refn1][1],

  2894.                             h->chroma_offset[0][refn0][1] + h->chroma_offset[1][refn1][1]);

  2895.         }

  2896.     }else{

  2897.         int list = list1 ? 1 : 0;

  2898.         int refn = h->ref_cache[list][ scan8[n] ];

  2899.         Picture *ref= &h->ref_list[list][refn];

  2900.         mc_dir_part(h, ref, n, square, chroma_height, delta, list,

  2901.                     dest_y, dest_cb, dest_cr, x_offset, y_offset,

  2902.                     qpix_put, chroma_put);

  2903. 

  2904.         luma_weight_op(dest_y, h->mb_linesize, h->luma_log2_weight_denom,

  2905.                        h->luma_weight[list][refn], h->luma_offset[list][refn]);

  2906.         if(h->use_weight_chroma){

  2907.             chroma_weight_op(dest_cb, h->mb_uvlinesize, h->chroma_log2_weight_denom,

  2908.                              h->chroma_weight[list][refn][0], h->chroma_offset[list][refn][0]);

  2909.             chroma_weight_op(dest_cr, h->mb_uvlinesize, h->chroma_log2_weight_denom,

  2910.                              h->chroma_weight[list][refn][1], h->chroma_offset[list][refn][1]);

  2911.         }

  2912.     }

  2913. }

  2914. 

  2915. static inline void mc_part(H264Context *h, int n, int square, int chroma_height, int delta,

  2916.                            uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,

  2917.                            int x_offset, int y_offset,

  2918.                            qpel_mc_func *qpix_put, h264_chroma_mc_func chroma_put,

  2919.                            qpel_mc_func *qpix_avg, h264_chroma_mc_func chroma_avg,

  2920.                            h264_weight_func *weight_op, h264_biweight_func *weight_avg,

  2921.                            int list0, int list1){

  2922.     if((h->use_weight==2 && list0 && list1

  2923.         && (h->implicit_weight[ h->ref_cache[0][scan8[n]] ][ h->ref_cache[1][scan8[n]] ] != 32))

  2924.        || h->use_weight==1)

  2925.         mc_part_weighted(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,

  2926.                          x_offset, y_offset, qpix_put, chroma_put,

  2927.                          weight_op[0], weight_op[3], weight_avg[0], weight_avg[3], list0, list1);

  2928.     else

  2929.         mc_part_std(h, n, square, chroma_height, delta, dest_y, dest_cb, dest_cr,

  2930.                     x_offset, y_offset, qpix_put, chroma_put, qpix_avg, chroma_avg, list0, list1);

  2931. }

  2932. 

  2933. static inline void prefetch_motion(H264Context *h, int list){

  2934.     /* fetch pixels for estimated mv 4 macroblocks ahead

  2935.      * optimized for 64byte cache lines */

  2936.     MpegEncContext * const s = &h->s;

  2937.     const int refn = h->ref_cache[list][scan8[0]];

  2938.     if(refn >= 0){

  2939.         const int mx= (h->mv_cache[list][scan8[0]][0]>>2) + 16*s->mb_x + 8;

  2940.         const int my= (h->mv_cache[list][scan8[0]][1]>>2) + 16*s->mb_y;

  2941.         uint8_t **src= h->ref_list[list][refn].data;

  2942.         int off= mx + (my + (s->mb_x&3)*4)*h->mb_linesize + 64;

  2943.         s->dsp.prefetch(src[0]+off, s->linesize, 4);

  2944.         off= (mx>>1) + ((my>>1) + (s->mb_x&7))*s->uvlinesize + 64;

  2945.         s->dsp.prefetch(src[1]+off, src[2]-src[1], 2);

  2946.     }

  2947. }

  2948. 

  2949. static void hl_motion(H264Context *h, uint8_t *dest_y, uint8_t *dest_cb, uint8_t *dest_cr,

  2950.                       qpel_mc_func (*qpix_put)[16], h264_chroma_mc_func (*chroma_put),

  2951.                       qpel_mc_func (*qpix_avg)[16], h264_chroma_mc_func (*chroma_avg),

  2952.                       h264_weight_func *weight_op, h264_biweight_func *weight_avg){

  2953.     MpegEncContext * const s = &h->s;

  2954.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  2955.     const int mb_type= s->current_picture.mb_type[mb_xy];

  2956. 

  2957.     assert(IS_INTER(mb_type));

  2958. 

  2959.     prefetch_motion(h, 0);

  2960. 

  2961.     if(IS_16X16(mb_type)){

  2962.         mc_part(h, 0, 1, 8, 0, dest_y, dest_cb, dest_cr, 0, 0,

  2963.                 qpix_put[0], chroma_put[0], qpix_avg[0], chroma_avg[0],

  2964.                 &weight_op[0], &weight_avg[0],

  2965.                 IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));

  2966.     }else if(IS_16X8(mb_type)){

  2967.         mc_part(h, 0, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 0,

  2968.                 qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],

  2969.                 &weight_op[1], &weight_avg[1],

  2970.                 IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));

  2971.         mc_part(h, 8, 0, 4, 8, dest_y, dest_cb, dest_cr, 0, 4,

  2972.                 qpix_put[1], chroma_put[0], qpix_avg[1], chroma_avg[0],

  2973.                 &weight_op[1], &weight_avg[1],

  2974.                 IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));

  2975.     }else if(IS_8X16(mb_type)){

  2976.         mc_part(h, 0, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 0, 0,

  2977.                 qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],

  2978.                 &weight_op[2], &weight_avg[2],

  2979.                 IS_DIR(mb_type, 0, 0), IS_DIR(mb_type, 0, 1));

  2980.         mc_part(h, 4, 0, 8, 8*h->mb_linesize, dest_y, dest_cb, dest_cr, 4, 0,

  2981.                 qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],

  2982.                 &weight_op[2], &weight_avg[2],

  2983.                 IS_DIR(mb_type, 1, 0), IS_DIR(mb_type, 1, 1));

  2984.     }else{

  2985.         int i;

  2986. 

  2987.         assert(IS_8X8(mb_type));

  2988. 

  2989.         for(i=0; i<4; i++){

  2990.             const int sub_mb_type= h->sub_mb_type[i];

  2991.             const int n= 4*i;

  2992.             int x_offset= (i&1)<<2;

  2993.             int y_offset= (i&2)<<1;

  2994. 

  2995.             if(IS_SUB_8X8(sub_mb_type)){

  2996.                 mc_part(h, n, 1, 4, 0, dest_y, dest_cb, dest_cr, x_offset, y_offset,

  2997.                     qpix_put[1], chroma_put[1], qpix_avg[1], chroma_avg[1],

  2998.                     &weight_op[3], &weight_avg[3],

  2999.                     IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3000.             }else if(IS_SUB_8X4(sub_mb_type)){

  3001.                 mc_part(h, n  , 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset,

  3002.                     qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],

  3003.                     &weight_op[4], &weight_avg[4],

  3004.                     IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3005.                 mc_part(h, n+2, 0, 2, 4, dest_y, dest_cb, dest_cr, x_offset, y_offset+2,

  3006.                     qpix_put[2], chroma_put[1], qpix_avg[2], chroma_avg[1],

  3007.                     &weight_op[4], &weight_avg[4],

  3008.                     IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3009.             }else if(IS_SUB_4X8(sub_mb_type)){

  3010.                 mc_part(h, n  , 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset, y_offset,

  3011.                     qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],

  3012.                     &weight_op[5], &weight_avg[5],

  3013.                     IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3014.                 mc_part(h, n+1, 0, 4, 4*h->mb_linesize, dest_y, dest_cb, dest_cr, x_offset+2, y_offset,

  3015.                     qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],

  3016.                     &weight_op[5], &weight_avg[5],

  3017.                     IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3018.             }else{

  3019.                 int j;

  3020.                 assert(IS_SUB_4X4(sub_mb_type));

  3021.                 for(j=0; j<4; j++){

  3022.                     int sub_x_offset= x_offset + 2*(j&1);

  3023.                     int sub_y_offset= y_offset +   (j&2);

  3024.                     mc_part(h, n+j, 1, 2, 0, dest_y, dest_cb, dest_cr, sub_x_offset, sub_y_offset,

  3025.                         qpix_put[2], chroma_put[2], qpix_avg[2], chroma_avg[2],

  3026.                         &weight_op[6], &weight_avg[6],

  3027.                         IS_DIR(sub_mb_type, 0, 0), IS_DIR(sub_mb_type, 0, 1));

  3028.                 }

  3029.             }

  3030.         }

  3031.     }

  3032. 

  3033.     prefetch_motion(h, 1);

  3034. }

  3035. 

  3036. static void decode_init_vlc(){

  3037.     static int done = 0;

  3038. 

  3039.     if (!done) {

  3040.         int i;

  3041.         done = 1;

  3042. 

  3043.         init_vlc(&chroma_dc_coeff_token_vlc, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 4*5,

  3044.                  &chroma_dc_coeff_token_len [0], 1, 1,

  3045.                  &chroma_dc_coeff_token_bits[0], 1, 1, 1);

  3046. 

  3047.         for(i=0; i<4; i++){

  3048.             init_vlc(&coeff_token_vlc[i], COEFF_TOKEN_VLC_BITS, 4*17,

  3049.                      &coeff_token_len [i][0], 1, 1,

  3050.                      &coeff_token_bits[i][0], 1, 1, 1);

  3051.         }

  3052. 

  3053.         for(i=0; i<3; i++){

  3054.             init_vlc(&chroma_dc_total_zeros_vlc[i], CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 4,

  3055.                      &chroma_dc_total_zeros_len [i][0], 1, 1,

  3056.                      &chroma_dc_total_zeros_bits[i][0], 1, 1, 1);

  3057.         }

  3058.         for(i=0; i<15; i++){

  3059.             init_vlc(&total_zeros_vlc[i], TOTAL_ZEROS_VLC_BITS, 16,

  3060.                      &total_zeros_len [i][0], 1, 1,

  3061.                      &total_zeros_bits[i][0], 1, 1, 1);

  3062.         }

  3063. 

  3064.         for(i=0; i<6; i++){

  3065.             init_vlc(&run_vlc[i], RUN_VLC_BITS, 7,

  3066.                      &run_len [i][0], 1, 1,

  3067.                      &run_bits[i][0], 1, 1, 1);

  3068.         }

  3069.         init_vlc(&run7_vlc, RUN7_VLC_BITS, 16,

  3070.                  &run_len [6][0], 1, 1,

  3071.                  &run_bits[6][0], 1, 1, 1);

  3072.     }

  3073. }

  3074. 

  3075. /**

  3076.  * Sets the intra prediction function pointers.

  3077.  */

  3078. static void init_pred_ptrs(H264Context *h){

  3079. //    MpegEncContext * const s = &h->s;

  3080. 

  3081.     h->pred4x4[VERT_PRED           ]= pred4x4_vertical_c;

  3082.     h->pred4x4[HOR_PRED            ]= pred4x4_horizontal_c;

  3083.     h->pred4x4[DC_PRED             ]= pred4x4_dc_c;

  3084.     h->pred4x4[DIAG_DOWN_LEFT_PRED ]= pred4x4_down_left_c;

  3085.     h->pred4x4[DIAG_DOWN_RIGHT_PRED]= pred4x4_down_right_c;

  3086.     h->pred4x4[VERT_RIGHT_PRED     ]= pred4x4_vertical_right_c;

  3087.     h->pred4x4[HOR_DOWN_PRED       ]= pred4x4_horizontal_down_c;

  3088.     h->pred4x4[VERT_LEFT_PRED      ]= pred4x4_vertical_left_c;

  3089.     h->pred4x4[HOR_UP_PRED         ]= pred4x4_horizontal_up_c;

  3090.     h->pred4x4[LEFT_DC_PRED        ]= pred4x4_left_dc_c;

  3091.     h->pred4x4[TOP_DC_PRED         ]= pred4x4_top_dc_c;

  3092.     h->pred4x4[DC_128_PRED         ]= pred4x4_128_dc_c;

  3093. 

  3094.     h->pred8x8l[VERT_PRED           ]= pred8x8l_vertical_c;

  3095.     h->pred8x8l[HOR_PRED            ]= pred8x8l_horizontal_c;

  3096.     h->pred8x8l[DC_PRED             ]= pred8x8l_dc_c;

  3097.     h->pred8x8l[DIAG_DOWN_LEFT_PRED ]= pred8x8l_down_left_c;

  3098.     h->pred8x8l[DIAG_DOWN_RIGHT_PRED]= pred8x8l_down_right_c;

  3099.     h->pred8x8l[VERT_RIGHT_PRED     ]= pred8x8l_vertical_right_c;

  3100.     h->pred8x8l[HOR_DOWN_PRED       ]= pred8x8l_horizontal_down_c;

  3101.     h->pred8x8l[VERT_LEFT_PRED      ]= pred8x8l_vertical_left_c;

  3102.     h->pred8x8l[HOR_UP_PRED         ]= pred8x8l_horizontal_up_c;

  3103.     h->pred8x8l[LEFT_DC_PRED        ]= pred8x8l_left_dc_c;

  3104.     h->pred8x8l[TOP_DC_PRED         ]= pred8x8l_top_dc_c;

  3105.     h->pred8x8l[DC_128_PRED         ]= pred8x8l_128_dc_c;

  3106. 

  3107.     h->pred8x8[DC_PRED8x8     ]= ff_pred8x8_dc_c;

  3108.     h->pred8x8[VERT_PRED8x8   ]= ff_pred8x8_vertical_c;

  3109.     h->pred8x8[HOR_PRED8x8    ]= ff_pred8x8_horizontal_c;

  3110.     h->pred8x8[PLANE_PRED8x8  ]= ff_pred8x8_plane_c;

  3111.     h->pred8x8[LEFT_DC_PRED8x8]= pred8x8_left_dc_c;

  3112.     h->pred8x8[TOP_DC_PRED8x8 ]= pred8x8_top_dc_c;

  3113.     h->pred8x8[DC_128_PRED8x8 ]= ff_pred8x8_128_dc_c;

  3114. 

  3115.     h->pred16x16[DC_PRED8x8     ]= ff_pred16x16_dc_c;

  3116.     h->pred16x16[VERT_PRED8x8   ]= ff_pred16x16_vertical_c;

  3117.     h->pred16x16[HOR_PRED8x8    ]= ff_pred16x16_horizontal_c;

  3118.     h->pred16x16[PLANE_PRED8x8  ]= ff_pred16x16_plane_c;

  3119.     h->pred16x16[LEFT_DC_PRED8x8]= pred16x16_left_dc_c;

  3120.     h->pred16x16[TOP_DC_PRED8x8 ]= pred16x16_top_dc_c;

  3121.     h->pred16x16[DC_128_PRED8x8 ]= ff_pred16x16_128_dc_c;

  3122. }

  3123. 

  3124. static void free_tables(H264Context *h){

  3125.     av_freep(&h->intra4x4_pred_mode);

  3126.     av_freep(&h->chroma_pred_mode_table);

  3127.     av_freep(&h->cbp_table);

  3128.     av_freep(&h->mvd_table[0]);

  3129.     av_freep(&h->mvd_table[1]);

  3130.     av_freep(&h->direct_table);

  3131.     av_freep(&h->non_zero_count);

  3132.     av_freep(&h->slice_table_base);

  3133.     av_freep(&h->top_borders[1]);

  3134.     av_freep(&h->top_borders[0]);

  3135.     h->slice_table= NULL;

  3136. 

  3137.     av_freep(&h->mb2b_xy);

  3138.     av_freep(&h->mb2b8_xy);

  3139. 

  3140.     av_freep(&h->s.obmc_scratchpad);

  3141. }

  3142. 

  3143. static void init_dequant8_coeff_table(H264Context *h){

  3144.     int i,q,x;

  3145.     const int transpose = (h->s.dsp.h264_idct8_add != ff_h264_idct8_add_c); //FIXME ugly

  3146.     h->dequant8_coeff[0] = h->dequant8_buffer[0];

  3147.     h->dequant8_coeff[1] = h->dequant8_buffer[1];

  3148. 

  3149.     for(i=0; i<2; i++ ){

  3150.         if(i && !memcmp(h->pps.scaling_matrix8[0], h->pps.scaling_matrix8[1], 64*sizeof(uint8_t))){

  3151.             h->dequant8_coeff[1] = h->dequant8_buffer[0];

  3152.             break;

  3153.         }

  3154. 

  3155.         for(q=0; q<52; q++){

  3156.             int shift = ff_div6[q];

  3157.             int idx = ff_rem6[q];

  3158.             for(x=0; x<64; x++)

  3159.                 h->dequant8_coeff[i][q][transpose ? (x>>3)|((x&7)<<3) : x] =

  3160.                     ((uint32_t)dequant8_coeff_init[idx][ dequant8_coeff_init_scan[((x>>1)&12) | (x&3)] ] *

  3161.                     h->pps.scaling_matrix8[i][x]) << shift;

  3162.         }

  3163.     }

  3164. }

  3165. 

  3166. static void init_dequant4_coeff_table(H264Context *h){

  3167.     int i,j,q,x;

  3168.     const int transpose = (h->s.dsp.h264_idct_add != ff_h264_idct_add_c); //FIXME ugly

  3169.     for(i=0; i<6; i++ ){

  3170.         h->dequant4_coeff[i] = h->dequant4_buffer[i];

  3171.         for(j=0; j<i; j++){

  3172.             if(!memcmp(h->pps.scaling_matrix4[j], h->pps.scaling_matrix4[i], 16*sizeof(uint8_t))){

  3173.                 h->dequant4_coeff[i] = h->dequant4_buffer[j];

  3174.                 break;

  3175.             }

  3176.         }

  3177.         if(j<i)

  3178.             continue;

  3179. 

  3180.         for(q=0; q<52; q++){

  3181.             int shift = ff_div6[q] + 2;

  3182.             int idx = ff_rem6[q];

  3183.             for(x=0; x<16; x++)

  3184.                 h->dequant4_coeff[i][q][transpose ? (x>>2)|((x<<2)&0xF) : x] =

  3185.                     ((uint32_t)dequant4_coeff_init[idx][(x&1) + ((x>>2)&1)] *

  3186.                     h->pps.scaling_matrix4[i][x]) << shift;

  3187.         }

  3188.     }

  3189. }

  3190. 

  3191. static void init_dequant_tables(H264Context *h){

  3192.     int i,x;

  3193.     init_dequant4_coeff_table(h);

  3194.     if(h->pps.transform_8x8_mode)

  3195.         init_dequant8_coeff_table(h);

  3196.     if(h->sps.transform_bypass){

  3197.         for(i=0; i<6; i++)

  3198.             for(x=0; x<16; x++)

  3199.                 h->dequant4_coeff[i][0][x] = 1<<6;

  3200.         if(h->pps.transform_8x8_mode)

  3201.             for(i=0; i<2; i++)

  3202.                 for(x=0; x<64; x++)

  3203.                     h->dequant8_coeff[i][0][x] = 1<<6;

  3204.     }

  3205. }

  3206. 

  3207. 

  3208. /**

  3209.  * allocates tables.

  3210.  * needs width/height

  3211.  */

  3212. static int alloc_tables(H264Context *h){

  3213.     MpegEncContext * const s = &h->s;

  3214.     const int big_mb_num= s->mb_stride * (s->mb_height+1);

  3215.     int x,y;

  3216. 

  3217.     CHECKED_ALLOCZ(h->intra4x4_pred_mode, big_mb_num * 8  * sizeof(uint8_t))

  3218. 

  3219.     CHECKED_ALLOCZ(h->non_zero_count    , big_mb_num * 16 * sizeof(uint8_t))

  3220.     CHECKED_ALLOCZ(h->slice_table_base  , (big_mb_num+s->mb_stride) * sizeof(uint8_t))

  3221.     CHECKED_ALLOCZ(h->top_borders[0]    , s->mb_width * (16+8+8) * sizeof(uint8_t))

  3222.     CHECKED_ALLOCZ(h->top_borders[1]    , s->mb_width * (16+8+8) * sizeof(uint8_t))

  3223.     CHECKED_ALLOCZ(h->cbp_table, big_mb_num * sizeof(uint16_t))

  3224. 

  3225.     if( h->pps.cabac ) {

  3226.         CHECKED_ALLOCZ(h->chroma_pred_mode_table, big_mb_num * sizeof(uint8_t))

  3227.         CHECKED_ALLOCZ(h->mvd_table[0], 32*big_mb_num * sizeof(uint16_t));

  3228.         CHECKED_ALLOCZ(h->mvd_table[1], 32*big_mb_num * sizeof(uint16_t));

  3229.         CHECKED_ALLOCZ(h->direct_table, 32*big_mb_num * sizeof(uint8_t));

  3230.     }

  3231. 

  3232.     memset(h->slice_table_base, -1, (big_mb_num+s->mb_stride)  * sizeof(uint8_t));

  3233.     h->slice_table= h->slice_table_base + s->mb_stride*2 + 1;

  3234. 

  3235.     CHECKED_ALLOCZ(h->mb2b_xy  , big_mb_num * sizeof(uint32_t));

  3236.     CHECKED_ALLOCZ(h->mb2b8_xy , big_mb_num * sizeof(uint32_t));

  3237.     for(y=0; y<s->mb_height; y++){

  3238.         for(x=0; x<s->mb_width; x++){

  3239.             const int mb_xy= x + y*s->mb_stride;

  3240.             const int b_xy = 4*x + 4*y*h->b_stride;

  3241.             const int b8_xy= 2*x + 2*y*h->b8_stride;

  3242. 

  3243.             h->mb2b_xy [mb_xy]= b_xy;

  3244.             h->mb2b8_xy[mb_xy]= b8_xy;

  3245.         }

  3246.     }

  3247. 

  3248.     s->obmc_scratchpad = NULL;

  3249. 

  3250.     if(!h->dequant4_coeff[0])

  3251.         init_dequant_tables(h);

  3252. 

  3253.     return 0;

  3254. fail:

  3255.     free_tables(h);

  3256.     return -1;

  3257. }

  3258. 

  3259. static void common_init(H264Context *h){

  3260.     MpegEncContext * const s = &h->s;

  3261. 

  3262.     s->width = s->avctx->width;

  3263.     s->height = s->avctx->height;

  3264.     s->codec_id= s->avctx->codec->id;

  3265. 

  3266.     init_pred_ptrs(h);

  3267. 

  3268.     h->dequant_coeff_pps= -1;

  3269.     s->unrestricted_mv=1;

  3270.     s->decode=1; //FIXME

  3271. 

  3272.     memset(h->pps.scaling_matrix4, 16, 6*16*sizeof(uint8_t));

  3273.     memset(h->pps.scaling_matrix8, 16, 2*64*sizeof(uint8_t));

  3274. }

  3275. 

  3276. static int decode_init(AVCodecContext *avctx){

  3277.     H264Context *h= avctx->priv_data;

  3278.     MpegEncContext * const s = &h->s;

  3279. 

  3280.     MPV_decode_defaults(s);

  3281. 

  3282.     s->avctx = avctx;

  3283.     common_init(h);

  3284. 

  3285.     s->out_format = FMT_H264;

  3286.     s->workaround_bugs= avctx->workaround_bugs;

  3287. 

  3288.     // set defaults

  3289. //    s->decode_mb= ff_h263_decode_mb;

  3290.     s->low_delay= 1;

  3291.     avctx->pix_fmt= PIX_FMT_YUV420P;

  3292. 

  3293.     decode_init_vlc();

  3294. 

  3295.     if(avctx->extradata_size > 0 && avctx->extradata &&

  3296.        *(char *)avctx->extradata == 1){

  3297.         h->is_avc = 1;

  3298.         h->got_avcC = 0;

  3299.     } else {

  3300.         h->is_avc = 0;

  3301.     }

  3302. 

  3303.     return 0;

  3304. }

  3305. 

  3306. static int frame_start(H264Context *h){

  3307.     MpegEncContext * const s = &h->s;

  3308.     int i;

  3309. 

  3310.     if(MPV_frame_start(s, s->avctx) < 0)

  3311.         return -1;

  3312.     ff_er_frame_start(s);

  3313. 

  3314.     assert(s->linesize && s->uvlinesize);

  3315. 

  3316.     for(i=0; i<16; i++){

  3317.         h->block_offset[i]= 4*((scan8[i] - scan8[0])&7) + 4*s->linesize*((scan8[i] - scan8[0])>>3);

  3318.         h->block_offset[24+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->linesize*((scan8[i] - scan8[0])>>3);

  3319.     }

  3320.     for(i=0; i<4; i++){

  3321.         h->block_offset[16+i]=

  3322.         h->block_offset[20+i]= 4*((scan8[i] - scan8[0])&7) + 4*s->uvlinesize*((scan8[i] - scan8[0])>>3);

  3323.         h->block_offset[24+16+i]=

  3324.         h->block_offset[24+20+i]= 4*((scan8[i] - scan8[0])&7) + 8*s->uvlinesize*((scan8[i] - scan8[0])>>3);

  3325.     }

  3326. 

  3327.     /* can't be in alloc_tables because linesize isn't known there.

  3328.      * FIXME: redo bipred weight to not require extra buffer? */

  3329.     if(!s->obmc_scratchpad)

  3330.         s->obmc_scratchpad = av_malloc(16*2*s->linesize + 8*2*s->uvlinesize);

  3331. 

  3332.     /* some macroblocks will be accessed before they're available */

  3333.     if(FRAME_MBAFF)

  3334.         memset(h->slice_table, -1, (s->mb_height*s->mb_stride-1) * sizeof(uint8_t));

  3335. 

  3336. //    s->decode= (s->flags&CODEC_FLAG_PSNR) || !s->encoding || s->current_picture.reference /*|| h->contains_intra*/ || 1;

  3337.     return 0;

  3338. }

  3339. 

  3340. static inline void backup_mb_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize){

  3341.     MpegEncContext * const s = &h->s;

  3342.     int i;

  3343. 

  3344.     src_y  -=   linesize;

  3345.     src_cb -= uvlinesize;

  3346.     src_cr -= uvlinesize;

  3347. 

  3348.     // There are two lines saved, the line above the the top macroblock of a pair,

  3349.     // and the line above the bottom macroblock

  3350.     h->left_border[0]= h->top_borders[0][s->mb_x][15];

  3351.     for(i=1; i<17; i++){

  3352.         h->left_border[i]= src_y[15+i*  linesize];

  3353.     }

  3354. 

  3355.     *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y +  16*linesize);

  3356.     *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+16*linesize);

  3357. 

  3358.     if(!(s->flags&CODEC_FLAG_GRAY)){

  3359.         h->left_border[17  ]= h->top_borders[0][s->mb_x][16+7];

  3360.         h->left_border[17+9]= h->top_borders[0][s->mb_x][24+7];

  3361.         for(i=1; i<9; i++){

  3362.             h->left_border[i+17  ]= src_cb[7+i*uvlinesize];

  3363.             h->left_border[i+17+9]= src_cr[7+i*uvlinesize];

  3364.         }

  3365.         *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+8*uvlinesize);

  3366.         *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+8*uvlinesize);

  3367.     }

  3368. }

  3369. 

  3370. 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){

  3371.     MpegEncContext * const s = &h->s;

  3372.     int temp8, i;

  3373.     uint64_t temp64;

  3374.     int deblock_left = (s->mb_x > 0);

  3375.     int deblock_top  = (s->mb_y > 0);

  3376. 

  3377.     src_y  -=   linesize + 1;

  3378.     src_cb -= uvlinesize + 1;

  3379.     src_cr -= uvlinesize + 1;

  3380. 

  3381. #define XCHG(a,b,t,xchg)\

  3382. t= a;\

  3383. if(xchg)\

  3384.     a= b;\

  3385. b= t;

  3386. 

  3387.     if(deblock_left){

  3388.         for(i = !deblock_top; i<17; i++){

  3389.             XCHG(h->left_border[i     ], src_y [i*  linesize], temp8, xchg);

  3390.         }

  3391.     }

  3392. 

  3393.     if(deblock_top){

  3394.         XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);

  3395.         XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);

  3396.         if(s->mb_x+1 < s->mb_width){

  3397.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);

  3398.         }

  3399.     }

  3400. 

  3401.     if(!(s->flags&CODEC_FLAG_GRAY)){

  3402.         if(deblock_left){

  3403.             for(i = !deblock_top; i<9; i++){

  3404.                 XCHG(h->left_border[i+17  ], src_cb[i*uvlinesize], temp8, xchg);

  3405.                 XCHG(h->left_border[i+17+9], src_cr[i*uvlinesize], temp8, xchg);

  3406.             }

  3407.         }

  3408.         if(deblock_top){

  3409.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);

  3410.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);

  3411.         }

  3412.     }

  3413. }

  3414. 

  3415. static inline void backup_pair_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize){

  3416.     MpegEncContext * const s = &h->s;

  3417.     int i;

  3418. 

  3419.     src_y  -= 2 *   linesize;

  3420.     src_cb -= 2 * uvlinesize;

  3421.     src_cr -= 2 * uvlinesize;

  3422. 

  3423.     // There are two lines saved, the line above the the top macroblock of a pair,

  3424.     // and the line above the bottom macroblock

  3425.     h->left_border[0]= h->top_borders[0][s->mb_x][15];

  3426.     h->left_border[1]= h->top_borders[1][s->mb_x][15];

  3427.     for(i=2; i<34; i++){

  3428.         h->left_border[i]= src_y[15+i*  linesize];

  3429.     }

  3430. 

  3431.     *(uint64_t*)(h->top_borders[0][s->mb_x]+0)= *(uint64_t*)(src_y +  32*linesize);

  3432.     *(uint64_t*)(h->top_borders[0][s->mb_x]+8)= *(uint64_t*)(src_y +8+32*linesize);

  3433.     *(uint64_t*)(h->top_borders[1][s->mb_x]+0)= *(uint64_t*)(src_y +  33*linesize);

  3434.     *(uint64_t*)(h->top_borders[1][s->mb_x]+8)= *(uint64_t*)(src_y +8+33*linesize);

  3435. 

  3436.     if(!(s->flags&CODEC_FLAG_GRAY)){

  3437.         h->left_border[34     ]= h->top_borders[0][s->mb_x][16+7];

  3438.         h->left_border[34+   1]= h->top_borders[1][s->mb_x][16+7];

  3439.         h->left_border[34+18  ]= h->top_borders[0][s->mb_x][24+7];

  3440.         h->left_border[34+18+1]= h->top_borders[1][s->mb_x][24+7];

  3441.         for(i=2; i<18; i++){

  3442.             h->left_border[i+34   ]= src_cb[7+i*uvlinesize];

  3443.             h->left_border[i+34+18]= src_cr[7+i*uvlinesize];

  3444.         }

  3445.         *(uint64_t*)(h->top_borders[0][s->mb_x]+16)= *(uint64_t*)(src_cb+16*uvlinesize);

  3446.         *(uint64_t*)(h->top_borders[0][s->mb_x]+24)= *(uint64_t*)(src_cr+16*uvlinesize);

  3447.         *(uint64_t*)(h->top_borders[1][s->mb_x]+16)= *(uint64_t*)(src_cb+17*uvlinesize);

  3448.         *(uint64_t*)(h->top_borders[1][s->mb_x]+24)= *(uint64_t*)(src_cr+17*uvlinesize);

  3449.     }

  3450. }

  3451. 

  3452. static inline void xchg_pair_border(H264Context *h, uint8_t *src_y, uint8_t *src_cb, uint8_t *src_cr, int linesize, int uvlinesize, int xchg){

  3453.     MpegEncContext * const s = &h->s;

  3454.     int temp8, i;

  3455.     uint64_t temp64;

  3456.     int deblock_left = (s->mb_x > 0);

  3457.     int deblock_top  = (s->mb_y > 1);

  3458. 

  3459.     tprintf("xchg_pair_border: src_y:%p src_cb:%p src_cr:%p ls:%d uvls:%d\n", src_y, src_cb, src_cr, linesize, uvlinesize);

  3460. 

  3461.     src_y  -= 2 *   linesize + 1;

  3462.     src_cb -= 2 * uvlinesize + 1;

  3463.     src_cr -= 2 * uvlinesize + 1;

  3464. 

  3465. #define XCHG(a,b,t,xchg)\

  3466. t= a;\

  3467. if(xchg)\

  3468.     a= b;\

  3469. b= t;

  3470. 

  3471.     if(deblock_left){

  3472.         for(i = (!deblock_top)<<1; i<34; i++){

  3473.             XCHG(h->left_border[i     ], src_y [i*  linesize], temp8, xchg);

  3474.         }

  3475.     }

  3476. 

  3477.     if(deblock_top){

  3478.         XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+0), *(uint64_t*)(src_y +1), temp64, xchg);

  3479.         XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+8), *(uint64_t*)(src_y +9), temp64, 1);

  3480.         XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+0), *(uint64_t*)(src_y +1 +linesize), temp64, xchg);

  3481.         XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+8), *(uint64_t*)(src_y +9 +linesize), temp64, 1);

  3482.         if(s->mb_x+1 < s->mb_width){

  3483.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x+1]), *(uint64_t*)(src_y +17), temp64, 1);

  3484.             XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x+1]), *(uint64_t*)(src_y +17 +linesize), temp64, 1);

  3485.         }

  3486.     }

  3487. 

  3488.     if(!(s->flags&CODEC_FLAG_GRAY)){

  3489.         if(deblock_left){

  3490.             for(i = (!deblock_top) << 1; i<18; i++){

  3491.                 XCHG(h->left_border[i+34   ], src_cb[i*uvlinesize], temp8, xchg);

  3492.                 XCHG(h->left_border[i+34+18], src_cr[i*uvlinesize], temp8, xchg);

  3493.             }

  3494.         }

  3495.         if(deblock_top){

  3496.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+16), *(uint64_t*)(src_cb+1), temp64, 1);

  3497.             XCHG(*(uint64_t*)(h->top_borders[0][s->mb_x]+24), *(uint64_t*)(src_cr+1), temp64, 1);

  3498.             XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+16), *(uint64_t*)(src_cb+1 +uvlinesize), temp64, 1);

  3499.             XCHG(*(uint64_t*)(h->top_borders[1][s->mb_x]+24), *(uint64_t*)(src_cr+1 +uvlinesize), temp64, 1);

  3500.         }

  3501.     }

  3502. }

  3503. 

  3504. static void hl_decode_mb(H264Context *h){

  3505.     MpegEncContext * const s = &h->s;

  3506.     const int mb_x= s->mb_x;

  3507.     const int mb_y= s->mb_y;

  3508.     const int mb_xy= mb_x + mb_y*s->mb_stride;

  3509.     const int mb_type= s->current_picture.mb_type[mb_xy];

  3510.     uint8_t  *dest_y, *dest_cb, *dest_cr;

  3511.     int linesize, uvlinesize /*dct_offset*/;

  3512.     int i;

  3513.     int *block_offset = &h->block_offset[0];

  3514.     const unsigned int bottom = mb_y & 1;

  3515.     const int transform_bypass = (s->qscale == 0 && h->sps.transform_bypass);

  3516.     void (*idct_add)(uint8_t *dst, DCTELEM *block, int stride);

  3517.     void (*idct_dc_add)(uint8_t *dst, DCTELEM *block, int stride);

  3518. 

  3519.     if(!s->decode)

  3520.         return;

  3521. 

  3522.     dest_y  = s->current_picture.data[0] + (mb_y * 16* s->linesize  ) + mb_x * 16;

  3523.     dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;

  3524.     dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;

  3525. 

  3526.     s->dsp.prefetch(dest_y + (s->mb_x&3)*4*s->linesize + 64, s->linesize, 4);

  3527.     s->dsp.prefetch(dest_cb + (s->mb_x&7)*s->uvlinesize + 64, dest_cr - dest_cb, 2);

  3528. 

  3529.     if (MB_FIELD) {

  3530.         linesize   = h->mb_linesize   = s->linesize * 2;

  3531.         uvlinesize = h->mb_uvlinesize = s->uvlinesize * 2;

  3532.         block_offset = &h->block_offset[24];

  3533.         if(mb_y&1){ //FIXME move out of this func?

  3534.             dest_y -= s->linesize*15;

  3535.             dest_cb-= s->uvlinesize*7;

  3536.             dest_cr-= s->uvlinesize*7;

  3537.         }

  3538.         if(FRAME_MBAFF) {

  3539.             int list;

  3540.             for(list=0; list<2; list++){

  3541.                 if(!USES_LIST(mb_type, list))

  3542.                     continue;

  3543.                 if(IS_16X16(mb_type)){

  3544.                     int8_t *ref = &h->ref_cache[list][scan8[0]];

  3545.                     fill_rectangle(ref, 4, 4, 8, 16+*ref^(s->mb_y&1), 1);

  3546.                 }else{

  3547.                     for(i=0; i<16; i+=4){

  3548.                         //FIXME can refs be smaller than 8x8 when !direct_8x8_inference ?

  3549.                         int ref = h->ref_cache[list][scan8[i]];

  3550.                         if(ref >= 0)

  3551.                             fill_rectangle(&h->ref_cache[list][scan8[i]], 2, 2, 8, 16+ref^(s->mb_y&1), 1);

  3552.                     }

  3553.                 }

  3554.             }

  3555.         }

  3556.     } else {

  3557.         linesize   = h->mb_linesize   = s->linesize;

  3558.         uvlinesize = h->mb_uvlinesize = s->uvlinesize;

  3559. //        dct_offset = s->linesize * 16;

  3560.     }

  3561. 

  3562.     if(transform_bypass){

  3563.         idct_dc_add =

  3564.         idct_add = IS_8x8DCT(mb_type) ? s->dsp.add_pixels8 : s->dsp.add_pixels4;

  3565.     }else if(IS_8x8DCT(mb_type)){

  3566.         idct_dc_add = s->dsp.h264_idct8_dc_add;

  3567.         idct_add = s->dsp.h264_idct8_add;

  3568.     }else{

  3569.         idct_dc_add = s->dsp.h264_idct_dc_add;

  3570.         idct_add = s->dsp.h264_idct_add;

  3571.     }

  3572. 

  3573.     if(FRAME_MBAFF && h->deblocking_filter && IS_INTRA(mb_type)

  3574.        && (!bottom || !IS_INTRA(s->current_picture.mb_type[mb_xy-s->mb_stride]))){

  3575.         int mbt_y = mb_y&~1;

  3576.         uint8_t *top_y  = s->current_picture.data[0] + (mbt_y * 16* s->linesize  ) + mb_x * 16;

  3577.         uint8_t *top_cb = s->current_picture.data[1] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;

  3578.         uint8_t *top_cr = s->current_picture.data[2] + (mbt_y * 8 * s->uvlinesize) + mb_x * 8;

  3579.         xchg_pair_border(h, top_y, top_cb, top_cr, s->linesize, s->uvlinesize, 1);

  3580.     }

  3581. 

  3582.     if (IS_INTRA_PCM(mb_type)) {

  3583.         unsigned int x, y;

  3584. 

  3585.         // The pixels are stored in h->mb array in the same order as levels,

  3586.         // copy them in output in the correct order.

  3587.         for(i=0; i<16; i++) {

  3588.             for (y=0; y<4; y++) {

  3589.                 for (x=0; x<4; x++) {

  3590.                     *(dest_y + block_offset[i] + y*linesize + x) = h->mb[i*16+y*4+x];

  3591.                 }

  3592.             }

  3593.         }

  3594.         for(i=16; i<16+4; i++) {

  3595.             for (y=0; y<4; y++) {

  3596.                 for (x=0; x<4; x++) {

  3597.                     *(dest_cb + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];

  3598.                 }

  3599.             }

  3600.         }

  3601.         for(i=20; i<20+4; i++) {

  3602.             for (y=0; y<4; y++) {

  3603.                 for (x=0; x<4; x++) {

  3604.                     *(dest_cr + block_offset[i] + y*uvlinesize + x) = h->mb[i*16+y*4+x];

  3605.                 }

  3606.             }

  3607.         }

  3608.     } else {

  3609.         if(IS_INTRA(mb_type)){

  3610.             if(h->deblocking_filter && !FRAME_MBAFF)

  3611.                 xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 1);

  3612. 

  3613.             if(!(s->flags&CODEC_FLAG_GRAY)){

  3614.                 h->pred8x8[ h->chroma_pred_mode ](dest_cb, uvlinesize);

  3615.                 h->pred8x8[ h->chroma_pred_mode ](dest_cr, uvlinesize);

  3616.             }

  3617. 

  3618.             if(IS_INTRA4x4(mb_type)){

  3619.                 if(!s->encoding){

  3620.                     if(IS_8x8DCT(mb_type)){

  3621.                         for(i=0; i<16; i+=4){

  3622.                             uint8_t * const ptr= dest_y + block_offset[i];

  3623.                             const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];

  3624.                             const int nnz = h->non_zero_count_cache[ scan8[i] ];

  3625.                             h->pred8x8l[ dir ](ptr, (h->topleft_samples_available<<i)&0x8000,

  3626.                                                    (h->topright_samples_available<<(i+1))&0x8000, linesize);

  3627.                             if(nnz){

  3628.                                 if(nnz == 1 && h->mb[i*16])

  3629.                                     idct_dc_add(ptr, h->mb + i*16, linesize);

  3630.                                 else

  3631.                                     idct_add(ptr, h->mb + i*16, linesize);

  3632.                             }

  3633.                         }

  3634.                     }else

  3635.                     for(i=0; i<16; i++){

  3636.                         uint8_t * const ptr= dest_y + block_offset[i];

  3637.                         uint8_t *topright;

  3638.                         const int dir= h->intra4x4_pred_mode_cache[ scan8[i] ];

  3639.                         int nnz, tr;

  3640. 

  3641.                         if(dir == DIAG_DOWN_LEFT_PRED || dir == VERT_LEFT_PRED){

  3642.                             const int topright_avail= (h->topright_samples_available<<i)&0x8000;

  3643.                             assert(mb_y || linesize <= block_offset[i]);

  3644.                             if(!topright_avail){

  3645.                                 tr= ptr[3 - linesize]*0x01010101;

  3646.                                 topright= (uint8_t*) &tr;

  3647.                             }else

  3648.                                 topright= ptr + 4 - linesize;

  3649.                         }else

  3650.                             topright= NULL;

  3651. 

  3652.                         h->pred4x4[ dir ](ptr, topright, linesize);

  3653.                         nnz = h->non_zero_count_cache[ scan8[i] ];

  3654.                         if(nnz){

  3655.                             if(s->codec_id == CODEC_ID_H264){

  3656.                                 if(nnz == 1 && h->mb[i*16])

  3657.                                     idct_dc_add(ptr, h->mb + i*16, linesize);

  3658.                                 else

  3659.                                     idct_add(ptr, h->mb + i*16, linesize);

  3660.                             }else

  3661.                                 svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, 0);

  3662.                         }

  3663.                     }

  3664.                 }

  3665.             }else{

  3666.                 h->pred16x16[ h->intra16x16_pred_mode ](dest_y , linesize);

  3667.                 if(s->codec_id == CODEC_ID_H264){

  3668.                     if(!transform_bypass)

  3669.                         h264_luma_dc_dequant_idct_c(h->mb, s->qscale, h->dequant4_coeff[IS_INTRA(mb_type) ? 0:3][s->qscale][0]);

  3670.                 }else

  3671.                     svq3_luma_dc_dequant_idct_c(h->mb, s->qscale);

  3672.             }

  3673.             if(h->deblocking_filter && !FRAME_MBAFF)

  3674.                 xchg_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize, 0);

  3675.         }else if(s->codec_id == CODEC_ID_H264){

  3676.             hl_motion(h, dest_y, dest_cb, dest_cr,

  3677.                       s->me.qpel_put, s->dsp.put_h264_chroma_pixels_tab,

  3678.                       s->me.qpel_avg, s->dsp.avg_h264_chroma_pixels_tab,

  3679.                       s->dsp.weight_h264_pixels_tab, s->dsp.biweight_h264_pixels_tab);

  3680.         }

  3681. 

  3682. 

  3683.         if(!IS_INTRA4x4(mb_type)){

  3684.             if(s->codec_id == CODEC_ID_H264){

  3685.                 if(IS_INTRA16x16(mb_type)){

  3686.                     for(i=0; i<16; i++){

  3687.                         if(h->non_zero_count_cache[ scan8[i] ])

  3688.                             idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);

  3689.                         else if(h->mb[i*16])

  3690.                             idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);

  3691.                     }

  3692.                 }else{

  3693.                     const int di = IS_8x8DCT(mb_type) ? 4 : 1;

  3694.                     for(i=0; i<16; i+=di){

  3695.                         int nnz = h->non_zero_count_cache[ scan8[i] ];

  3696.                         if(nnz){

  3697.                             if(nnz==1 && h->mb[i*16])

  3698.                                 idct_dc_add(dest_y + block_offset[i], h->mb + i*16, linesize);

  3699.                             else

  3700.                                 idct_add(dest_y + block_offset[i], h->mb + i*16, linesize);

  3701.                         }

  3702.                     }

  3703.                 }

  3704.             }else{

  3705.                 for(i=0; i<16; i++){

  3706.                     if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){ //FIXME benchmark weird rule, & below

  3707.                         uint8_t * const ptr= dest_y + block_offset[i];

  3708.                         svq3_add_idct_c(ptr, h->mb + i*16, linesize, s->qscale, IS_INTRA(mb_type) ? 1 : 0);

  3709.                     }

  3710.                 }

  3711.             }

  3712.         }

  3713. 

  3714.         if(!(s->flags&CODEC_FLAG_GRAY)){

  3715.             uint8_t *dest[2] = {dest_cb, dest_cr};

  3716.             if(transform_bypass){

  3717.                 idct_add = idct_dc_add = s->dsp.add_pixels4;

  3718.             }else{

  3719.                 idct_add = s->dsp.h264_idct_add;

  3720.                 idct_dc_add = s->dsp.h264_idct_dc_add;

  3721.                 chroma_dc_dequant_idct_c(h->mb + 16*16, h->chroma_qp, h->dequant4_coeff[IS_INTRA(mb_type) ? 1:4][h->chroma_qp][0]);

  3722.                 chroma_dc_dequant_idct_c(h->mb + 16*16+4*16, h->chroma_qp, h->dequant4_coeff[IS_INTRA(mb_type) ? 2:5][h->chroma_qp][0]);

  3723.             }

  3724.             if(s->codec_id == CODEC_ID_H264){

  3725.                 for(i=16; i<16+8; i++){

  3726.                     if(h->non_zero_count_cache[ scan8[i] ])

  3727.                         idct_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);

  3728.                     else if(h->mb[i*16])

  3729.                         idct_dc_add(dest[(i&4)>>2] + block_offset[i], h->mb + i*16, uvlinesize);

  3730.                 }

  3731.             }else{

  3732.                 for(i=16; i<16+8; i++){

  3733.                     if(h->non_zero_count_cache[ scan8[i] ] || h->mb[i*16]){

  3734.                         uint8_t * const ptr= dest[(i&4)>>2] + block_offset[i];

  3735.                         svq3_add_idct_c(ptr, h->mb + i*16, uvlinesize, chroma_qp[s->qscale + 12] - 12, 2);

  3736.                     }

  3737.                 }

  3738.             }

  3739.         }

  3740.     }

  3741.     if(h->deblocking_filter) {

  3742.         if (FRAME_MBAFF) {

  3743.             //FIXME try deblocking one mb at a time?

  3744.             // the reduction in load/storing mvs and such might outweigh the extra backup/xchg_border

  3745.             const int mb_y = s->mb_y - 1;

  3746.             uint8_t  *pair_dest_y, *pair_dest_cb, *pair_dest_cr;

  3747.             const int mb_xy= mb_x + mb_y*s->mb_stride;

  3748.             const int mb_type_top   = s->current_picture.mb_type[mb_xy];

  3749.             const int mb_type_bottom= s->current_picture.mb_type[mb_xy+s->mb_stride];

  3750.             if (!bottom) return;

  3751.             pair_dest_y  = s->current_picture.data[0] + (mb_y * 16* s->linesize  ) + mb_x * 16;

  3752.             pair_dest_cb = s->current_picture.data[1] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;

  3753.             pair_dest_cr = s->current_picture.data[2] + (mb_y * 8 * s->uvlinesize) + mb_x * 8;

  3754. 

  3755.             if(IS_INTRA(mb_type_top | mb_type_bottom))

  3756.                 xchg_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize, 0);

  3757. 

  3758.             backup_pair_border(h, pair_dest_y, pair_dest_cb, pair_dest_cr, s->linesize, s->uvlinesize);

  3759.             // deblock a pair

  3760.             // top

  3761.             s->mb_y--;

  3762.             tprintf("call mbaff filter_mb mb_x:%d mb_y:%d pair_dest_y = %p, dest_y = %p\n", mb_x, mb_y, pair_dest_y, dest_y);

  3763.             fill_caches(h, mb_type_top, 1); //FIXME don't fill stuff which isn't used by filter_mb

  3764.             h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, s->current_picture.qscale_table[mb_xy]);

  3765.             filter_mb(h, mb_x, mb_y, pair_dest_y, pair_dest_cb, pair_dest_cr, linesize, uvlinesize);

  3766.             // bottom

  3767.             s->mb_y++;

  3768.             tprintf("call mbaff filter_mb\n");

  3769.             fill_caches(h, mb_type_bottom, 1); //FIXME don't fill stuff which isn't used by filter_mb

  3770.             h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, s->current_picture.qscale_table[mb_xy+s->mb_stride]);

  3771.             filter_mb(h, mb_x, mb_y+1, dest_y, dest_cb, dest_cr, linesize, uvlinesize);

  3772.         } else {

  3773.             tprintf("call filter_mb\n");

  3774.             backup_mb_border(h, dest_y, dest_cb, dest_cr, linesize, uvlinesize);

  3775.             fill_caches(h, mb_type, 1); //FIXME don't fill stuff which isn't used by filter_mb

  3776.             filter_mb_fast(h, mb_x, mb_y, dest_y, dest_cb, dest_cr, linesize, uvlinesize);

  3777.         }

  3778.     }

  3779. }

  3780. 

  3781. /**

  3782.  * fills the default_ref_list.

  3783.  */

  3784. static int fill_default_ref_list(H264Context *h){

  3785.     MpegEncContext * const s = &h->s;

  3786.     int i;

  3787.     int smallest_poc_greater_than_current = -1;

  3788.     Picture sorted_short_ref[32];

  3789. 

  3790.     if(h->slice_type==B_TYPE){

  3791.         int out_i;

  3792.         int limit= INT_MIN;

  3793. 

  3794.         /* sort frame according to poc in B slice */

  3795.         for(out_i=0; out_i<h->short_ref_count; out_i++){

  3796.             int best_i=INT_MIN;

  3797.             int best_poc=INT_MAX;

  3798. 

  3799.             for(i=0; i<h->short_ref_count; i++){

  3800.                 const int poc= h->short_ref[i]->poc;

  3801.                 if(poc > limit && poc < best_poc){

  3802.                     best_poc= poc;

  3803.                     best_i= i;

  3804.                 }

  3805.             }

  3806. 

  3807.             assert(best_i != INT_MIN);

  3808. 

  3809.             limit= best_poc;

  3810.             sorted_short_ref[out_i]= *h->short_ref[best_i];

  3811.             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);

  3812.             if (-1 == smallest_poc_greater_than_current) {

  3813.                 if (h->short_ref[best_i]->poc >= s->current_picture_ptr->poc) {

  3814.                     smallest_poc_greater_than_current = out_i;

  3815.                 }

  3816.             }

  3817.         }

  3818.     }

  3819. 

  3820.     if(s->picture_structure == PICT_FRAME){

  3821.         if(h->slice_type==B_TYPE){

  3822.             int list;

  3823.             tprintf("current poc: %d, smallest_poc_greater_than_current: %d\n", s->current_picture_ptr->poc, smallest_poc_greater_than_current);

  3824. 

  3825.             // find the largest poc

  3826.             for(list=0; list<2; list++){

  3827.                 int index = 0;

  3828.                 int j= -99;

  3829.                 int step= list ? -1 : 1;

  3830. 

  3831.                 for(i=0; i<h->short_ref_count && index < h->ref_count[list]; i++, j+=step) {

  3832.                     while(j<0 || j>= h->short_ref_count){

  3833.                         if(j != -99 && step == (list ? -1 : 1))

  3834.                             return -1;

  3835.                         step = -step;

  3836.                         j= smallest_poc_greater_than_current + (step>>1);

  3837.                     }

  3838.                     if(sorted_short_ref[j].reference != 3) continue;

  3839.                     h->default_ref_list[list][index  ]= sorted_short_ref[j];

  3840.                     h->default_ref_list[list][index++].pic_id= sorted_short_ref[j].frame_num;

  3841.                 }

  3842. 

  3843.                 for(i = 0; i < 16 && index < h->ref_count[ list ]; i++){

  3844.                     if(h->long_ref[i] == NULL) continue;

  3845.                     if(h->long_ref[i]->reference != 3) continue;

  3846. 

  3847.                     h->default_ref_list[ list ][index  ]= *h->long_ref[i];

  3848.                     h->default_ref_list[ list ][index++].pic_id= i;;

  3849.                 }

  3850. 

  3851.                 if(list && (smallest_poc_greater_than_current<=0 || smallest_poc_greater_than_current>=h->short_ref_count) && (1 < index)){

  3852.                     // swap the two first elements of L1 when

  3853.                     // L0 and L1 are identical

  3854.                     Picture temp= h->default_ref_list[1][0];

  3855.                     h->default_ref_list[1][0] = h->default_ref_list[1][1];

  3856.                     h->default_ref_list[1][1] = temp;

  3857.                 }

  3858. 

  3859.                 if(index < h->ref_count[ list ])

  3860.                     memset(&h->default_ref_list[list][index], 0, sizeof(Picture)*(h->ref_count[ list ] - index));

  3861.             }

  3862.         }else{

  3863.             int index=0;

  3864.             for(i=0; i<h->short_ref_count; i++){

  3865.                 if(h->short_ref[i]->reference != 3) continue; //FIXME refernce field shit

  3866.                 h->default_ref_list[0][index  ]= *h->short_ref[i];

  3867.                 h->default_ref_list[0][index++].pic_id= h->short_ref[i]->frame_num;

  3868.             }

  3869.             for(i = 0; i < 16; i++){

  3870.                 if(h->long_ref[i] == NULL) continue;

  3871.                 if(h->long_ref[i]->reference != 3) continue;

  3872.                 h->default_ref_list[0][index  ]= *h->long_ref[i];

  3873.                 h->default_ref_list[0][index++].pic_id= i;;

  3874.             }

  3875.             if(index < h->ref_count[0])

  3876.                 memset(&h->default_ref_list[0][index], 0, sizeof(Picture)*(h->ref_count[0] - index));

  3877.         }

  3878.     }else{ //FIELD

  3879.         if(h->slice_type==B_TYPE){

  3880.         }else{

  3881.             //FIXME second field balh

  3882.         }

  3883.     }

  3884. #ifdef TRACE

  3885.     for (i=0; i<h->ref_count[0]; i++) {

  3886.         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]);

  3887.     }

  3888.     if(h->slice_type==B_TYPE){

  3889.         for (i=0; i<h->ref_count[1]; i++) {

  3890.             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]);

  3891.         }

  3892.     }

  3893. #endif

  3894.     return 0;

  3895. }

  3896. 

  3897. static void print_short_term(H264Context *h);

  3898. static void print_long_term(H264Context *h);

  3899. 

  3900. static int decode_ref_pic_list_reordering(H264Context *h){

  3901.     MpegEncContext * const s = &h->s;

  3902.     int list, index;

  3903. 

  3904.     print_short_term(h);

  3905.     print_long_term(h);

  3906.     if(h->slice_type==I_TYPE || h->slice_type==SI_TYPE) return 0; //FIXME move before func

  3907. 

  3908.     for(list=0; list<2; list++){

  3909.         memcpy(h->ref_list[list], h->default_ref_list[list], sizeof(Picture)*h->ref_count[list]);

  3910. 

  3911.         if(get_bits1(&s->gb)){

  3912.             int pred= h->curr_pic_num;

  3913. 

  3914.             for(index=0; ; index++){

  3915.                 int reordering_of_pic_nums_idc= get_ue_golomb(&s->gb);

  3916.                 int pic_id;

  3917.                 int i;

  3918.                 Picture *ref = NULL;

  3919. 

  3920.                 if(reordering_of_pic_nums_idc==3)

  3921.                     break;

  3922. 

  3923.                 if(index >= h->ref_count[list]){

  3924.                     av_log(h->s.avctx, AV_LOG_ERROR, "reference count overflow\n");

  3925.                     return -1;

  3926.                 }

  3927. 

  3928.                 if(reordering_of_pic_nums_idc<3){

  3929.                     if(reordering_of_pic_nums_idc<2){

  3930.                         const int abs_diff_pic_num= get_ue_golomb(&s->gb) + 1;

  3931. 

  3932.                         if(abs_diff_pic_num >= h->max_pic_num){

  3933.                             av_log(h->s.avctx, AV_LOG_ERROR, "abs_diff_pic_num overflow\n");

  3934.                             return -1;

  3935.                         }

  3936. 

  3937.                         if(reordering_of_pic_nums_idc == 0) pred-= abs_diff_pic_num;

  3938.                         else                                pred+= abs_diff_pic_num;

  3939.                         pred &= h->max_pic_num - 1;

  3940. 

  3941.                         for(i= h->short_ref_count-1; i>=0; i--){

  3942.                             ref = h->short_ref[i];

  3943.                             assert(ref->reference == 3);

  3944.                             assert(!ref->long_ref);

  3945.                             if(ref->data[0] != NULL && ref->frame_num == pred && ref->long_ref == 0) // ignore non existing pictures by testing data[0] pointer

  3946.                                 break;

  3947.                         }

  3948.                         if(i>=0)

  3949.                             ref->pic_id= ref->frame_num;

  3950.                     }else{

  3951.                         pic_id= get_ue_golomb(&s->gb); //long_term_pic_idx

  3952.                         ref = h->long_ref[pic_id];

  3953.                         ref->pic_id= pic_id;

  3954.                         assert(ref->reference == 3);

  3955.                         assert(ref->long_ref);

  3956.                         i=0;

  3957.                     }

  3958. 

  3959.                     if (i < 0) {

  3960.                         av_log(h->s.avctx, AV_LOG_ERROR, "reference picture missing during reorder\n");

  3961.                         memset(&h->ref_list[list][index], 0, sizeof(Picture)); //FIXME

  3962.                     } else {

  3963.                         for(i=index; i+1<h->ref_count[list]; i++){

  3964.                             if(ref->long_ref == h->ref_list[list][i].long_ref && ref->pic_id == h->ref_list[list][i].pic_id)

  3965.                                 break;

  3966.                         }

  3967.                         for(; i > index; i--){

  3968.                             h->ref_list[list][i]= h->ref_list[list][i-1];

  3969.                         }

  3970.                         h->ref_list[list][index]= *ref;

  3971.                     }

  3972.                 }else{

  3973.                     av_log(h->s.avctx, AV_LOG_ERROR, "illegal reordering_of_pic_nums_idc\n");

  3974.                     return -1;

  3975.                 }

  3976.             }

  3977.         }

  3978. 

  3979.         if(h->slice_type!=B_TYPE) break;

  3980.     }

  3981.     for(list=0; list<2; list++){

  3982.         for(index= 0; index < h->ref_count[list]; index++){

  3983.             if(!h->ref_list[list][index].data[0])

  3984.                 h->ref_list[list][index]= s->current_picture;

  3985.         }

  3986.         if(h->slice_type!=B_TYPE) break;

  3987.     }

  3988. 

  3989.     if(h->slice_type==B_TYPE && !h->direct_spatial_mv_pred)

  3990.         direct_dist_scale_factor(h);

  3991.     direct_ref_list_init(h);

  3992.     return 0;

  3993. }

  3994. 

  3995. static void fill_mbaff_ref_list(H264Context *h){

  3996.     int list, i, j;

  3997.     for(list=0; list<2; list++){

  3998.         for(i=0; i<h->ref_count[list]; i++){

  3999.             Picture *frame = &h->ref_list[list][i];

  4000.             Picture *field = &h->ref_list[list][16+2*i];

  4001.             field[0] = *frame;

  4002.             for(j=0; j<3; j++)

  4003.                 field[0].linesize[j] <<= 1;

  4004.             field[1] = field[0];

  4005.             for(j=0; j<3; j++)

  4006.                 field[1].data[j] += frame->linesize[j];

  4007. 

  4008.             h->luma_weight[list][16+2*i] = h->luma_weight[list][16+2*i+1] = h->luma_weight[list][i];

  4009.             h->luma_offset[list][16+2*i] = h->luma_offset[list][16+2*i+1] = h->luma_offset[list][i];

  4010.             for(j=0; j<2; j++){

  4011.                 h->chroma_weight[list][16+2*i][j] = h->chroma_weight[list][16+2*i+1][j] = h->chroma_weight[list][i][j];

  4012.                 h->chroma_offset[list][16+2*i][j] = h->chroma_offset[list][16+2*i+1][j] = h->chroma_offset[list][i][j];

  4013.             }

  4014.         }

  4015.     }

  4016.     for(j=0; j<h->ref_count[1]; j++){

  4017.         for(i=0; i<h->ref_count[0]; i++)

  4018.             h->implicit_weight[j][16+2*i] = h->implicit_weight[j][16+2*i+1] = h->implicit_weight[j][i];

  4019.         memcpy(h->implicit_weight[16+2*j],   h->implicit_weight[j], sizeof(*h->implicit_weight));

  4020.         memcpy(h->implicit_weight[16+2*j+1], h->implicit_weight[j], sizeof(*h->implicit_weight));

  4021.     }

  4022. }

  4023. 

  4024. static int pred_weight_table(H264Context *h){

  4025.     MpegEncContext * const s = &h->s;

  4026.     int list, i;

  4027.     int luma_def, chroma_def;

  4028. 

  4029.     h->use_weight= 0;

  4030.     h->use_weight_chroma= 0;

  4031.     h->luma_log2_weight_denom= get_ue_golomb(&s->gb);

  4032.     h->chroma_log2_weight_denom= get_ue_golomb(&s->gb);

  4033.     luma_def = 1<<h->luma_log2_weight_denom;

  4034.     chroma_def = 1<<h->chroma_log2_weight_denom;

  4035. 

  4036.     for(list=0; list<2; list++){

  4037.         for(i=0; i<h->ref_count[list]; i++){

  4038.             int luma_weight_flag, chroma_weight_flag;

  4039. 

  4040.             luma_weight_flag= get_bits1(&s->gb);

  4041.             if(luma_weight_flag){

  4042.                 h->luma_weight[list][i]= get_se_golomb(&s->gb);

  4043.                 h->luma_offset[list][i]= get_se_golomb(&s->gb);

  4044.                 if(   h->luma_weight[list][i] != luma_def

  4045.                    || h->luma_offset[list][i] != 0)

  4046.                     h->use_weight= 1;

  4047.             }else{

  4048.                 h->luma_weight[list][i]= luma_def;

  4049.                 h->luma_offset[list][i]= 0;

  4050.             }

  4051. 

  4052.             chroma_weight_flag= get_bits1(&s->gb);

  4053.             if(chroma_weight_flag){

  4054.                 int j;

  4055.                 for(j=0; j<2; j++){

  4056.                     h->chroma_weight[list][i][j]= get_se_golomb(&s->gb);

  4057.                     h->chroma_offset[list][i][j]= get_se_golomb(&s->gb);

  4058.                     if(   h->chroma_weight[list][i][j] != chroma_def

  4059.                        || h->chroma_offset[list][i][j] != 0)

  4060.                         h->use_weight_chroma= 1;

  4061.                 }

  4062.             }else{

  4063.                 int j;

  4064.                 for(j=0; j<2; j++){

  4065.                     h->chroma_weight[list][i][j]= chroma_def;

  4066.                     h->chroma_offset[list][i][j]= 0;

  4067.                 }

  4068.             }

  4069.         }

  4070.         if(h->slice_type != B_TYPE) break;

  4071.     }

  4072.     h->use_weight= h->use_weight || h->use_weight_chroma;

  4073.     return 0;

  4074. }

  4075. 

  4076. static void implicit_weight_table(H264Context *h){

  4077.     MpegEncContext * const s = &h->s;

  4078.     int ref0, ref1;

  4079.     int cur_poc = s->current_picture_ptr->poc;

  4080. 

  4081.     if(   h->ref_count[0] == 1 && h->ref_count[1] == 1

  4082.        && h->ref_list[0][0].poc + h->ref_list[1][0].poc == 2*cur_poc){

  4083.         h->use_weight= 0;

  4084.         h->use_weight_chroma= 0;

  4085.         return;

  4086.     }

  4087. 

  4088.     h->use_weight= 2;

  4089.     h->use_weight_chroma= 2;

  4090.     h->luma_log2_weight_denom= 5;

  4091.     h->chroma_log2_weight_denom= 5;

  4092. 

  4093.     for(ref0=0; ref0 < h->ref_count[0]; ref0++){

  4094.         int poc0 = h->ref_list[0][ref0].poc;

  4095.         for(ref1=0; ref1 < h->ref_count[1]; ref1++){

  4096.             int poc1 = h->ref_list[1][ref1].poc;

  4097.             int td = clip(poc1 - poc0, -128, 127);

  4098.             if(td){

  4099.                 int tb = clip(cur_poc - poc0, -128, 127);

  4100.                 int tx = (16384 + (FFABS(td) >> 1)) / td;

  4101.                 int dist_scale_factor = clip((tb*tx + 32) >> 6, -1024, 1023) >> 2;

  4102.                 if(dist_scale_factor < -64 || dist_scale_factor > 128)

  4103.                     h->implicit_weight[ref0][ref1] = 32;

  4104.                 else

  4105.                     h->implicit_weight[ref0][ref1] = 64 - dist_scale_factor;

  4106.             }else

  4107.                 h->implicit_weight[ref0][ref1] = 32;

  4108.         }

  4109.     }

  4110. }

  4111. 

  4112. static inline void unreference_pic(H264Context *h, Picture *pic){

  4113.     int i;

  4114.     pic->reference=0;

  4115.     if(pic == h->delayed_output_pic)

  4116.         pic->reference=1;

  4117.     else{

  4118.         for(i = 0; h->delayed_pic[i]; i++)

  4119.             if(pic == h->delayed_pic[i]){

  4120.                 pic->reference=1;

  4121.                 break;

  4122.             }

  4123.     }

  4124. }

  4125. 

  4126. /**

  4127.  * instantaneous decoder refresh.

  4128.  */

  4129. static void idr(H264Context *h){

  4130.     int i;

  4131. 

  4132.     for(i=0; i<16; i++){

  4133.         if (h->long_ref[i] != NULL) {

  4134.             unreference_pic(h, h->long_ref[i]);

  4135.             h->long_ref[i]= NULL;

  4136.         }

  4137.     }

  4138.     h->long_ref_count=0;

  4139. 

  4140.     for(i=0; i<h->short_ref_count; i++){

  4141.         unreference_pic(h, h->short_ref[i]);

  4142.         h->short_ref[i]= NULL;

  4143.     }

  4144.     h->short_ref_count=0;

  4145. }

  4146. 

  4147. /* forget old pics after a seek */

  4148. static void flush_dpb(AVCodecContext *avctx){

  4149.     H264Context *h= avctx->priv_data;

  4150.     int i;

  4151.     for(i=0; i<16; i++) {

  4152.         if(h->delayed_pic[i])

  4153.             h->delayed_pic[i]->reference= 0;

  4154.         h->delayed_pic[i]= NULL;

  4155.     }

  4156.     if(h->delayed_output_pic)

  4157.         h->delayed_output_pic->reference= 0;

  4158.     h->delayed_output_pic= NULL;

  4159.     idr(h);

  4160.     if(h->s.current_picture_ptr)

  4161.         h->s.current_picture_ptr->reference= 0;

  4162. }

  4163. 

  4164. /**

  4165.  *

  4166.  * @return the removed picture or NULL if an error occurs

  4167.  */

  4168. static Picture * remove_short(H264Context *h, int frame_num){

  4169.     MpegEncContext * const s = &h->s;

  4170.     int i;

  4171. 

  4172.     if(s->avctx->debug&FF_DEBUG_MMCO)

  4173.         av_log(h->s.avctx, AV_LOG_DEBUG, "remove short %d count %d\n", frame_num, h->short_ref_count);

  4174. 

  4175.     for(i=0; i<h->short_ref_count; i++){

  4176.         Picture *pic= h->short_ref[i];

  4177.         if(s->avctx->debug&FF_DEBUG_MMCO)

  4178.             av_log(h->s.avctx, AV_LOG_DEBUG, "%d %d %p\n", i, pic->frame_num, pic);

  4179.         if(pic->frame_num == frame_num){

  4180.             h->short_ref[i]= NULL;

  4181.             memmove(&h->short_ref[i], &h->short_ref[i+1], (h->short_ref_count - i - 1)*sizeof(Picture*));

  4182.             h->short_ref_count--;

  4183.             return pic;

  4184.         }

  4185.     }

  4186.     return NULL;

  4187. }

  4188. 

  4189. /**

  4190.  *

  4191.  * @return the removed picture or NULL if an error occurs

  4192.  */

  4193. static Picture * remove_long(H264Context *h, int i){

  4194.     Picture *pic;

  4195. 

  4196.     pic= h->long_ref[i];

  4197.     h->long_ref[i]= NULL;

  4198.     if(pic) h->long_ref_count--;

  4199. 

  4200.     return pic;

  4201. }

  4202. 

  4203. /**

  4204.  * print short term list

  4205.  */

  4206. static void print_short_term(H264Context *h) {

  4207.     uint32_t i;

  4208.     if(h->s.avctx->debug&FF_DEBUG_MMCO) {

  4209.         av_log(h->s.avctx, AV_LOG_DEBUG, "short term list:\n");

  4210.         for(i=0; i<h->short_ref_count; i++){

  4211.             Picture *pic= h->short_ref[i];

  4212.             av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);

  4213.         }

  4214.     }

  4215. }

  4216. 

  4217. /**

  4218.  * print long term list

  4219.  */

  4220. static void print_long_term(H264Context *h) {

  4221.     uint32_t i;

  4222.     if(h->s.avctx->debug&FF_DEBUG_MMCO) {

  4223.         av_log(h->s.avctx, AV_LOG_DEBUG, "long term list:\n");

  4224.         for(i = 0; i < 16; i++){

  4225.             Picture *pic= h->long_ref[i];

  4226.             if (pic) {

  4227.                 av_log(h->s.avctx, AV_LOG_DEBUG, "%d fn:%d poc:%d %p\n", i, pic->frame_num, pic->poc, pic->data[0]);

  4228.             }

  4229.         }

  4230.     }

  4231. }

  4232. 

  4233. /**

  4234.  * Executes the reference picture marking (memory management control operations).

  4235.  */

  4236. static int execute_ref_pic_marking(H264Context *h, MMCO *mmco, int mmco_count){

  4237.     MpegEncContext * const s = &h->s;

  4238.     int i, j;

  4239.     int current_is_long=0;

  4240.     Picture *pic;

  4241. 

  4242.     if((s->avctx->debug&FF_DEBUG_MMCO) && mmco_count==0)

  4243.         av_log(h->s.avctx, AV_LOG_DEBUG, "no mmco here\n");

  4244. 

  4245.     for(i=0; i<mmco_count; i++){

  4246.         if(s->avctx->debug&FF_DEBUG_MMCO)

  4247.             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);

  4248. 

  4249.         switch(mmco[i].opcode){

  4250.         case MMCO_SHORT2UNUSED:

  4251.             pic= remove_short(h, mmco[i].short_frame_num);

  4252.             if(pic)

  4253.                 unreference_pic(h, pic);

  4254.             else if(s->avctx->debug&FF_DEBUG_MMCO)

  4255.                 av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: remove_short() failure\n");

  4256.             break;

  4257.         case MMCO_SHORT2LONG:

  4258.             pic= remove_long(h, mmco[i].long_index);

  4259.             if(pic) unreference_pic(h, pic);

  4260. 

  4261.             h->long_ref[ mmco[i].long_index ]= remove_short(h, mmco[i].short_frame_num);

  4262.             h->long_ref[ mmco[i].long_index ]->long_ref=1;

  4263.             h->long_ref_count++;

  4264.             break;

  4265.         case MMCO_LONG2UNUSED:

  4266.             pic= remove_long(h, mmco[i].long_index);

  4267.             if(pic)

  4268.                 unreference_pic(h, pic);

  4269.             else if(s->avctx->debug&FF_DEBUG_MMCO)

  4270.                 av_log(h->s.avctx, AV_LOG_DEBUG, "mmco: remove_long() failure\n");

  4271.             break;

  4272.         case MMCO_LONG:

  4273.             pic= remove_long(h, mmco[i].long_index);

  4274.             if(pic) unreference_pic(h, pic);

  4275. 

  4276.             h->long_ref[ mmco[i].long_index ]= s->current_picture_ptr;

  4277.             h->long_ref[ mmco[i].long_index ]->long_ref=1;

  4278.             h->long_ref_count++;

  4279. 

  4280.             current_is_long=1;

  4281.             break;

  4282.         case MMCO_SET_MAX_LONG:

  4283.             assert(mmco[i].long_index <= 16);

  4284.             // just remove the long term which index is greater than new max

  4285.             for(j = mmco[i].long_index; j<16; j++){

  4286.                 pic = remove_long(h, j);

  4287.                 if (pic) unreference_pic(h, pic);

  4288.             }

  4289.             break;

  4290.         case MMCO_RESET:

  4291.             while(h->short_ref_count){

  4292.                 pic= remove_short(h, h->short_ref[0]->frame_num);

  4293.                 unreference_pic(h, pic);

  4294.             }

  4295.             for(j = 0; j < 16; j++) {

  4296.                 pic= remove_long(h, j);

  4297.                 if(pic) unreference_pic(h, pic);

  4298.             }

  4299.             break;

  4300.         default: assert(0);

  4301.         }

  4302.     }

  4303. 

  4304.     if(!current_is_long){

  4305.         pic= remove_short(h, s->current_picture_ptr->frame_num);

  4306.         if(pic){

  4307.             unreference_pic(h, pic);

  4308.             av_log(h->s.avctx, AV_LOG_ERROR, "illegal short term buffer state detected\n");

  4309.         }

  4310. 

  4311.         if(h->short_ref_count)

  4312.             memmove(&h->short_ref[1], &h->short_ref[0], h->short_ref_count*sizeof(Picture*));

  4313. 

  4314.         h->short_ref[0]= s->current_picture_ptr;

  4315.         h->short_ref[0]->long_ref=0;

  4316.         h->short_ref_count++;

  4317.     }

  4318. 

  4319.     print_short_term(h);

  4320.     print_long_term(h);

  4321.     return 0;

  4322. }

  4323. 

  4324. static int decode_ref_pic_marking(H264Context *h){

  4325.     MpegEncContext * const s = &h->s;

  4326.     int i;

  4327. 

  4328.     if(h->nal_unit_type == NAL_IDR_SLICE){ //FIXME fields

  4329.         s->broken_link= get_bits1(&s->gb) -1;

  4330.         h->mmco[0].long_index= get_bits1(&s->gb) - 1; // current_long_term_idx

  4331.         if(h->mmco[0].long_index == -1)

  4332.             h->mmco_index= 0;

  4333.         else{

  4334.             h->mmco[0].opcode= MMCO_LONG;

  4335.             h->mmco_index= 1;

  4336.         }

  4337.     }else{

  4338.         if(get_bits1(&s->gb)){ // adaptive_ref_pic_marking_mode_flag

  4339.             for(i= 0; i<MAX_MMCO_COUNT; i++) {

  4340.                 MMCOOpcode opcode= get_ue_golomb(&s->gb);;

  4341. 

  4342.                 h->mmco[i].opcode= opcode;

  4343.                 if(opcode==MMCO_SHORT2UNUSED || opcode==MMCO_SHORT2LONG){

  4344.                     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

  4345. /*                    if(h->mmco[i].short_frame_num >= h->short_ref_count || h->short_ref[ h->mmco[i].short_frame_num ] == NULL){

  4346.                         av_log(s->avctx, AV_LOG_ERROR, "illegal short ref in memory management control operation %d\n", mmco);

  4347.                         return -1;

  4348.                     }*/

  4349.                 }

  4350.                 if(opcode==MMCO_SHORT2LONG || opcode==MMCO_LONG2UNUSED || opcode==MMCO_LONG || opcode==MMCO_SET_MAX_LONG){

  4351.                     h->mmco[i].long_index= get_ue_golomb(&s->gb);

  4352.                     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){

  4353.                         av_log(h->s.avctx, AV_LOG_ERROR, "illegal long ref in memory management control operation %d\n", opcode);

  4354.                         return -1;

  4355.                     }

  4356.                 }

  4357. 

  4358.                 if(opcode > MMCO_LONG){

  4359.                     av_log(h->s.avctx, AV_LOG_ERROR, "illegal memory management control operation %d\n", opcode);

  4360.                     return -1;

  4361.                 }

  4362.                 if(opcode == MMCO_END)

  4363.                     break;

  4364.             }

  4365.             h->mmco_index= i;

  4366.         }else{

  4367.             assert(h->long_ref_count + h->short_ref_count <= h->sps.ref_frame_count);

  4368. 

  4369.             if(h->long_ref_count + h->short_ref_count == h->sps.ref_frame_count){ //FIXME fields

  4370.                 h->mmco[0].opcode= MMCO_SHORT2UNUSED;

  4371.                 h->mmco[0].short_frame_num= h->short_ref[ h->short_ref_count - 1 ]->frame_num;

  4372.                 h->mmco_index= 1;

  4373.             }else

  4374.                 h->mmco_index= 0;

  4375.         }

  4376.     }

  4377. 

  4378.     return 0;

  4379. }

  4380. 

  4381. static int init_poc(H264Context *h){

  4382.     MpegEncContext * const s = &h->s;

  4383.     const int max_frame_num= 1<<h->sps.log2_max_frame_num;

  4384.     int field_poc[2];

  4385. 

  4386.     if(h->nal_unit_type == NAL_IDR_SLICE){

  4387.         h->frame_num_offset= 0;

  4388.     }else{

  4389.         if(h->frame_num < h->prev_frame_num)

  4390.             h->frame_num_offset= h->prev_frame_num_offset + max_frame_num;

  4391.         else

  4392.             h->frame_num_offset= h->prev_frame_num_offset;

  4393.     }

  4394. 

  4395.     if(h->sps.poc_type==0){

  4396.         const int max_poc_lsb= 1<<h->sps.log2_max_poc_lsb;

  4397. 

  4398.         if(h->nal_unit_type == NAL_IDR_SLICE){

  4399.              h->prev_poc_msb=

  4400.              h->prev_poc_lsb= 0;

  4401.         }

  4402. 

  4403.         if     (h->poc_lsb < h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb >= max_poc_lsb/2)

  4404.             h->poc_msb = h->prev_poc_msb + max_poc_lsb;

  4405.         else if(h->poc_lsb > h->prev_poc_lsb && h->prev_poc_lsb - h->poc_lsb < -max_poc_lsb/2)

  4406.             h->poc_msb = h->prev_poc_msb - max_poc_lsb;

  4407.         else

  4408.             h->poc_msb = h->prev_poc_msb;

  4409. //printf("poc: %d %d\n", h->poc_msb, h->poc_lsb);

  4410.         field_poc[0] =

  4411.         field_poc[1] = h->poc_msb + h->poc_lsb;

  4412.         if(s->picture_structure == PICT_FRAME)

  4413.             field_poc[1] += h->delta_poc_bottom;

  4414.     }else if(h->sps.poc_type==1){

  4415.         int abs_frame_num, expected_delta_per_poc_cycle, expectedpoc;

  4416.         int i;

  4417. 

  4418.         if(h->sps.poc_cycle_length != 0)

  4419.             abs_frame_num = h->frame_num_offset + h->frame_num;

  4420.         else

  4421.             abs_frame_num = 0;

  4422. 

  4423.         if(h->nal_ref_idc==0 && abs_frame_num > 0)

  4424.             abs_frame_num--;

  4425. 

  4426.         expected_delta_per_poc_cycle = 0;

  4427.         for(i=0; i < h->sps.poc_cycle_length; i++)

  4428.             expected_delta_per_poc_cycle += h->sps.offset_for_ref_frame[ i ]; //FIXME integrate during sps parse

  4429. 

  4430.         if(abs_frame_num > 0){

  4431.             int poc_cycle_cnt          = (abs_frame_num - 1) / h->sps.poc_cycle_length;

  4432.             int frame_num_in_poc_cycle = (abs_frame_num - 1) % h->sps.poc_cycle_length;

  4433. 

  4434.             expectedpoc = poc_cycle_cnt * expected_delta_per_poc_cycle;

  4435.             for(i = 0; i <= frame_num_in_poc_cycle; i++)

  4436.                 expectedpoc = expectedpoc + h->sps.offset_for_ref_frame[ i ];

  4437.         } else

  4438.             expectedpoc = 0;

  4439. 

  4440.         if(h->nal_ref_idc == 0)

  4441.             expectedpoc = expectedpoc + h->sps.offset_for_non_ref_pic;

  4442. 

  4443.         field_poc[0] = expectedpoc + h->delta_poc[0];

  4444.         field_poc[1] = field_poc[0] + h->sps.offset_for_top_to_bottom_field;

  4445. 

  4446.         if(s->picture_structure == PICT_FRAME)

  4447.             field_poc[1] += h->delta_poc[1];

  4448.     }else{

  4449.         int poc;

  4450.         if(h->nal_unit_type == NAL_IDR_SLICE){

  4451.             poc= 0;

  4452.         }else{

  4453.             if(h->nal_ref_idc) poc= 2*(h->frame_num_offset + h->frame_num);

  4454.             else               poc= 2*(h->frame_num_offset + h->frame_num) - 1;

  4455.         }

  4456.         field_poc[0]= poc;

  4457.         field_poc[1]= poc;

  4458.     }

  4459. 

  4460.     if(s->picture_structure != PICT_BOTTOM_FIELD)

  4461.         s->current_picture_ptr->field_poc[0]= field_poc[0];

  4462.     if(s->picture_structure != PICT_TOP_FIELD)

  4463.         s->current_picture_ptr->field_poc[1]= field_poc[1];

  4464.     if(s->picture_structure == PICT_FRAME) // FIXME field pix?

  4465.         s->current_picture_ptr->poc= FFMIN(field_poc[0], field_poc[1]);

  4466. 

  4467.     return 0;

  4468. }

  4469. 

  4470. /**

  4471.  * decodes a slice header.

  4472.  * this will allso call MPV_common_init() and frame_start() as needed

  4473.  */

  4474. static int decode_slice_header(H264Context *h){

  4475.     MpegEncContext * const s = &h->s;

  4476.     int first_mb_in_slice, pps_id;

  4477.     int num_ref_idx_active_override_flag;

  4478.     static const uint8_t slice_type_map[5]= {P_TYPE, B_TYPE, I_TYPE, SP_TYPE, SI_TYPE};

  4479.     int slice_type;

  4480.     int default_ref_list_done = 0;

  4481. 

  4482.     s->current_picture.reference= h->nal_ref_idc != 0;

  4483.     s->dropable= h->nal_ref_idc == 0;

  4484. 

  4485.     first_mb_in_slice= get_ue_golomb(&s->gb);

  4486. 

  4487.     slice_type= get_ue_golomb(&s->gb);

  4488.     if(slice_type > 9){

  4489.         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);

  4490.         return -1;

  4491.     }

  4492.     if(slice_type > 4){

  4493.         slice_type -= 5;

  4494.         h->slice_type_fixed=1;

  4495.     }else

  4496.         h->slice_type_fixed=0;

  4497. 

  4498.     slice_type= slice_type_map[ slice_type ];

  4499.     if (slice_type == I_TYPE

  4500.         || (h->slice_num != 0 && slice_type == h->slice_type) ) {

  4501.         default_ref_list_done = 1;

  4502.     }

  4503.     h->slice_type= slice_type;

  4504. 

  4505.     s->pict_type= h->slice_type; // to make a few old func happy, it's wrong though

  4506. 

  4507.     pps_id= get_ue_golomb(&s->gb);

  4508.     if(pps_id>255){

  4509.         av_log(h->s.avctx, AV_LOG_ERROR, "pps_id out of range\n");

  4510.         return -1;

  4511.     }

  4512.     h->pps= h->pps_buffer[pps_id];

  4513.     if(h->pps.slice_group_count == 0){

  4514.         av_log(h->s.avctx, AV_LOG_ERROR, "non existing PPS referenced\n");

  4515.         return -1;

  4516.     }

  4517. 

  4518.     h->sps= h->sps_buffer[ h->pps.sps_id ];

  4519.     if(h->sps.log2_max_frame_num == 0){

  4520.         av_log(h->s.avctx, AV_LOG_ERROR, "non existing SPS referenced\n");

  4521.         return -1;

  4522.     }

  4523. 

  4524.     if(h->dequant_coeff_pps != pps_id){

  4525.         h->dequant_coeff_pps = pps_id;

  4526.         init_dequant_tables(h);

  4527.     }

  4528. 

  4529.     s->mb_width= h->sps.mb_width;

  4530.     s->mb_height= h->sps.mb_height * (2 - h->sps.frame_mbs_only_flag);

  4531. 

  4532.     h->b_stride=  s->mb_width*4;

  4533.     h->b8_stride= s->mb_width*2;

  4534. 

  4535.     s->width = 16*s->mb_width - 2*(h->sps.crop_left + h->sps.crop_right );

  4536.     if(h->sps.frame_mbs_only_flag)

  4537.         s->height= 16*s->mb_height - 2*(h->sps.crop_top  + h->sps.crop_bottom);

  4538.     else

  4539.         s->height= 16*s->mb_height - 4*(h->sps.crop_top  + h->sps.crop_bottom); //FIXME recheck

  4540. 

  4541.     if (s->context_initialized

  4542.         && (   s->width != s->avctx->width || s->height != s->avctx->height)) {

  4543.         free_tables(h);

  4544.         MPV_common_end(s);

  4545.     }

  4546.     if (!s->context_initialized) {

  4547.         if (MPV_common_init(s) < 0)

  4548.             return -1;

  4549. 

  4550.         if(s->dsp.h264_idct_add == ff_h264_idct_add_c){ //FIXME little ugly

  4551.             memcpy(h->zigzag_scan, zigzag_scan, 16*sizeof(uint8_t));

  4552.             memcpy(h-> field_scan,  field_scan, 16*sizeof(uint8_t));

  4553.         }else{

  4554.             int i;

  4555.             for(i=0; i<16; i++){

  4556. #define T(x) (x>>2) | ((x<<2) & 0xF)

  4557.                 h->zigzag_scan[i] = T(zigzag_scan[i]);

  4558.                 h-> field_scan[i] = T( field_scan[i]);

  4559. #undef T

  4560.             }

  4561.         }

  4562.         if(s->dsp.h264_idct8_add == ff_h264_idct8_add_c){

  4563.             memcpy(h->zigzag_scan8x8,       zigzag_scan8x8,       64*sizeof(uint8_t));

  4564.             memcpy(h->zigzag_scan8x8_cavlc, zigzag_scan8x8_cavlc, 64*sizeof(uint8_t));

  4565.             memcpy(h->field_scan8x8,        field_scan8x8,        64*sizeof(uint8_t));

  4566.             memcpy(h->field_scan8x8_cavlc,  field_scan8x8_cavlc,  64*sizeof(uint8_t));

  4567.         }else{

  4568.             int i;

  4569.             for(i=0; i<64; i++){

  4570. #define T(x) (x>>3) | ((x&7)<<3)

  4571.                 h->zigzag_scan8x8[i]       = T(zigzag_scan8x8[i]);

  4572.                 h->zigzag_scan8x8_cavlc[i] = T(zigzag_scan8x8_cavlc[i]);

  4573.                 h->field_scan8x8[i]        = T(field_scan8x8[i]);

  4574.                 h->field_scan8x8_cavlc[i]  = T(field_scan8x8_cavlc[i]);

  4575. #undef T

  4576.             }

  4577.         }

  4578.         if(h->sps.transform_bypass){ //FIXME same ugly

  4579.             h->zigzag_scan_q0          = zigzag_scan;

  4580.             h->zigzag_scan8x8_q0       = zigzag_scan8x8;

  4581.             h->zigzag_scan8x8_cavlc_q0 = zigzag_scan8x8_cavlc;

  4582.             h->field_scan_q0           = field_scan;

  4583.             h->field_scan8x8_q0        = field_scan8x8;

  4584.             h->field_scan8x8_cavlc_q0  = field_scan8x8_cavlc;

  4585.         }else{

  4586.             h->zigzag_scan_q0          = h->zigzag_scan;

  4587.             h->zigzag_scan8x8_q0       = h->zigzag_scan8x8;

  4588.             h->zigzag_scan8x8_cavlc_q0 = h->zigzag_scan8x8_cavlc;

  4589.             h->field_scan_q0           = h->field_scan;

  4590.             h->field_scan8x8_q0        = h->field_scan8x8;

  4591.             h->field_scan8x8_cavlc_q0  = h->field_scan8x8_cavlc;

  4592.         }

  4593. 

  4594.         alloc_tables(h);

  4595. 

  4596.         s->avctx->width = s->width;

  4597.         s->avctx->height = s->height;

  4598.         s->avctx->sample_aspect_ratio= h->sps.sar;

  4599.         if(!s->avctx->sample_aspect_ratio.den)

  4600.             s->avctx->sample_aspect_ratio.den = 1;

  4601. 

  4602.         if(h->sps.timing_info_present_flag){

  4603.             s->avctx->time_base= (AVRational){h->sps.num_units_in_tick * 2, h->sps.time_scale};

  4604.             if(h->x264_build > 0 && h->x264_build < 44)

  4605.                 s->avctx->time_base.den *= 2;

  4606.             av_reduce(&s->avctx->time_base.num, &s->avctx->time_base.den,

  4607.                       s->avctx->time_base.num, s->avctx->time_base.den, 1<<30);

  4608.         }

  4609.     }

  4610. 

  4611.     if(h->slice_num == 0){

  4612.         if(frame_start(h) < 0)

  4613.             return -1;

  4614.     }

  4615. 

  4616.     s->current_picture_ptr->frame_num= //FIXME frame_num cleanup

  4617.     h->frame_num= get_bits(&s->gb, h->sps.log2_max_frame_num);

  4618. 

  4619.     h->mb_mbaff = 0;

  4620.     h->mb_aff_frame = 0;

  4621.     if(h->sps.frame_mbs_only_flag){

  4622.         s->picture_structure= PICT_FRAME;

  4623.     }else{

  4624.         if(get_bits1(&s->gb)) { //field_pic_flag

  4625.             s->picture_structure= PICT_TOP_FIELD + get_bits1(&s->gb); //bottom_field_flag

  4626.             av_log(h->s.avctx, AV_LOG_ERROR, "PAFF interlacing is not implemented\n");

  4627.         } else {

  4628.             s->picture_structure= PICT_FRAME;

  4629.             h->mb_aff_frame = h->sps.mb_aff;

  4630.         }

  4631.     }

  4632. 

  4633.     s->resync_mb_x = s->mb_x = first_mb_in_slice % s->mb_width;

  4634.     s->resync_mb_y = s->mb_y = (first_mb_in_slice / s->mb_width) << h->mb_aff_frame;

  4635.     if(s->mb_y >= s->mb_height){

  4636.         return -1;

  4637.     }

  4638. 

  4639.     if(s->picture_structure==PICT_FRAME){

  4640.         h->curr_pic_num=   h->frame_num;

  4641.         h->max_pic_num= 1<< h->sps.log2_max_frame_num;

  4642.     }else{

  4643.         h->curr_pic_num= 2*h->frame_num;

  4644.         h->max_pic_num= 1<<(h->sps.log2_max_frame_num + 1);

  4645.     }

  4646. 

  4647.     if(h->nal_unit_type == NAL_IDR_SLICE){

  4648.         get_ue_golomb(&s->gb); /* idr_pic_id */

  4649.     }

  4650. 

  4651.     if(h->sps.poc_type==0){

  4652.         h->poc_lsb= get_bits(&s->gb, h->sps.log2_max_poc_lsb);

  4653. 

  4654.         if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME){

  4655.             h->delta_poc_bottom= get_se_golomb(&s->gb);

  4656.         }

  4657.     }

  4658. 

  4659.     if(h->sps.poc_type==1 && !h->sps.delta_pic_order_always_zero_flag){

  4660.         h->delta_poc[0]= get_se_golomb(&s->gb);

  4661. 

  4662.         if(h->pps.pic_order_present==1 && s->picture_structure==PICT_FRAME)

  4663.             h->delta_poc[1]= get_se_golomb(&s->gb);

  4664.     }

  4665. 

  4666.     init_poc(h);

  4667. 

  4668.     if(h->pps.redundant_pic_cnt_present){

  4669.         h->redundant_pic_count= get_ue_golomb(&s->gb);

  4670.     }

  4671. 

  4672.     //set defaults, might be overriden a few line later

  4673.     h->ref_count[0]= h->pps.ref_count[0];

  4674.     h->ref_count[1]= h->pps.ref_count[1];

  4675. 

  4676.     if(h->slice_type == P_TYPE || h->slice_type == SP_TYPE || h->slice_type == B_TYPE){

  4677.         if(h->slice_type == B_TYPE){

  4678.             h->direct_spatial_mv_pred= get_bits1(&s->gb);

  4679.             if(h->sps.mb_aff && h->direct_spatial_mv_pred)

  4680.                 av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF + spatial direct mode is not implemented\n");

  4681.         }

  4682.         num_ref_idx_active_override_flag= get_bits1(&s->gb);

  4683. 

  4684.         if(num_ref_idx_active_override_flag){

  4685.             h->ref_count[0]= get_ue_golomb(&s->gb) + 1;

  4686.             if(h->slice_type==B_TYPE)

  4687.                 h->ref_count[1]= get_ue_golomb(&s->gb) + 1;

  4688. 

  4689.             if(h->ref_count[0] > 32 || h->ref_count[1] > 32){

  4690.                 av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow\n");

  4691.                 return -1;

  4692.             }

  4693.         }

  4694.     }

  4695. 

  4696.     if(!default_ref_list_done){

  4697.         fill_default_ref_list(h);

  4698.     }

  4699. 

  4700.     if(decode_ref_pic_list_reordering(h) < 0)

  4701.         return -1;

  4702. 

  4703.     if(   (h->pps.weighted_pred          && (h->slice_type == P_TYPE || h->slice_type == SP_TYPE ))

  4704.        || (h->pps.weighted_bipred_idc==1 && h->slice_type==B_TYPE ) )

  4705.         pred_weight_table(h);

  4706.     else if(h->pps.weighted_bipred_idc==2 && h->slice_type==B_TYPE)

  4707.         implicit_weight_table(h);

  4708.     else

  4709.         h->use_weight = 0;

  4710. 

  4711.     if(s->current_picture.reference)

  4712.         decode_ref_pic_marking(h);

  4713. 

  4714.     if(FRAME_MBAFF)

  4715.         fill_mbaff_ref_list(h);

  4716. 

  4717.     if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE && h->pps.cabac )

  4718.         h->cabac_init_idc = get_ue_golomb(&s->gb);

  4719. 

  4720.     h->last_qscale_diff = 0;

  4721.     s->qscale = h->pps.init_qp + get_se_golomb(&s->gb);

  4722.     if(s->qscale<0 || s->qscale>51){

  4723.         av_log(s->avctx, AV_LOG_ERROR, "QP %d out of range\n", s->qscale);

  4724.         return -1;

  4725.     }

  4726.     h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, s->qscale);

  4727.     //FIXME qscale / qp ... stuff

  4728.     if(h->slice_type == SP_TYPE){

  4729.         get_bits1(&s->gb); /* sp_for_switch_flag */

  4730.     }

  4731.     if(h->slice_type==SP_TYPE || h->slice_type == SI_TYPE){

  4732.         get_se_golomb(&s->gb); /* slice_qs_delta */

  4733.     }

  4734. 

  4735.     h->deblocking_filter = 1;

  4736.     h->slice_alpha_c0_offset = 0;

  4737.     h->slice_beta_offset = 0;

  4738.     if( h->pps.deblocking_filter_parameters_present ) {

  4739.         h->deblocking_filter= get_ue_golomb(&s->gb);

  4740.         if(h->deblocking_filter < 2)

  4741.             h->deblocking_filter^= 1; // 1<->0

  4742. 

  4743.         if( h->deblocking_filter ) {

  4744.             h->slice_alpha_c0_offset = get_se_golomb(&s->gb) << 1;

  4745.             h->slice_beta_offset = get_se_golomb(&s->gb) << 1;

  4746.         }

  4747.     }

  4748.     if(   s->avctx->skip_loop_filter >= AVDISCARD_ALL

  4749.        ||(s->avctx->skip_loop_filter >= AVDISCARD_NONKEY && h->slice_type != I_TYPE)

  4750.        ||(s->avctx->skip_loop_filter >= AVDISCARD_BIDIR  && h->slice_type == B_TYPE)

  4751.        ||(s->avctx->skip_loop_filter >= AVDISCARD_NONREF && h->nal_ref_idc == 0))

  4752.         h->deblocking_filter= 0;

  4753. 

  4754. #if 0 //FMO

  4755.     if( h->pps.num_slice_groups > 1  && h->pps.mb_slice_group_map_type >= 3 && h->pps.mb_slice_group_map_type <= 5)

  4756.         slice_group_change_cycle= get_bits(&s->gb, ?);

  4757. #endif

  4758. 

  4759.     h->slice_num++;

  4760. 

  4761.     h->emu_edge_width= (s->flags&CODEC_FLAG_EMU_EDGE) ? 0 : 16;

  4762.     h->emu_edge_height= FRAME_MBAFF ? 0 : h->emu_edge_width;

  4763. 

  4764.     if(s->avctx->debug&FF_DEBUG_PICT_INFO){

  4765.         av_log(h->s.avctx, AV_LOG_DEBUG, "slice:%d %s mb:%d %c pps:%d frame:%d poc:%d/%d ref:%d/%d qp:%d loop:%d:%d:%d weight:%d%s\n",

  4766.                h->slice_num,

  4767.                (s->picture_structure==PICT_FRAME ? "F" : s->picture_structure==PICT_TOP_FIELD ? "T" : "B"),

  4768.                first_mb_in_slice,

  4769.                av_get_pict_type_char(h->slice_type),

  4770.                pps_id, h->frame_num,

  4771.                s->current_picture_ptr->field_poc[0], s->current_picture_ptr->field_poc[1],

  4772.                h->ref_count[0], h->ref_count[1],

  4773.                s->qscale,

  4774.                h->deblocking_filter, h->slice_alpha_c0_offset/2, h->slice_beta_offset/2,

  4775.                h->use_weight,

  4776.                h->use_weight==1 && h->use_weight_chroma ? "c" : ""

  4777.                );

  4778.     }

  4779. 

  4780.     if((s->avctx->flags2 & CODEC_FLAG2_FAST) && !s->current_picture.reference){

  4781.         s->me.qpel_put= s->dsp.put_2tap_qpel_pixels_tab;

  4782.         s->me.qpel_avg= s->dsp.avg_2tap_qpel_pixels_tab;

  4783.     }else{

  4784.         s->me.qpel_put= s->dsp.put_h264_qpel_pixels_tab;

  4785.         s->me.qpel_avg= s->dsp.avg_h264_qpel_pixels_tab;

  4786.     }

  4787. 

  4788.     return 0;

  4789. }

  4790. 

  4791. /**

  4792.  *

  4793.  */

  4794. static inline int get_level_prefix(GetBitContext *gb){

  4795.     unsigned int buf;

  4796.     int log;

  4797. 

  4798.     OPEN_READER(re, gb);

  4799.     UPDATE_CACHE(re, gb);

  4800.     buf=GET_CACHE(re, gb);

  4801. 

  4802.     log= 32 - av_log2(buf);

  4803. #ifdef TRACE

  4804.     print_bin(buf>>(32-log), log);

  4805.     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__);

  4806. #endif

  4807. 

  4808.     LAST_SKIP_BITS(re, gb, log);

  4809.     CLOSE_READER(re, gb);

  4810. 

  4811.     return log-1;

  4812. }

  4813. 

  4814. static inline int get_dct8x8_allowed(H264Context *h){

  4815.     int i;

  4816.     for(i=0; i<4; i++){

  4817.         if(!IS_SUB_8X8(h->sub_mb_type[i])

  4818.            || (!h->sps.direct_8x8_inference_flag && IS_DIRECT(h->sub_mb_type[i])))

  4819.             return 0;

  4820.     }

  4821.     return 1;

  4822. }

  4823. 

  4824. /**

  4825.  * decodes a residual block.

  4826.  * @param n block index

  4827.  * @param scantable scantable

  4828.  * @param max_coeff number of coefficients in the block

  4829.  * @return <0 if an error occured

  4830.  */

  4831. static int decode_residual(H264Context *h, GetBitContext *gb, DCTELEM *block, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff){

  4832.     MpegEncContext * const s = &h->s;

  4833.     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};

  4834.     int level[16];

  4835.     int zeros_left, coeff_num, coeff_token, total_coeff, i, j, trailing_ones, run_before;

  4836. 

  4837.     //FIXME put trailing_onex into the context

  4838. 

  4839.     if(n == CHROMA_DC_BLOCK_INDEX){

  4840.         coeff_token= get_vlc2(gb, chroma_dc_coeff_token_vlc.table, CHROMA_DC_COEFF_TOKEN_VLC_BITS, 1);

  4841.         total_coeff= coeff_token>>2;

  4842.     }else{

  4843.         if(n == LUMA_DC_BLOCK_INDEX){

  4844.             total_coeff= pred_non_zero_count(h, 0);

  4845.             coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);

  4846.             total_coeff= coeff_token>>2;

  4847.         }else{

  4848.             total_coeff= pred_non_zero_count(h, n);

  4849.             coeff_token= get_vlc2(gb, coeff_token_vlc[ coeff_token_table_index[total_coeff] ].table, COEFF_TOKEN_VLC_BITS, 2);

  4850.             total_coeff= coeff_token>>2;

  4851.             h->non_zero_count_cache[ scan8[n] ]= total_coeff;

  4852.         }

  4853.     }

  4854. 

  4855.     //FIXME set last_non_zero?

  4856. 

  4857.     if(total_coeff==0)

  4858.         return 0;

  4859.     if(total_coeff<0) {

  4860.         av_log(h->s.avctx, AV_LOG_ERROR, "corrupted macroblock %d %d (total_coeff<0)\n", s->mb_x, s->mb_y);

  4861.         return -1;

  4862.     }

  4863. 

  4864.     trailing_ones= coeff_token&3;

  4865.     tprintf("trailing:%d, total:%d\n", trailing_ones, total_coeff);

  4866.     assert(total_coeff<=16);

  4867. 

  4868.     for(i=0; i<trailing_ones; i++){

  4869.         level[i]= 1 - 2*get_bits1(gb);

  4870.     }

  4871. 

  4872.     if(i<total_coeff) {

  4873.         int level_code, mask;

  4874.         int suffix_length = total_coeff > 10 && trailing_ones < 3;

  4875.         int prefix= get_level_prefix(gb);

  4876. 

  4877.         //first coefficient has suffix_length equal to 0 or 1

  4878.         if(prefix<14){ //FIXME try to build a large unified VLC table for all this

  4879.             if(suffix_length)

  4880.                 level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part

  4881.             else

  4882.                 level_code= (prefix<<suffix_length); //part

  4883.         }else if(prefix==14){

  4884.             if(suffix_length)

  4885.                 level_code= (prefix<<suffix_length) + get_bits(gb, suffix_length); //part

  4886.             else

  4887.                 level_code= prefix + get_bits(gb, 4); //part

  4888.         }else if(prefix==15){

  4889.             level_code= (prefix<<suffix_length) + get_bits(gb, 12); //part

  4890.             if(suffix_length==0) level_code+=15; //FIXME doesn't make (much)sense

  4891.         }else{

  4892.             av_log(h->s.avctx, AV_LOG_ERROR, "prefix too large at %d %d\n", s->mb_x, s->mb_y);

  4893.             return -1;

  4894.         }

  4895. 

  4896.         if(trailing_ones < 3) level_code += 2;

  4897. 

  4898.         suffix_length = 1;

  4899.         if(level_code > 5)

  4900.             suffix_length++;

  4901.         mask= -(level_code&1);

  4902.         level[i]= (((2+level_code)>>1) ^ mask) - mask;

  4903.         i++;

  4904. 

  4905.         //remaining coefficients have suffix_length > 0

  4906.         for(;i<total_coeff;i++) {

  4907.             static const int suffix_limit[7] = {0,5,11,23,47,95,INT_MAX };

  4908.             prefix = get_level_prefix(gb);

  4909.             if(prefix<15){

  4910.                 level_code = (prefix<<suffix_length) + get_bits(gb, suffix_length);

  4911.             }else if(prefix==15){

  4912.                 level_code =  (prefix<<suffix_length) + get_bits(gb, 12);

  4913.             }else{

  4914.                 av_log(h->s.avctx, AV_LOG_ERROR, "prefix too large at %d %d\n", s->mb_x, s->mb_y);

  4915.                 return -1;

  4916.             }

  4917.             mask= -(level_code&1);

  4918.             level[i]= (((2+level_code)>>1) ^ mask) - mask;

  4919.             if(level_code > suffix_limit[suffix_length])

  4920.                 suffix_length++;

  4921.         }

  4922.     }

  4923. 

  4924.     if(total_coeff == max_coeff)

  4925.         zeros_left=0;

  4926.     else{

  4927.         if(n == CHROMA_DC_BLOCK_INDEX)

  4928.             zeros_left= get_vlc2(gb, chroma_dc_total_zeros_vlc[ total_coeff-1 ].table, CHROMA_DC_TOTAL_ZEROS_VLC_BITS, 1);

  4929.         else

  4930.             zeros_left= get_vlc2(gb, total_zeros_vlc[ total_coeff-1 ].table, TOTAL_ZEROS_VLC_BITS, 1);

  4931.     }

  4932. 

  4933.     coeff_num = zeros_left + total_coeff - 1;

  4934.     j = scantable[coeff_num];

  4935.     if(n > 24){

  4936.         block[j] = level[0];

  4937.         for(i=1;i<total_coeff;i++) {

  4938.             if(zeros_left <= 0)

  4939.                 run_before = 0;

  4940.             else if(zeros_left < 7){

  4941.                 run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);

  4942.             }else{

  4943.                 run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);

  4944.             }

  4945.             zeros_left -= run_before;

  4946.             coeff_num -= 1 + run_before;

  4947.             j= scantable[ coeff_num ];

  4948. 

  4949.             block[j]= level[i];

  4950.         }

  4951.     }else{

  4952.         block[j] = (level[0] * qmul[j] + 32)>>6;

  4953.         for(i=1;i<total_coeff;i++) {

  4954.             if(zeros_left <= 0)

  4955.                 run_before = 0;

  4956.             else if(zeros_left < 7){

  4957.                 run_before= get_vlc2(gb, run_vlc[zeros_left-1].table, RUN_VLC_BITS, 1);

  4958.             }else{

  4959.                 run_before= get_vlc2(gb, run7_vlc.table, RUN7_VLC_BITS, 2);

  4960.             }

  4961.             zeros_left -= run_before;

  4962.             coeff_num -= 1 + run_before;

  4963.             j= scantable[ coeff_num ];

  4964. 

  4965.             block[j]= (level[i] * qmul[j] + 32)>>6;

  4966.         }

  4967.     }

  4968. 

  4969.     if(zeros_left<0){

  4970.         av_log(h->s.avctx, AV_LOG_ERROR, "negative number of zero coeffs at %d %d\n", s->mb_x, s->mb_y);

  4971.         return -1;

  4972.     }

  4973. 

  4974.     return 0;

  4975. }

  4976. 

  4977. static void predict_field_decoding_flag(H264Context *h){

  4978.     MpegEncContext * const s = &h->s;

  4979.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  4980.     int mb_type = (h->slice_table[mb_xy-1] == h->slice_num)

  4981.                 ? s->current_picture.mb_type[mb_xy-1]

  4982.                 : (h->slice_table[mb_xy-s->mb_stride] == h->slice_num)

  4983.                 ? s->current_picture.mb_type[mb_xy-s->mb_stride]

  4984.                 : 0;

  4985.     h->mb_mbaff = h->mb_field_decoding_flag = IS_INTERLACED(mb_type) ? 1 : 0;

  4986. }

  4987. 

  4988. /**

  4989.  * decodes a P_SKIP or B_SKIP macroblock

  4990.  */

  4991. static void decode_mb_skip(H264Context *h){

  4992.     MpegEncContext * const s = &h->s;

  4993.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  4994.     int mb_type=0;

  4995. 

  4996.     memset(h->non_zero_count[mb_xy], 0, 16);

  4997.     memset(h->non_zero_count_cache + 8, 0, 8*5); //FIXME ugly, remove pfui

  4998. 

  4999.     if(MB_FIELD)

  5000.         mb_type|= MB_TYPE_INTERLACED;

  5001. 

  5002.     if( h->slice_type == B_TYPE )

  5003.     {

  5004.         // just for fill_caches. pred_direct_motion will set the real mb_type

  5005.         mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P0L1|MB_TYPE_DIRECT2|MB_TYPE_SKIP;

  5006. 

  5007.         fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...

  5008.         pred_direct_motion(h, &mb_type);

  5009.         mb_type|= MB_TYPE_SKIP;

  5010.     }

  5011.     else

  5012.     {

  5013.         int mx, my;

  5014.         mb_type|= MB_TYPE_16x16|MB_TYPE_P0L0|MB_TYPE_P1L0|MB_TYPE_SKIP;

  5015. 

  5016.         fill_caches(h, mb_type, 0); //FIXME check what is needed and what not ...

  5017.         pred_pskip_motion(h, &mx, &my);

  5018.         fill_rectangle(&h->ref_cache[0][scan8[0]], 4, 4, 8, 0, 1);

  5019.         fill_rectangle(  h->mv_cache[0][scan8[0]], 4, 4, 8, pack16to32(mx,my), 4);

  5020.     }

  5021. 

  5022.     write_back_motion(h, mb_type);

  5023.     s->current_picture.mb_type[mb_xy]= mb_type;

  5024.     s->current_picture.qscale_table[mb_xy]= s->qscale;

  5025.     h->slice_table[ mb_xy ]= h->slice_num;

  5026.     h->prev_mb_skipped= 1;

  5027. }

  5028. 

  5029. /**

  5030.  * decodes a macroblock

  5031.  * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed

  5032.  */

  5033. static int decode_mb_cavlc(H264Context *h){

  5034.     MpegEncContext * const s = &h->s;

  5035.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  5036.     int mb_type, partition_count, cbp;

  5037.     int dct8x8_allowed= h->pps.transform_8x8_mode;

  5038. 

  5039.     s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?

  5040. 

  5041.     tprintf("pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);

  5042.     cbp = 0; /* avoid warning. FIXME: find a solution without slowing

  5043.                 down the code */

  5044.     if(h->slice_type != I_TYPE && h->slice_type != SI_TYPE){

  5045.         if(s->mb_skip_run==-1)

  5046.             s->mb_skip_run= get_ue_golomb(&s->gb);

  5047. 

  5048.         if (s->mb_skip_run--) {

  5049.             if(FRAME_MBAFF && (s->mb_y&1) == 0){

  5050.                 if(s->mb_skip_run==0)

  5051.                     h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);

  5052.                 else

  5053.                     predict_field_decoding_flag(h);

  5054.             }

  5055.             decode_mb_skip(h);

  5056.             return 0;

  5057.         }

  5058.     }

  5059.     if(FRAME_MBAFF){

  5060.         if( (s->mb_y&1) == 0 )

  5061.             h->mb_mbaff = h->mb_field_decoding_flag = get_bits1(&s->gb);

  5062.     }else

  5063.         h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);

  5064. 

  5065.     h->prev_mb_skipped= 0;

  5066. 

  5067.     mb_type= get_ue_golomb(&s->gb);

  5068.     if(h->slice_type == B_TYPE){

  5069.         if(mb_type < 23){

  5070.             partition_count= b_mb_type_info[mb_type].partition_count;

  5071.             mb_type=         b_mb_type_info[mb_type].type;

  5072.         }else{

  5073.             mb_type -= 23;

  5074.             goto decode_intra_mb;

  5075.         }

  5076.     }else if(h->slice_type == P_TYPE /*|| h->slice_type == SP_TYPE */){

  5077.         if(mb_type < 5){

  5078.             partition_count= p_mb_type_info[mb_type].partition_count;

  5079.             mb_type=         p_mb_type_info[mb_type].type;

  5080.         }else{

  5081.             mb_type -= 5;

  5082.             goto decode_intra_mb;

  5083.         }

  5084.     }else{

  5085.        assert(h->slice_type == I_TYPE);

  5086. decode_intra_mb:

  5087.         if(mb_type > 25){

  5088.             av_log(h->s.avctx, AV_LOG_ERROR, "mb_type %d in %c slice too large at %d %d\n", mb_type, av_get_pict_type_char(h->slice_type), s->mb_x, s->mb_y);

  5089.             return -1;

  5090.         }

  5091.         partition_count=0;

  5092.         cbp= i_mb_type_info[mb_type].cbp;

  5093.         h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;

  5094.         mb_type= i_mb_type_info[mb_type].type;

  5095.     }

  5096. 

  5097.     if(MB_FIELD)

  5098.         mb_type |= MB_TYPE_INTERLACED;

  5099. 

  5100.     h->slice_table[ mb_xy ]= h->slice_num;

  5101. 

  5102.     if(IS_INTRA_PCM(mb_type)){

  5103.         unsigned int x, y;

  5104. 

  5105.         // we assume these blocks are very rare so we dont optimize it

  5106.         align_get_bits(&s->gb);

  5107. 

  5108.         // The pixels are stored in the same order as levels in h->mb array.

  5109.         for(y=0; y<16; y++){

  5110.             const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);

  5111.             for(x=0; x<16; x++){

  5112.                 tprintf("LUMA ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));

  5113.                 h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= get_bits(&s->gb, 8);

  5114.             }

  5115.         }

  5116.         for(y=0; y<8; y++){

  5117.             const int index= 256 + 4*(y&3) + 32*(y>>2);

  5118.             for(x=0; x<8; x++){

  5119.                 tprintf("CHROMA U ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));

  5120.                 h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);

  5121.             }

  5122.         }

  5123.         for(y=0; y<8; y++){

  5124.             const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);

  5125.             for(x=0; x<8; x++){

  5126.                 tprintf("CHROMA V ICPM LEVEL (%3d)\n", show_bits(&s->gb, 8));

  5127.                 h->mb[index + (x&3) + 16*(x>>2)]= get_bits(&s->gb, 8);

  5128.             }

  5129.         }

  5130. 

  5131.         // In deblocking, the quantizer is 0

  5132.         s->current_picture.qscale_table[mb_xy]= 0;

  5133.         h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, 0);

  5134.         // All coeffs are present

  5135.         memset(h->non_zero_count[mb_xy], 16, 16);

  5136. 

  5137.         s->current_picture.mb_type[mb_xy]= mb_type;

  5138.         return 0;

  5139.     }

  5140. 

  5141.     if(MB_MBAFF){

  5142.         h->ref_count[0] <<= 1;

  5143.         h->ref_count[1] <<= 1;

  5144.     }

  5145. 

  5146.     fill_caches(h, mb_type, 0);

  5147. 

  5148.     //mb_pred

  5149.     if(IS_INTRA(mb_type)){

  5150. //            init_top_left_availability(h);

  5151.             if(IS_INTRA4x4(mb_type)){

  5152.                 int i;

  5153.                 int di = 1;

  5154.                 if(dct8x8_allowed && get_bits1(&s->gb)){

  5155.                     mb_type |= MB_TYPE_8x8DCT;

  5156.                     di = 4;

  5157.                 }

  5158. 

  5159. //                fill_intra4x4_pred_table(h);

  5160.                 for(i=0; i<16; i+=di){

  5161.                     int mode= pred_intra_mode(h, i);

  5162. 

  5163.                     if(!get_bits1(&s->gb)){

  5164.                         const int rem_mode= get_bits(&s->gb, 3);

  5165.                         mode = rem_mode + (rem_mode >= mode);

  5166.                     }

  5167. 

  5168.                     if(di==4)

  5169.                         fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );

  5170.                     else

  5171.                         h->intra4x4_pred_mode_cache[ scan8[i] ] = mode;

  5172.                 }

  5173.                 write_back_intra_pred_mode(h);

  5174.                 if( check_intra4x4_pred_mode(h) < 0)

  5175.                     return -1;

  5176.             }else{

  5177.                 h->intra16x16_pred_mode= check_intra_pred_mode(h, h->intra16x16_pred_mode);

  5178.                 if(h->intra16x16_pred_mode < 0)

  5179.                     return -1;

  5180.             }

  5181.             h->chroma_pred_mode= get_ue_golomb(&s->gb);

  5182. 

  5183.             h->chroma_pred_mode= check_intra_pred_mode(h, h->chroma_pred_mode);

  5184.             if(h->chroma_pred_mode < 0)

  5185.                 return -1;

  5186.     }else if(partition_count==4){

  5187.         int i, j, sub_partition_count[4], list, ref[2][4];

  5188. 

  5189.         if(h->slice_type == B_TYPE){

  5190.             for(i=0; i<4; i++){

  5191.                 h->sub_mb_type[i]= get_ue_golomb(&s->gb);

  5192.                 if(h->sub_mb_type[i] >=13){

  5193.                     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);

  5194.                     return -1;

  5195.                 }

  5196.                 sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;

  5197.                 h->sub_mb_type[i]=      b_sub_mb_type_info[ h->sub_mb_type[i] ].type;

  5198.             }

  5199.             if(   IS_DIRECT(h->sub_mb_type[0]) || IS_DIRECT(h->sub_mb_type[1])

  5200.                || IS_DIRECT(h->sub_mb_type[2]) || IS_DIRECT(h->sub_mb_type[3])) {

  5201.                 pred_direct_motion(h, &mb_type);

  5202.                 h->ref_cache[0][scan8[4]] =

  5203.                 h->ref_cache[1][scan8[4]] =

  5204.                 h->ref_cache[0][scan8[12]] =

  5205.                 h->ref_cache[1][scan8[12]] = PART_NOT_AVAILABLE;

  5206.             }

  5207.         }else{

  5208.             assert(h->slice_type == P_TYPE || h->slice_type == SP_TYPE); //FIXME SP correct ?

  5209.             for(i=0; i<4; i++){

  5210.                 h->sub_mb_type[i]= get_ue_golomb(&s->gb);

  5211.                 if(h->sub_mb_type[i] >=4){

  5212.                     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);

  5213.                     return -1;

  5214.                 }

  5215.                 sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;

  5216.                 h->sub_mb_type[i]=      p_sub_mb_type_info[ h->sub_mb_type[i] ].type;

  5217.             }

  5218.         }

  5219. 

  5220.         for(list=0; list<2; list++){

  5221.             int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];

  5222.             if(ref_count == 0) continue;

  5223.             for(i=0; i<4; i++){

  5224.                 if(IS_DIRECT(h->sub_mb_type[i])) continue;

  5225.                 if(IS_DIR(h->sub_mb_type[i], 0, list)){

  5226.                     ref[list][i] = get_te0_golomb(&s->gb, ref_count); //FIXME init to 0 before and skip?

  5227.                 }else{

  5228.                  //FIXME

  5229.                     ref[list][i] = -1;

  5230.                 }

  5231.             }

  5232.         }

  5233. 

  5234.         if(dct8x8_allowed)

  5235.             dct8x8_allowed = get_dct8x8_allowed(h);

  5236. 

  5237.         for(list=0; list<2; list++){

  5238.             const int ref_count= IS_REF0(mb_type) ? 1 : h->ref_count[list];

  5239.             if(ref_count == 0) continue;

  5240. 

  5241.             for(i=0; i<4; i++){

  5242.                 if(IS_DIRECT(h->sub_mb_type[i])) {

  5243.                     h->ref_cache[list][ scan8[4*i] ] = h->ref_cache[list][ scan8[4*i]+1 ];

  5244.                     continue;

  5245.                 }

  5246.                 h->ref_cache[list][ scan8[4*i]   ]=h->ref_cache[list][ scan8[4*i]+1 ]=

  5247.                 h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];

  5248. 

  5249.                 if(IS_DIR(h->sub_mb_type[i], 0, list)){

  5250.                     const int sub_mb_type= h->sub_mb_type[i];

  5251.                     const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;

  5252.                     for(j=0; j<sub_partition_count[i]; j++){

  5253.                         int mx, my;

  5254.                         const int index= 4*i + block_width*j;

  5255.                         int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];

  5256.                         pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mx, &my);

  5257.                         mx += get_se_golomb(&s->gb);

  5258.                         my += get_se_golomb(&s->gb);

  5259.                         tprintf("final mv:%d %d\n", mx, my);

  5260. 

  5261.                         if(IS_SUB_8X8(sub_mb_type)){

  5262.                             mv_cache[ 0 ][0]= mv_cache[ 1 ][0]=

  5263.                             mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;

  5264.                             mv_cache[ 0 ][1]= mv_cache[ 1 ][1]=

  5265.                             mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;

  5266.                         }else if(IS_SUB_8X4(sub_mb_type)){

  5267.                             mv_cache[ 0 ][0]= mv_cache[ 1 ][0]= mx;

  5268.                             mv_cache[ 0 ][1]= mv_cache[ 1 ][1]= my;

  5269.                         }else if(IS_SUB_4X8(sub_mb_type)){

  5270.                             mv_cache[ 0 ][0]= mv_cache[ 8 ][0]= mx;

  5271.                             mv_cache[ 0 ][1]= mv_cache[ 8 ][1]= my;

  5272.                         }else{

  5273.                             assert(IS_SUB_4X4(sub_mb_type));

  5274.                             mv_cache[ 0 ][0]= mx;

  5275.                             mv_cache[ 0 ][1]= my;

  5276.                         }

  5277.                     }

  5278.                 }else{

  5279.                     uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];

  5280.                     p[0] = p[1]=

  5281.                     p[8] = p[9]= 0;

  5282.                 }

  5283.             }

  5284.         }

  5285.     }else if(IS_DIRECT(mb_type)){

  5286.         pred_direct_motion(h, &mb_type);

  5287.         dct8x8_allowed &= h->sps.direct_8x8_inference_flag;

  5288.     }else{

  5289.         int list, mx, my, i;

  5290.          //FIXME we should set ref_idx_l? to 0 if we use that later ...

  5291.         if(IS_16X16(mb_type)){

  5292.             for(list=0; list<2; list++){

  5293.                 if(h->ref_count[list]>0){

  5294.                     if(IS_DIR(mb_type, 0, list)){

  5295.                         const int val= get_te0_golomb(&s->gb, h->ref_count[list]);

  5296.                         fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, val, 1);

  5297.                     }else

  5298.                         fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, (LIST_NOT_USED&0xFF), 1);

  5299.                 }

  5300.             }

  5301.             for(list=0; list<2; list++){

  5302.                 if(IS_DIR(mb_type, 0, list)){

  5303.                     pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mx, &my);

  5304.                     mx += get_se_golomb(&s->gb);

  5305.                     my += get_se_golomb(&s->gb);

  5306.                     tprintf("final mv:%d %d\n", mx, my);

  5307. 

  5308.                     fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);

  5309.                 }else

  5310.                     fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, 0, 4);

  5311.             }

  5312.         }

  5313.         else if(IS_16X8(mb_type)){

  5314.             for(list=0; list<2; list++){

  5315.                 if(h->ref_count[list]>0){

  5316.                     for(i=0; i<2; i++){

  5317.                         if(IS_DIR(mb_type, i, list)){

  5318.                             const int val= get_te0_golomb(&s->gb, h->ref_count[list]);

  5319.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, val, 1);

  5320.                         }else

  5321.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);

  5322.                     }

  5323.                 }

  5324.             }

  5325.             for(list=0; list<2; list++){

  5326.                 for(i=0; i<2; i++){

  5327.                     if(IS_DIR(mb_type, i, list)){

  5328.                         pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mx, &my);

  5329.                         mx += get_se_golomb(&s->gb);

  5330.                         my += get_se_golomb(&s->gb);

  5331.                         tprintf("final mv:%d %d\n", mx, my);

  5332. 

  5333.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);

  5334.                     }else

  5335.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);

  5336.                 }

  5337.             }

  5338.         }else{

  5339.             assert(IS_8X16(mb_type));

  5340.             for(list=0; list<2; list++){

  5341.                 if(h->ref_count[list]>0){

  5342.                     for(i=0; i<2; i++){

  5343.                         if(IS_DIR(mb_type, i, list)){ //FIXME optimize

  5344.                             const int val= get_te0_golomb(&s->gb, h->ref_count[list]);

  5345.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, val, 1);

  5346.                         }else

  5347.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);

  5348.                     }

  5349.                 }

  5350.             }

  5351.             for(list=0; list<2; list++){

  5352.                 for(i=0; i<2; i++){

  5353.                     if(IS_DIR(mb_type, i, list)){

  5354.                         pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mx, &my);

  5355.                         mx += get_se_golomb(&s->gb);

  5356.                         my += get_se_golomb(&s->gb);

  5357.                         tprintf("final mv:%d %d\n", mx, my);

  5358. 

  5359.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);

  5360.                     }else

  5361.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);

  5362.                 }

  5363.             }

  5364.         }

  5365.     }

  5366. 

  5367.     if(IS_INTER(mb_type))

  5368.         write_back_motion(h, mb_type);

  5369. 

  5370.     if(!IS_INTRA16x16(mb_type)){

  5371.         cbp= get_ue_golomb(&s->gb);

  5372.         if(cbp > 47){

  5373.             av_log(h->s.avctx, AV_LOG_ERROR, "cbp too large (%d) at %d %d\n", cbp, s->mb_x, s->mb_y);

  5374.             return -1;

  5375.         }

  5376. 

  5377.         if(IS_INTRA4x4(mb_type))

  5378.             cbp= golomb_to_intra4x4_cbp[cbp];

  5379.         else

  5380.             cbp= golomb_to_inter_cbp[cbp];

  5381.     }

  5382.     h->cbp = cbp;

  5383. 

  5384.     if(dct8x8_allowed && (cbp&15) && !IS_INTRA(mb_type)){

  5385.         if(get_bits1(&s->gb))

  5386.             mb_type |= MB_TYPE_8x8DCT;

  5387.     }

  5388.     s->current_picture.mb_type[mb_xy]= mb_type;

  5389. 

  5390.     if(cbp || IS_INTRA16x16(mb_type)){

  5391.         int i8x8, i4x4, chroma_idx;

  5392.         int chroma_qp, dquant;

  5393.         GetBitContext *gb= IS_INTRA(mb_type) ? h->intra_gb_ptr : h->inter_gb_ptr;

  5394.         const uint8_t *scan, *scan8x8, *dc_scan;

  5395. 

  5396. //        fill_non_zero_count_cache(h);

  5397. 

  5398.         if(IS_INTERLACED(mb_type)){

  5399.             scan8x8= s->qscale ? h->field_scan8x8_cavlc : h->field_scan8x8_cavlc_q0;

  5400.             scan= s->qscale ? h->field_scan : h->field_scan_q0;

  5401.             dc_scan= luma_dc_field_scan;

  5402.         }else{

  5403.             scan8x8= s->qscale ? h->zigzag_scan8x8_cavlc : h->zigzag_scan8x8_cavlc_q0;

  5404.             scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;

  5405.             dc_scan= luma_dc_zigzag_scan;

  5406.         }

  5407. 

  5408.         dquant= get_se_golomb(&s->gb);

  5409. 

  5410.         if( dquant > 25 || dquant < -26 ){

  5411.             av_log(h->s.avctx, AV_LOG_ERROR, "dquant out of range (%d) at %d %d\n", dquant, s->mb_x, s->mb_y);

  5412.             return -1;

  5413.         }

  5414. 

  5415.         s->qscale += dquant;

  5416.         if(((unsigned)s->qscale) > 51){

  5417.             if(s->qscale<0) s->qscale+= 52;

  5418.             else            s->qscale-= 52;

  5419.         }

  5420. 

  5421.         h->chroma_qp= chroma_qp= get_chroma_qp(h->pps.chroma_qp_index_offset, s->qscale);

  5422.         if(IS_INTRA16x16(mb_type)){

  5423.             if( decode_residual(h, h->intra_gb_ptr, h->mb, LUMA_DC_BLOCK_INDEX, dc_scan, h->dequant4_coeff[0][s->qscale], 16) < 0){

  5424.                 return -1; //FIXME continue if partitioned and other return -1 too

  5425.             }

  5426. 

  5427.             assert((cbp&15) == 0 || (cbp&15) == 15);

  5428. 

  5429.             if(cbp&15){

  5430.                 for(i8x8=0; i8x8<4; i8x8++){

  5431.                     for(i4x4=0; i4x4<4; i4x4++){

  5432.                         const int index= i4x4 + 4*i8x8;

  5433.                         if( decode_residual(h, h->intra_gb_ptr, h->mb + 16*index, index, scan + 1, h->dequant4_coeff[0][s->qscale], 15) < 0 ){

  5434.                             return -1;

  5435.                         }

  5436.                     }

  5437.                 }

  5438.             }else{

  5439.                 fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);

  5440.             }

  5441.         }else{

  5442.             for(i8x8=0; i8x8<4; i8x8++){

  5443.                 if(cbp & (1<<i8x8)){

  5444.                     if(IS_8x8DCT(mb_type)){

  5445.                         DCTELEM *buf = &h->mb[64*i8x8];

  5446.                         uint8_t *nnz;

  5447.                         for(i4x4=0; i4x4<4; i4x4++){

  5448.                             if( decode_residual(h, gb, buf, i4x4+4*i8x8, scan8x8+16*i4x4,

  5449.                                                 h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 16) <0 )

  5450.                                 return -1;

  5451.                         }

  5452.                         nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];

  5453.                         nnz[0] += nnz[1] + nnz[8] + nnz[9];

  5454.                     }else{

  5455.                         for(i4x4=0; i4x4<4; i4x4++){

  5456.                             const int index= i4x4 + 4*i8x8;

  5457. 

  5458.                             if( decode_residual(h, gb, h->mb + 16*index, index, scan, h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale], 16) <0 ){

  5459.                                 return -1;

  5460.                             }

  5461.                         }

  5462.                     }

  5463.                 }else{

  5464.                     uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];

  5465.                     nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;

  5466.                 }

  5467.             }

  5468.         }

  5469. 

  5470.         if(cbp&0x30){

  5471.             for(chroma_idx=0; chroma_idx<2; chroma_idx++)

  5472.                 if( decode_residual(h, gb, h->mb + 256 + 16*4*chroma_idx, CHROMA_DC_BLOCK_INDEX, chroma_dc_scan, NULL, 4) < 0){

  5473.                     return -1;

  5474.                 }

  5475.         }

  5476. 

  5477.         if(cbp&0x20){

  5478.             for(chroma_idx=0; chroma_idx<2; chroma_idx++){

  5479.                 for(i4x4=0; i4x4<4; i4x4++){

  5480.                     const int index= 16 + 4*chroma_idx + i4x4;

  5481.                     if( decode_residual(h, gb, h->mb + 16*index, index, scan + 1, h->dequant4_coeff[chroma_idx+1+(IS_INTRA( mb_type ) ? 0:3)][chroma_qp], 15) < 0){

  5482.                         return -1;

  5483.                     }

  5484.                 }

  5485.             }

  5486.         }else{

  5487.             uint8_t * const nnz= &h->non_zero_count_cache[0];

  5488.             nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =

  5489.             nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;

  5490.         }

  5491.     }else{

  5492.         uint8_t * const nnz= &h->non_zero_count_cache[0];

  5493.         fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);

  5494.         nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =

  5495.         nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;

  5496.     }

  5497.     s->current_picture.qscale_table[mb_xy]= s->qscale;

  5498.     write_back_non_zero_count(h);

  5499. 

  5500.     if(MB_MBAFF){

  5501.         h->ref_count[0] >>= 1;

  5502.         h->ref_count[1] >>= 1;

  5503.     }

  5504. 

  5505.     return 0;

  5506. }

  5507. 

  5508. static int decode_cabac_field_decoding_flag(H264Context *h) {

  5509.     MpegEncContext * const s = &h->s;

  5510.     const int mb_x = s->mb_x;

  5511.     const int mb_y = s->mb_y & ~1;

  5512.     const int mba_xy = mb_x - 1 +  mb_y   *s->mb_stride;

  5513.     const int mbb_xy = mb_x     + (mb_y-2)*s->mb_stride;

  5514. 

  5515.     unsigned int ctx = 0;

  5516. 

  5517.     if( h->slice_table[mba_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) ) {

  5518.         ctx += 1;

  5519.     }

  5520.     if( h->slice_table[mbb_xy] == h->slice_num && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) ) {

  5521.         ctx += 1;

  5522.     }

  5523. 

  5524.     return get_cabac_noinline( &h->cabac, &h->cabac_state[70 + ctx] );

  5525. }

  5526. 

  5527. static int decode_cabac_intra_mb_type(H264Context *h, int ctx_base, int intra_slice) {

  5528.     uint8_t *state= &h->cabac_state[ctx_base];

  5529.     int mb_type;

  5530. 

  5531.     if(intra_slice){

  5532.         MpegEncContext * const s = &h->s;

  5533.         const int mba_xy = h->left_mb_xy[0];

  5534.         const int mbb_xy = h->top_mb_xy;

  5535.         int ctx=0;

  5536.         if( h->slice_table[mba_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mba_xy] ) )

  5537.             ctx++;

  5538.         if( h->slice_table[mbb_xy] == h->slice_num && !IS_INTRA4x4( s->current_picture.mb_type[mbb_xy] ) )

  5539.             ctx++;

  5540.         if( get_cabac_noinline( &h->cabac, &state[ctx] ) == 0 )

  5541.             return 0;   /* I4x4 */

  5542.         state += 2;

  5543.     }else{

  5544.         if( get_cabac_noinline( &h->cabac, &state[0] ) == 0 )

  5545.             return 0;   /* I4x4 */

  5546.     }

  5547. 

  5548.     if( get_cabac_terminate( &h->cabac ) )

  5549.         return 25;  /* PCM */

  5550. 

  5551.     mb_type = 1; /* I16x16 */

  5552.     mb_type += 12 * get_cabac_noinline( &h->cabac, &state[1] ); /* cbp_luma != 0 */

  5553.     if( get_cabac_noinline( &h->cabac, &state[2] ) ) /* cbp_chroma */

  5554.         mb_type += 4 + 4 * get_cabac_noinline( &h->cabac, &state[2+intra_slice] );

  5555.     mb_type += 2 * get_cabac_noinline( &h->cabac, &state[3+intra_slice] );

  5556.     mb_type += 1 * get_cabac_noinline( &h->cabac, &state[3+2*intra_slice] );

  5557.     return mb_type;

  5558. }

  5559. 

  5560. static int decode_cabac_mb_type( H264Context *h ) {

  5561.     MpegEncContext * const s = &h->s;

  5562. 

  5563.     if( h->slice_type == I_TYPE ) {

  5564.         return decode_cabac_intra_mb_type(h, 3, 1);

  5565.     } else if( h->slice_type == P_TYPE ) {

  5566.         if( get_cabac_noinline( &h->cabac, &h->cabac_state[14] ) == 0 ) {

  5567.             /* P-type */

  5568.             if( get_cabac_noinline( &h->cabac, &h->cabac_state[15] ) == 0 ) {

  5569.                 /* P_L0_D16x16, P_8x8 */

  5570.                 return 3 * get_cabac_noinline( &h->cabac, &h->cabac_state[16] );

  5571.             } else {

  5572.                 /* P_L0_D8x16, P_L0_D16x8 */

  5573.                 return 2 - get_cabac_noinline( &h->cabac, &h->cabac_state[17] );

  5574.             }

  5575.         } else {

  5576.             return decode_cabac_intra_mb_type(h, 17, 0) + 5;

  5577.         }

  5578.     } else if( h->slice_type == B_TYPE ) {

  5579.         const int mba_xy = h->left_mb_xy[0];

  5580.         const int mbb_xy = h->top_mb_xy;

  5581.         int ctx = 0;

  5582.         int bits;

  5583. 

  5584.         if( h->slice_table[mba_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mba_xy] ) )

  5585.             ctx++;

  5586.         if( h->slice_table[mbb_xy] == h->slice_num && !IS_DIRECT( s->current_picture.mb_type[mbb_xy] ) )

  5587.             ctx++;

  5588. 

  5589.         if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+ctx] ) )

  5590.             return 0; /* B_Direct_16x16 */

  5591. 

  5592.         if( !get_cabac_noinline( &h->cabac, &h->cabac_state[27+3] ) ) {

  5593.             return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ); /* B_L[01]_16x16 */

  5594.         }

  5595. 

  5596.         bits = get_cabac_noinline( &h->cabac, &h->cabac_state[27+4] ) << 3;

  5597.         bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 2;

  5598.         bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] ) << 1;

  5599.         bits|= get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );

  5600.         if( bits < 8 )

  5601.             return bits + 3; /* B_Bi_16x16 through B_L1_L0_16x8 */

  5602.         else if( bits == 13 ) {

  5603.             return decode_cabac_intra_mb_type(h, 32, 0) + 23;

  5604.         } else if( bits == 14 )

  5605.             return 11; /* B_L1_L0_8x16 */

  5606.         else if( bits == 15 )

  5607.             return 22; /* B_8x8 */

  5608. 

  5609.         bits= ( bits<<1 ) | get_cabac_noinline( &h->cabac, &h->cabac_state[27+5] );

  5610.         return bits - 4; /* B_L0_Bi_* through B_Bi_Bi_* */

  5611.     } else {

  5612.         /* TODO SI/SP frames? */

  5613.         return -1;

  5614.     }

  5615. }

  5616. 

  5617. static int decode_cabac_mb_skip( H264Context *h, int mb_x, int mb_y ) {

  5618.     MpegEncContext * const s = &h->s;

  5619.     int mba_xy, mbb_xy;

  5620.     int ctx = 0;

  5621. 

  5622.     if(FRAME_MBAFF){ //FIXME merge with the stuff in fill_caches?

  5623.         int mb_xy = mb_x + (mb_y&~1)*s->mb_stride;

  5624.         mba_xy = mb_xy - 1;

  5625.         if( (mb_y&1)

  5626.             && h->slice_table[mba_xy] == h->slice_num

  5627.             && MB_FIELD == !!IS_INTERLACED( s->current_picture.mb_type[mba_xy] ) )

  5628.             mba_xy += s->mb_stride;

  5629.         if( MB_FIELD ){

  5630.             mbb_xy = mb_xy - s->mb_stride;

  5631.             if( !(mb_y&1)

  5632.                 && h->slice_table[mbb_xy] == h->slice_num

  5633.                 && IS_INTERLACED( s->current_picture.mb_type[mbb_xy] ) )

  5634.                 mbb_xy -= s->mb_stride;

  5635.         }else

  5636.             mbb_xy = mb_x + (mb_y-1)*s->mb_stride;

  5637.     }else{

  5638.         int mb_xy = mb_x + mb_y*s->mb_stride;

  5639.         mba_xy = mb_xy - 1;

  5640.         mbb_xy = mb_xy - s->mb_stride;

  5641.     }

  5642. 

  5643.     if( h->slice_table[mba_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mba_xy] ))

  5644.         ctx++;

  5645.     if( h->slice_table[mbb_xy] == h->slice_num && !IS_SKIP( s->current_picture.mb_type[mbb_xy] ))

  5646.         ctx++;

  5647. 

  5648.     if( h->slice_type == B_TYPE )

  5649.         ctx += 13;

  5650.     return get_cabac_noinline( &h->cabac, &h->cabac_state[11+ctx] );

  5651. }

  5652. 

  5653. static int decode_cabac_mb_intra4x4_pred_mode( H264Context *h, int pred_mode ) {

  5654.     int mode = 0;

  5655. 

  5656.     if( get_cabac( &h->cabac, &h->cabac_state[68] ) )

  5657.         return pred_mode;

  5658. 

  5659.     mode += 1 * get_cabac( &h->cabac, &h->cabac_state[69] );

  5660.     mode += 2 * get_cabac( &h->cabac, &h->cabac_state[69] );

  5661.     mode += 4 * get_cabac( &h->cabac, &h->cabac_state[69] );

  5662. 

  5663.     if( mode >= pred_mode )

  5664.         return mode + 1;

  5665.     else

  5666.         return mode;

  5667. }

  5668. 

  5669. static int decode_cabac_mb_chroma_pre_mode( H264Context *h) {

  5670.     const int mba_xy = h->left_mb_xy[0];

  5671.     const int mbb_xy = h->top_mb_xy;

  5672. 

  5673.     int ctx = 0;

  5674. 

  5675.     /* No need to test for IS_INTRA4x4 and IS_INTRA16x16, as we set chroma_pred_mode_table to 0 */

  5676.     if( h->slice_table[mba_xy] == h->slice_num && h->chroma_pred_mode_table[mba_xy] != 0 )

  5677.         ctx++;

  5678. 

  5679.     if( h->slice_table[mbb_xy] == h->slice_num && h->chroma_pred_mode_table[mbb_xy] != 0 )

  5680.         ctx++;

  5681. 

  5682.     if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+ctx] ) == 0 )

  5683.         return 0;

  5684. 

  5685.     if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )

  5686.         return 1;

  5687.     if( get_cabac_noinline( &h->cabac, &h->cabac_state[64+3] ) == 0 )

  5688.         return 2;

  5689.     else

  5690.         return 3;

  5691. }

  5692. 

  5693. static const uint8_t block_idx_x[16] = {

  5694.     0, 1, 0, 1, 2, 3, 2, 3, 0, 1, 0, 1, 2, 3, 2, 3

  5695. };

  5696. static const uint8_t block_idx_y[16] = {

  5697.     0, 0, 1, 1, 0, 0, 1, 1, 2, 2, 3, 3, 2, 2, 3, 3

  5698. };

  5699. static const uint8_t block_idx_xy[4][4] = {

  5700.     { 0, 2, 8,  10},

  5701.     { 1, 3, 9,  11},

  5702.     { 4, 6, 12, 14},

  5703.     { 5, 7, 13, 15}

  5704. };

  5705. 

  5706. static int decode_cabac_mb_cbp_luma( H264Context *h) {

  5707.     int cbp = 0;

  5708.     int cbp_b = -1;

  5709.     int i8x8;

  5710. 

  5711.     if( h->slice_table[h->top_mb_xy] == h->slice_num ) {

  5712.         cbp_b = h->top_cbp;

  5713.         tprintf("cbp_b = top_cbp = %x\n", cbp_b);

  5714.     }

  5715. 

  5716.     for( i8x8 = 0; i8x8 < 4; i8x8++ ) {

  5717.         int cbp_a = -1;

  5718.         int x, y;

  5719.         int ctx = 0;

  5720. 

  5721.         x = block_idx_x[4*i8x8];

  5722.         y = block_idx_y[4*i8x8];

  5723. 

  5724.         if( x > 0 )

  5725.             cbp_a = cbp;

  5726.         else if( h->slice_table[h->left_mb_xy[0]] == h->slice_num ) {

  5727.             cbp_a = h->left_cbp;

  5728.             tprintf("cbp_a = left_cbp = %x\n", cbp_a);

  5729.         }

  5730. 

  5731.         if( y > 0 )

  5732.             cbp_b = cbp;

  5733. 

  5734.         /* No need to test for skip as we put 0 for skip block */

  5735.         /* No need to test for IPCM as we put 1 for IPCM block */

  5736.         if( cbp_a >= 0 ) {

  5737.             int i8x8a = block_idx_xy[(x-1)&0x03][y]/4;

  5738.             if( ((cbp_a >> i8x8a)&0x01) == 0 )

  5739.                 ctx++;

  5740.         }

  5741. 

  5742.         if( cbp_b >= 0 ) {

  5743.             int i8x8b = block_idx_xy[x][(y-1)&0x03]/4;

  5744.             if( ((cbp_b >> i8x8b)&0x01) == 0 )

  5745.                 ctx += 2;

  5746.         }

  5747. 

  5748.         if( get_cabac( &h->cabac, &h->cabac_state[73 + ctx] ) ) {

  5749.             cbp |= 1 << i8x8;

  5750.         }

  5751.     }

  5752.     return cbp;

  5753. }

  5754. static int decode_cabac_mb_cbp_chroma( H264Context *h) {

  5755.     int ctx;

  5756.     int cbp_a, cbp_b;

  5757. 

  5758.     cbp_a = (h->left_cbp>>4)&0x03;

  5759.     cbp_b = (h-> top_cbp>>4)&0x03;

  5760. 

  5761.     ctx = 0;

  5762.     if( cbp_a > 0 ) ctx++;

  5763.     if( cbp_b > 0 ) ctx += 2;

  5764.     if( get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] ) == 0 )

  5765.         return 0;

  5766. 

  5767.     ctx = 4;

  5768.     if( cbp_a == 2 ) ctx++;

  5769.     if( cbp_b == 2 ) ctx += 2;

  5770.     return 1 + get_cabac_noinline( &h->cabac, &h->cabac_state[77 + ctx] );

  5771. }

  5772. static int decode_cabac_mb_dqp( H264Context *h) {

  5773.     MpegEncContext * const s = &h->s;

  5774.     int mbn_xy;

  5775.     int   ctx = 0;

  5776.     int   val = 0;

  5777. 

  5778.     if( s->mb_x > 0 )

  5779.         mbn_xy = s->mb_x + s->mb_y*s->mb_stride - 1;

  5780.     else

  5781.         mbn_xy = s->mb_width - 1 + (s->mb_y-1)*s->mb_stride;

  5782. 

  5783.     if( h->last_qscale_diff != 0 )

  5784.         ctx++;

  5785. 

  5786.     while( get_cabac_noinline( &h->cabac, &h->cabac_state[60 + ctx] ) ) {

  5787.         if( ctx < 2 )

  5788.             ctx = 2;

  5789.         else

  5790.             ctx = 3;

  5791.         val++;

  5792.         if(val > 102) //prevent infinite loop

  5793.             return INT_MIN;

  5794.     }

  5795. 

  5796.     if( val&0x01 )

  5797.         return (val + 1)/2;

  5798.     else

  5799.         return -(val + 1)/2;

  5800. }

  5801. static int decode_cabac_p_mb_sub_type( H264Context *h ) {

  5802.     if( get_cabac( &h->cabac, &h->cabac_state[21] ) )

  5803.         return 0;   /* 8x8 */

  5804.     if( !get_cabac( &h->cabac, &h->cabac_state[22] ) )

  5805.         return 1;   /* 8x4 */

  5806.     if( get_cabac( &h->cabac, &h->cabac_state[23] ) )

  5807.         return 2;   /* 4x8 */

  5808.     return 3;       /* 4x4 */

  5809. }

  5810. static int decode_cabac_b_mb_sub_type( H264Context *h ) {

  5811.     int type;

  5812.     if( !get_cabac( &h->cabac, &h->cabac_state[36] ) )

  5813.         return 0;   /* B_Direct_8x8 */

  5814.     if( !get_cabac( &h->cabac, &h->cabac_state[37] ) )

  5815.         return 1 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L0_8x8, B_L1_8x8 */

  5816.     type = 3;

  5817.     if( get_cabac( &h->cabac, &h->cabac_state[38] ) ) {

  5818.         if( get_cabac( &h->cabac, &h->cabac_state[39] ) )

  5819.             return 11 + get_cabac( &h->cabac, &h->cabac_state[39] ); /* B_L1_4x4, B_Bi_4x4 */

  5820.         type += 4;

  5821.     }

  5822.     type += 2*get_cabac( &h->cabac, &h->cabac_state[39] );

  5823.     type +=   get_cabac( &h->cabac, &h->cabac_state[39] );

  5824.     return type;

  5825. }

  5826. 

  5827. static inline int decode_cabac_mb_transform_size( H264Context *h ) {

  5828.     return get_cabac_noinline( &h->cabac, &h->cabac_state[399 + h->neighbor_transform_size] );

  5829. }

  5830. 

  5831. static int decode_cabac_mb_ref( H264Context *h, int list, int n ) {

  5832.     int refa = h->ref_cache[list][scan8[n] - 1];

  5833.     int refb = h->ref_cache[list][scan8[n] - 8];

  5834.     int ref  = 0;

  5835.     int ctx  = 0;

  5836. 

  5837.     if( h->slice_type == B_TYPE) {

  5838.         if( refa > 0 && !h->direct_cache[scan8[n] - 1] )

  5839.             ctx++;

  5840.         if( refb > 0 && !h->direct_cache[scan8[n] - 8] )

  5841.             ctx += 2;

  5842.     } else {

  5843.         if( refa > 0 )

  5844.             ctx++;

  5845.         if( refb > 0 )

  5846.             ctx += 2;

  5847.     }

  5848. 

  5849.     while( get_cabac( &h->cabac, &h->cabac_state[54+ctx] ) ) {

  5850.         ref++;

  5851.         if( ctx < 4 )

  5852.             ctx = 4;

  5853.         else

  5854.             ctx = 5;

  5855.     }

  5856.     return ref;

  5857. }

  5858. 

  5859. static int decode_cabac_mb_mvd( H264Context *h, int list, int n, int l ) {

  5860.     int amvd = abs( h->mvd_cache[list][scan8[n] - 1][l] ) +

  5861.                abs( h->mvd_cache[list][scan8[n] - 8][l] );

  5862.     int ctxbase = (l == 0) ? 40 : 47;

  5863.     int ctx, mvd;

  5864. 

  5865.     if( amvd < 3 )

  5866.         ctx = 0;

  5867.     else if( amvd > 32 )

  5868.         ctx = 2;

  5869.     else

  5870.         ctx = 1;

  5871. 

  5872.     if(!get_cabac(&h->cabac, &h->cabac_state[ctxbase+ctx]))

  5873.         return 0;

  5874. 

  5875.     mvd= 1;

  5876.     ctx= 3;

  5877.     while( mvd < 9 && get_cabac( &h->cabac, &h->cabac_state[ctxbase+ctx] ) ) {

  5878.         mvd++;

  5879.         if( ctx < 6 )

  5880.             ctx++;

  5881.     }

  5882. 

  5883.     if( mvd >= 9 ) {

  5884.         int k = 3;

  5885.         while( get_cabac_bypass( &h->cabac ) ) {

  5886.             mvd += 1 << k;

  5887.             k++;

  5888.         }

  5889.         while( k-- ) {

  5890.             if( get_cabac_bypass( &h->cabac ) )

  5891.                 mvd += 1 << k;

  5892.         }

  5893.     }

  5894.     return get_cabac_bypass_sign( &h->cabac, -mvd );

  5895. }

  5896. 

  5897. static int inline get_cabac_cbf_ctx( H264Context *h, int cat, int idx ) {

  5898.     int nza, nzb;

  5899.     int ctx = 0;

  5900. 

  5901.     if( cat == 0 ) {

  5902.         nza = h->left_cbp&0x100;

  5903.         nzb = h-> top_cbp&0x100;

  5904.     } else if( cat == 1 || cat == 2 ) {

  5905.         nza = h->non_zero_count_cache[scan8[idx] - 1];

  5906.         nzb = h->non_zero_count_cache[scan8[idx] - 8];

  5907.     } else if( cat == 3 ) {

  5908.         nza = (h->left_cbp>>(6+idx))&0x01;

  5909.         nzb = (h-> top_cbp>>(6+idx))&0x01;

  5910.     } else {

  5911.         assert(cat == 4);

  5912.         nza = h->non_zero_count_cache[scan8[16+idx] - 1];

  5913.         nzb = h->non_zero_count_cache[scan8[16+idx] - 8];

  5914.     }

  5915. 

  5916.     if( nza > 0 )

  5917.         ctx++;

  5918. 

  5919.     if( nzb > 0 )

  5920.         ctx += 2;

  5921. 

  5922.     return ctx + 4 * cat;

  5923. }

  5924. 

  5925. static const __attribute((used)) uint8_t last_coeff_flag_offset_8x8[63] = {

  5926.     0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,

  5927.     2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,

  5928.     3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4,

  5929.     5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8

  5930. };

  5931. 

  5932. static int decode_cabac_residual( H264Context *h, DCTELEM *block, int cat, int n, const uint8_t *scantable, const uint32_t *qmul, int max_coeff) {

  5933.     const int mb_xy  = h->s.mb_x + h->s.mb_y*h->s.mb_stride;

  5934.     static const int significant_coeff_flag_offset[2][6] = {

  5935.       { 105+0, 105+15, 105+29, 105+44, 105+47, 402 },

  5936.       { 277+0, 277+15, 277+29, 277+44, 277+47, 436 }

  5937.     };

  5938.     static const int last_coeff_flag_offset[2][6] = {

  5939.       { 166+0, 166+15, 166+29, 166+44, 166+47, 417 },

  5940.       { 338+0, 338+15, 338+29, 338+44, 338+47, 451 }

  5941.     };

  5942.     static const int coeff_abs_level_m1_offset[6] = {

  5943.         227+0, 227+10, 227+20, 227+30, 227+39, 426

  5944.     };

  5945.     static const uint8_t significant_coeff_flag_offset_8x8[2][63] = {

  5946.       { 0, 1, 2, 3, 4, 5, 5, 4, 4, 3, 3, 4, 4, 4, 5, 5,

  5947.         4, 4, 4, 4, 3, 3, 6, 7, 7, 7, 8, 9,10, 9, 8, 7,

  5948.         7, 6,11,12,13,11, 6, 7, 8, 9,14,10, 9, 8, 6,11,

  5949.        12,13,11, 6, 9,14,10, 9,11,12,13,11,14,10,12 },

  5950.       { 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 7, 7, 7, 8, 4, 5,

  5951.         6, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,11,12,11,

  5952.         9, 9,10,10, 8,11,12,11, 9, 9,10,10, 8,13,13, 9,

  5953.         9,10,10, 8,13,13, 9, 9,10,10,14,14,14,14,14 }

  5954.     };

  5955. 

  5956.     int index[64];

  5957. 

  5958.     int last;

  5959.     int coeff_count = 0;

  5960. 

  5961.     int abslevel1 = 1;

  5962.     int abslevelgt1 = 0;

  5963. 

  5964.     uint8_t *significant_coeff_ctx_base;

  5965.     uint8_t *last_coeff_ctx_base;

  5966.     uint8_t *abs_level_m1_ctx_base;

  5967. 

  5968. #ifndef ARCH_X86

  5969. #define CABAC_ON_STACK

  5970. #endif

  5971. #ifdef CABAC_ON_STACK

  5972. #define CC &cc

  5973.     CABACContext cc;

  5974.     cc.range     = h->cabac.range;

  5975.     cc.low       = h->cabac.low;

  5976.     cc.bytestream= h->cabac.bytestream;

  5977. #else

  5978. #define CC &h->cabac

  5979. #endif

  5980. 

  5981. 

  5982.     /* cat: 0-> DC 16x16  n = 0

  5983.      *      1-> AC 16x16  n = luma4x4idx

  5984.      *      2-> Luma4x4   n = luma4x4idx

  5985.      *      3-> DC Chroma n = iCbCr

  5986.      *      4-> AC Chroma n = 4 * iCbCr + chroma4x4idx

  5987.      *      5-> Luma8x8   n = 4 * luma8x8idx

  5988.      */

  5989. 

  5990.     /* read coded block flag */

  5991.     if( cat != 5 ) {

  5992.         if( get_cabac( CC, &h->cabac_state[85 + get_cabac_cbf_ctx( h, cat, n ) ] ) == 0 ) {

  5993.             if( cat == 1 || cat == 2 )

  5994.                 h->non_zero_count_cache[scan8[n]] = 0;

  5995.             else if( cat == 4 )

  5996.                 h->non_zero_count_cache[scan8[16+n]] = 0;

  5997. #ifdef CABAC_ON_STACK

  5998.             h->cabac.range     = cc.range     ;

  5999.             h->cabac.low       = cc.low       ;

  6000.             h->cabac.bytestream= cc.bytestream;

  6001. #endif

  6002.             return 0;

  6003.         }

  6004.     }

  6005. 

  6006.     significant_coeff_ctx_base = h->cabac_state

  6007.         + significant_coeff_flag_offset[MB_FIELD][cat];

  6008.     last_coeff_ctx_base = h->cabac_state

  6009.         + last_coeff_flag_offset[MB_FIELD][cat];

  6010.     abs_level_m1_ctx_base = h->cabac_state

  6011.         + coeff_abs_level_m1_offset[cat];

  6012. 

  6013.     if( cat == 5 ) {

  6014. #define DECODE_SIGNIFICANCE( coefs, sig_off, last_off ) \

  6015.         for(last= 0; last < coefs; last++) { \

  6016.             uint8_t *sig_ctx = significant_coeff_ctx_base + sig_off; \

  6017.             if( get_cabac( CC, sig_ctx )) { \

  6018.                 uint8_t *last_ctx = last_coeff_ctx_base + last_off; \

  6019.                 index[coeff_count++] = last; \

  6020.                 if( get_cabac( CC, last_ctx ) ) { \

  6021.                     last= max_coeff; \

  6022.                     break; \

  6023.                 } \

  6024.             } \

  6025.         }\

  6026.         if( last == max_coeff -1 ) {\

  6027.             index[coeff_count++] = last;\

  6028.         }

  6029.         const uint8_t *sig_off = significant_coeff_flag_offset_8x8[MB_FIELD];

  6030. #if defined(ARCH_X86) && !(defined(PIC) && defined(__GNUC__))

  6031.         coeff_count= decode_significance_8x8_x86(CC, significant_coeff_ctx_base, index, sig_off);

  6032.     } else {

  6033.         coeff_count= decode_significance_x86(CC, max_coeff, significant_coeff_ctx_base, index);

  6034. #else

  6035.         DECODE_SIGNIFICANCE( 63, sig_off[last], last_coeff_flag_offset_8x8[last] );

  6036.     } else {

  6037.         DECODE_SIGNIFICANCE( max_coeff - 1, last, last );

  6038. #endif

  6039.     }

  6040.     assert(coeff_count > 0);

  6041. 

  6042.     if( cat == 0 )

  6043.         h->cbp_table[mb_xy] |= 0x100;

  6044.     else if( cat == 1 || cat == 2 )

  6045.         h->non_zero_count_cache[scan8[n]] = coeff_count;

  6046.     else if( cat == 3 )

  6047.         h->cbp_table[mb_xy] |= 0x40 << n;

  6048.     else if( cat == 4 )

  6049.         h->non_zero_count_cache[scan8[16+n]] = coeff_count;

  6050.     else {

  6051.         assert( cat == 5 );

  6052.         fill_rectangle(&h->non_zero_count_cache[scan8[n]], 2, 2, 8, coeff_count, 1);

  6053.     }

  6054. 

  6055.     for( coeff_count--; coeff_count >= 0; coeff_count-- ) {

  6056.         uint8_t *ctx = (abslevelgt1 != 0 ? 0 : FFMIN( 4, abslevel1 )) + abs_level_m1_ctx_base;

  6057.         int j= scantable[index[coeff_count]];

  6058. 

  6059.         if( get_cabac( CC, ctx ) == 0 ) {

  6060.             if( !qmul ) {

  6061.                 block[j] = get_cabac_bypass_sign( CC, -1);

  6062.             }else{

  6063.                 block[j] = (get_cabac_bypass_sign( CC, -qmul[j]) + 32) >> 6;;

  6064.             }

  6065. 

  6066.             abslevel1++;

  6067.         } else {

  6068.             int coeff_abs = 2;

  6069.             ctx = 5 + FFMIN( 4, abslevelgt1 ) + abs_level_m1_ctx_base;

  6070.             while( coeff_abs < 15 && get_cabac( CC, ctx ) ) {

  6071.                 coeff_abs++;

  6072.             }

  6073. 

  6074.             if( coeff_abs >= 15 ) {

  6075.                 int j = 0;

  6076.                 while( get_cabac_bypass( CC ) ) {

  6077.                     j++;

  6078.                 }

  6079. 

  6080.                 coeff_abs=1;

  6081.                 while( j-- ) {

  6082.                     coeff_abs += coeff_abs + get_cabac_bypass( CC );

  6083.                 }

  6084.                 coeff_abs+= 14;

  6085.             }

  6086. 

  6087.             if( !qmul ) {

  6088.                 if( get_cabac_bypass( CC ) ) block[j] = -coeff_abs;

  6089.                 else                                block[j] =  coeff_abs;

  6090.             }else{

  6091.                 if( get_cabac_bypass( CC ) ) block[j] = (-coeff_abs * qmul[j] + 32) >> 6;

  6092.                 else                                block[j] = ( coeff_abs * qmul[j] + 32) >> 6;

  6093.             }

  6094. 

  6095.             abslevelgt1++;

  6096.         }

  6097.     }

  6098. #ifdef CABAC_ON_STACK

  6099.             h->cabac.range     = cc.range     ;

  6100.             h->cabac.low       = cc.low       ;

  6101.             h->cabac.bytestream= cc.bytestream;

  6102. #endif

  6103.     return 0;

  6104. }

  6105. 

  6106. static void inline compute_mb_neighbors(H264Context *h)

  6107. {

  6108.     MpegEncContext * const s = &h->s;

  6109.     const int mb_xy  = s->mb_x + s->mb_y*s->mb_stride;

  6110.     h->top_mb_xy     = mb_xy - s->mb_stride;

  6111.     h->left_mb_xy[0] = mb_xy - 1;

  6112.     if(FRAME_MBAFF){

  6113.         const int pair_xy          = s->mb_x     + (s->mb_y & ~1)*s->mb_stride;

  6114.         const int top_pair_xy      = pair_xy     - s->mb_stride;

  6115.         const int top_mb_frame_flag      = !IS_INTERLACED(s->current_picture.mb_type[top_pair_xy]);

  6116.         const int left_mb_frame_flag = !IS_INTERLACED(s->current_picture.mb_type[pair_xy-1]);

  6117.         const int curr_mb_frame_flag = !MB_FIELD;

  6118.         const int bottom = (s->mb_y & 1);

  6119.         if (bottom

  6120.                 ? !curr_mb_frame_flag // bottom macroblock

  6121.                 : (!curr_mb_frame_flag && !top_mb_frame_flag) // top macroblock

  6122.                 ) {

  6123.             h->top_mb_xy -= s->mb_stride;

  6124.         }

  6125.         if (left_mb_frame_flag != curr_mb_frame_flag) {

  6126.             h->left_mb_xy[0] = pair_xy - 1;

  6127.         }

  6128.     }

  6129.     return;

  6130. }

  6131. 

  6132. /**

  6133.  * decodes a macroblock

  6134.  * @returns 0 if ok, AC_ERROR / DC_ERROR / MV_ERROR if an error is noticed

  6135.  */

  6136. static int decode_mb_cabac(H264Context *h) {

  6137.     MpegEncContext * const s = &h->s;

  6138.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  6139.     int mb_type, partition_count, cbp = 0;

  6140.     int dct8x8_allowed= h->pps.transform_8x8_mode;

  6141. 

  6142.     s->dsp.clear_blocks(h->mb); //FIXME avoid if already clear (move after skip handlong?)

  6143. 

  6144.     tprintf("pic:%d mb:%d/%d\n", h->frame_num, s->mb_x, s->mb_y);

  6145.     if( h->slice_type != I_TYPE && h->slice_type != SI_TYPE ) {

  6146.         int skip;

  6147.         /* a skipped mb needs the aff flag from the following mb */

  6148.         if( FRAME_MBAFF && s->mb_x==0 && (s->mb_y&1)==0 )

  6149.             predict_field_decoding_flag(h);

  6150.         if( FRAME_MBAFF && (s->mb_y&1)==1 && h->prev_mb_skipped )

  6151.             skip = h->next_mb_skipped;

  6152.         else

  6153.             skip = decode_cabac_mb_skip( h, s->mb_x, s->mb_y );

  6154.         /* read skip flags */

  6155.         if( skip ) {

  6156.             if( FRAME_MBAFF && (s->mb_y&1)==0 ){

  6157.                 s->current_picture.mb_type[mb_xy] = MB_TYPE_SKIP;

  6158.                 h->next_mb_skipped = decode_cabac_mb_skip( h, s->mb_x, s->mb_y+1 );

  6159.                 if(h->next_mb_skipped)

  6160.                     predict_field_decoding_flag(h);

  6161.                 else

  6162.                     h->mb_mbaff = h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);

  6163.             }

  6164. 

  6165.             decode_mb_skip(h);

  6166. 

  6167.             h->cbp_table[mb_xy] = 0;

  6168.             h->chroma_pred_mode_table[mb_xy] = 0;

  6169.             h->last_qscale_diff = 0;

  6170. 

  6171.             return 0;

  6172. 

  6173.         }

  6174.     }

  6175.     if(FRAME_MBAFF){

  6176.         if( (s->mb_y&1) == 0 )

  6177.             h->mb_mbaff =

  6178.             h->mb_field_decoding_flag = decode_cabac_field_decoding_flag(h);

  6179.     }else

  6180.         h->mb_field_decoding_flag= (s->picture_structure!=PICT_FRAME);

  6181. 

  6182.     h->prev_mb_skipped = 0;

  6183. 

  6184.     compute_mb_neighbors(h);

  6185.     if( ( mb_type = decode_cabac_mb_type( h ) ) < 0 ) {

  6186.         av_log( h->s.avctx, AV_LOG_ERROR, "decode_cabac_mb_type failed\n" );

  6187.         return -1;

  6188.     }

  6189. 

  6190.     if( h->slice_type == B_TYPE ) {

  6191.         if( mb_type < 23 ){

  6192.             partition_count= b_mb_type_info[mb_type].partition_count;

  6193.             mb_type=         b_mb_type_info[mb_type].type;

  6194.         }else{

  6195.             mb_type -= 23;

  6196.             goto decode_intra_mb;

  6197.         }

  6198.     } else if( h->slice_type == P_TYPE ) {

  6199.         if( mb_type < 5) {

  6200.             partition_count= p_mb_type_info[mb_type].partition_count;

  6201.             mb_type=         p_mb_type_info[mb_type].type;

  6202.         } else {

  6203.             mb_type -= 5;

  6204.             goto decode_intra_mb;

  6205.         }

  6206.     } else {

  6207.        assert(h->slice_type == I_TYPE);

  6208. decode_intra_mb:

  6209.         partition_count = 0;

  6210.         cbp= i_mb_type_info[mb_type].cbp;

  6211.         h->intra16x16_pred_mode= i_mb_type_info[mb_type].pred_mode;

  6212.         mb_type= i_mb_type_info[mb_type].type;

  6213.     }

  6214.     if(MB_FIELD)

  6215.         mb_type |= MB_TYPE_INTERLACED;

  6216. 

  6217.     h->slice_table[ mb_xy ]= h->slice_num;

  6218. 

  6219.     if(IS_INTRA_PCM(mb_type)) {

  6220.         const uint8_t *ptr;

  6221.         unsigned int x, y;

  6222. 

  6223.         // We assume these blocks are very rare so we dont optimize it.

  6224.         // FIXME The two following lines get the bitstream position in the cabac

  6225.         // decode, I think it should be done by a function in cabac.h (or cabac.c).

  6226.         ptr= h->cabac.bytestream;

  6227.         if(h->cabac.low&0x1) ptr--;

  6228.         if(CABAC_BITS==16){

  6229.             if(h->cabac.low&0x1FF) ptr--;

  6230.         }

  6231. 

  6232.         // The pixels are stored in the same order as levels in h->mb array.

  6233.         for(y=0; y<16; y++){

  6234.             const int index= 4*(y&3) + 32*((y>>2)&1) + 128*(y>>3);

  6235.             for(x=0; x<16; x++){

  6236.                 tprintf("LUMA ICPM LEVEL (%3d)\n", *ptr);

  6237.                 h->mb[index + (x&3) + 16*((x>>2)&1) + 64*(x>>3)]= *ptr++;

  6238.             }

  6239.         }

  6240.         for(y=0; y<8; y++){

  6241.             const int index= 256 + 4*(y&3) + 32*(y>>2);

  6242.             for(x=0; x<8; x++){

  6243.                 tprintf("CHROMA U ICPM LEVEL (%3d)\n", *ptr);

  6244.                 h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;

  6245.             }

  6246.         }

  6247.         for(y=0; y<8; y++){

  6248.             const int index= 256 + 64 + 4*(y&3) + 32*(y>>2);

  6249.             for(x=0; x<8; x++){

  6250.                 tprintf("CHROMA V ICPM LEVEL (%3d)\n", *ptr);

  6251.                 h->mb[index + (x&3) + 16*(x>>2)]= *ptr++;

  6252.             }

  6253.         }

  6254. 

  6255.         ff_init_cabac_decoder(&h->cabac, ptr, h->cabac.bytestream_end - ptr);

  6256. 

  6257.         // All blocks are present

  6258.         h->cbp_table[mb_xy] = 0x1ef;

  6259.         h->chroma_pred_mode_table[mb_xy] = 0;

  6260.         // In deblocking, the quantizer is 0

  6261.         s->current_picture.qscale_table[mb_xy]= 0;

  6262.         h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, 0);

  6263.         // All coeffs are present

  6264.         memset(h->non_zero_count[mb_xy], 16, 16);

  6265.         s->current_picture.mb_type[mb_xy]= mb_type;

  6266.         return 0;

  6267.     }

  6268. 

  6269.     if(MB_MBAFF){

  6270.         h->ref_count[0] <<= 1;

  6271.         h->ref_count[1] <<= 1;

  6272.     }

  6273. 

  6274.     fill_caches(h, mb_type, 0);

  6275. 

  6276.     if( IS_INTRA( mb_type ) ) {

  6277.         int i;

  6278.         if( IS_INTRA4x4( mb_type ) ) {

  6279.             if( dct8x8_allowed && decode_cabac_mb_transform_size( h ) ) {

  6280.                 mb_type |= MB_TYPE_8x8DCT;

  6281.                 for( i = 0; i < 16; i+=4 ) {

  6282.                     int pred = pred_intra_mode( h, i );

  6283.                     int mode = decode_cabac_mb_intra4x4_pred_mode( h, pred );

  6284.                     fill_rectangle( &h->intra4x4_pred_mode_cache[ scan8[i] ], 2, 2, 8, mode, 1 );

  6285.                 }

  6286.             } else {

  6287.                 for( i = 0; i < 16; i++ ) {

  6288.                     int pred = pred_intra_mode( h, i );

  6289.                     h->intra4x4_pred_mode_cache[ scan8[i] ] = decode_cabac_mb_intra4x4_pred_mode( h, pred );

  6290. 

  6291.                 //av_log( s->avctx, AV_LOG_ERROR, "i4x4 pred=%d mode=%d\n", pred, h->intra4x4_pred_mode_cache[ scan8[i] ] );

  6292.                 }

  6293.             }

  6294.             write_back_intra_pred_mode(h);

  6295.             if( check_intra4x4_pred_mode(h) < 0 ) return -1;

  6296.         } else {

  6297.             h->intra16x16_pred_mode= check_intra_pred_mode( h, h->intra16x16_pred_mode );

  6298.             if( h->intra16x16_pred_mode < 0 ) return -1;

  6299.         }

  6300.         h->chroma_pred_mode_table[mb_xy] =

  6301.             h->chroma_pred_mode          = decode_cabac_mb_chroma_pre_mode( h );

  6302. 

  6303.         h->chroma_pred_mode= check_intra_pred_mode( h, h->chroma_pred_mode );

  6304.         if( h->chroma_pred_mode < 0 ) return -1;

  6305.     } else if( partition_count == 4 ) {

  6306.         int i, j, sub_partition_count[4], list, ref[2][4];

  6307. 

  6308.         if( h->slice_type == B_TYPE ) {

  6309.             for( i = 0; i < 4; i++ ) {

  6310.                 h->sub_mb_type[i] = decode_cabac_b_mb_sub_type( h );

  6311.                 sub_partition_count[i]= b_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;

  6312.                 h->sub_mb_type[i]=      b_sub_mb_type_info[ h->sub_mb_type[i] ].type;

  6313.             }

  6314.             if( IS_DIRECT(h->sub_mb_type[0] | h->sub_mb_type[1] |

  6315.                           h->sub_mb_type[2] | h->sub_mb_type[3]) ) {

  6316.                 pred_direct_motion(h, &mb_type);

  6317.                 if( h->ref_count[0] > 1 || h->ref_count[1] > 1 ) {

  6318.                     for( i = 0; i < 4; i++ )

  6319.                         if( IS_DIRECT(h->sub_mb_type[i]) )

  6320.                             fill_rectangle( &h->direct_cache[scan8[4*i]], 2, 2, 8, 1, 1 );

  6321.                 }

  6322.             }

  6323.         } else {

  6324.             for( i = 0; i < 4; i++ ) {

  6325.                 h->sub_mb_type[i] = decode_cabac_p_mb_sub_type( h );

  6326.                 sub_partition_count[i]= p_sub_mb_type_info[ h->sub_mb_type[i] ].partition_count;

  6327.                 h->sub_mb_type[i]=      p_sub_mb_type_info[ h->sub_mb_type[i] ].type;

  6328.             }

  6329.         }

  6330. 

  6331.         for( list = 0; list < 2; list++ ) {

  6332.             if( h->ref_count[list] > 0 ) {

  6333.                 for( i = 0; i < 4; i++ ) {

  6334.                     if(IS_DIRECT(h->sub_mb_type[i])) continue;

  6335.                     if(IS_DIR(h->sub_mb_type[i], 0, list)){

  6336.                         if( h->ref_count[list] > 1 )

  6337.                             ref[list][i] = decode_cabac_mb_ref( h, list, 4*i );

  6338.                         else

  6339.                             ref[list][i] = 0;

  6340.                     } else {

  6341.                         ref[list][i] = -1;

  6342.                     }

  6343.                                                        h->ref_cache[list][ scan8[4*i]+1 ]=

  6344.                     h->ref_cache[list][ scan8[4*i]+8 ]=h->ref_cache[list][ scan8[4*i]+9 ]= ref[list][i];

  6345.                 }

  6346.             }

  6347.         }

  6348. 

  6349.         if(dct8x8_allowed)

  6350.             dct8x8_allowed = get_dct8x8_allowed(h);

  6351. 

  6352.         for(list=0; list<2; list++){

  6353.             for(i=0; i<4; i++){

  6354.                 if(IS_DIRECT(h->sub_mb_type[i])){

  6355.                     fill_rectangle(h->mvd_cache[list][scan8[4*i]], 2, 2, 8, 0, 4);

  6356.                     continue;

  6357.                 }

  6358.                 h->ref_cache[list][ scan8[4*i]   ]=h->ref_cache[list][ scan8[4*i]+1 ];

  6359. 

  6360.                 if(IS_DIR(h->sub_mb_type[i], 0, list) && !IS_DIRECT(h->sub_mb_type[i])){

  6361.                     const int sub_mb_type= h->sub_mb_type[i];

  6362.                     const int block_width= (sub_mb_type & (MB_TYPE_16x16|MB_TYPE_16x8)) ? 2 : 1;

  6363.                     for(j=0; j<sub_partition_count[i]; j++){

  6364.                         int mpx, mpy;

  6365.                         int mx, my;

  6366.                         const int index= 4*i + block_width*j;

  6367.                         int16_t (* mv_cache)[2]= &h->mv_cache[list][ scan8[index] ];

  6368.                         int16_t (* mvd_cache)[2]= &h->mvd_cache[list][ scan8[index] ];

  6369.                         pred_motion(h, index, block_width, list, h->ref_cache[list][ scan8[index] ], &mpx, &mpy);

  6370. 

  6371.                         mx = mpx + decode_cabac_mb_mvd( h, list, index, 0 );

  6372.                         my = mpy + decode_cabac_mb_mvd( h, list, index, 1 );

  6373.                         tprintf("final mv:%d %d\n", mx, my);

  6374. 

  6375.                         if(IS_SUB_8X8(sub_mb_type)){

  6376.                             mv_cache[ 0 ][0]= mv_cache[ 1 ][0]=

  6377.                             mv_cache[ 8 ][0]= mv_cache[ 9 ][0]= mx;

  6378.                             mv_cache[ 0 ][1]= mv_cache[ 1 ][1]=

  6379.                             mv_cache[ 8 ][1]= mv_cache[ 9 ][1]= my;

  6380. 

  6381.                             mvd_cache[ 0 ][0]= mvd_cache[ 1 ][0]=

  6382.                             mvd_cache[ 8 ][0]= mvd_cache[ 9 ][0]= mx - mpx;

  6383.                             mvd_cache[ 0 ][1]= mvd_cache[ 1 ][1]=

  6384.                             mvd_cache[ 8 ][1]= mvd_cache[ 9 ][1]= my - mpy;

  6385.                         }else if(IS_SUB_8X4(sub_mb_type)){

  6386.                             mv_cache[ 0 ][0]= mv_cache[ 1 ][0]= mx;

  6387.                             mv_cache[ 0 ][1]= mv_cache[ 1 ][1]= my;

  6388. 

  6389.                             mvd_cache[ 0 ][0]= mvd_cache[ 1 ][0]= mx- mpx;

  6390.                             mvd_cache[ 0 ][1]= mvd_cache[ 1 ][1]= my - mpy;

  6391.                         }else if(IS_SUB_4X8(sub_mb_type)){

  6392.                             mv_cache[ 0 ][0]= mv_cache[ 8 ][0]= mx;

  6393.                             mv_cache[ 0 ][1]= mv_cache[ 8 ][1]= my;

  6394. 

  6395.                             mvd_cache[ 0 ][0]= mvd_cache[ 8 ][0]= mx - mpx;

  6396.                             mvd_cache[ 0 ][1]= mvd_cache[ 8 ][1]= my - mpy;

  6397.                         }else{

  6398.                             assert(IS_SUB_4X4(sub_mb_type));

  6399.                             mv_cache[ 0 ][0]= mx;

  6400.                             mv_cache[ 0 ][1]= my;

  6401. 

  6402.                             mvd_cache[ 0 ][0]= mx - mpx;

  6403.                             mvd_cache[ 0 ][1]= my - mpy;

  6404.                         }

  6405.                     }

  6406.                 }else{

  6407.                     uint32_t *p= (uint32_t *)&h->mv_cache[list][ scan8[4*i] ][0];

  6408.                     uint32_t *pd= (uint32_t *)&h->mvd_cache[list][ scan8[4*i] ][0];

  6409.                     p[0] = p[1] = p[8] = p[9] = 0;

  6410.                     pd[0]= pd[1]= pd[8]= pd[9]= 0;

  6411.                 }

  6412.             }

  6413.         }

  6414.     } else if( IS_DIRECT(mb_type) ) {

  6415.         pred_direct_motion(h, &mb_type);

  6416.         fill_rectangle(h->mvd_cache[0][scan8[0]], 4, 4, 8, 0, 4);

  6417.         fill_rectangle(h->mvd_cache[1][scan8[0]], 4, 4, 8, 0, 4);

  6418.         dct8x8_allowed &= h->sps.direct_8x8_inference_flag;

  6419.     } else {

  6420.         int list, mx, my, i, mpx, mpy;

  6421.         if(IS_16X16(mb_type)){

  6422.             for(list=0; list<2; list++){

  6423.                 if(IS_DIR(mb_type, 0, list)){

  6424.                     if(h->ref_count[list] > 0 ){

  6425.                         const int ref = h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 0 ) : 0;

  6426.                         fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, ref, 1);

  6427.                     }

  6428.                 }else

  6429.                     fill_rectangle(&h->ref_cache[list][ scan8[0] ], 4, 4, 8, (uint8_t)LIST_NOT_USED, 1);

  6430.             }

  6431.             for(list=0; list<2; list++){

  6432.                 if(IS_DIR(mb_type, 0, list)){

  6433.                     pred_motion(h, 0, 4, list, h->ref_cache[list][ scan8[0] ], &mpx, &mpy);

  6434. 

  6435.                     mx = mpx + decode_cabac_mb_mvd( h, list, 0, 0 );

  6436.                     my = mpy + decode_cabac_mb_mvd( h, list, 0, 1 );

  6437.                     tprintf("final mv:%d %d\n", mx, my);

  6438. 

  6439.                     fill_rectangle(h->mvd_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx-mpx,my-mpy), 4);

  6440.                     fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, pack16to32(mx,my), 4);

  6441.                 }else

  6442.                     fill_rectangle(h->mv_cache[list][ scan8[0] ], 4, 4, 8, 0, 4);

  6443.             }

  6444.         }

  6445.         else if(IS_16X8(mb_type)){

  6446.             for(list=0; list<2; list++){

  6447.                 if(h->ref_count[list]>0){

  6448.                     for(i=0; i<2; i++){

  6449.                         if(IS_DIR(mb_type, i, list)){

  6450.                             const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 8*i ) : 0;

  6451.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, ref, 1);

  6452.                         }else

  6453.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 16*i ], 4, 2, 8, (LIST_NOT_USED&0xFF), 1);

  6454.                     }

  6455.                 }

  6456.             }

  6457.             for(list=0; list<2; list++){

  6458.                 for(i=0; i<2; i++){

  6459.                     if(IS_DIR(mb_type, i, list)){

  6460.                         pred_16x8_motion(h, 8*i, list, h->ref_cache[list][scan8[0] + 16*i], &mpx, &mpy);

  6461.                         mx = mpx + decode_cabac_mb_mvd( h, list, 8*i, 0 );

  6462.                         my = mpy + decode_cabac_mb_mvd( h, list, 8*i, 1 );

  6463.                         tprintf("final mv:%d %d\n", mx, my);

  6464. 

  6465.                         fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx-mpx,my-mpy), 4);

  6466.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, pack16to32(mx,my), 4);

  6467.                     }else{

  6468.                         fill_rectangle(h->mvd_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);

  6469.                         fill_rectangle(h-> mv_cache[list][ scan8[0] + 16*i ], 4, 2, 8, 0, 4);

  6470.                     }

  6471.                 }

  6472.             }

  6473.         }else{

  6474.             assert(IS_8X16(mb_type));

  6475.             for(list=0; list<2; list++){

  6476.                 if(h->ref_count[list]>0){

  6477.                     for(i=0; i<2; i++){

  6478.                         if(IS_DIR(mb_type, i, list)){ //FIXME optimize

  6479.                             const int ref= h->ref_count[list] > 1 ? decode_cabac_mb_ref( h, list, 4*i ) : 0;

  6480.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, ref, 1);

  6481.                         }else

  6482.                             fill_rectangle(&h->ref_cache[list][ scan8[0] + 2*i ], 2, 4, 8, (LIST_NOT_USED&0xFF), 1);

  6483.                     }

  6484.                 }

  6485.             }

  6486.             for(list=0; list<2; list++){

  6487.                 for(i=0; i<2; i++){

  6488.                     if(IS_DIR(mb_type, i, list)){

  6489.                         pred_8x16_motion(h, i*4, list, h->ref_cache[list][ scan8[0] + 2*i ], &mpx, &mpy);

  6490.                         mx = mpx + decode_cabac_mb_mvd( h, list, 4*i, 0 );

  6491.                         my = mpy + decode_cabac_mb_mvd( h, list, 4*i, 1 );

  6492. 

  6493.                         tprintf("final mv:%d %d\n", mx, my);

  6494.                         fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx-mpx,my-mpy), 4);

  6495.                         fill_rectangle(h->mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, pack16to32(mx,my), 4);

  6496.                     }else{

  6497.                         fill_rectangle(h->mvd_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);

  6498.                         fill_rectangle(h-> mv_cache[list][ scan8[0] + 2*i ], 2, 4, 8, 0, 4);

  6499.                     }

  6500.                 }

  6501.             }

  6502.         }

  6503.     }

  6504. 

  6505.    if( IS_INTER( mb_type ) ) {

  6506.         h->chroma_pred_mode_table[mb_xy] = 0;

  6507.         write_back_motion( h, mb_type );

  6508.    }

  6509. 

  6510.     if( !IS_INTRA16x16( mb_type ) ) {

  6511.         cbp  = decode_cabac_mb_cbp_luma( h );

  6512.         cbp |= decode_cabac_mb_cbp_chroma( h ) << 4;

  6513.     }

  6514. 

  6515.     h->cbp_table[mb_xy] = h->cbp = cbp;

  6516. 

  6517.     if( dct8x8_allowed && (cbp&15) && !IS_INTRA( mb_type ) ) {

  6518.         if( decode_cabac_mb_transform_size( h ) )

  6519.             mb_type |= MB_TYPE_8x8DCT;

  6520.     }

  6521.     s->current_picture.mb_type[mb_xy]= mb_type;

  6522. 

  6523.     if( cbp || IS_INTRA16x16( mb_type ) ) {

  6524.         const uint8_t *scan, *scan8x8, *dc_scan;

  6525.         int dqp;

  6526. 

  6527.         if(IS_INTERLACED(mb_type)){

  6528.             scan8x8= s->qscale ? h->field_scan8x8 : h->field_scan8x8_q0;

  6529.             scan= s->qscale ? h->field_scan : h->field_scan_q0;

  6530.             dc_scan= luma_dc_field_scan;

  6531.         }else{

  6532.             scan8x8= s->qscale ? h->zigzag_scan8x8 : h->zigzag_scan8x8_q0;

  6533.             scan= s->qscale ? h->zigzag_scan : h->zigzag_scan_q0;

  6534.             dc_scan= luma_dc_zigzag_scan;

  6535.         }

  6536. 

  6537.         h->last_qscale_diff = dqp = decode_cabac_mb_dqp( h );

  6538.         if( dqp == INT_MIN ){

  6539.             av_log(h->s.avctx, AV_LOG_ERROR, "cabac decode of qscale diff failed at %d %d\n", s->mb_x, s->mb_y);

  6540.             return -1;

  6541.         }

  6542.         s->qscale += dqp;

  6543.         if(((unsigned)s->qscale) > 51){

  6544.             if(s->qscale<0) s->qscale+= 52;

  6545.             else            s->qscale-= 52;

  6546.         }

  6547.         h->chroma_qp = get_chroma_qp(h->pps.chroma_qp_index_offset, s->qscale);

  6548. 

  6549.         if( IS_INTRA16x16( mb_type ) ) {

  6550.             int i;

  6551.             //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 DC\n" );

  6552.             if( decode_cabac_residual( h, h->mb, 0, 0, dc_scan, NULL, 16) < 0)

  6553.                 return -1;

  6554.             if( cbp&15 ) {

  6555.                 for( i = 0; i < 16; i++ ) {

  6556.                     //av_log( s->avctx, AV_LOG_ERROR, "INTRA16x16 AC:%d\n", i );

  6557.                     if( decode_cabac_residual(h, h->mb + 16*i, 1, i, scan + 1, h->dequant4_coeff[0][s->qscale], 15) < 0 )

  6558.                         return -1;

  6559.                 }

  6560.             } else {

  6561.                 fill_rectangle(&h->non_zero_count_cache[scan8[0]], 4, 4, 8, 0, 1);

  6562.             }

  6563.         } else {

  6564.             int i8x8, i4x4;

  6565.             for( i8x8 = 0; i8x8 < 4; i8x8++ ) {

  6566.                 if( cbp & (1<<i8x8) ) {

  6567.                     if( IS_8x8DCT(mb_type) ) {

  6568.                         if( decode_cabac_residual(h, h->mb + 64*i8x8, 5, 4*i8x8,

  6569.                             scan8x8, h->dequant8_coeff[IS_INTRA( mb_type ) ? 0:1][s->qscale], 64) < 0 )

  6570.                             return -1;

  6571.                     } else

  6572.                     for( i4x4 = 0; i4x4 < 4; i4x4++ ) {

  6573.                         const int index = 4*i8x8 + i4x4;

  6574.                         //av_log( s->avctx, AV_LOG_ERROR, "Luma4x4: %d\n", index );

  6575. //START_TIMER

  6576.                         if( decode_cabac_residual(h, h->mb + 16*index, 2, index, scan, h->dequant4_coeff[IS_INTRA( mb_type ) ? 0:3][s->qscale], 16) < 0 )

  6577.                             return -1;

  6578. //STOP_TIMER("decode_residual")

  6579.                     }

  6580.                 } else {

  6581.                     uint8_t * const nnz= &h->non_zero_count_cache[ scan8[4*i8x8] ];

  6582.                     nnz[0] = nnz[1] = nnz[8] = nnz[9] = 0;

  6583.                 }

  6584.             }

  6585.         }

  6586. 

  6587.         if( cbp&0x30 ){

  6588.             int c;

  6589.             for( c = 0; c < 2; c++ ) {

  6590.                 //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-DC\n",c );

  6591.                 if( decode_cabac_residual(h, h->mb + 256 + 16*4*c, 3, c, chroma_dc_scan, NULL, 4) < 0)

  6592.                     return -1;

  6593.             }

  6594.         }

  6595. 

  6596.         if( cbp&0x20 ) {

  6597.             int c, i;

  6598.             for( c = 0; c < 2; c++ ) {

  6599.                 for( i = 0; i < 4; i++ ) {

  6600.                     const int index = 16 + 4 * c + i;

  6601.                     //av_log( s->avctx, AV_LOG_ERROR, "INTRA C%d-AC %d\n",c, index - 16 );

  6602.                     if( decode_cabac_residual(h, h->mb + 16*index, 4, index - 16, scan + 1, h->dequant4_coeff[c+1+(IS_INTRA( mb_type ) ? 0:3)][h->chroma_qp], 15) < 0)

  6603.                         return -1;

  6604.                 }

  6605.             }

  6606.         } else {

  6607.             uint8_t * const nnz= &h->non_zero_count_cache[0];

  6608.             nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =

  6609.             nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;

  6610.         }

  6611.     } else {

  6612.         uint8_t * const nnz= &h->non_zero_count_cache[0];

  6613.         fill_rectangle(&nnz[scan8[0]], 4, 4, 8, 0, 1);

  6614.         nnz[ scan8[16]+0 ] = nnz[ scan8[16]+1 ] =nnz[ scan8[16]+8 ] =nnz[ scan8[16]+9 ] =

  6615.         nnz[ scan8[20]+0 ] = nnz[ scan8[20]+1 ] =nnz[ scan8[20]+8 ] =nnz[ scan8[20]+9 ] = 0;

  6616.         h->last_qscale_diff = 0;

  6617.     }

  6618. 

  6619.     s->current_picture.qscale_table[mb_xy]= s->qscale;

  6620.     write_back_non_zero_count(h);

  6621. 

  6622.     if(MB_MBAFF){

  6623.         h->ref_count[0] >>= 1;

  6624.         h->ref_count[1] >>= 1;

  6625.     }

  6626. 

  6627.     return 0;

  6628. }

  6629. 

  6630. 

  6631. static void filter_mb_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  6632.     int i, d;

  6633.     const int index_a = qp + h->slice_alpha_c0_offset;

  6634.     const int alpha = (alpha_table+52)[index_a];

  6635.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  6636. 

  6637.     if( bS[0] < 4 ) {

  6638.         int8_t tc[4];

  6639.         for(i=0; i<4; i++)

  6640.             tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;

  6641.         h->s.dsp.h264_h_loop_filter_luma(pix, stride, alpha, beta, tc);

  6642.     } else {

  6643.         /* 16px edge length, because bS=4 is triggered by being at

  6644.          * the edge of an intra MB, so all 4 bS are the same */

  6645.             for( d = 0; d < 16; d++ ) {

  6646.                 const int p0 = pix[-1];

  6647.                 const int p1 = pix[-2];

  6648.                 const int p2 = pix[-3];

  6649. 

  6650.                 const int q0 = pix[0];

  6651.                 const int q1 = pix[1];

  6652.                 const int q2 = pix[2];

  6653. 

  6654.                 if( FFABS( p0 - q0 ) < alpha &&

  6655.                     FFABS( p1 - p0 ) < beta &&

  6656.                     FFABS( q1 - q0 ) < beta ) {

  6657. 

  6658.                     if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){

  6659.                         if( FFABS( p2 - p0 ) < beta)

  6660.                         {

  6661.                             const int p3 = pix[-4];

  6662.                             /* p0', p1', p2' */

  6663.                             pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;

  6664.                             pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;

  6665.                             pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;

  6666.                         } else {

  6667.                             /* p0' */

  6668.                             pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6669.                         }

  6670.                         if( FFABS( q2 - q0 ) < beta)

  6671.                         {

  6672.                             const int q3 = pix[3];

  6673.                             /* q0', q1', q2' */

  6674.                             pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;

  6675.                             pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;

  6676.                             pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;

  6677.                         } else {

  6678.                             /* q0' */

  6679.                             pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6680.                         }

  6681.                     }else{

  6682.                         /* p0', q0' */

  6683.                         pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6684.                         pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6685.                     }

  6686.                     tprintf("filter_mb_edgev i:%d d:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, p2, p1, p0, q0, q1, q2, pix[-2], pix[-1], pix[0], pix[1]);

  6687.                 }

  6688.                 pix += stride;

  6689.             }

  6690.     }

  6691. }

  6692. static void filter_mb_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  6693.     int i;

  6694.     const int index_a = qp + h->slice_alpha_c0_offset;

  6695.     const int alpha = (alpha_table+52)[index_a];

  6696.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  6697. 

  6698.     if( bS[0] < 4 ) {

  6699.         int8_t tc[4];

  6700.         for(i=0; i<4; i++)

  6701.             tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;

  6702.         h->s.dsp.h264_h_loop_filter_chroma(pix, stride, alpha, beta, tc);

  6703.     } else {

  6704.         h->s.dsp.h264_h_loop_filter_chroma_intra(pix, stride, alpha, beta);

  6705.     }

  6706. }

  6707. 

  6708. static void filter_mb_mbaff_edgev( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {

  6709.     int i;

  6710.     for( i = 0; i < 16; i++, pix += stride) {

  6711.         int index_a;

  6712.         int alpha;

  6713.         int beta;

  6714. 

  6715.         int qp_index;

  6716.         int bS_index = (i >> 1);

  6717.         if (!MB_FIELD) {

  6718.             bS_index &= ~1;

  6719.             bS_index |= (i & 1);

  6720.         }

  6721. 

  6722.         if( bS[bS_index] == 0 ) {

  6723.             continue;

  6724.         }

  6725. 

  6726.         qp_index = MB_FIELD ? (i >> 3) : (i & 1);

  6727.         index_a = qp[qp_index] + h->slice_alpha_c0_offset;

  6728.         alpha = (alpha_table+52)[index_a];

  6729.         beta  = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];

  6730. 

  6731.         if( bS[bS_index] < 4 ) {

  6732.             const int tc0 = (tc0_table+52)[index_a][bS[bS_index] - 1];

  6733.             const int p0 = pix[-1];

  6734.             const int p1 = pix[-2];

  6735.             const int p2 = pix[-3];

  6736.             const int q0 = pix[0];

  6737.             const int q1 = pix[1];

  6738.             const int q2 = pix[2];

  6739. 

  6740.             if( FFABS( p0 - q0 ) < alpha &&

  6741.                 FFABS( p1 - p0 ) < beta &&

  6742.                 FFABS( q1 - q0 ) < beta ) {

  6743.                 int tc = tc0;

  6744.                 int i_delta;

  6745. 

  6746.                 if( FFABS( p2 - p0 ) < beta ) {

  6747.                     pix[-2] = p1 + clip( ( p2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( p1 << 1 ) ) >> 1, -tc0, tc0 );

  6748.                     tc++;

  6749.                 }

  6750.                 if( FFABS( q2 - q0 ) < beta ) {

  6751.                     pix[1] = q1 + clip( ( q2 + ( ( p0 + q0 + 1 ) >> 1 ) - ( q1 << 1 ) ) >> 1, -tc0, tc0 );

  6752.                     tc++;

  6753.                 }

  6754. 

  6755.                 i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );

  6756.                 pix[-1] = clip_uint8( p0 + i_delta );    /* p0' */

  6757.                 pix[0]  = clip_uint8( q0 - i_delta );    /* q0' */

  6758.                 tprintf("filter_mb_mbaff_edgev i:%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, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);

  6759.             }

  6760.         }else{

  6761.             const int p0 = pix[-1];

  6762.             const int p1 = pix[-2];

  6763.             const int p2 = pix[-3];

  6764. 

  6765.             const int q0 = pix[0];

  6766.             const int q1 = pix[1];

  6767.             const int q2 = pix[2];

  6768. 

  6769.             if( FFABS( p0 - q0 ) < alpha &&

  6770.                 FFABS( p1 - p0 ) < beta &&

  6771.                 FFABS( q1 - q0 ) < beta ) {

  6772. 

  6773.                 if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){

  6774.                     if( FFABS( p2 - p0 ) < beta)

  6775.                     {

  6776.                         const int p3 = pix[-4];

  6777.                         /* p0', p1', p2' */

  6778.                         pix[-1] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;

  6779.                         pix[-2] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;

  6780.                         pix[-3] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;

  6781.                     } else {

  6782.                         /* p0' */

  6783.                         pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6784.                     }

  6785.                     if( FFABS( q2 - q0 ) < beta)

  6786.                     {

  6787.                         const int q3 = pix[3];

  6788.                         /* q0', q1', q2' */

  6789.                         pix[0] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;

  6790.                         pix[1] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;

  6791.                         pix[2] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;

  6792.                     } else {

  6793.                         /* q0' */

  6794.                         pix[0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6795.                     }

  6796.                 }else{

  6797.                     /* p0', q0' */

  6798.                     pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6799.                     pix[ 0] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6800.                 }

  6801.                 tprintf("filter_mb_mbaff_edgev i:%d, qp:%d, indexA:%d, alpha:%d, beta:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, qp[qp_index], index_a, alpha, beta, p2, p1, p0, q0, q1, q2, pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);

  6802.             }

  6803.         }

  6804.     }

  6805. }

  6806. static void filter_mb_mbaff_edgecv( H264Context *h, uint8_t *pix, int stride, int16_t bS[8], int qp[2] ) {

  6807.     int i;

  6808.     for( i = 0; i < 8; i++, pix += stride) {

  6809.         int index_a;

  6810.         int alpha;

  6811.         int beta;

  6812. 

  6813.         int qp_index;

  6814.         int bS_index = i;

  6815. 

  6816.         if( bS[bS_index] == 0 ) {

  6817.             continue;

  6818.         }

  6819. 

  6820.         qp_index = MB_FIELD ? (i >> 2) : (i & 1);

  6821.         index_a = qp[qp_index] + h->slice_alpha_c0_offset;

  6822.         alpha = (alpha_table+52)[index_a];

  6823.         beta  = (beta_table+52)[qp[qp_index] + h->slice_beta_offset];

  6824. 

  6825.         if( bS[bS_index] < 4 ) {

  6826.             const int tc = (tc0_table+52)[index_a][bS[bS_index] - 1] + 1;

  6827.             const int p0 = pix[-1];

  6828.             const int p1 = pix[-2];

  6829.             const int q0 = pix[0];

  6830.             const int q1 = pix[1];

  6831. 

  6832.             if( FFABS( p0 - q0 ) < alpha &&

  6833.                 FFABS( p1 - p0 ) < beta &&

  6834.                 FFABS( q1 - q0 ) < beta ) {

  6835.                 const int i_delta = clip( (((q0 - p0 ) << 2) + (p1 - q1) + 4) >> 3, -tc, tc );

  6836. 

  6837.                 pix[-1] = clip_uint8( p0 + i_delta );    /* p0' */

  6838.                 pix[0]  = clip_uint8( q0 - i_delta );    /* q0' */

  6839.                 tprintf("filter_mb_mbaff_edgecv i:%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, qp[qp_index], index_a, alpha, beta, tc, bS[bS_index], pix[-3], p1, p0, q0, q1, pix[2], p1, pix[-1], pix[0], q1);

  6840.             }

  6841.         }else{

  6842.             const int p0 = pix[-1];

  6843.             const int p1 = pix[-2];

  6844.             const int q0 = pix[0];

  6845.             const int q1 = pix[1];

  6846. 

  6847.             if( FFABS( p0 - q0 ) < alpha &&

  6848.                 FFABS( p1 - p0 ) < beta &&

  6849.                 FFABS( q1 - q0 ) < beta ) {

  6850. 

  6851.                 pix[-1] = ( 2*p1 + p0 + q1 + 2 ) >> 2;   /* p0' */

  6852.                 pix[0]  = ( 2*q1 + q0 + p1 + 2 ) >> 2;   /* q0' */

  6853.                 tprintf("filter_mb_mbaff_edgecv i:%d\n# bS:4 -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x, %02x, %02x]\n", i, pix[-3], p1, p0, q0, q1, pix[2], pix[-3], pix[-2], pix[-1], pix[0], pix[1], pix[2]);

  6854.             }

  6855.         }

  6856.     }

  6857. }

  6858. 

  6859. static void filter_mb_edgeh( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  6860.     int i, d;

  6861.     const int index_a = qp + h->slice_alpha_c0_offset;

  6862.     const int alpha = (alpha_table+52)[index_a];

  6863.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  6864.     const int pix_next  = stride;

  6865. 

  6866.     if( bS[0] < 4 ) {

  6867.         int8_t tc[4];

  6868.         for(i=0; i<4; i++)

  6869.             tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] : -1;

  6870.         h->s.dsp.h264_v_loop_filter_luma(pix, stride, alpha, beta, tc);

  6871.     } else {

  6872.         /* 16px edge length, see filter_mb_edgev */

  6873.             for( d = 0; d < 16; d++ ) {

  6874.                 const int p0 = pix[-1*pix_next];

  6875.                 const int p1 = pix[-2*pix_next];

  6876.                 const int p2 = pix[-3*pix_next];

  6877.                 const int q0 = pix[0];

  6878.                 const int q1 = pix[1*pix_next];

  6879.                 const int q2 = pix[2*pix_next];

  6880. 

  6881.                 if( FFABS( p0 - q0 ) < alpha &&

  6882.                     FFABS( p1 - p0 ) < beta &&

  6883.                     FFABS( q1 - q0 ) < beta ) {

  6884. 

  6885.                     const int p3 = pix[-4*pix_next];

  6886.                     const int q3 = pix[ 3*pix_next];

  6887. 

  6888.                     if(FFABS( p0 - q0 ) < (( alpha >> 2 ) + 2 )){

  6889.                         if( FFABS( p2 - p0 ) < beta) {

  6890.                             /* p0', p1', p2' */

  6891.                             pix[-1*pix_next] = ( p2 + 2*p1 + 2*p0 + 2*q0 + q1 + 4 ) >> 3;

  6892.                             pix[-2*pix_next] = ( p2 + p1 + p0 + q0 + 2 ) >> 2;

  6893.                             pix[-3*pix_next] = ( 2*p3 + 3*p2 + p1 + p0 + q0 + 4 ) >> 3;

  6894.                         } else {

  6895.                             /* p0' */

  6896.                             pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6897.                         }

  6898.                         if( FFABS( q2 - q0 ) < beta) {

  6899.                             /* q0', q1', q2' */

  6900.                             pix[0*pix_next] = ( p1 + 2*p0 + 2*q0 + 2*q1 + q2 + 4 ) >> 3;

  6901.                             pix[1*pix_next] = ( p0 + q0 + q1 + q2 + 2 ) >> 2;

  6902.                             pix[2*pix_next] = ( 2*q3 + 3*q2 + q1 + q0 + p0 + 4 ) >> 3;

  6903.                         } else {

  6904.                             /* q0' */

  6905.                             pix[0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6906.                         }

  6907.                     }else{

  6908.                         /* p0', q0' */

  6909.                         pix[-1*pix_next] = ( 2*p1 + p0 + q1 + 2 ) >> 2;

  6910.                         pix[ 0*pix_next] = ( 2*q1 + q0 + p1 + 2 ) >> 2;

  6911.                     }

  6912.                     tprintf("filter_mb_edgeh i:%d d:%d, qp:%d, indexA:%d, alpha:%d, beta:%d\n# bS:%d -> [%02x, %02x, %02x, %02x, %02x, %02x] =>[%02x, %02x, %02x, %02x]\n", i, d, qp, index_a, alpha, beta, bS[i], p2, p1, p0, q0, q1, q2, pix[-2*pix_next], pix[-pix_next], pix[0], pix[pix_next]);

  6913.                 }

  6914.                 pix++;

  6915.             }

  6916.     }

  6917. }

  6918. 

  6919. static void filter_mb_edgech( H264Context *h, uint8_t *pix, int stride, int16_t bS[4], int qp ) {

  6920.     int i;

  6921.     const int index_a = qp + h->slice_alpha_c0_offset;

  6922.     const int alpha = (alpha_table+52)[index_a];

  6923.     const int beta  = (beta_table+52)[qp + h->slice_beta_offset];

  6924. 

  6925.     if( bS[0] < 4 ) {

  6926.         int8_t tc[4];

  6927.         for(i=0; i<4; i++)

  6928.             tc[i] = bS[i] ? (tc0_table+52)[index_a][bS[i] - 1] + 1 : 0;

  6929.         h->s.dsp.h264_v_loop_filter_chroma(pix, stride, alpha, beta, tc);

  6930.     } else {

  6931.         h->s.dsp.h264_v_loop_filter_chroma_intra(pix, stride, alpha, beta);

  6932.     }

  6933. }

  6934. 

  6935. static void filter_mb_fast( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {

  6936.     MpegEncContext * const s = &h->s;

  6937.     int mb_xy, mb_type;

  6938.     int qp, qp0, qp1, qpc, qpc0, qpc1, qp_thresh;

  6939. 

  6940.     if(mb_x==0 || mb_y==0 || !s->dsp.h264_loop_filter_strength) {

  6941.         filter_mb(h, mb_x, mb_y, img_y, img_cb, img_cr, linesize, uvlinesize);

  6942.         return;

  6943.     }

  6944.     assert(!FRAME_MBAFF);

  6945. 

  6946.     mb_xy = mb_x + mb_y*s->mb_stride;

  6947.     mb_type = s->current_picture.mb_type[mb_xy];

  6948.     qp = s->current_picture.qscale_table[mb_xy];

  6949.     qp0 = s->current_picture.qscale_table[mb_xy-1];

  6950.     qp1 = s->current_picture.qscale_table[h->top_mb_xy];

  6951.     qpc = get_chroma_qp( h->pps.chroma_qp_index_offset, qp );

  6952.     qpc0 = get_chroma_qp( h->pps.chroma_qp_index_offset, qp0 );

  6953.     qpc1 = get_chroma_qp( h->pps.chroma_qp_index_offset, qp1 );

  6954.     qp0 = (qp + qp0 + 1) >> 1;

  6955.     qp1 = (qp + qp1 + 1) >> 1;

  6956.     qpc0 = (qpc + qpc0 + 1) >> 1;

  6957.     qpc1 = (qpc + qpc1 + 1) >> 1;

  6958.     qp_thresh = 15 - h->slice_alpha_c0_offset;

  6959.     if(qp <= qp_thresh && qp0 <= qp_thresh && qp1 <= qp_thresh &&

  6960.        qpc <= qp_thresh && qpc0 <= qp_thresh && qpc1 <= qp_thresh)

  6961.         return;

  6962. 

  6963.     if( IS_INTRA(mb_type) ) {

  6964.         int16_t bS4[4] = {4,4,4,4};

  6965.         int16_t bS3[4] = {3,3,3,3};

  6966.         if( IS_8x8DCT(mb_type) ) {

  6967.             filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );

  6968.             filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );

  6969.             filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bS4, qp1 );

  6970.             filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );

  6971.         } else {

  6972.             filter_mb_edgev( h, &img_y[4*0], linesize, bS4, qp0 );

  6973.             filter_mb_edgev( h, &img_y[4*1], linesize, bS3, qp );

  6974.             filter_mb_edgev( h, &img_y[4*2], linesize, bS3, qp );

  6975.             filter_mb_edgev( h, &img_y[4*3], linesize, bS3, qp );

  6976.             filter_mb_edgeh( h, &img_y[4*0*linesize], linesize, bS4, qp1 );

  6977.             filter_mb_edgeh( h, &img_y[4*1*linesize], linesize, bS3, qp );

  6978.             filter_mb_edgeh( h, &img_y[4*2*linesize], linesize, bS3, qp );

  6979.             filter_mb_edgeh( h, &img_y[4*3*linesize], linesize, bS3, qp );

  6980.         }

  6981.         filter_mb_edgecv( h, &img_cb[2*0], uvlinesize, bS4, qpc0 );

  6982.         filter_mb_edgecv( h, &img_cb[2*2], uvlinesize, bS3, qpc );

  6983.         filter_mb_edgecv( h, &img_cr[2*0], uvlinesize, bS4, qpc0 );

  6984.         filter_mb_edgecv( h, &img_cr[2*2], uvlinesize, bS3, qpc );

  6985.         filter_mb_edgech( h, &img_cb[2*0*uvlinesize], uvlinesize, bS4, qpc1 );

  6986.         filter_mb_edgech( h, &img_cb[2*2*uvlinesize], uvlinesize, bS3, qpc );

  6987.         filter_mb_edgech( h, &img_cr[2*0*uvlinesize], uvlinesize, bS4, qpc1 );

  6988.         filter_mb_edgech( h, &img_cr[2*2*uvlinesize], uvlinesize, bS3, qpc );

  6989.         return;

  6990.     } else {

  6991.         DECLARE_ALIGNED_8(int16_t, bS[2][4][4]);

  6992.         uint64_t (*bSv)[4] = (uint64_t(*)[4])bS;

  6993.         int edges;

  6994.         if( IS_8x8DCT(mb_type) && (h->cbp&7) == 7 ) {

  6995.             edges = 4;

  6996.             bSv[0][0] = bSv[0][2] = bSv[1][0] = bSv[1][2] = 0x0002000200020002ULL;

  6997.         } else {

  6998.             int mask_edge1 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16)) ? 3 :

  6999.                              (mb_type & MB_TYPE_16x8) ? 1 : 0;

  7000.             int mask_edge0 = (mb_type & (MB_TYPE_16x16 | MB_TYPE_8x16))

  7001.                              && (s->current_picture.mb_type[mb_xy-1] & (MB_TYPE_16x16 | MB_TYPE_8x16))

  7002.                              ? 3 : 0;

  7003.             int step = IS_8x8DCT(mb_type) ? 2 : 1;

  7004.             edges = (mb_type & MB_TYPE_16x16) && !(h->cbp & 15) ? 1 : 4;

  7005.             s->dsp.h264_loop_filter_strength( bS, h->non_zero_count_cache, h->ref_cache, h->mv_cache,

  7006.                                               (h->slice_type == B_TYPE), edges, step, mask_edge0, mask_edge1 );

  7007.         }

  7008.         if( IS_INTRA(s->current_picture.mb_type[mb_xy-1]) )

  7009.             bSv[0][0] = 0x0004000400040004ULL;

  7010.         if( IS_INTRA(s->current_picture.mb_type[h->top_mb_xy]) )

  7011.             bSv[1][0] = 0x0004000400040004ULL;

  7012. 

  7013. #define FILTER(hv,dir,edge)\

  7014.         if(bSv[dir][edge]) {\

  7015.             filter_mb_edge##hv( h, &img_y[4*edge*(dir?linesize:1)], linesize, bS[dir][edge], edge ? qp : qp##dir );\

  7016.             if(!(edge&1)) {\

  7017.                 filter_mb_edgec##hv( h, &img_cb[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\

  7018.                 filter_mb_edgec##hv( h, &img_cr[2*edge*(dir?uvlinesize:1)], uvlinesize, bS[dir][edge], edge ? qpc : qpc##dir );\

  7019.             }\

  7020.         }

  7021.         if( edges == 1 ) {

  7022.             FILTER(v,0,0);

  7023.             FILTER(h,1,0);

  7024.         } else if( IS_8x8DCT(mb_type) ) {

  7025.             FILTER(v,0,0);

  7026.             FILTER(v,0,2);

  7027.             FILTER(h,1,0);

  7028.             FILTER(h,1,2);

  7029.         } else {

  7030.             FILTER(v,0,0);

  7031.             FILTER(v,0,1);

  7032.             FILTER(v,0,2);

  7033.             FILTER(v,0,3);

  7034.             FILTER(h,1,0);

  7035.             FILTER(h,1,1);

  7036.             FILTER(h,1,2);

  7037.             FILTER(h,1,3);

  7038.         }

  7039. #undef FILTER

  7040.     }

  7041. }

  7042. 

  7043. static void filter_mb( H264Context *h, int mb_x, int mb_y, uint8_t *img_y, uint8_t *img_cb, uint8_t *img_cr, unsigned int linesize, unsigned int uvlinesize) {

  7044.     MpegEncContext * const s = &h->s;

  7045.     const int mb_xy= mb_x + mb_y*s->mb_stride;

  7046.     const int mb_type = s->current_picture.mb_type[mb_xy];

  7047.     const int mvy_limit = IS_INTERLACED(mb_type) ? 2 : 4;

  7048.     int first_vertical_edge_done = 0;

  7049.     int dir;

  7050.     /* FIXME: A given frame may occupy more than one position in

  7051.      * the reference list. So ref2frm should be populated with

  7052.      * frame numbers, not indices. */

  7053.     static const int ref2frm[34] = {-1,-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,

  7054.                                     16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31};

  7055. 

  7056.     //for sufficiently low qp, filtering wouldn't do anything

  7057.     //this is a conservative estimate: could also check beta_offset and more accurate chroma_qp

  7058.     if(!FRAME_MBAFF){

  7059.         int qp_thresh = 15 - h->slice_alpha_c0_offset - FFMAX(0, h->pps.chroma_qp_index_offset);

  7060.         int qp = s->current_picture.qscale_table[mb_xy];

  7061.         if(qp <= qp_thresh

  7062.            && (mb_x == 0 || ((qp + s->current_picture.qscale_table[mb_xy-1] + 1)>>1) <= qp_thresh)

  7063.            && (mb_y == 0 || ((qp + s->current_picture.qscale_table[h->top_mb_xy] + 1)>>1) <= qp_thresh)){

  7064.             return;

  7065.         }

  7066.     }

  7067. 

  7068.     if (FRAME_MBAFF

  7069.             // left mb is in picture

  7070.             && h->slice_table[mb_xy-1] != 255

  7071.             // and current and left pair do not have the same interlaced type

  7072.             && (IS_INTERLACED(mb_type) != IS_INTERLACED(s->current_picture.mb_type[mb_xy-1]))

  7073.             // and left mb is in the same slice if deblocking_filter == 2

  7074.             && (h->deblocking_filter!=2 || h->slice_table[mb_xy-1] == h->slice_table[mb_xy])) {

  7075.         /* First vertical edge is different in MBAFF frames

  7076.          * There are 8 different bS to compute and 2 different Qp

  7077.          */

  7078.         const int pair_xy = mb_x + (mb_y&~1)*s->mb_stride;

  7079.         const int left_mb_xy[2] = { pair_xy-1, pair_xy-1+s->mb_stride };

  7080.         int16_t bS[8];

  7081.         int qp[2];

  7082.         int chroma_qp[2];

  7083.         int mb_qp, mbn0_qp, mbn1_qp;

  7084.         int i;

  7085.         first_vertical_edge_done = 1;

  7086. 

  7087.         if( IS_INTRA(mb_type) )

  7088.             bS[0] = bS[1] = bS[2] = bS[3] = bS[4] = bS[5] = bS[6] = bS[7] = 4;

  7089.         else {

  7090.             for( i = 0; i < 8; i++ ) {

  7091.                 int mbn_xy = MB_FIELD ? left_mb_xy[i>>2] : left_mb_xy[i&1];

  7092. 

  7093.                 if( IS_INTRA( s->current_picture.mb_type[mbn_xy] ) )

  7094.                     bS[i] = 4;

  7095.                 else if( h->non_zero_count_cache[12+8*(i>>1)] != 0 ||

  7096.                          /* FIXME: with 8x8dct + cavlc, should check cbp instead of nnz */

  7097.                          h->non_zero_count[mbn_xy][MB_FIELD ? i&3 : (i>>2)+(mb_y&1)*2] )

  7098.                     bS[i] = 2;

  7099.                 else

  7100.                     bS[i] = 1;

  7101.             }

  7102.         }

  7103. 

  7104.         mb_qp = s->current_picture.qscale_table[mb_xy];

  7105.         mbn0_qp = s->current_picture.qscale_table[left_mb_xy[0]];

  7106.         mbn1_qp = s->current_picture.qscale_table[left_mb_xy[1]];

  7107.         qp[0] = ( mb_qp + mbn0_qp + 1 ) >> 1;

  7108.         chroma_qp[0] = ( get_chroma_qp( h->pps.chroma_qp_index_offset, mb_qp ) +

  7109.                          get_chroma_qp( h->pps.chroma_qp_index_offset, mbn0_qp ) + 1 ) >> 1;

  7110.         qp[1] = ( mb_qp + mbn1_qp + 1 ) >> 1;

  7111.         chroma_qp[1] = ( get_chroma_qp( h->pps.chroma_qp_index_offset, mb_qp ) +

  7112.                          get_chroma_qp( h->pps.chroma_qp_index_offset, mbn1_qp ) + 1 ) >> 1;

  7113. 

  7114.         /* Filter edge */

  7115.         tprintf("filter mb:%d/%d MBAFF, QPy:%d/%d, QPc:%d/%d ls:%d uvls:%d", mb_x, mb_y, qp[0], qp[1], chroma_qp[0], chroma_qp[1], linesize, uvlinesize);

  7116.         { int i; for (i = 0; i < 8; i++) tprintf(" bS[%d]:%d", i, bS[i]); tprintf("\n"); }

  7117.         filter_mb_mbaff_edgev ( h, &img_y [0], linesize,   bS, qp );

  7118.         filter_mb_mbaff_edgecv( h, &img_cb[0], uvlinesize, bS, chroma_qp );

  7119.         filter_mb_mbaff_edgecv( h, &img_cr[0], uvlinesize, bS, chroma_qp );

  7120.     }

  7121.     /* dir : 0 -> vertical edge, 1 -> horizontal edge */

  7122.     for( dir = 0; dir < 2; dir++ )

  7123.     {

  7124.         int edge;

  7125.         const int mbm_xy = dir == 0 ? mb_xy -1 : h->top_mb_xy;

  7126.         const int mbm_type = s->current_picture.mb_type[mbm_xy];

  7127.         int start = h->slice_table[mbm_xy] == 255 ? 1 : 0;

  7128. 

  7129.         const int edges = (mb_type & (MB_TYPE_16x16|MB_TYPE_SKIP))

  7130.                                   == (MB_TYPE_16x16|MB_TYPE_SKIP) ? 1 : 4;

  7131.         // how often to recheck mv-based bS when iterating between edges

  7132.         const int mask_edge = (mb_type & (MB_TYPE_16x16 | (MB_TYPE_16x8 << dir))) ? 3 :

  7133.                               (mb_type & (MB_TYPE_8x16 >> dir)) ? 1 : 0;

  7134.         // how often to recheck mv-based bS when iterating along each edge

  7135.         const int mask_par0 = mb_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir));

  7136. 

  7137.         if (first_vertical_edge_done) {

  7138.             start = 1;

  7139.             first_vertical_edge_done = 0;

  7140.         }

  7141. 

  7142.         if (h->deblocking_filter==2 && h->slice_table[mbm_xy] != h->slice_table[mb_xy])

  7143.             start = 1;

  7144. 

  7145.         if (FRAME_MBAFF && (dir == 1) && ((mb_y&1) == 0) && start == 0

  7146.             && !IS_INTERLACED(mb_type)

  7147.             && IS_INTERLACED(mbm_type)

  7148.             ) {

  7149.             // This is a special case in the norm where the filtering must

  7150.             // be done twice (one each of the field) even if we are in a

  7151.             // frame macroblock.

  7152.             //

  7153.             static const int nnz_idx[4] = {4,5,6,3};

  7154.             unsigned int tmp_linesize   = 2 *   linesize;

  7155.             unsigned int tmp_uvlinesize = 2 * uvlinesize;

  7156.             int mbn_xy = mb_xy - 2 * s->mb_stride;

  7157.             int qp, chroma_qp;

  7158.             int i, j;

  7159.             int16_t bS[4];

  7160. 

  7161.             for(j=0; j<2; j++, mbn_xy += s->mb_stride){

  7162.                 if( IS_INTRA(mb_type) ||

  7163.                     IS_INTRA(s->current_picture.mb_type[mbn_xy]) ) {

  7164.                     bS[0] = bS[1] = bS[2] = bS[3] = 3;

  7165.                 } else {

  7166.                     const uint8_t *mbn_nnz = h->non_zero_count[mbn_xy];

  7167.                     for( i = 0; i < 4; i++ ) {

  7168.                         if( h->non_zero_count_cache[scan8[0]+i] != 0 ||

  7169.                             mbn_nnz[nnz_idx[i]] != 0 )

  7170.                             bS[i] = 2;

  7171.                         else

  7172.                             bS[i] = 1;

  7173.                     }

  7174.                 }

  7175.                 // Do not use s->qscale as luma quantizer because it has not the same

  7176.                 // value in IPCM macroblocks.

  7177.                 qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;

  7178.                 tprintf("filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, tmp_linesize, tmp_uvlinesize);

  7179.                 { int i; for (i = 0; i < 4; i++) tprintf(" bS[%d]:%d", i, bS[i]); tprintf("\n"); }

  7180.                 filter_mb_edgeh( h, &img_y[j*linesize], tmp_linesize, bS, qp );

  7181.                 chroma_qp = ( h->chroma_qp +

  7182.                               get_chroma_qp( h->pps.chroma_qp_index_offset, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1;

  7183.                 filter_mb_edgech( h, &img_cb[j*uvlinesize], tmp_uvlinesize, bS, chroma_qp );

  7184.                 filter_mb_edgech( h, &img_cr[j*uvlinesize], tmp_uvlinesize, bS, chroma_qp );

  7185.             }

  7186. 

  7187.             start = 1;

  7188.         }

  7189. 

  7190.         /* Calculate bS */

  7191.         for( edge = start; edge < edges; edge++ ) {

  7192.             /* mbn_xy: neighbor macroblock */

  7193.             const int mbn_xy = edge > 0 ? mb_xy : mbm_xy;

  7194.             const int mbn_type = s->current_picture.mb_type[mbn_xy];

  7195.             int16_t bS[4];

  7196.             int qp;

  7197. 

  7198.             if( (edge&1) && IS_8x8DCT(mb_type) )

  7199.                 continue;

  7200. 

  7201.             if( IS_INTRA(mb_type) ||

  7202.                 IS_INTRA(mbn_type) ) {

  7203.                 int value;

  7204.                 if (edge == 0) {

  7205.                     if (   (!IS_INTERLACED(mb_type) && !IS_INTERLACED(mbm_type))

  7206.                         || ((FRAME_MBAFF || (s->picture_structure != PICT_FRAME)) && (dir == 0))

  7207.                     ) {

  7208.                         value = 4;

  7209.                     } else {

  7210.                         value = 3;

  7211.                     }

  7212.                 } else {

  7213.                     value = 3;

  7214.                 }

  7215.                 bS[0] = bS[1] = bS[2] = bS[3] = value;

  7216.             } else {

  7217.                 int i, l;

  7218.                 int mv_done;

  7219. 

  7220.                 if( edge & mask_edge ) {

  7221.                     bS[0] = bS[1] = bS[2] = bS[3] = 0;

  7222.                     mv_done = 1;

  7223.                 }

  7224.                 else if( FRAME_MBAFF && IS_INTERLACED(mb_type ^ mbn_type)) {

  7225.                     bS[0] = bS[1] = bS[2] = bS[3] = 1;

  7226.                     mv_done = 1;

  7227.                 }

  7228.                 else if( mask_par0 && (edge || (mbn_type & (MB_TYPE_16x16 | (MB_TYPE_8x16 >> dir)))) ) {

  7229.                     int b_idx= 8 + 4 + edge * (dir ? 8:1);

  7230.                     int bn_idx= b_idx - (dir ? 8:1);

  7231.                     int v = 0;

  7232.                     for( l = 0; !v && l < 1 + (h->slice_type == B_TYPE); l++ ) {

  7233.                         v |= ref2frm[h->ref_cache[l][b_idx]+2] != ref2frm[h->ref_cache[l][bn_idx]+2] ||

  7234.                              FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] ) >= 4 ||

  7235.                              FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit;

  7236.                     }

  7237.                     bS[0] = bS[1] = bS[2] = bS[3] = v;

  7238.                     mv_done = 1;

  7239.                 }

  7240.                 else

  7241.                     mv_done = 0;

  7242. 

  7243.                 for( i = 0; i < 4; i++ ) {

  7244.                     int x = dir == 0 ? edge : i;

  7245.                     int y = dir == 0 ? i    : edge;

  7246.                     int b_idx= 8 + 4 + x + 8*y;

  7247.                     int bn_idx= b_idx - (dir ? 8:1);

  7248. 

  7249.                     if( h->non_zero_count_cache[b_idx] != 0 ||

  7250.                         h->non_zero_count_cache[bn_idx] != 0 ) {

  7251.                         bS[i] = 2;

  7252.                     }

  7253.                     else if(!mv_done)

  7254.                     {

  7255.                         bS[i] = 0;

  7256.                         for( l = 0; l < 1 + (h->slice_type == B_TYPE); l++ ) {

  7257.                             if( ref2frm[h->ref_cache[l][b_idx]+2] != ref2frm[h->ref_cache[l][bn_idx]+2] ||

  7258.                                 FFABS( h->mv_cache[l][b_idx][0] - h->mv_cache[l][bn_idx][0] ) >= 4 ||

  7259.                                 FFABS( h->mv_cache[l][b_idx][1] - h->mv_cache[l][bn_idx][1] ) >= mvy_limit ) {

  7260.                                 bS[i] = 1;

  7261.                                 break;

  7262.                             }

  7263.                         }

  7264.                     }

  7265.                 }

  7266. 

  7267.                 if(bS[0]+bS[1]+bS[2]+bS[3] == 0)

  7268.                     continue;

  7269.             }

  7270. 

  7271.             /* Filter edge */

  7272.             // Do not use s->qscale as luma quantizer because it has not the same

  7273.             // value in IPCM macroblocks.

  7274.             qp = ( s->current_picture.qscale_table[mb_xy] + s->current_picture.qscale_table[mbn_xy] + 1 ) >> 1;

  7275.             //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]);

  7276.             tprintf("filter mb:%d/%d dir:%d edge:%d, QPy:%d ls:%d uvls:%d", mb_x, mb_y, dir, edge, qp, linesize, uvlinesize);

  7277.             { int i; for (i = 0; i < 4; i++) tprintf(" bS[%d]:%d", i, bS[i]); tprintf("\n"); }

  7278.             if( dir == 0 ) {

  7279.                 filter_mb_edgev( h, &img_y[4*edge], linesize, bS, qp );

  7280.                 if( (edge&1) == 0 ) {

  7281.                     int chroma_qp = ( h->chroma_qp +

  7282.                                       get_chroma_qp( h->pps.chroma_qp_index_offset, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1;

  7283.                     filter_mb_edgecv( h, &img_cb[2*edge], uvlinesize, bS, chroma_qp );

  7284.                     filter_mb_edgecv( h, &img_cr[2*edge], uvlinesize, bS, chroma_qp );

  7285.                 }

  7286.             } else {

  7287.                 filter_mb_edgeh( h, &img_y[4*edge*linesize], linesize, bS, qp );

  7288.                 if( (edge&1) == 0 ) {

  7289.                     int chroma_qp = ( h->chroma_qp +

  7290.                                       get_chroma_qp( h->pps.chroma_qp_index_offset, s->current_picture.qscale_table[mbn_xy] ) + 1 ) >> 1;

  7291.                     filter_mb_edgech( h, &img_cb[2*edge*uvlinesize], uvlinesize, bS, chroma_qp );

  7292.                     filter_mb_edgech( h, &img_cr[2*edge*uvlinesize], uvlinesize, bS, chroma_qp );

  7293.                 }

  7294.             }

  7295.         }

  7296.     }

  7297. }

  7298. 

  7299. static int decode_slice(H264Context *h){

  7300.     MpegEncContext * const s = &h->s;

  7301.     const int part_mask= s->partitioned_frame ? (AC_END|AC_ERROR) : 0x7F;

  7302. 

  7303.     s->mb_skip_run= -1;

  7304. 

  7305.     if( h->pps.cabac ) {

  7306.         int i;

  7307. 

  7308.         /* realign */

  7309.         align_get_bits( &s->gb );

  7310. 

  7311.         /* init cabac */

  7312.         ff_init_cabac_states( &h->cabac);

  7313.         ff_init_cabac_decoder( &h->cabac,

  7314.                                s->gb.buffer + get_bits_count(&s->gb)/8,

  7315.                                ( s->gb.size_in_bits - get_bits_count(&s->gb) + 7)/8);

  7316.         /* calculate pre-state */

  7317.         for( i= 0; i < 460; i++ ) {

  7318.             int pre;

  7319.             if( h->slice_type == I_TYPE )

  7320.                 pre = clip( ((cabac_context_init_I[i][0] * s->qscale) >>4 ) + cabac_context_init_I[i][1], 1, 126 );

  7321.             else

  7322.                 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 );

  7323. 

  7324.             if( pre <= 63 )

  7325.                 h->cabac_state[i] = 2 * ( 63 - pre ) + 0;

  7326.             else

  7327.                 h->cabac_state[i] = 2 * ( pre - 64 ) + 1;

  7328.         }

  7329. 

  7330.         for(;;){

  7331. //START_TIMER

  7332.             int ret = decode_mb_cabac(h);

  7333.             int eos;

  7334. //STOP_TIMER("decode_mb_cabac")

  7335. 

  7336.             if(ret>=0) hl_decode_mb(h);

  7337. 

  7338.             if( ret >= 0 && FRAME_MBAFF ) { //FIXME optimal? or let mb_decode decode 16x32 ?

  7339.                 s->mb_y++;

  7340. 

  7341.                 if(ret>=0) ret = decode_mb_cabac(h);

  7342. 

  7343.                 if(ret>=0) hl_decode_mb(h);

  7344.                 s->mb_y--;

  7345.             }

  7346.             eos = get_cabac_terminate( &h->cabac );

  7347. 

  7348.             if( ret < 0 || h->cabac.bytestream > h->cabac.bytestream_end + 2) {

  7349.                 av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d, bytestream (%d)\n", s->mb_x, s->mb_y, h->cabac.bytestream_end - h->cabac.bytestream);

  7350.                 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);

  7351.                 return -1;

  7352.             }

  7353. 

  7354.             if( ++s->mb_x >= s->mb_width ) {

  7355.                 s->mb_x = 0;

  7356.                 ff_draw_horiz_band(s, 16*s->mb_y, 16);

  7357.                 ++s->mb_y;

  7358.                 if(FRAME_MBAFF) {

  7359.                     ++s->mb_y;

  7360.                 }

  7361.             }

  7362. 

  7363.             if( eos || s->mb_y >= s->mb_height ) {

  7364.                 tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);

  7365.                 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);

  7366.                 return 0;

  7367.             }

  7368.         }

  7369. 

  7370.     } else {

  7371.         for(;;){

  7372.             int ret = decode_mb_cavlc(h);

  7373. 

  7374.             if(ret>=0) hl_decode_mb(h);

  7375. 

  7376.             if(ret>=0 && FRAME_MBAFF){ //FIXME optimal? or let mb_decode decode 16x32 ?

  7377.                 s->mb_y++;

  7378.                 ret = decode_mb_cavlc(h);

  7379. 

  7380.                 if(ret>=0) hl_decode_mb(h);

  7381.                 s->mb_y--;

  7382.             }

  7383. 

  7384.             if(ret<0){

  7385.                 av_log(h->s.avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);

  7386.                 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);

  7387. 

  7388.                 return -1;

  7389.             }

  7390. 

  7391.             if(++s->mb_x >= s->mb_width){

  7392.                 s->mb_x=0;

  7393.                 ff_draw_horiz_band(s, 16*s->mb_y, 16);

  7394.                 ++s->mb_y;

  7395.                 if(FRAME_MBAFF) {

  7396.                     ++s->mb_y;

  7397.                 }

  7398.                 if(s->mb_y >= s->mb_height){

  7399.                     tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);

  7400. 

  7401.                     if(get_bits_count(&s->gb) == s->gb.size_in_bits ) {

  7402.                         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);

  7403. 

  7404.                         return 0;

  7405.                     }else{

  7406.                         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);

  7407. 

  7408.                         return -1;

  7409.                     }

  7410.                 }

  7411.             }

  7412. 

  7413.             if(get_bits_count(&s->gb) >= s->gb.size_in_bits && s->mb_skip_run<=0){

  7414.                 tprintf("slice end %d %d\n", get_bits_count(&s->gb), s->gb.size_in_bits);

  7415.                 if(get_bits_count(&s->gb) == s->gb.size_in_bits ){

  7416.                     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);

  7417. 

  7418.                     return 0;

  7419.                 }else{

  7420.                     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);

  7421. 

  7422.                     return -1;

  7423.                 }

  7424.             }

  7425.         }

  7426.     }

  7427. 

  7428. #if 0

  7429.     for(;s->mb_y < s->mb_height; s->mb_y++){

  7430.         for(;s->mb_x < s->mb_width; s->mb_x++){

  7431.             int ret= decode_mb(h);

  7432. 

  7433.             hl_decode_mb(h);

  7434. 

  7435.             if(ret<0){

  7436.                 av_log(s->avctx, AV_LOG_ERROR, "error while decoding MB %d %d\n", s->mb_x, s->mb_y);

  7437.                 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);

  7438. 

  7439.                 return -1;

  7440.             }

  7441. 

  7442.             if(++s->mb_x >= s->mb_width){

  7443.                 s->mb_x=0;

  7444.                 if(++s->mb_y >= s->mb_height){

  7445.                     if(get_bits_count(s->gb) == s->gb.size_in_bits){

  7446.                         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);

  7447. 

  7448.                         return 0;

  7449.                     }else{

  7450.                         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);

  7451. 

  7452.                         return -1;

  7453.                     }

  7454.                 }

  7455.             }

  7456. 

  7457.             if(get_bits_count(s->?gb) >= s->gb?.size_in_bits){

  7458.                 if(get_bits_count(s->gb) == s->gb.size_in_bits){

  7459.                     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);

  7460. 

  7461.                     return 0;

  7462.                 }else{

  7463.                     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);

  7464. 

  7465.                     return -1;

  7466.                 }

  7467.             }

  7468.         }

  7469.         s->mb_x=0;

  7470.         ff_draw_horiz_band(s, 16*s->mb_y, 16);

  7471.     }

  7472. #endif

  7473.     return -1; //not reached

  7474. }

  7475. 

  7476. static int decode_unregistered_user_data(H264Context *h, int size){

  7477.     MpegEncContext * const s = &h->s;

  7478.     uint8_t user_data[16+256];

  7479.     int e, build, i;

  7480. 

  7481.     if(size<16)

  7482.         return -1;

  7483. 

  7484.     for(i=0; i<sizeof(user_data)-1 && i<size; i++){

  7485.         user_data[i]= get_bits(&s->gb, 8);

  7486.     }

  7487. 

  7488.     user_data[i]= 0;

  7489.     e= sscanf(user_data+16, "x264 - core %d"/*%s - H.264/MPEG-4 AVC codec - Copyleft 2005 - http://www.videolan.org/x264.html*/, &build);

  7490.     if(e==1 && build>=0)

  7491.         h->x264_build= build;

  7492. 

  7493.     if(s->avctx->debug & FF_DEBUG_BUGS)

  7494.         av_log(s->avctx, AV_LOG_DEBUG, "user data:\"%s\"\n", user_data+16);

  7495. 

  7496.     for(; i<size; i++)

  7497.         skip_bits(&s->gb, 8);

  7498. 

  7499.     return 0;

  7500. }

  7501. 

  7502. static int decode_sei(H264Context *h){

  7503.     MpegEncContext * const s = &h->s;

  7504. 

  7505.     while(get_bits_count(&s->gb) + 16 < s->gb.size_in_bits){

  7506.         int size, type;

  7507. 

  7508.         type=0;

  7509.         do{

  7510.             type+= show_bits(&s->gb, 8);

  7511.         }while(get_bits(&s->gb, 8) == 255);

  7512. 

  7513.         size=0;

  7514.         do{

  7515.             size+= show_bits(&s->gb, 8);

  7516.         }while(get_bits(&s->gb, 8) == 255);

  7517. 

  7518.         switch(type){

  7519.         case 5:

  7520.             if(decode_unregistered_user_data(h, size) < 0)

  7521.                 return -1;

  7522.             break;

  7523.         default:

  7524.             skip_bits(&s->gb, 8*size);

  7525.         }

  7526. 

  7527.         //FIXME check bits here

  7528.         align_get_bits(&s->gb);

  7529.     }

  7530. 

  7531.     return 0;

  7532. }

  7533. 

  7534. static inline void decode_hrd_parameters(H264Context *h, SPS *sps){

  7535.     MpegEncContext * const s = &h->s;

  7536.     int cpb_count, i;

  7537.     cpb_count = get_ue_golomb(&s->gb) + 1;

  7538.     get_bits(&s->gb, 4); /* bit_rate_scale */

  7539.     get_bits(&s->gb, 4); /* cpb_size_scale */

  7540.     for(i=0; i<cpb_count; i++){

  7541.         get_ue_golomb(&s->gb); /* bit_rate_value_minus1 */

  7542.         get_ue_golomb(&s->gb); /* cpb_size_value_minus1 */

  7543.         get_bits1(&s->gb);     /* cbr_flag */

  7544.     }

  7545.     get_bits(&s->gb, 5); /* initial_cpb_removal_delay_length_minus1 */

  7546.     get_bits(&s->gb, 5); /* cpb_removal_delay_length_minus1 */

  7547.     get_bits(&s->gb, 5); /* dpb_output_delay_length_minus1 */

  7548.     get_bits(&s->gb, 5); /* time_offset_length */

  7549. }

  7550. 

  7551. static inline int decode_vui_parameters(H264Context *h, SPS *sps){

  7552.     MpegEncContext * const s = &h->s;

  7553.     int aspect_ratio_info_present_flag, aspect_ratio_idc;

  7554.     int nal_hrd_parameters_present_flag, vcl_hrd_parameters_present_flag;

  7555. 

  7556.     aspect_ratio_info_present_flag= get_bits1(&s->gb);

  7557. 

  7558.     if( aspect_ratio_info_present_flag ) {

  7559.         aspect_ratio_idc= get_bits(&s->gb, 8);

  7560.         if( aspect_ratio_idc == EXTENDED_SAR ) {

  7561.             sps->sar.num= get_bits(&s->gb, 16);

  7562.             sps->sar.den= get_bits(&s->gb, 16);

  7563.         }else if(aspect_ratio_idc < 14){

  7564.             sps->sar=  pixel_aspect[aspect_ratio_idc];

  7565.         }else{

  7566.             av_log(h->s.avctx, AV_LOG_ERROR, "illegal aspect ratio\n");

  7567.             return -1;

  7568.         }

  7569.     }else{

  7570.         sps->sar.num=

  7571.         sps->sar.den= 0;

  7572.     }

  7573. //            s->avctx->aspect_ratio= sar_width*s->width / (float)(s->height*sar_height);

  7574. 

  7575.     if(get_bits1(&s->gb)){      /* overscan_info_present_flag */

  7576.         get_bits1(&s->gb);      /* overscan_appropriate_flag */

  7577.     }

  7578. 

  7579.     if(get_bits1(&s->gb)){      /* video_signal_type_present_flag */

  7580.         get_bits(&s->gb, 3);    /* video_format */

  7581.         get_bits1(&s->gb);      /* video_full_range_flag */

  7582.         if(get_bits1(&s->gb)){  /* colour_description_present_flag */

  7583.             get_bits(&s->gb, 8); /* colour_primaries */

  7584.             get_bits(&s->gb, 8); /* transfer_characteristics */

  7585.             get_bits(&s->gb, 8); /* matrix_coefficients */

  7586.         }

  7587.     }

  7588. 

  7589.     if(get_bits1(&s->gb)){      /* chroma_location_info_present_flag */

  7590.         get_ue_golomb(&s->gb);  /* chroma_sample_location_type_top_field */

  7591.         get_ue_golomb(&s->gb);  /* chroma_sample_location_type_bottom_field */

  7592.     }

  7593. 

  7594.     sps->timing_info_present_flag = get_bits1(&s->gb);

  7595.     if(sps->timing_info_present_flag){

  7596.         sps->num_units_in_tick = get_bits_long(&s->gb, 32);

  7597.         sps->time_scale = get_bits_long(&s->gb, 32);

  7598.         sps->fixed_frame_rate_flag = get_bits1(&s->gb);

  7599.     }

  7600. 

  7601.     nal_hrd_parameters_present_flag = get_bits1(&s->gb);

  7602.     if(nal_hrd_parameters_present_flag)

  7603.         decode_hrd_parameters(h, sps);

  7604.     vcl_hrd_parameters_present_flag = get_bits1(&s->gb);

  7605.     if(vcl_hrd_parameters_present_flag)

  7606.         decode_hrd_parameters(h, sps);

  7607.     if(nal_hrd_parameters_present_flag || vcl_hrd_parameters_present_flag)

  7608.         get_bits1(&s->gb);     /* low_delay_hrd_flag */

  7609.     get_bits1(&s->gb);         /* pic_struct_present_flag */

  7610. 

  7611.     sps->bitstream_restriction_flag = get_bits1(&s->gb);

  7612.     if(sps->bitstream_restriction_flag){

  7613.         get_bits1(&s->gb);     /* motion_vectors_over_pic_boundaries_flag */

  7614.         get_ue_golomb(&s->gb); /* max_bytes_per_pic_denom */

  7615.         get_ue_golomb(&s->gb); /* max_bits_per_mb_denom */

  7616.         get_ue_golomb(&s->gb); /* log2_max_mv_length_horizontal */

  7617.         get_ue_golomb(&s->gb); /* log2_max_mv_length_vertical */

  7618.         sps->num_reorder_frames = get_ue_golomb(&s->gb);

  7619.         get_ue_golomb(&s->gb); /* max_dec_frame_buffering */

  7620.     }

  7621. 

  7622.     return 0;

  7623. }

  7624. 

  7625. static void decode_scaling_list(H264Context *h, uint8_t *factors, int size,

  7626.                                 const uint8_t *jvt_list, const uint8_t *fallback_list){

  7627.     MpegEncContext * const s = &h->s;

  7628.     int i, last = 8, next = 8;

  7629.     const uint8_t *scan = size == 16 ? zigzag_scan : zigzag_scan8x8;

  7630.     if(!get_bits1(&s->gb)) /* matrix not written, we use the predicted one */

  7631.         memcpy(factors, fallback_list, size*sizeof(uint8_t));

  7632.     else

  7633.     for(i=0;i<size;i++){

  7634.         if(next)

  7635.             next = (last + get_se_golomb(&s->gb)) & 0xff;

  7636.         if(!i && !next){ /* matrix not written, we use the preset one */

  7637.             memcpy(factors, jvt_list, size*sizeof(uint8_t));

  7638.             break;

  7639.         }

  7640.         last = factors[scan[i]] = next ? next : last;

  7641.     }

  7642. }

  7643. 

  7644. static void decode_scaling_matrices(H264Context *h, SPS *sps, PPS *pps, int is_sps,

  7645.                                    uint8_t (*scaling_matrix4)[16], uint8_t (*scaling_matrix8)[64]){

  7646.     MpegEncContext * const s = &h->s;

  7647.     int fallback_sps = !is_sps && sps->scaling_matrix_present;

  7648.     const uint8_t *fallback[4] = {

  7649.         fallback_sps ? sps->scaling_matrix4[0] : default_scaling4[0],

  7650.         fallback_sps ? sps->scaling_matrix4[3] : default_scaling4[1],

  7651.         fallback_sps ? sps->scaling_matrix8[0] : default_scaling8[0],

  7652.         fallback_sps ? sps->scaling_matrix8[1] : default_scaling8[1]

  7653.     };

  7654.     if(get_bits1(&s->gb)){

  7655.         sps->scaling_matrix_present |= is_sps;

  7656.         decode_scaling_list(h,scaling_matrix4[0],16,default_scaling4[0],fallback[0]); // Intra, Y

  7657.         decode_scaling_list(h,scaling_matrix4[1],16,default_scaling4[0],scaling_matrix4[0]); // Intra, Cr

  7658.         decode_scaling_list(h,scaling_matrix4[2],16,default_scaling4[0],scaling_matrix4[1]); // Intra, Cb

  7659.         decode_scaling_list(h,scaling_matrix4[3],16,default_scaling4[1],fallback[1]); // Inter, Y

  7660.         decode_scaling_list(h,scaling_matrix4[4],16,default_scaling4[1],scaling_matrix4[3]); // Inter, Cr

  7661.         decode_scaling_list(h,scaling_matrix4[5],16,default_scaling4[1],scaling_matrix4[4]); // Inter, Cb

  7662.         if(is_sps || pps->transform_8x8_mode){

  7663.             decode_scaling_list(h,scaling_matrix8[0],64,default_scaling8[0],fallback[2]);  // Intra, Y

  7664.             decode_scaling_list(h,scaling_matrix8[1],64,default_scaling8[1],fallback[3]);  // Inter, Y

  7665.         }

  7666.     } else if(fallback_sps) {

  7667.         memcpy(scaling_matrix4, sps->scaling_matrix4, 6*16*sizeof(uint8_t));

  7668.         memcpy(scaling_matrix8, sps->scaling_matrix8, 2*64*sizeof(uint8_t));

  7669.     }

  7670. }

  7671. 

  7672. static inline int decode_seq_parameter_set(H264Context *h){

  7673.     MpegEncContext * const s = &h->s;

  7674.     int profile_idc, level_idc;

  7675.     int sps_id, i;

  7676.     SPS *sps;

  7677. 

  7678.     profile_idc= get_bits(&s->gb, 8);

  7679.     get_bits1(&s->gb);   //constraint_set0_flag

  7680.     get_bits1(&s->gb);   //constraint_set1_flag

  7681.     get_bits1(&s->gb);   //constraint_set2_flag

  7682.     get_bits1(&s->gb);   //constraint_set3_flag

  7683.     get_bits(&s->gb, 4); // reserved

  7684.     level_idc= get_bits(&s->gb, 8);

  7685.     sps_id= get_ue_golomb(&s->gb);

  7686. 

  7687.     sps= &h->sps_buffer[ sps_id ];

  7688.     sps->profile_idc= profile_idc;

  7689.     sps->level_idc= level_idc;

  7690. 

  7691.     if(sps->profile_idc >= 100){ //high profile

  7692.         if(get_ue_golomb(&s->gb) == 3) //chroma_format_idc

  7693.             get_bits1(&s->gb);  //residual_color_transform_flag

  7694.         get_ue_golomb(&s->gb);  //bit_depth_luma_minus8

  7695.         get_ue_golomb(&s->gb);  //bit_depth_chroma_minus8

  7696.         sps->transform_bypass = get_bits1(&s->gb);

  7697.         decode_scaling_matrices(h, sps, NULL, 1, sps->scaling_matrix4, sps->scaling_matrix8);

  7698.     }else

  7699.         sps->scaling_matrix_present = 0;

  7700. 

  7701.     sps->log2_max_frame_num= get_ue_golomb(&s->gb) + 4;

  7702.     sps->poc_type= get_ue_golomb(&s->gb);

  7703. 

  7704.     if(sps->poc_type == 0){ //FIXME #define

  7705.         sps->log2_max_poc_lsb= get_ue_golomb(&s->gb) + 4;

  7706.     } else if(sps->poc_type == 1){//FIXME #define

  7707.         sps->delta_pic_order_always_zero_flag= get_bits1(&s->gb);

  7708.         sps->offset_for_non_ref_pic= get_se_golomb(&s->gb);

  7709.         sps->offset_for_top_to_bottom_field= get_se_golomb(&s->gb);

  7710.         sps->poc_cycle_length= get_ue_golomb(&s->gb);

  7711. 

  7712.         for(i=0; i<sps->poc_cycle_length; i++)

  7713.             sps->offset_for_ref_frame[i]= get_se_golomb(&s->gb);

  7714.     }

  7715.     if(sps->poc_type > 2){

  7716.         av_log(h->s.avctx, AV_LOG_ERROR, "illegal POC type %d\n", sps->poc_type);

  7717.         return -1;

  7718.     }

  7719. 

  7720.     sps->ref_frame_count= get_ue_golomb(&s->gb);

  7721.     if(sps->ref_frame_count > MAX_PICTURE_COUNT-2){

  7722.         av_log(h->s.avctx, AV_LOG_ERROR, "too many reference frames\n");

  7723.     }

  7724.     sps->gaps_in_frame_num_allowed_flag= get_bits1(&s->gb);

  7725.     sps->mb_width= get_ue_golomb(&s->gb) + 1;

  7726.     sps->mb_height= get_ue_golomb(&s->gb) + 1;

  7727.     if((unsigned)sps->mb_width >= INT_MAX/16 || (unsigned)sps->mb_height >= INT_MAX/16 ||

  7728.        avcodec_check_dimensions(NULL, 16*sps->mb_width, 16*sps->mb_height))

  7729.         return -1;

  7730. 

  7731.     sps->frame_mbs_only_flag= get_bits1(&s->gb);

  7732.     if(!sps->frame_mbs_only_flag)

  7733.         sps->mb_aff= get_bits1(&s->gb);

  7734.     else

  7735.         sps->mb_aff= 0;

  7736. 

  7737.     sps->direct_8x8_inference_flag= get_bits1(&s->gb);

  7738. 

  7739. #ifndef ALLOW_INTERLACE

  7740.     if(sps->mb_aff)

  7741.         av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF support not included; enable it at compile-time.\n");

  7742. #endif

  7743.     if(!sps->direct_8x8_inference_flag && sps->mb_aff)

  7744.         av_log(h->s.avctx, AV_LOG_ERROR, "MBAFF + !direct_8x8_inference is not implemented\n");

  7745. 

  7746.     sps->crop= get_bits1(&s->gb);

  7747.     if(sps->crop){

  7748.         sps->crop_left  = get_ue_golomb(&s->gb);

  7749.         sps->crop_right = get_ue_golomb(&s->gb);

  7750.         sps->crop_top   = get_ue_golomb(&s->gb);

  7751.         sps->crop_bottom= get_ue_golomb(&s->gb);

  7752.         if(sps->crop_left || sps->crop_top){

  7753.             av_log(h->s.avctx, AV_LOG_ERROR, "insane cropping not completely supported, this could look slightly wrong ...\n");

  7754.         }

  7755.     }else{

  7756.         sps->crop_left  =

  7757.         sps->crop_right =

  7758.         sps->crop_top   =

  7759.         sps->crop_bottom= 0;

  7760.     }

  7761. 

  7762.     sps->vui_parameters_present_flag= get_bits1(&s->gb);

  7763.     if( sps->vui_parameters_present_flag )

  7764.         decode_vui_parameters(h, sps);

  7765. 

  7766.     if(s->avctx->debug&FF_DEBUG_PICT_INFO){

  7767.         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",

  7768.                sps_id, sps->profile_idc, sps->level_idc,

  7769.                sps->poc_type,

  7770.                sps->ref_frame_count,

  7771.                sps->mb_width, sps->mb_height,

  7772.                sps->frame_mbs_only_flag ? "FRM" : (sps->mb_aff ? "MB-AFF" : "PIC-AFF"),

  7773.                sps->direct_8x8_inference_flag ? "8B8" : "",

  7774.                sps->crop_left, sps->crop_right,

  7775.                sps->crop_top, sps->crop_bottom,

  7776.                sps->vui_parameters_present_flag ? "VUI" : ""

  7777.                );

  7778.     }

  7779.     return 0;

  7780. }

  7781. 

  7782. static inline int decode_picture_parameter_set(H264Context *h, int bit_length){

  7783.     MpegEncContext * const s = &h->s;

  7784.     int pps_id= get_ue_golomb(&s->gb);

  7785.     PPS *pps= &h->pps_buffer[pps_id];

  7786. 

  7787.     pps->sps_id= get_ue_golomb(&s->gb);

  7788.     pps->cabac= get_bits1(&s->gb);

  7789.     pps->pic_order_present= get_bits1(&s->gb);

  7790.     pps->slice_group_count= get_ue_golomb(&s->gb) + 1;

  7791.     if(pps->slice_group_count > 1 ){

  7792.         pps->mb_slice_group_map_type= get_ue_golomb(&s->gb);

  7793.         av_log(h->s.avctx, AV_LOG_ERROR, "FMO not supported\n");

  7794.         switch(pps->mb_slice_group_map_type){

  7795.         case 0:

  7796. #if 0

  7797. |   for( i = 0; i <= num_slice_groups_minus1; i++ ) |   |        |

  7798. |    run_length[ i ]                                |1  |ue(v)   |

  7799. #endif

  7800.             break;

  7801.         case 2:

  7802. #if 0

  7803. |   for( i = 0; i < num_slice_groups_minus1; i++ )  |   |        |

  7804. |{                                                  |   |        |

  7805. |    top_left_mb[ i ]                               |1  |ue(v)   |

  7806. |    bottom_right_mb[ i ]                           |1  |ue(v)   |

  7807. |   }                                               |   |        |

  7808. #endif

  7809.             break;

  7810.         case 3:

  7811.         case 4:

  7812.         case 5:

  7813. #if 0

  7814. |   slice_group_change_direction_flag               |1  |u(1)    |

  7815. |   slice_group_change_rate_minus1                  |1  |ue(v)   |

  7816. #endif

  7817.             break;

  7818.         case 6:

  7819. #if 0

  7820. |   slice_group_id_cnt_minus1                       |1  |ue(v)   |

  7821. |   for( i = 0; i <= slice_group_id_cnt_minus1; i++ |   |        |

  7822. |)                                                  |   |        |

  7823. |    slice_group_id[ i ]                            |1  |u(v)    |

  7824. #endif

  7825.             break;

  7826.         }

  7827.     }

  7828.     pps->ref_count[0]= get_ue_golomb(&s->gb) + 1;

  7829.     pps->ref_count[1]= get_ue_golomb(&s->gb) + 1;

  7830.     if(pps->ref_count[0] > 32 || pps->ref_count[1] > 32){

  7831.         av_log(h->s.avctx, AV_LOG_ERROR, "reference overflow (pps)\n");

  7832.         return -1;

  7833.     }

  7834. 

  7835.     pps->weighted_pred= get_bits1(&s->gb);

  7836.     pps->weighted_bipred_idc= get_bits(&s->gb, 2);

  7837.     pps->init_qp= get_se_golomb(&s->gb) + 26;

  7838.     pps->init_qs= get_se_golomb(&s->gb) + 26;

  7839.     pps->chroma_qp_index_offset= get_se_golomb(&s->gb);

  7840.     pps->deblocking_filter_parameters_present= get_bits1(&s->gb);

  7841.     pps->constrained_intra_pred= get_bits1(&s->gb);

  7842.     pps->redundant_pic_cnt_present = get_bits1(&s->gb);

  7843. 

  7844.     pps->transform_8x8_mode= 0;

  7845.     h->dequant_coeff_pps= -1; //contents of sps/pps can change even if id doesn't, so reinit

  7846.     memset(pps->scaling_matrix4, 16, 6*16*sizeof(uint8_t));

  7847.     memset(pps->scaling_matrix8, 16, 2*64*sizeof(uint8_t));

  7848. 

  7849.     if(get_bits_count(&s->gb) < bit_length){

  7850.         pps->transform_8x8_mode= get_bits1(&s->gb);

  7851.         decode_scaling_matrices(h, &h->sps_buffer[pps->sps_id], pps, 0, pps->scaling_matrix4, pps->scaling_matrix8);

  7852.         get_se_golomb(&s->gb);  //second_chroma_qp_index_offset

  7853.     }

  7854. 

  7855.     if(s->avctx->debug&FF_DEBUG_PICT_INFO){

  7856.         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 %s\n",

  7857.                pps_id, pps->sps_id,

  7858.                pps->cabac ? "CABAC" : "CAVLC",

  7859.                pps->slice_group_count,

  7860.                pps->ref_count[0], pps->ref_count[1],

  7861.                pps->weighted_pred ? "weighted" : "",

  7862.                pps->init_qp, pps->init_qs, pps->chroma_qp_index_offset,

  7863.                pps->deblocking_filter_parameters_present ? "LPAR" : "",

  7864.                pps->constrained_intra_pred ? "CONSTR" : "",

  7865.                pps->redundant_pic_cnt_present ? "REDU" : "",

  7866.                pps->transform_8x8_mode ? "8x8DCT" : ""

  7867.                );

  7868.     }

  7869. 

  7870.     return 0;

  7871. }

  7872. 

  7873. /**

  7874.  * finds the end of the current frame in the bitstream.

  7875.  * @return the position of the first byte of the next frame, or -1

  7876.  */

  7877. static int find_frame_end(H264Context *h, const uint8_t *buf, int buf_size){

  7878.     int i;

  7879.     uint32_t state;

  7880.     ParseContext *pc = &(h->s.parse_context);

  7881. //printf("first %02X%02X%02X%02X\n", buf[0], buf[1],buf[2],buf[3]);

  7882. //    mb_addr= pc->mb_addr - 1;

  7883.     state= pc->state;

  7884.     for(i=0; i<=buf_size; i++){

  7885.         if((state&0xFFFFFF1F) == 0x101 || (state&0xFFFFFF1F) == 0x102 || (state&0xFFFFFF1F) == 0x105){

  7886.             tprintf("find_frame_end new startcode = %08x, frame_start_found = %d, pos = %d\n", state, pc->frame_start_found, i);

  7887.             if(pc->frame_start_found){

  7888.                 // If there isn't one more byte in the buffer

  7889.                 // the test on first_mb_in_slice cannot be done yet

  7890.                 // do it at next call.

  7891.                 if (i >= buf_size) break;

  7892.                 if (buf[i] & 0x80) {

  7893.                     // first_mb_in_slice is 0, probably the first nal of a new

  7894.                     // slice

  7895.                     tprintf("find_frame_end frame_end_found, state = %08x, pos = %d\n", state, i);

  7896.                     pc->state=-1;

  7897.                     pc->frame_start_found= 0;

  7898.                     return i-4;

  7899.                 }

  7900.             }

  7901.             pc->frame_start_found = 1;

  7902.         }

  7903.         if((state&0xFFFFFF1F) == 0x107 || (state&0xFFFFFF1F) == 0x108 || (state&0xFFFFFF1F) == 0x109){

  7904.            if(pc->frame_start_found){

  7905.                 pc->state=-1;

  7906.                 pc->frame_start_found= 0;

  7907.                 return i-4;

  7908.            }

  7909.         }

  7910.         if (i<buf_size)

  7911.             state= (state<<8) | buf[i];

  7912.     }

  7913. 

  7914.     pc->state= state;

  7915.     return END_NOT_FOUND;

  7916. }

  7917. 

  7918. #ifdef CONFIG_H264_PARSER

  7919. static int h264_parse(AVCodecParserContext *s,

  7920.                       AVCodecContext *avctx,

  7921.                       uint8_t **poutbuf, int *poutbuf_size,

  7922.                       const uint8_t *buf, int buf_size)

  7923. {

  7924.     H264Context *h = s->priv_data;

  7925.     ParseContext *pc = &h->s.parse_context;

  7926.     int next;

  7927. 

  7928.     next= find_frame_end(h, buf, buf_size);

  7929. 

  7930.     if (ff_combine_frame(pc, next, (uint8_t **)&buf, &buf_size) < 0) {

  7931.         *poutbuf = NULL;

  7932.         *poutbuf_size = 0;

  7933.         return buf_size;

  7934.     }

  7935. 

  7936.     *poutbuf = (uint8_t *)buf;

  7937.     *poutbuf_size = buf_size;

  7938.     return next;

  7939. }

  7940. 

  7941. static int h264_split(AVCodecContext *avctx,

  7942.                       const uint8_t *buf, int buf_size)

  7943. {

  7944.     int i;

  7945.     uint32_t state = -1;

  7946.     int has_sps= 0;

  7947. 

  7948.     for(i=0; i<=buf_size; i++){

  7949.         if((state&0xFFFFFF1F) == 0x107)

  7950.             has_sps=1;

  7951. /*        if((state&0xFFFFFF1F) == 0x101 || (state&0xFFFFFF1F) == 0x102 || (state&0xFFFFFF1F) == 0x105){

  7952.         }*/

  7953.         if((state&0xFFFFFF00) == 0x100 && (state&0xFFFFFF1F) != 0x107 && (state&0xFFFFFF1F) != 0x108 && (state&0xFFFFFF1F) != 0x109){

  7954.             if(has_sps){

  7955.                 while(i>4 && buf[i-5]==0) i--;

  7956.                 return i-4;

  7957.             }

  7958.         }

  7959.         if (i<buf_size)

  7960.             state= (state<<8) | buf[i];

  7961.     }

  7962.     return 0;

  7963. }

  7964. #endif /* CONFIG_H264_PARSER */

  7965. 

  7966. static int decode_nal_units(H264Context *h, uint8_t *buf, int buf_size){

  7967.     MpegEncContext * const s = &h->s;

  7968.     AVCodecContext * const avctx= s->avctx;

  7969.     int buf_index=0;

  7970. #if 0

  7971.     int i;

  7972.     for(i=0; i<50; i++){

  7973.         av_log(NULL, AV_LOG_ERROR,"%02X ", buf[i]);

  7974.     }

  7975. #endif

  7976.     h->slice_num = 0;

  7977.     s->current_picture_ptr= NULL;

  7978.     for(;;){

  7979.         int consumed;

  7980.         int dst_length;

  7981.         int bit_length;

  7982.         uint8_t *ptr;

  7983.         int i, nalsize = 0;

  7984. 

  7985.       if(h->is_avc) {

  7986.         if(buf_index >= buf_size) break;

  7987.         nalsize = 0;

  7988.         for(i = 0; i < h->nal_length_size; i++)

  7989.             nalsize = (nalsize << 8) | buf[buf_index++];

  7990.         if(nalsize <= 1){

  7991.             if(nalsize == 1){

  7992.                 buf_index++;

  7993.                 continue;

  7994.             }else{

  7995.                 av_log(h->s.avctx, AV_LOG_ERROR, "AVC: nal size %d\n", nalsize);

  7996.                 break;

  7997.             }

  7998.         }

  7999.       } else {

  8000.         // start code prefix search

  8001.         for(; buf_index + 3 < buf_size; buf_index++){

  8002.             // this should allways succeed in the first iteration

  8003.             if(buf[buf_index] == 0 && buf[buf_index+1] == 0 && buf[buf_index+2] == 1)

  8004.                 break;

  8005.         }

  8006. 

  8007.         if(buf_index+3 >= buf_size) break;

  8008. 

  8009.         buf_index+=3;

  8010.       }

  8011. 

  8012.         ptr= decode_nal(h, buf + buf_index, &dst_length, &consumed, h->is_avc ? nalsize : buf_size - buf_index);

  8013.         while(ptr[dst_length - 1] == 0 && dst_length > 1)

  8014.             dst_length--;

  8015.         bit_length= 8*dst_length - decode_rbsp_trailing(ptr + dst_length - 1);

  8016. 

  8017.         if(s->avctx->debug&FF_DEBUG_STARTCODE){

  8018.             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);

  8019.         }

  8020. 

  8021.         if (h->is_avc && (nalsize != consumed))

  8022.             av_log(h->s.avctx, AV_LOG_ERROR, "AVC: Consumed only %d bytes instead of %d\n", consumed, nalsize);

  8023. 

  8024.         buf_index += consumed;

  8025. 

  8026.         if(  (s->hurry_up == 1 && h->nal_ref_idc  == 0) //FIXME dont discard SEI id

  8027.            ||(avctx->skip_frame >= AVDISCARD_NONREF && h->nal_ref_idc  == 0))

  8028.             continue;

  8029. 

  8030.         switch(h->nal_unit_type){

  8031.         case NAL_IDR_SLICE:

  8032.             idr(h); //FIXME ensure we don't loose some frames if there is reordering

  8033.         case NAL_SLICE:

  8034.             init_get_bits(&s->gb, ptr, bit_length);

  8035.             h->intra_gb_ptr=

  8036.             h->inter_gb_ptr= &s->gb;

  8037.             s->data_partitioning = 0;

  8038. 

  8039.             if(decode_slice_header(h) < 0){

  8040.                 av_log(h->s.avctx, AV_LOG_ERROR, "decode_slice_header error\n");

  8041.                 break;

  8042.             }

  8043.             s->current_picture_ptr->key_frame= (h->nal_unit_type == NAL_IDR_SLICE);

  8044.             if(h->redundant_pic_count==0 && s->hurry_up < 5

  8045.                && (avctx->skip_frame < AVDISCARD_NONREF || h->nal_ref_idc)

  8046.                && (avctx->skip_frame < AVDISCARD_BIDIR  || h->slice_type!=B_TYPE)

  8047.                && (avctx->skip_frame < AVDISCARD_NONKEY || h->slice_type==I_TYPE)

  8048.                && avctx->skip_frame < AVDISCARD_ALL)

  8049.                 decode_slice(h);

  8050.             break;

  8051.         case NAL_DPA:

  8052.             init_get_bits(&s->gb, ptr, bit_length);

  8053.             h->intra_gb_ptr=

  8054.             h->inter_gb_ptr= NULL;

  8055.             s->data_partitioning = 1;

  8056. 

  8057.             if(decode_slice_header(h) < 0){

  8058.                 av_log(h->s.avctx, AV_LOG_ERROR, "decode_slice_header error\n");

  8059.             }

  8060.             break;

  8061.         case NAL_DPB:

  8062.             init_get_bits(&h->intra_gb, ptr, bit_length);

  8063.             h->intra_gb_ptr= &h->intra_gb;

  8064.             break;

  8065.         case NAL_DPC:

  8066.             init_get_bits(&h->inter_gb, ptr, bit_length);

  8067.             h->inter_gb_ptr= &h->inter_gb;

  8068. 

  8069.             if(h->redundant_pic_count==0 && h->intra_gb_ptr && s->data_partitioning

  8070.                && s->hurry_up < 5

  8071.                && (avctx->skip_frame < AVDISCARD_NONREF || h->nal_ref_idc)

  8072.                && (avctx->skip_frame < AVDISCARD_BIDIR  || h->slice_type!=B_TYPE)

  8073.                && (avctx->skip_frame < AVDISCARD_NONKEY || h->slice_type==I_TYPE)

  8074.                && avctx->skip_frame < AVDISCARD_ALL)

  8075.                 decode_slice(h);

  8076.             break;

  8077.         case NAL_SEI:

  8078.             init_get_bits(&s->gb, ptr, bit_length);

  8079.             decode_sei(h);

  8080.             break;

  8081.         case NAL_SPS:

  8082.             init_get_bits(&s->gb, ptr, bit_length);

  8083.             decode_seq_parameter_set(h);

  8084. 

  8085.             if(s->flags& CODEC_FLAG_LOW_DELAY)

  8086.                 s->low_delay=1;

  8087. 

  8088.             if(avctx->has_b_frames < 2)

  8089.                 avctx->has_b_frames= !s->low_delay;

  8090.             break;

  8091.         case NAL_PPS:

  8092.             init_get_bits(&s->gb, ptr, bit_length);

  8093. 

  8094.             decode_picture_parameter_set(h, bit_length);

  8095. 

  8096.             break;

  8097.         case NAL_AUD:

  8098.         case NAL_END_SEQUENCE:

  8099.         case NAL_END_STREAM:

  8100.         case NAL_FILLER_DATA:

  8101.         case NAL_SPS_EXT:

  8102.         case NAL_AUXILIARY_SLICE:

  8103.             break;

  8104.         default:

  8105.             av_log(avctx, AV_LOG_ERROR, "Unknown NAL code: %d\n", h->nal_unit_type);

  8106.         }

  8107.     }

  8108. 

  8109.     if(!s->current_picture_ptr) return buf_index; //no frame

  8110. 

  8111.     s->current_picture_ptr->qscale_type= FF_QSCALE_TYPE_H264;

  8112.     s->current_picture_ptr->pict_type= s->pict_type;

  8113. 

  8114.     h->prev_frame_num_offset= h->frame_num_offset;

  8115.     h->prev_frame_num= h->frame_num;

  8116.     if(s->current_picture_ptr->reference){

  8117.         h->prev_poc_msb= h->poc_msb;

  8118.         h->prev_poc_lsb= h->poc_lsb;

  8119.     }

  8120.     if(s->current_picture_ptr->reference)

  8121.         execute_ref_pic_marking(h, h->mmco, h->mmco_index);

  8122. 

  8123.     ff_er_frame_end(s);

  8124. 

  8125.     MPV_frame_end(s);

  8126. 

  8127.     return buf_index;

  8128. }

  8129. 

  8130. /**

  8131.  * returns the number of bytes consumed for building the current frame

  8132.  */

  8133. static int get_consumed_bytes(MpegEncContext *s, int pos, int buf_size){

  8134.     if(s->flags&CODEC_FLAG_TRUNCATED){

  8135.         pos -= s->parse_context.last_index;

  8136.         if(pos<0) pos=0; // FIXME remove (unneeded?)

  8137. 

  8138.         return pos;

  8139.     }else{

  8140.         if(pos==0) pos=1; //avoid infinite loops (i doubt thats needed but ...)

  8141.         if(pos+10>buf_size) pos=buf_size; // oops ;)

  8142. 

  8143.         return pos;

  8144.     }

  8145. }

  8146. 

  8147. static int decode_frame(AVCodecContext *avctx,

  8148.                              void *data, int *data_size,

  8149.                              uint8_t *buf, int buf_size)

  8150. {

  8151.     H264Context *h = avctx->priv_data;

  8152.     MpegEncContext *s = &h->s;

  8153.     AVFrame *pict = data;

  8154.     int buf_index;

  8155. 

  8156.     s->flags= avctx->flags;

  8157.     s->flags2= avctx->flags2;

  8158. 

  8159.    /* no supplementary picture */

  8160.     if (buf_size == 0) {

  8161.         return 0;

  8162.     }

  8163. 

  8164.     if(s->flags&CODEC_FLAG_TRUNCATED){

  8165.         int next= find_frame_end(h, buf, buf_size);

  8166. 

  8167.         if( ff_combine_frame(&s->parse_context, next, &buf, &buf_size) < 0 )

  8168.             return buf_size;

  8169. //printf("next:%d buf_size:%d last_index:%d\n", next, buf_size, s->parse_context.last_index);

  8170.     }

  8171. 

  8172.     if(h->is_avc && !h->got_avcC) {

  8173.         int i, cnt, nalsize;

  8174.         unsigned char *p = avctx->extradata;

  8175.         if(avctx->extradata_size < 7) {

  8176.             av_log(avctx, AV_LOG_ERROR, "avcC too short\n");

  8177.             return -1;

  8178.         }

  8179.         if(*p != 1) {

  8180.             av_log(avctx, AV_LOG_ERROR, "Unknown avcC version %d\n", *p);

  8181.             return -1;

  8182.         }

  8183.         /* sps and pps in the avcC always have length coded with 2 bytes,

  8184.            so put a fake nal_length_size = 2 while parsing them */

  8185.         h->nal_length_size = 2;

  8186.         // Decode sps from avcC

  8187.         cnt = *(p+5) & 0x1f; // Number of sps

  8188.         p += 6;

  8189.         for (i = 0; i < cnt; i++) {

  8190.             nalsize = BE_16(p) + 2;

  8191.             if(decode_nal_units(h, p, nalsize) < 0) {

  8192.                 av_log(avctx, AV_LOG_ERROR, "Decoding sps %d from avcC failed\n", i);

  8193.                 return -1;

  8194.             }

  8195.             p += nalsize;

  8196.         }

  8197.         // Decode pps from avcC

  8198.         cnt = *(p++); // Number of pps

  8199.         for (i = 0; i < cnt; i++) {

  8200.             nalsize = BE_16(p) + 2;

  8201.             if(decode_nal_units(h, p, nalsize)  != nalsize) {

  8202.                 av_log(avctx, AV_LOG_ERROR, "Decoding pps %d from avcC failed\n", i);

  8203.                 return -1;

  8204.             }

  8205.             p += nalsize;

  8206.         }

  8207.         // Now store right nal length size, that will be use to parse all other nals

  8208.         h->nal_length_size = ((*(((char*)(avctx->extradata))+4))&0x03)+1;

  8209.         // Do not reparse avcC

  8210.         h->got_avcC = 1;

  8211.     }

  8212. 

  8213.     if(!h->is_avc && s->avctx->extradata_size && s->picture_number==0){

  8214.         if(decode_nal_units(h, s->avctx->extradata, s->avctx->extradata_size) < 0)

  8215.             return -1;

  8216.     }

  8217. 

  8218.     buf_index=decode_nal_units(h, buf, buf_size);

  8219.     if(buf_index < 0)

  8220.         return -1;

  8221. 

  8222.     //FIXME do something with unavailable reference frames

  8223. 

  8224. //    if(ret==FRAME_SKIPPED) return get_consumed_bytes(s, buf_index, buf_size);

  8225.     if(!s->current_picture_ptr){

  8226.         av_log(h->s.avctx, AV_LOG_DEBUG, "error, NO frame\n");

  8227.         return -1;

  8228.     }

  8229. 

  8230.     {

  8231.         Picture *out = s->current_picture_ptr;

  8232. #if 0 //decode order

  8233.         *data_size = sizeof(AVFrame);

  8234. #else

  8235.         /* Sort B-frames into display order */

  8236.         Picture *cur = s->current_picture_ptr;

  8237.         Picture *prev = h->delayed_output_pic;

  8238.         int i, pics, cross_idr, out_of_order, out_idx;

  8239. 

  8240.         if(h->sps.bitstream_restriction_flag

  8241.            && s->avctx->has_b_frames < h->sps.num_reorder_frames){

  8242.             s->avctx->has_b_frames = h->sps.num_reorder_frames;

  8243.             s->low_delay = 0;

  8244.         }

  8245. 

  8246.         pics = 0;

  8247.         while(h->delayed_pic[pics]) pics++;

  8248.         h->delayed_pic[pics++] = cur;

  8249.         if(cur->reference == 0)

  8250.             cur->reference = 1;

  8251. 

  8252.         cross_idr = 0;

  8253.         for(i=0; h->delayed_pic[i]; i++)

  8254.             if(h->delayed_pic[i]->key_frame || h->delayed_pic[i]->poc==0)

  8255.                 cross_idr = 1;

  8256. 

  8257.         out = h->delayed_pic[0];

  8258.         out_idx = 0;

  8259.         for(i=1; h->delayed_pic[i] && !h->delayed_pic[i]->key_frame; i++)

  8260.             if(h->delayed_pic[i]->poc < out->poc){

  8261.                 out = h->delayed_pic[i];

  8262.                 out_idx = i;

  8263.             }

  8264. 

  8265.         out_of_order = !cross_idr && prev && out->poc < prev->poc;

  8266.         if(h->sps.bitstream_restriction_flag && s->avctx->has_b_frames >= h->sps.num_reorder_frames)

  8267.             { }

  8268.         else if(prev && pics <= s->avctx->has_b_frames)

  8269.             out = prev;

  8270.         else if((out_of_order && pics-1 == s->avctx->has_b_frames && pics < 15)

  8271.            || (s->low_delay &&

  8272.             ((!cross_idr && prev && out->poc > prev->poc + 2)

  8273.              || cur->pict_type == B_TYPE)))

  8274.         {

  8275.             s->low_delay = 0;

  8276.             s->avctx->has_b_frames++;

  8277.             out = prev;

  8278.         }

  8279.         else if(out_of_order)

  8280.             out = prev;

  8281. 

  8282.         if(out_of_order || pics > s->avctx->has_b_frames){

  8283.             for(i=out_idx; h->delayed_pic[i]; i++)

  8284.                 h->delayed_pic[i] = h->delayed_pic[i+1];

  8285.         }

  8286. 

  8287.         if(prev == out)

  8288.             *data_size = 0;

  8289.         else

  8290.             *data_size = sizeof(AVFrame);

  8291.         if(prev && prev != out && prev->reference == 1)

  8292.             prev->reference = 0;

  8293.         h->delayed_output_pic = out;

  8294. #endif

  8295. 

  8296.         if(out)

  8297.             *pict= *(AVFrame*)out;

  8298.         else

  8299.             av_log(avctx, AV_LOG_DEBUG, "no picture\n");

  8300.     }

  8301. 

  8302.     assert(pict->data[0] || !*data_size);

  8303.     ff_print_debug_info(s, pict);

  8304. //printf("out %d\n", (int)pict->data[0]);

  8305. #if 0 //?

  8306. 

  8307.     /* Return the Picture timestamp as the frame number */

  8308.     /* we substract 1 because it is added on utils.c    */

  8309.     avctx->frame_number = s->picture_number - 1;

  8310. #endif

  8311.     return get_consumed_bytes(s, buf_index, buf_size);

  8312. }

  8313. #if 0

  8314. static inline void fill_mb_avail(H264Context *h){

  8315.     MpegEncContext * const s = &h->s;

  8316.     const int mb_xy= s->mb_x + s->mb_y*s->mb_stride;

  8317. 

  8318.     if(s->mb_y){

  8319.         h->mb_avail[0]= s->mb_x                 && h->slice_table[mb_xy - s->mb_stride - 1] == h->slice_num;

  8320.         h->mb_avail[1]=                            h->slice_table[mb_xy - s->mb_stride    ] == h->slice_num;

  8321.         h->mb_avail[2]= s->mb_x+1 < s->mb_width && h->slice_table[mb_xy - s->mb_stride + 1] == h->slice_num;

  8322.     }else{

  8323.         h->mb_avail[0]=

  8324.         h->mb_avail[1]=

  8325.         h->mb_avail[2]= 0;

  8326.     }

  8327.     h->mb_avail[3]= s->mb_x && h->slice_table[mb_xy - 1] == h->slice_num;

  8328.     h->mb_avail[4]= 1; //FIXME move out

  8329.     h->mb_avail[5]= 0; //FIXME move out

  8330. }

  8331. #endif

  8332. 

  8333. #if 0 //selftest

  8334. #define COUNT 8000

  8335. #define SIZE (COUNT*40)

  8336. int main(){

  8337.     int i;

  8338.     uint8_t temp[SIZE];

  8339.     PutBitContext pb;

  8340.     GetBitContext gb;

  8341. //    int int_temp[10000];

  8342.     DSPContext dsp;

  8343.     AVCodecContext avctx;

  8344. 

  8345.     dsputil_init(&dsp, &avctx);

  8346. 

  8347.     init_put_bits(&pb, temp, SIZE);

  8348.     printf("testing unsigned exp golomb\n");

  8349.     for(i=0; i<COUNT; i++){

  8350.         START_TIMER

  8351.         set_ue_golomb(&pb, i);

  8352.         STOP_TIMER("set_ue_golomb");

  8353.     }

  8354.     flush_put_bits(&pb);

  8355. 

  8356.     init_get_bits(&gb, temp, 8*SIZE);

  8357.     for(i=0; i<COUNT; i++){

  8358.         int j, s;

  8359. 

  8360.         s= show_bits(&gb, 24);

  8361. 

  8362.         START_TIMER

  8363.         j= get_ue_golomb(&gb);

  8364.         if(j != i){

  8365.             printf("missmatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);

  8366. //            return -1;

  8367.         }

  8368.         STOP_TIMER("get_ue_golomb");

  8369.     }

  8370. 

  8371. 

  8372.     init_put_bits(&pb, temp, SIZE);

  8373.     printf("testing signed exp golomb\n");

  8374.     for(i=0; i<COUNT; i++){

  8375.         START_TIMER

  8376.         set_se_golomb(&pb, i - COUNT/2);

  8377.         STOP_TIMER("set_se_golomb");

  8378.     }

  8379.     flush_put_bits(&pb);

  8380. 

  8381.     init_get_bits(&gb, temp, 8*SIZE);

  8382.     for(i=0; i<COUNT; i++){

  8383.         int j, s;

  8384. 

  8385.         s= show_bits(&gb, 24);

  8386. 

  8387.         START_TIMER

  8388.         j= get_se_golomb(&gb);

  8389.         if(j != i - COUNT/2){

  8390.             printf("missmatch! at %d (%d should be %d) bits:%6X\n", i, j, i, s);

  8391. //            return -1;

  8392.         }

  8393.         STOP_TIMER("get_se_golomb");

  8394.     }

  8395. 

  8396.     printf("testing 4x4 (I)DCT\n");

  8397. 

  8398.     DCTELEM block[16];

  8399.     uint8_t src[16], ref[16];

  8400.     uint64_t error= 0, max_error=0;

  8401. 

  8402.     for(i=0; i<COUNT; i++){

  8403.         int j;

  8404. //        printf("%d %d %d\n", r1, r2, (r2-r1)*16);

  8405.         for(j=0; j<16; j++){

  8406.             ref[j]= random()%255;

  8407.             src[j]= random()%255;

  8408.         }

  8409. 

  8410.         h264_diff_dct_c(block, src, ref, 4);

  8411. 

  8412.         //normalize

  8413.         for(j=0; j<16; j++){

  8414. //            printf("%d ", block[j]);

  8415.             block[j]= block[j]*4;

  8416.             if(j&1) block[j]= (block[j]*4 + 2)/5;

  8417.             if(j&4) block[j]= (block[j]*4 + 2)/5;

  8418.         }

  8419. //        printf("\n");

  8420. 

  8421.         s->dsp.h264_idct_add(ref, block, 4);

  8422. /*        for(j=0; j<16; j++){

  8423.             printf("%d ", ref[j]);

  8424.         }

  8425.         printf("\n");*/

  8426. 

  8427.         for(j=0; j<16; j++){

  8428.             int diff= FFABS(src[j] - ref[j]);

  8429. 

  8430.             error+= diff*diff;

  8431.             max_error= FFMAX(max_error, diff);

  8432.         }

  8433.     }

  8434.     printf("error=%f max_error=%d\n", ((float)error)/COUNT/16, (int)max_error );

  8435. #if 0

  8436.     printf("testing quantizer\n");

  8437.     for(qp=0; qp<52; qp++){

  8438.         for(i=0; i<16; i++)

  8439.             src1_block[i]= src2_block[i]= random()%255;

  8440. 

  8441.     }

  8442. #endif

  8443.     printf("Testing NAL layer\n");

  8444. 

  8445.     uint8_t bitstream[COUNT];

  8446.     uint8_t nal[COUNT*2];

  8447.     H264Context h;

  8448.     memset(&h, 0, sizeof(H264Context));

  8449. 

  8450.     for(i=0; i<COUNT; i++){

  8451.         int zeros= i;

  8452.         int nal_length;

  8453.         int consumed;

  8454.         int out_length;

  8455.         uint8_t *out;

  8456.         int j;

  8457. 

  8458.         for(j=0; j<COUNT; j++){

  8459.             bitstream[j]= (random() % 255) + 1;

  8460.         }

  8461. 

  8462.         for(j=0; j<zeros; j++){

  8463.             int pos= random() % COUNT;

  8464.             while(bitstream[pos] == 0){

  8465.                 pos++;

  8466.                 pos %= COUNT;

  8467.             }

  8468.             bitstream[pos]=0;

  8469.         }

  8470. 

  8471.         START_TIMER

  8472. 

  8473.         nal_length= encode_nal(&h, nal, bitstream, COUNT, COUNT*2);

  8474.         if(nal_length<0){

  8475.             printf("encoding failed\n");

  8476.             return -1;

  8477.         }

  8478. 

  8479.         out= decode_nal(&h, nal, &out_length, &consumed, nal_length);

  8480. 

  8481.         STOP_TIMER("NAL")

  8482. 

  8483.         if(out_length != COUNT){

  8484.             printf("incorrect length %d %d\n", out_length, COUNT);

  8485.             return -1;

  8486.         }

  8487. 

  8488.         if(consumed != nal_length){

  8489.             printf("incorrect consumed length %d %d\n", nal_length, consumed);

  8490.             return -1;

  8491.         }

  8492. 

  8493.         if(memcmp(bitstream, out, COUNT)){

  8494.             printf("missmatch\n");

  8495.             return -1;

  8496.         }

  8497.     }

  8498. 

  8499.     printf("Testing RBSP\n");

  8500. 

  8501. 

  8502.     return 0;

  8503. }

  8504. #endif

  8505. 

  8506. 

  8507. static int decode_end(AVCodecContext *avctx)

  8508. {

  8509.     H264Context *h = avctx->priv_data;

  8510.     MpegEncContext *s = &h->s;

  8511. 

  8512.     av_freep(&h->rbsp_buffer);

  8513.     free_tables(h); //FIXME cleanup init stuff perhaps

  8514.     MPV_common_end(s);

  8515. 

  8516. //    memset(h, 0, sizeof(H264Context));

  8517. 

  8518.     return 0;

  8519. }

  8520. 

  8521. 

  8522. AVCodec h264_decoder = {

  8523.     "h264",

  8524.     CODEC_TYPE_VIDEO,

  8525.     CODEC_ID_H264,

  8526.     sizeof(H264Context),

  8527.     decode_init,

  8528.     NULL,

  8529.     decode_end,

  8530.     decode_frame,

  8531.     /*CODEC_CAP_DRAW_HORIZ_BAND |*/ CODEC_CAP_DR1 | CODEC_CAP_TRUNCATED | CODEC_CAP_DELAY,

  8532.     .flush= flush_dpb,

  8533. };

  8534. 

  8535. #ifdef CONFIG_H264_PARSER

  8536. AVCodecParser h264_parser = {

  8537.     { CODEC_ID_H264 },

  8538.     sizeof(H264Context),

  8539.     NULL,

  8540.     h264_parse,

  8541.     ff_parse_close,

  8542.     h264_split,

  8543. };

  8544. #endif

  8545. 

  8546. #include "svq3.c"