/*****************************************************************************
* frame.h: h264 encoder library
*****************************************************************************
- * Copyright (C) 2003 Laurent Aimar
- * $Id: frame.h,v 1.1 2004/06/03 19:27:06 fenrir Exp $
+ * Copyright (C) 2003-2008 x264 project
*
* Authors: Laurent Aimar <fenrir@via.ecp.fr>
+ * Loren Merritt <lorenm@u.washington.edu>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111, USA.
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02111, USA.
*****************************************************************************/
-#ifndef _FRAME_H
-#define _FRAME_H 1
+#ifndef X264_FRAME_H
+#define X264_FRAME_H
-typedef struct
+/* number of pixels past the edge of the frame, for motion estimation/compensation */
+#define PADH 32
+#define PADV 32
+
+typedef struct x264_frame
{
/* */
int i_poc;
int i_type;
int i_qpplus1;
int64_t i_pts;
- int i_frame; /* Presentation frame number */
- int i_frame_num; /* Coded frame number */
+ int64_t i_reordered_pts;
+ x264_param_t *param;
+
+ int i_frame; /* Presentation frame number */
+ int i_coded; /* Coded frame number */
+ int i_frame_num; /* 7.4.3 frame_num */
int b_kept_as_ref;
- float f_qp_avg;
+ int b_keyframe;
+ uint8_t b_fdec;
+ uint8_t b_last_minigop_bframe; /* this frame is the last b in a sequence of bframes */
+ uint8_t i_bframes; /* number of bframes following this nonb in coded order */
+ float f_qp_avg_rc; /* QPs as decided by ratecontrol */
+ float f_qp_avg_aq; /* QPs as decided by AQ in addition to ratecontrol */
+ int i_poc_l0ref0; /* poc of first refframe in L0, used to check if direct temporal is possible */
/* YUV buffer */
int i_plane;
- int i_stride[4];
- int i_lines[4];
+ int i_stride[3];
+ int i_width[3];
+ int i_lines[3];
int i_stride_lowres;
+ int i_width_lowres;
int i_lines_lowres;
- uint8_t *plane[4];
+ uint8_t *plane[3];
uint8_t *filtered[4]; /* plane[0], H, V, HV */
uint8_t *lowres[4]; /* half-size copy of input frame: Orig, H, V, HV */
uint16_t *integral;
/* for unrestricted mv we allocate more data than needed
* allocated data are stored in buffer */
- void *buffer[12];
+ uint8_t *buffer[4];
+ uint8_t *buffer_lowres[4];
+
+ x264_weight_t weight[16][3]; /* [ref_index][plane] */
+ uint8_t *weighted[16]; /* plane[0] weighted of the reference frames */
+ int b_duplicate;
+ struct x264_frame *orig;
/* motion data */
int8_t *mb_type;
+ uint8_t *mb_partition;
int16_t (*mv[2])[2];
+ int16_t (*lowres_mvs[2][X264_BFRAME_MAX+1])[2];
+ uint16_t (*lowres_costs[X264_BFRAME_MAX+2][X264_BFRAME_MAX+2]);
+ /* Actually a width-2 bitfield with 4 values per uint8_t. */
+ uint8_t (*lowres_inter_types[X264_BFRAME_MAX+2][X264_BFRAME_MAX+2]);
+ int *lowres_mv_costs[2][X264_BFRAME_MAX+1];
int8_t *ref[2];
int i_ref[2];
int ref_poc[2][16];
+ int inv_ref_poc[16]; // inverse values (list0 only) to avoid divisions in MB encoding
/* for adaptive B-frame decision.
* contains the SATD cost of the lowres frame encoded in various modes
* FIXME: how big an array do we need? */
int i_cost_est[X264_BFRAME_MAX+2][X264_BFRAME_MAX+2];
+ int i_cost_est_aq[X264_BFRAME_MAX+2][X264_BFRAME_MAX+2];
int i_satd; // the i_cost_est of the selected frametype
int i_intra_mbs[X264_BFRAME_MAX+2];
int *i_row_satds[X264_BFRAME_MAX+2][X264_BFRAME_MAX+2];
int *i_row_satd;
int *i_row_bits;
int *i_row_qp;
+ float *f_qp_offset;
+ float *f_qp_offset_aq;
+ int b_intra_calculated;
+ uint16_t *i_intra_cost;
+ uint16_t *i_propagate_cost;
+ uint16_t *i_inv_qscale_factor;
+ int b_scenecut; /* Set to zero if the frame cannot possibly be part of a real scenecut. */
+ float f_weighted_cost_delta[X264_BFRAME_MAX+2];
+ uint32_t i_pixel_sum;
+ uint64_t i_pixel_ssd;
+ /* vbv */
+ uint8_t i_planned_type[X264_LOOKAHEAD_MAX+1];
+ int i_planned_satd[X264_LOOKAHEAD_MAX+1];
+
+ /* threading */
+ int i_lines_completed; /* in pixels */
+ int i_lines_weighted; /* FIXME: this only supports weighting of one reference frame */
+ int i_reference_count; /* number of threads using this frame (not necessarily the number of pointers) */
+ x264_pthread_mutex_t mutex;
+ x264_pthread_cond_t cv;
+
+ /* periodic intra refresh */
+ float f_pir_position;
+ int i_pir_start_col;
+ int i_pir_end_col;
} x264_frame_t;
+/* synchronized frame list */
+typedef struct
+{
+ x264_frame_t **list;
+ int i_max_size;
+ int i_size;
+ x264_pthread_mutex_t mutex;
+ x264_pthread_cond_t cv_fill; /* event signaling that the list became fuller */
+ x264_pthread_cond_t cv_empty; /* event signaling that the list became emptier */
+} x264_synch_frame_list_t;
+
typedef void (*x264_deblock_inter_t)( uint8_t *pix, int stride, int alpha, int beta, int8_t *tc0 );
typedef void (*x264_deblock_intra_t)( uint8_t *pix, int stride, int alpha, int beta );
typedef struct
x264_deblock_intra_t deblock_h_chroma_intra;
} x264_deblock_function_t;
-x264_frame_t *x264_frame_new( x264_t *h );
+x264_frame_t *x264_frame_new( x264_t *h, int b_fdec );
void x264_frame_delete( x264_frame_t *frame );
-void x264_frame_copy_picture( x264_t *h, x264_frame_t *dst, x264_picture_t *src );
+int x264_frame_copy_picture( x264_t *h, x264_frame_t *dst, x264_picture_t *src );
-void x264_frame_expand_border( x264_frame_t *frame );
-void x264_frame_expand_border_filtered( x264_frame_t *frame );
+void x264_frame_expand_border( x264_t *h, x264_frame_t *frame, int mb_y, int b_end );
+void x264_frame_expand_border_filtered( x264_t *h, x264_frame_t *frame, int mb_y, int b_end );
void x264_frame_expand_border_lowres( x264_frame_t *frame );
void x264_frame_expand_border_mod16( x264_t *h, x264_frame_t *frame );
-void x264_frame_deblocking_filter( x264_t *h, int i_slice_type );
+void x264_frame_deblock( x264_t *h );
+void x264_frame_deblock_row( x264_t *h, int mb_y );
-void x264_frame_filter( int cpu, x264_frame_t *frame );
-void x264_frame_init_lowres( int cpu, x264_frame_t *frame );
+void x264_frame_filter( x264_t *h, x264_frame_t *frame, int mb_y, int b_end );
+void x264_frame_init_lowres( x264_t *h, x264_frame_t *frame );
void x264_deblock_init( int cpu, x264_deblock_function_t *pf );
+void x264_frame_cond_broadcast( x264_frame_t *frame, int i_lines_completed );
+void x264_frame_cond_wait( x264_frame_t *frame, int i_lines_completed );
+
+void x264_frame_push( x264_frame_t **list, x264_frame_t *frame );
+x264_frame_t *x264_frame_pop( x264_frame_t **list );
+void x264_frame_unshift( x264_frame_t **list, x264_frame_t *frame );
+x264_frame_t *x264_frame_shift( x264_frame_t **list );
+void x264_frame_push_unused( x264_t *h, x264_frame_t *frame );
+void x264_frame_push_blank_unused( x264_t *h, x264_frame_t *frame );
+x264_frame_t *x264_frame_pop_blank_unused( x264_t *h );
+void x264_weight_scale_plane( x264_t *h, uint8_t *dst, int i_dst_stride, uint8_t *src, int i_src_stride,
+ int i_width, int i_height, x264_weight_t *w );
+x264_frame_t *x264_frame_pop_unused( x264_t *h, int b_fdec );
+void x264_frame_sort( x264_frame_t **list, int b_dts );
+void x264_frame_delete_list( x264_frame_t **list );
+
+int x264_synch_frame_list_init( x264_synch_frame_list_t *slist, int nelem );
+void x264_synch_frame_list_delete( x264_synch_frame_list_t *slist );
+void x264_synch_frame_list_push( x264_synch_frame_list_t *slist, x264_frame_t *frame );
+
+#define x264_frame_sort_dts(list) x264_frame_sort(list, 1)
+#define x264_frame_sort_pts(list) x264_frame_sort(list, 0)
+
#endif
projects / x264 / blobdiff