1 /*****************************************************************************
2 * common.h: misc common functions
3 *****************************************************************************
4 * Copyright (C) 2003-2011 x264 project
6 * Authors: Laurent Aimar <fenrir@via.ecp.fr>
7 * Loren Merritt <lorenm@u.washington.edu>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
23 * This program is also available under a commercial proprietary license.
24 * For more information, contact us at licensing@x264.com.
25 *****************************************************************************/
30 /****************************************************************************
32 ****************************************************************************/
33 #define X264_MIN(a,b) ( (a)<(b) ? (a) : (b) )
34 #define X264_MAX(a,b) ( (a)>(b) ? (a) : (b) )
35 #define X264_MIN3(a,b,c) X264_MIN((a),X264_MIN((b),(c)))
36 #define X264_MAX3(a,b,c) X264_MAX((a),X264_MAX((b),(c)))
37 #define X264_MIN4(a,b,c,d) X264_MIN((a),X264_MIN3((b),(c),(d)))
38 #define X264_MAX4(a,b,c,d) X264_MAX((a),X264_MAX3((b),(c),(d)))
39 #define XCHG(type,a,b) do{ type t = a; a = b; b = t; } while(0)
40 #define IS_DISPOSABLE(type) ( type == X264_TYPE_B )
41 #define FIX8(f) ((int)(f*(1<<8)+.5))
42 #define ALIGN(x,a) (((x)+((a)-1))&~((a)-1))
44 #define CHECKED_MALLOC( var, size )\
46 var = x264_malloc( size );\
50 #define CHECKED_MALLOCZERO( var, size )\
52 CHECKED_MALLOC( var, size );\
53 memset( var, 0, size );\
56 #define X264_BFRAME_MAX 16
57 #define X264_REF_MAX 16
58 #define X264_THREAD_MAX 128
59 #define X264_PCM_COST (384*BIT_DEPTH+16)
60 #define X264_LOOKAHEAD_MAX 250
61 #define QP_BD_OFFSET (6*(BIT_DEPTH-8))
62 #define QP_MAX (51+QP_BD_OFFSET)
63 #define QP_MAX_MAX (51+2*6)
64 #define LAMBDA_MAX (91 << (BIT_DEPTH-8))
65 #define PIXEL_MAX ((1 << BIT_DEPTH)-1)
66 // arbitrary, but low because SATD scores are 1/4 normal
67 #define X264_LOOKAHEAD_QP (12+QP_BD_OFFSET)
69 // number of pixels (per thread) in progress at any given time.
70 // 16 for the macroblock in progress + 3 for deblocking + 3 for motion compensation filter + 2 for extra safety
71 #define X264_THREAD_HEIGHT 24
73 /* WEIGHTP_FAKE is set when mb_tree & psy are enabled, but normal weightp is disabled
74 * (such as in baseline). It checks for fades in lookahead and adjusts qp accordingly
75 * to increase quality. Defined as (-1) so that if(i_weighted_pred > 0) is true only when
76 * real weights are being used. */
78 #define X264_WEIGHTP_FAKE (-1)
80 #define NALU_OVERHEAD 5 // startcode + NAL type costs 5 bytes per frame
81 #define FILLER_OVERHEAD (NALU_OVERHEAD+1)
83 /****************************************************************************
85 ****************************************************************************/
94 /* Unions for type-punning.
95 * Mn: load or store n bits, aligned, native-endian
96 * CPn: copy n bits, aligned, native-endian
97 * we don't use memcpy for CPn because memcpy's args aren't assumed to be aligned */
98 typedef union { uint16_t i; uint8_t c[2]; } MAY_ALIAS x264_union16_t;
99 typedef union { uint32_t i; uint16_t b[2]; uint8_t c[4]; } MAY_ALIAS x264_union32_t;
100 typedef union { uint64_t i; uint32_t a[2]; uint16_t b[4]; uint8_t c[8]; } MAY_ALIAS x264_union64_t;
101 typedef struct { uint64_t i[2]; } x264_uint128_t;
102 typedef union { x264_uint128_t i; uint64_t a[2]; uint32_t b[4]; uint16_t c[8]; uint8_t d[16]; } MAY_ALIAS x264_union128_t;
103 #define M16(src) (((x264_union16_t*)(src))->i)
104 #define M32(src) (((x264_union32_t*)(src))->i)
105 #define M64(src) (((x264_union64_t*)(src))->i)
106 #define M128(src) (((x264_union128_t*)(src))->i)
107 #define M128_ZERO ((x264_uint128_t){{0,0}})
108 #define CP16(dst,src) M16(dst) = M16(src)
109 #define CP32(dst,src) M32(dst) = M32(src)
110 #define CP64(dst,src) M64(dst) = M64(src)
111 #define CP128(dst,src) M128(dst) = M128(src)
114 typedef uint16_t pixel;
115 typedef uint64_t pixel4;
116 typedef int32_t dctcoef;
117 typedef uint32_t udctcoef;
119 # define PIXEL_SPLAT_X4(x) ((x)*0x0001000100010001ULL)
120 # define MPIXEL_X4(src) M64(src)
122 typedef uint8_t pixel;
123 typedef uint32_t pixel4;
124 typedef int16_t dctcoef;
125 typedef uint16_t udctcoef;
127 # define PIXEL_SPLAT_X4(x) ((x)*0x01010101U)
128 # define MPIXEL_X4(src) M32(src)
131 #define BIT_DEPTH X264_BIT_DEPTH
133 #define CPPIXEL_X4(dst,src) MPIXEL_X4(dst) = MPIXEL_X4(src)
135 #define X264_SCAN8_SIZE (6*8)
136 #define X264_SCAN8_LUMA_SIZE (5*8)
137 #define X264_SCAN8_0 (4+1*8)
139 static const int x264_scan8[16+2*4+3] =
142 4+1*8, 5+1*8, 4+2*8, 5+2*8,
143 6+1*8, 7+1*8, 6+2*8, 7+2*8,
144 4+3*8, 5+3*8, 4+4*8, 5+4*8,
145 6+3*8, 7+3*8, 6+4*8, 7+4*8,
172 #include "bitstream.h"
182 #include "threadpool.h"
184 /****************************************************************************
186 ****************************************************************************/
187 /* x264_malloc : will do or emulate a memalign
188 * you have to use x264_free for buffers allocated with x264_malloc */
189 void *x264_malloc( int );
190 void x264_free( void * );
192 /* x264_slurp_file: malloc space for the whole file and read it */
193 char *x264_slurp_file( const char *filename );
195 /* mdate: return the current date in microsecond */
196 int64_t x264_mdate( void );
198 /* x264_param2string: return a (malloced) string containing most of
199 * the encoding options */
200 char *x264_param2string( x264_param_t *p, int b_res );
203 void x264_log( x264_t *h, int i_level, const char *psz_fmt, ... );
205 void x264_reduce_fraction( uint32_t *n, uint32_t *d );
206 void x264_reduce_fraction64( uint64_t *n, uint64_t *d );
207 void x264_init_vlc_tables( void );
209 static ALWAYS_INLINE pixel x264_clip_pixel( int x )
211 return ( (x & ~PIXEL_MAX) ? (-x)>>31 & PIXEL_MAX : x );
214 static ALWAYS_INLINE int x264_clip3( int v, int i_min, int i_max )
216 return ( (v < i_min) ? i_min : (v > i_max) ? i_max : v );
219 static ALWAYS_INLINE double x264_clip3f( double v, double f_min, double f_max )
221 return ( (v < f_min) ? f_min : (v > f_max) ? f_max : v );
224 static ALWAYS_INLINE int x264_median( int a, int b, int c )
226 int t = (a-b)&((a-b)>>31);
229 b -= (b-c)&((b-c)>>31);
230 b += (a-b)&((a-b)>>31);
234 static ALWAYS_INLINE void x264_median_mv( int16_t *dst, int16_t *a, int16_t *b, int16_t *c )
236 dst[0] = x264_median( a[0], b[0], c[0] );
237 dst[1] = x264_median( a[1], b[1], c[1] );
240 static ALWAYS_INLINE int x264_predictor_difference( int16_t (*mvc)[2], intptr_t i_mvc )
243 for( int i = 0; i < i_mvc-1; i++ )
245 sum += abs( mvc[i][0] - mvc[i+1][0] )
246 + abs( mvc[i][1] - mvc[i+1][1] );
251 static ALWAYS_INLINE uint16_t x264_cabac_mvd_sum( uint8_t *mvdleft, uint8_t *mvdtop )
253 int amvd0 = abs(mvdleft[0]) + abs(mvdtop[0]);
254 int amvd1 = abs(mvdleft[1]) + abs(mvdtop[1]);
255 amvd0 = (amvd0 > 2) + (amvd0 > 32);
256 amvd1 = (amvd1 > 2) + (amvd1 > 32);
257 return amvd0 + (amvd1<<8);
260 static void ALWAYS_INLINE x264_predictor_roundclip( int16_t (*dst)[2], int16_t (*mvc)[2], int i_mvc, int mv_x_min, int mv_x_max, int mv_y_min, int mv_y_max )
262 for( int i = 0; i < i_mvc; i++ )
264 int mx = (mvc[i][0] + 2) >> 2;
265 int my = (mvc[i][1] + 2) >> 2;
266 dst[i][0] = x264_clip3( mx, mv_x_min, mv_x_max );
267 dst[i][1] = x264_clip3( my, mv_y_min, mv_y_max );
271 extern const uint8_t x264_exp2_lut[64];
272 extern const float x264_log2_lut[128];
273 extern const float x264_log2_lz_lut[32];
275 /* Not a general-purpose function; multiplies input by -1/6 to convert
277 static ALWAYS_INLINE int x264_exp2fix8( float x )
279 int i = x*(-64.f/6.f) + 512.5f;
280 if( i < 0 ) return 0;
281 if( i > 1023 ) return 0xffff;
282 return (x264_exp2_lut[i&63]+256) << (i>>6) >> 8;
285 static ALWAYS_INLINE float x264_log2( uint32_t x )
287 int lz = x264_clz( x );
288 return x264_log2_lut[(x<<lz>>24)&0x7f] + x264_log2_lz_lut[lz];
291 /****************************************************************************
293 ****************************************************************************/
301 static const char slice_type_to_char[] = { 'P', 'B', 'I' };
303 enum sei_payload_type_e
305 SEI_BUFFERING_PERIOD = 0,
307 SEI_PAN_SCAN_RECT = 2,
309 SEI_USER_DATA_REGISTERED = 4,
310 SEI_USER_DATA_UNREGISTERED = 5,
311 SEI_RECOVERY_POINT = 6,
312 SEI_FRAME_PACKING = 45,
332 int i_idr_pic_id; /* -1 if nal_type != 5 */
335 int i_delta_poc_bottom;
338 int i_redundant_pic_cnt;
340 int b_direct_spatial_mv_pred;
342 int b_num_ref_idx_override;
343 int i_num_ref_idx_l0_active;
344 int i_num_ref_idx_l1_active;
346 int b_ref_pic_list_reordering[2];
351 } ref_pic_list_order[2][X264_REF_MAX];
353 /* P-frame weighting */
354 x264_weight_t weight[X264_REF_MAX*2][3];
356 int i_mmco_remove_from_end;
357 int i_mmco_command_count;
358 struct /* struct for future expansion */
360 int i_difference_of_pic_nums;
362 } mmco[X264_REF_MAX];
364 int i_cabac_init_idc;
371 /* deblocking filter */
372 int i_disable_deblocking_filter_idc;
373 int i_alpha_c0_offset;
376 } x264_slice_header_t;
378 typedef struct x264_lookahead_t
380 volatile uint8_t b_exit_thread;
381 uint8_t b_thread_active;
382 uint8_t b_analyse_keyframe;
384 int i_slicetype_length;
385 x264_frame_t *last_nonb;
386 x264_pthread_t thread_handle;
387 x264_sync_frame_list_t ifbuf;
388 x264_sync_frame_list_t next;
389 x264_sync_frame_list_t ofbuf;
392 typedef struct x264_ratecontrol_t x264_ratecontrol_t;
396 /* encoder parameters */
399 x264_t *thread[X264_THREAD_MAX+1];
401 int i_thread_phase; /* which thread to use for the next frame */
402 int i_threadslice_start; /* first row in this thread slice */
403 int i_threadslice_end; /* row after the end of this thread slice */
404 x264_threadpool_t *threadpool;
406 /* bitstream output */
410 int i_nals_allocated;
412 int i_bitstream; /* size of p_bitstream */
413 uint8_t *p_bitstream; /* will hold data for all nal */
420 /**** thread synchronization starts here ****/
422 /* frame number/poc */
426 int i_thread_frames; /* Number of different frames being encoded by threads;
427 * 1 when sliced-threads is on. */
431 int64_t i_disp_fields; /* Number of displayed fields (both coded and implied via pic_struct) */
432 int i_disp_fields_last_frame;
433 int64_t i_prev_duration; /* Duration of previous frame */
434 int64_t i_coded_fields; /* Number of coded fields (both coded and implied via pic_struct) */
435 int64_t i_cpb_delay; /* Equal to number of fields preceding this field
436 * since last buffering_period SEI */
437 int64_t i_coded_fields_lookahead; /* Use separate counters for lookahead */
438 int64_t i_cpb_delay_lookahead;
440 int64_t i_cpb_delay_pir_offset;
442 int b_queued_intra_refresh;
443 int64_t i_last_idr_pts;
445 /* We use only one SPS and one PPS */
446 x264_sps_t sps_array[1];
448 x264_pps_t pps_array[1];
452 /* quantization matrix for decoding, [cqm][qp%6][coef] */
453 int (*dequant4_mf[4])[16]; /* [4][6][16] */
454 int (*dequant8_mf[2])[64]; /* [2][6][64] */
455 /* quantization matrix for trellis, [cqm][qp][coef] */
456 int (*unquant4_mf[4])[16]; /* [4][52][16] */
457 int (*unquant8_mf[2])[64]; /* [2][52][64] */
458 /* quantization matrix for deadzone */
459 udctcoef (*quant4_mf[4])[16]; /* [4][52][16] */
460 udctcoef (*quant8_mf[2])[64]; /* [2][52][64] */
461 udctcoef (*quant4_bias[4])[16]; /* [4][52][16] */
462 udctcoef (*quant8_bias[2])[64]; /* [2][52][64] */
464 /* mv/ref cost arrays. Indexed by lambda instead of
465 * qp because, due to rounding, some quantizers share
466 * lambdas. This saves memory. */
467 uint16_t *cost_mv[LAMBDA_MAX+1];
468 uint16_t *cost_mv_fpel[LAMBDA_MAX+1][4];
470 const uint8_t *chroma_qp_table; /* includes both the nonlinear luma->chroma mapping and chroma_qp_offset */
473 x264_slice_header_t sh;
480 /* Frames to be encoded (whose types have been decided) */
481 x264_frame_t **current;
482 /* Unused frames: 0 = fenc, 1 = fdec */
483 x264_frame_t **unused[2];
485 /* Unused blank frames (for duplicates) */
486 x264_frame_t **blank_unused;
488 /* frames used for reference + sentinels */
489 x264_frame_t *reference[X264_REF_MAX+2];
491 int i_last_keyframe; /* Frame number of the last keyframe */
492 int i_last_idr; /* Frame number of the last IDR (not RP)*/
493 int i_poc_last_open_gop; /* Poc of the I frame of the last open-gop. The value
494 * is only assigned during the period between that
495 * I frame and the next P or I frame, else -1 */
497 int i_input; /* Number of input frames already accepted */
499 int i_max_dpb; /* Number of frames allocated in the decoded picture buffer */
502 int i_delay; /* Number of frames buffered for B reordering */
504 int64_t i_bframe_delay_time;
506 int64_t i_prev_reordered_pts[2];
507 int64_t i_largest_pts;
508 int64_t i_second_largest_pts;
509 int b_have_lowres; /* Whether 1/2 resolution luma planes are being used */
510 int b_have_sub8x8_esa;
513 /* current frame being encoded */
516 /* frame being reconstructed */
519 /* references lists */
521 x264_frame_t *fref[2][X264_REF_MAX+3];
522 x264_frame_t *fref_nearest[2];
523 int b_ref_reorder[2];
526 int initial_cpb_removal_delay;
527 int initial_cpb_removal_delay_offset;
528 int64_t i_reordered_pts_delay;
530 /* Current MB DCT coeffs */
533 ALIGNED_16( dctcoef luma16x16_dc[16] );
534 ALIGNED_16( dctcoef chroma_dc[2][4] );
535 // FIXME share memory?
536 ALIGNED_16( dctcoef luma8x8[4][64] );
537 ALIGNED_16( dctcoef luma4x4[16+8][16] );
540 /* MB table and cache for current frame/mb */
545 int i_mb_count; /* number of mbs in a frame */
559 /* Search parameters */
564 int b_noise_reduction;
566 int i_psy_rd; /* Psy RD strength--fixed point value*/
567 int i_psy_trellis; /* Psy trellis strength--fixed point value*/
571 /* Allowed qpel MV range to stay within the picture + emulated edge pixels */
574 /* Subpel MV range for motion search.
575 * same mv_min/max but includes levels' i_mv_range. */
578 /* Fullpel MV range for motion search */
582 /* neighboring MBs */
583 unsigned int i_neighbour;
584 unsigned int i_neighbour8[4]; /* neighbours of each 8x8 or 4x4 block that are available */
585 unsigned int i_neighbour4[16]; /* at the time the block is coded */
586 unsigned int i_neighbour_intra; /* for constrained intra pred */
587 unsigned int i_neighbour_frame; /* ignoring slice boundaries */
590 int i_mb_type_topleft;
591 int i_mb_type_topright;
596 int i_mb_topright_xy;
598 /**** thread synchronization ends here ****/
599 /* subsequent variables are either thread-local or constant,
600 * and won't be copied from one thread to another */
603 int8_t *type; /* mb type */
604 uint8_t *partition; /* mb partition */
605 int8_t *qp; /* mb qp */
606 int16_t *cbp; /* mb cbp: 0x0?: luma, 0x?0: chroma, 0x100: luma dc, 0x0200 and 0x0400: chroma dc (all set for PCM)*/
607 int8_t (*intra4x4_pred_mode)[8]; /* intra4x4 pred mode. for non I4x4 set to I_PRED_4x4_DC(2) */
608 /* actually has only 7 entries; set to 8 for write-combining optimizations */
609 uint8_t (*non_zero_count)[16+4+4]; /* nzc. for I_PCM set to 16 */
610 int8_t *chroma_pred_mode; /* chroma_pred_mode. cabac only. for non intra I_PRED_CHROMA_DC(0) */
611 int16_t (*mv[2])[2]; /* mb mv. set to 0 for intra mb */
612 uint8_t (*mvd[2])[8][2]; /* absolute value of mb mv difference with predict, clipped to [0,33]. set to 0 if intra. cabac only */
613 int8_t *ref[2]; /* mb ref. set to -1 if non used (intra or Lx only) */
614 int16_t (*mvr[2][X264_REF_MAX*2])[2];/* 16x16 mv for each possible ref */
615 int8_t *skipbp; /* block pattern for SKIP or DIRECT (sub)mbs. B-frames + cabac only */
616 int8_t *mb_transform_size; /* transform_size_8x8_flag of each mb */
617 uint16_t *slice_table; /* sh->first_mb of the slice that the indexed mb is part of
618 * NOTE: this will fail on resolutions above 2^16 MBs... */
620 /* buffer for weighted versions of the reference frames */
621 pixel *p_weight_buf[X264_REF_MAX];
626 ALIGNED_4( uint8_t i_sub_partition[4] );
632 int i_intra16x16_pred_mode;
633 int i_chroma_pred_mode;
635 /* skip flags for i4x4 and i8x8
636 * 0 = encode as normal.
637 * 1 (non-RD only) = the DCT is still in h->dct, restore fdec and skip reconstruction.
638 * 2 (RD only) = the DCT has since been overwritten by RD; restore that too. */
640 /* skip flag for motion compensation */
641 /* if we've already done MC, we don't need to do it again */
643 /* set to true if we are re-encoding a macroblock. */
645 int ip_offset; /* Used by PIR to offset the quantizer of intra-refresh blocks. */
650 /* space for p_fenc and p_fdec */
651 #define FENC_STRIDE 16
652 #define FDEC_STRIDE 32
653 ALIGNED_16( pixel fenc_buf[24*FENC_STRIDE] );
654 ALIGNED_16( pixel fdec_buf[27*FDEC_STRIDE] );
656 /* i4x4 and i8x8 backup data, for skipping the encode stage when possible */
657 ALIGNED_16( pixel i4x4_fdec_buf[16*16] );
658 ALIGNED_16( pixel i8x8_fdec_buf[16*16] );
659 ALIGNED_16( dctcoef i8x8_dct_buf[3][64] );
660 ALIGNED_16( dctcoef i4x4_dct_buf[15][16] );
661 uint32_t i4x4_nnz_buf[4];
662 uint32_t i8x8_nnz_buf[4];
666 /* Psy trellis DCT data */
667 ALIGNED_16( dctcoef fenc_dct8[4][64] );
668 ALIGNED_16( dctcoef fenc_dct4[16][16] );
670 /* Psy RD SATD/SA8D scores cache */
671 ALIGNED_16( uint64_t fenc_hadamard_cache[9] );
672 ALIGNED_16( uint32_t fenc_satd_cache[32] );
674 /* pointer over mb of the frame to be compressed */
675 pixel *p_fenc[3]; /* y,u,v */
676 /* pointer to the actual source frame, not a block copy */
677 pixel *p_fenc_plane[2]; /* y,uv */
679 /* pointer over mb of the frame to be reconstructed */
682 /* pointer over mb of the references */
684 pixel *p_fref[2][X264_REF_MAX*2][4+1]; /* last: yN, yH, yV, yHV, uv */
685 pixel *p_fref_w[X264_REF_MAX*2]; /* weighted fullpel luma */
686 uint16_t *p_integral[2][X264_REF_MAX];
695 /* real intra4x4_pred_mode if I_4X4 or I_8X8, I_PRED_4x4_DC if mb available, -1 if not */
696 ALIGNED_8( int8_t intra4x4_pred_mode[X264_SCAN8_LUMA_SIZE] );
698 /* i_non_zero_count if available else 0x80 */
699 ALIGNED_16( uint8_t non_zero_count[X264_SCAN8_SIZE] );
701 /* -1 if unused, -2 if unavailable */
702 ALIGNED_4( int8_t ref[2][X264_SCAN8_LUMA_SIZE] );
704 /* 0 if not available */
705 ALIGNED_16( int16_t mv[2][X264_SCAN8_LUMA_SIZE][2] );
706 ALIGNED_8( uint8_t mvd[2][X264_SCAN8_LUMA_SIZE][2] );
708 /* 1 if SKIP or DIRECT. set only for B-frames + CABAC */
709 ALIGNED_4( int8_t skip[X264_SCAN8_LUMA_SIZE] );
711 ALIGNED_4( int16_t direct_mv[2][4][2] );
712 ALIGNED_4( int8_t direct_ref[2][4] );
713 int direct_partition;
714 ALIGNED_4( int16_t pskip_mv[2] );
716 /* number of neighbors (top and left) that used 8x8 dct */
717 int i_neighbour_transform_size;
718 int i_neighbour_interlaced;
726 int i_qp; /* current qp */
728 int i_last_qp; /* last qp */
729 int i_last_dqp; /* last delta qp */
730 int b_variable_qp; /* whether qp is allowed to vary per macroblock */
732 int b_direct_auto_read; /* take stats for --direct auto from the 2pass log */
733 int b_direct_auto_write; /* analyse direct modes, to use and/or save */
736 int i_trellis_lambda2[2][2]; /* [luma,chroma][inter,intra] */
738 int i_chroma_lambda2_offset;
740 /* B_direct and weighted prediction */
741 int16_t dist_scale_factor_buf[2][X264_REF_MAX*2][4];
742 int16_t (*dist_scale_factor)[4];
743 int8_t bipred_weight_buf[2][X264_REF_MAX*2][4];
744 int8_t (*bipred_weight)[4];
745 /* maps fref1[0]'s ref indices into the current list0 */
746 #define map_col_to_list0(col) h->mb.map_col_to_list0[(col)+2]
747 int8_t map_col_to_list0[X264_REF_MAX+2];
748 int ref_blind_dupe; /* The index of the blind reference frame duplicate. */
749 int8_t deblock_ref_table[X264_REF_MAX*2+2];
750 #define deblock_ref_table(x) h->mb.deblock_ref_table[(x)+2]
753 /* rate control encoding only */
754 x264_ratecontrol_t *rc;
759 /* Current frame stats */
762 /* MV bits (MV+Ref+Block Type) */
764 /* Texture bits (DCT coefs) */
773 int i_mb_count_8x8dct[2];
774 int i_mb_count_ref[2][X264_REF_MAX*2];
775 int i_mb_partition[17];
777 int i_mb_pred_mode[4][13];
778 /* Adaptive direct mv pred */
779 int i_direct_score[2];
785 /* Cumulated stats */
788 int i_frame_count[3];
789 int64_t i_frame_size[3];
790 double f_frame_qp[3];
791 int i_consecutive_bframes[X264_BFRAME_MAX+1];
793 double f_ssd_global[3];
794 double f_psnr_average[3];
795 double f_psnr_mean_y[3];
796 double f_psnr_mean_u[3];
797 double f_psnr_mean_v[3];
798 double f_ssim_mean_y[3];
799 double f_frame_duration[3];
801 int64_t i_mb_count[3][19];
802 int64_t i_mb_partition[2][17];
803 int64_t i_mb_count_8x8dct[2];
804 int64_t i_mb_count_ref[2][2][X264_REF_MAX*2];
806 int64_t i_mb_pred_mode[4][13];
808 int i_direct_score[2];
809 int i_direct_frames[2];
810 /* num p-frames weighted */
815 ALIGNED_16( uint32_t nr_residual_sum[2][64] );
816 ALIGNED_16( udctcoef nr_offset[2][64] );
817 uint32_t nr_count[2];
819 /* Buffers that are allocated per-thread even in sliced threads. */
820 void *scratch_buffer; /* for any temporary storage that doesn't want repeated malloc */
821 pixel *intra_border_backup[2][2]; /* bottom pixels of the previous mb row, used for intra prediction after the framebuffer has been deblocked */
822 uint8_t (*deblock_strength[2])[2][4][4];
824 /* CPU functions dependents */
825 x264_predict_t predict_16x16[4+3];
826 x264_predict_t predict_8x8c[4+3];
827 x264_predict8x8_t predict_8x8[9+3];
828 x264_predict_t predict_4x4[9+3];
829 x264_predict_8x8_filter_t predict_8x8_filter;
831 x264_pixel_function_t pixf;
832 x264_mc_functions_t mc;
833 x264_dct_function_t dctf;
834 x264_zigzag_function_t zigzagf;
835 x264_quant_function_t quantf;
836 x264_deblock_function_t loopf;
837 x264_bitstream_function_t bsf;
840 struct visualize_t *visualize;
842 x264_lookahead_t *lookahead;
845 // included at the end because it needs x264_t
846 #include "macroblock.h"
847 #include "rectangle.h"
850 #include "x86/util.h"