📄 mbuffer.cpp
字号:
mm_assign_long_term_frame_idx(p, tmp_drpm->difference_of_pic_nums_minus1, tmp_drpm->long_term_frame_idx);
update_ref_list();
update_ltref_list();
break;
case 4:
mm_update_max_long_term_frame_idx (tmp_drpm->max_long_term_frame_idx_plus1);
update_ltref_list();
break;
case 5:
mm_unmark_all_short_term_for_reference();
mm_update_max_long_term_frame_idx(0);
img->last_has_mmco_5 = 1;
break;
case 6:
mm_mark_current_picture_long_term(p, tmp_drpm->long_term_frame_idx);
break;
default:
error ("invalid memory_management_control_operation in buffer", 500);
}
img->dec_ref_pic_marking_buffer = tmp_drpm->Next;
free (tmp_drpm);
}
if ( img->last_has_mmco_5 )
{
img->frame_num = p->pic_num = 0;
p->poc = 0;
flush_dpb();
}
}
/*!
************************************************************************
* \brief
* Store a picture in DPB. This includes cheking for space in DPB and
* flushing frames.
* If we received a frame, we need to check for a new store, if we
* got a field, check if it's the second field of an already allocated
* store.
*
* \param p
* Picture to be stored
*
************************************************************************
*/
void store_picture_in_dpb(StorablePicture* p)
{
unsigned i;
int poc, pos;
assert (p!=NULL);
p->used_for_reference = (img->nal_reference_idc != 0);
img->last_has_mmco_5=0;
if (img->idr_flag)
idr_memory_management(p);
else
{
// adaptive memory management
if (p->used_for_reference && (img->adaptive_ref_pic_buffering_flag))
adaptive_memory_management(p);
}
// this is a frame or a field which has no stored complementatry field
// sliding window, if necessary
if ((!img->idr_flag)&&(p->used_for_reference && (!img->adaptive_ref_pic_buffering_flag)))
{
sliding_window_memory_management(p);
}
// first try to remove unused frames
if (dpb.used_size==dpb.size)
{
remove_unused_frame_from_dpb();
}
// then output frames until one can be removed
while (dpb.used_size==dpb.size)
{
// non-reference frames may be output directly
if (!p->used_for_reference)
{
get_smallest_poc(&poc, &pos);
if ((-1==pos) || (p->poc < poc))
{
direct_output(p/*, p_out*/); //输出解压后
return;
}
}
// flush a frame
output_one_frame_from_dpb();
}
// check for duplicate frame number in short term reference buffer
if ((p->used_for_reference)&&(!p->is_long_term))
{
for (i=0; i<dpb.ref_frames_in_buffer; i++)
{
if (dpb.fs_ref[i]->frame_num == img->frame_num)
{
error("duplicate frame_num im short-term reference picture buffer", 500);
}
}
}
// store at end of buffer
// printf ("store frame/field at pos %d\n",dpb.used_size);
insert_picture_in_dpb(dpb.fs[dpb.used_size],p);
dpb.used_size++;
update_ref_list();
// update_ltref_list();
}
/*!
************************************************************************
* \brief
* Insert the picture into the DPB. A free DPB position is necessary
* for frames, .
*
* \param fs
* FrameStore into which the picture will be inserted
* \param p
* StorablePicture to be inserted
*
************************************************************************
*/
static void insert_picture_in_dpb(FrameStore* fs, StorablePicture* p)
{
assert (p!=NULL);
assert (fs!=NULL);
fs->frame = p;
fs->is_used = 3;
if (p->used_for_reference)
{
fs->is_reference = 3;
if (p->is_long_term)
{
fs->is_long_term = 3;
}
}
// dpb_split_field(fs);
fs->poc = fs->frame->poc;
fs->long_term_frame_idx = fs->frame->long_term_frame_idx;
fs->frame_num = p->pic_num;
fs->is_output = p->is_output;
}
/*!
************************************************************************
* \brief
* Check if one of the frames in frame store is used for reference
************************************************************************
*/
static int is_used_for_reference(FrameStore* fs)
{
if (fs->is_reference)
return 1;
if (fs->frame->used_for_reference)
return 1;
return 0;
}
/*!
************************************************************************
* \brief
* Check if one of the frames in frame store is used for short-term reference
************************************************************************
*/
static int is_short_term_reference(FrameStore* fs)
{
if (fs->is_used==3)
{
if ((fs->frame->used_for_reference)&&(!fs->frame->is_long_term))
{
return 1;
}
}
return 0;
}
/*!
************************************************************************
* \brief
* Check if one of the frames in frame store is used for short-term reference
************************************************************************
*/
static int is_long_term_reference(FrameStore* fs)
{
if ((fs->is_used==3)&&(fs->frame->used_for_reference)&&(fs->frame->is_long_term))
{
return 1;
}
return 0;
}
/*!
************************************************************************
* \brief
* remove one frame from DPB
************************************************************************
*/
static void remove_frame_from_dpb(int pos)
{
FrameStore* fs = dpb.fs[pos];
FrameStore* tmp;
unsigned i;
free_storable_picture(fs->frame);
fs->frame=NULL;
fs->is_used = 0;
fs->is_long_term = 0;
fs->is_reference = 0;
// move empty framestore to end of buffer
tmp = dpb.fs[pos];
for (i=pos; i<dpb.used_size-1;i++)
{
dpb.fs[i] = dpb.fs[i+1];
}
dpb.fs[dpb.used_size-1] = tmp;
dpb.used_size--;
}
/*!
************************************************************************
* \brief
* find smallest POC in the DPB.
************************************************************************
*/
static void get_smallest_poc(int *poc,int * pos)
{
unsigned i;
if (dpb.used_size<1)
{
error("Cannot determine smallest POC, DPB empty.",150);
}
*pos=-1;
*poc = INT_MAX;
for (i=0; i<dpb.used_size; i++)
{
if ((*poc>dpb.fs[i]->poc)&&(!dpb.fs[i]->is_output))
{
*poc = dpb.fs[i]->poc;
*pos=i;
}
}
}
/*!
************************************************************************
* \brief
* Remove a picture from DPB which is no longer needed.
************************************************************************
*/
static int remove_unused_frame_from_dpb()
{
unsigned i;
// check for frames that were already output and no longer used for reference
for (i=0; i<dpb.used_size; i++)
{
if (dpb.fs[i]->is_output && (!is_used_for_reference(dpb.fs[i])))
{
remove_frame_from_dpb(i);
return 1;
}
}
return 0;
}
/*!
************************************************************************
* \brief
* Output one picture stored in the DPB.
************************************************************************
*/
static void output_one_frame_from_dpb()
{
int poc, pos;
//diagnostics
if (dpb.used_size<1)
{
error("Cannot output frame, DPB empty.",150);
}
// find smallest POC
get_smallest_poc(&poc, &pos);
if(pos==-1)
{
error("no frames for output available", 150);
}
// call the output function
// printf ("output frame with frame_num #%d, poc %d (dpb. dpb.size=%d, dpb.used_size=%d)\n", dpb.fs[pos]->frame_num, dpb.fs[pos]->frame->poc, dpb.size, dpb.used_size);
write_stored_frame(dpb.fs[pos]/*, p_out*/);
if (dpb.last_output_poc >= poc)
{
error ("output POC must be in ascending order", 150);
}
dpb.last_output_poc = poc;
// free frame store and move empty store to end of buffer
if (!is_used_for_reference(dpb.fs[pos]))
{
remove_frame_from_dpb(pos);
}
}
/*!
************************************************************************
* \brief
* All stored picture are output. Should be called to empty the buffer
************************************************************************
*/
void flush_dpb()
{
unsigned i;
//diagnostics
// mark all frames unused
for (i=0; i<dpb.used_size; i++)
{
unmark_for_reference (dpb.fs[i]);
}
while (remove_unused_frame_from_dpb()) ;
// output frames in POC order
while (dpb.used_size)
{
output_one_frame_from_dpb();
}
dpb.last_output_poc = INT_MIN;
}
#define RSD(x) ((x&2)?(x|1):(x&(~1)))
/*!
************************************************************************
* \brief
* Use inference flag to remap mvs/references
************************************************************************
*/
void dpb_split_field(FrameStore *fs)
{
int i,j;
fs->poc = fs->frame->poc;
fs->long_term_frame_idx = fs->frame->long_term_frame_idx;
for (j=0 ; j<fs->frame->size_y>>2 ; j++)
{
for (i=0 ; i<fs->frame->size_x>>2 ; i++)
{
if (!active_sps->frame_mbs_only_flag || active_sps->direct_8x8_inference_flag)
{
//! Use inference flag to remap mvs/references
fs->frame->mv[LIST_0][i][j][0]=fs->frame->mv[LIST_0][RSD(i)][RSD(j)][0];
fs->frame->mv[LIST_0][i][j][1]=fs->frame->mv[LIST_0][RSD(i)][RSD(j)][1];
fs->frame->ref_idx[LIST_0][i][j]=fs->frame->ref_idx[LIST_0][RSD(i)][RSD(j)] ;
}
fs->frame->moving_block[i][j]=
!(((fs->frame->ref_idx[LIST_0][i][j] == 0) &&
(abs(fs->frame->mv[LIST_0][i][j][0])>>1 == 0) &&
(abs(fs->frame->mv[LIST_0][i][j][1])>>1 == 0)) ||
((fs->frame->ref_idx[LIST_0][i][j] == -1)));
}
}
}
/*!
************************************************************************
* \brief
* Allocate memory for buffering of reference picture reordering commands
************************************************************************
*/
void alloc_ref_pic_list_reordering_buffer(Slice *currSlice)
{
int size = img->num_ref_idx_l0_active+1;
if (img->type!=I_SLICE)
{
if ((currSlice->remapping_of_pic_nums_idc_l0 =(int *) calloc(size,sizeof(int)))==NULL)
error ("alloc_ref_pic_list_reordering_buffer: Could not allocate remapping_of_pic_nums_idc_l0 memory", 100);
if ((currSlice->abs_diff_pic_num_minus1_l0 =(int *) calloc(size,sizeof(int)))==NULL)
error ("alloc_ref_pic_list_reordering_buffer: Could not allocate abs_diff_pic_num_minus1_l0 memory", 100);
if ((currSlice->long_term_pic_idx_l0 =(int *) calloc(size,sizeof(int)))==NULL)
error ("alloc_ref_pic_list_reordering_buffer:Could not allocate long_term_pic_idx_l0 memory", 100);
}
else
{
currSlice->remapping_of_pic_nums_idc_l0 = NULL;
currSlice->abs_diff_pic_num_minus1_l0 = NULL;
currSlice->long_term_pic_idx_l0 = NULL;
}
}
/*!
************************************************************************
* \brief
* Free memory for buffering of reference picture reordering commands
************************************************************************
*/
void free_ref_pic_list_reordering_buffer(Slice *currSlice)
{
if (currSlice->remapping_of_pic_nums_idc_l0)
free(currSlice->remapping_of_pic_nums_idc_l0);
if (currSlice->abs_diff_pic_num_minus1_l0)
free(currSlice->abs_diff_pic_num_minus1_l0);
if (currSlice->long_term_pic_idx_l0)
free(currSlice->long_term_pic_idx_l0);
currSlice->remapping_of_pic_nums_idc_l0 = NULL;
currSlice->abs_diff_pic_num_minus1_l0 = NULL;
currSlice->long_term_pic_idx_l0 = NULL;
}
/*!
************************************************************************
* \brief
* Tian Dong
* June 13, 2002, Modifed on July 30, 2003
*
* If a gap in frame_num is found, try to fill the gap
* \param img
*
************************************************************************
*/
void fill_frame_num_gap(ImageParameters *img)
{
int CurrFrameNum;
int UnusedShortTermFrameNum;
StorablePicture *picture = NULL;
int nal_ref_idc_bak;
// printf("A gap in frame number is found, try to fill it.\n");
nal_ref_idc_bak = img->nal_reference_idc;
img->nal_reference_idc = 1;
UnusedShortTermFrameNum = (img->pre_frame_num + 1) % img->MaxFrameNum;
CurrFrameNum = img->frame_num;
while (CurrFrameNum != UnusedShortTermFrameNum)
{
picture = alloc_storable_picture (img->width, img->height, img->width_cr, img->height_cr);
picture->pic_num = UnusedShortTermFrameNum;
picture->is_output = 1;
img->adaptive_ref_pic_buffering_flag = 0;
store_picture_in_dpb(picture);
picture=NULL;
UnusedShortTermFrameNum = (UnusedShortTermFrameNum + 1) % img->MaxFrameNum;
}
img->nal_reference_idc = nal_ref_idc_bak;
}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -