⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mbuffer.c

📁 包含了从MPEG4的视频解码到H.264的视频编码部分的源代码
💻 C
📖 第 1 页 / 共 2 页
字号:
  if((mcef_frm = (byte****)calloc(frm->short_size+frm->long_size,sizeof(byte***))) == NULL)
    no_mem_exit("alloc_mref: mcef_frm");

  if (mref_fld) 
    free (mref_fld);

  if((mref_fld = (byte***)calloc(fld->short_size+fld->long_size,sizeof(byte**))) == NULL)
    no_mem_exit("alloc_mref: mref_fld");

  if (mcef_fld) 
    free (mcef_fld);

  if((mcef_fld = (byte****)calloc(fld->short_size+fld->long_size,sizeof(byte***))) == NULL)
    no_mem_exit("alloc_mref: mcef_fld");

  if (parity_fld) 
    free (parity_fld);

  if((parity_fld = (int *)calloc(fld->short_size+fld->long_size, sizeof(int))) == NULL)
    no_mem_exit("alloc_mref: mref_fld");

  if (chroma_vector_adjustment) 
    free (chroma_vector_adjustment);

  if((chroma_vector_adjustment = (int *)calloc(fld->short_size+fld->long_size, sizeof(int))) == NULL)
    no_mem_exit("alloc_mref: mref_fld");
}

/*!
 ************************************************************************
 * \brief
 *    init mref pointer structure
 ************************************************************************
 */
void init_mref(ImageParameters *img)
{
  int i,j;

  for (i=0,j=0;i<frm->short_used;i++,j++)
  {
    mref_frm[j]=frm->picbuf_short[i]->mref;
    mcef_frm[j]=frm->picbuf_short[i]->mcef;
  }
  for (i=0;i<frm->long_size;i++,j++)
  {
    mref_frm[j]=frm->picbuf_long[i]->mref;
    mcef_frm[j]=frm->picbuf_long[i]->mcef;
  }

  // Tian Dong. June 15, 2002. Let the others be NULL
  for (i=frm->short_used;i<frm->short_size;i++,j++)
  {
    mref_frm[j]=NULL;
    mcef_frm[j]=NULL;
  }
  for (i=frm->long_used;i<frm->long_size;i++,j++)
  {
    mref_frm[j]=NULL;
    mcef_frm[j]=NULL;
  }

  for (i=0,j=0;i<fld->short_used;i++,j++)
  {
    mref_fld[j]=fld->picbuf_short[i]->mref;
    mcef_fld[j]=fld->picbuf_short[i]->mcef;
	parity_fld[j] = fld->picbuf_short[i]->parity;
  }
  for (i=0;i<fld->long_size;i++,j++)
  {
    mref_fld[j]=fld->picbuf_long[i]->mref;
    mcef_fld[j]=fld->picbuf_long[i]->mcef;
	parity_fld[j] = fld->picbuf_long[i]->parity;
  }

}


/*!
 ************************************************************************
 * \brief
 *    process RMPNI command list
 ************************************************************************
 */
void reorder_mref(ImageParameters *img)
{

  //!KS: do nothing but freeing the buffers, needs to be rewritten for list0 and list1
  init_mref(img);
  free_ref_pic_list_reordering_buffer(img->currentSlice);
  return;

#if (0)
  RMPNIbuffer_t *r;

  int pnp = img->pn;
  int pnq = 0;
  int index = 0,i;
  int size;
  int islong=0;
  int found=0;
  
  Frame **fr;
  Frame *f;


  // if nothing to do update mref and return
  if (img->currentSlice->rmpni_buffer==NULL) 
  {
    init_mref(img);
    return;
  }

  // We have to do the reordering with complete frame structures
  // so we need a temporary frame buffer of ordered references

  size=fb->short_used+fb->long_used;

  if ((fr=(Frame**)calloc(size,sizeof (Frame*)))==NULL) no_mem_exit("init_frame_buffers: fb->picbuf_long");

  for (i=0;i<fb->short_used;i++)
  {
    fr[i]=fb->picbuf_short[i];
    fr[i]->islong=0;
  }

  for (i=0;i<fb->long_used;i++)
  {
    fr[i+fb->short_used]=fb->picbuf_long[i];
    fr[i+fb->short_used]->islong=1;
  }

  r=img->currentSlice->rmpni_buffer;
  while (r)
  {
    switch (r->RMPNI)
    {

    case 0:
      // ADPN correspondig to negative difference
      if ((pnp-r->Data)<0)
        pnq=pnp-r->Data+fb->short_size;
      else
        pnq=pnp-r->Data;

      islong=0;

      break;

    case 1:
      // ADPN correspondig to positive difference
      if ((pnp+r->Data)>fb->short_size-1)
        pnq=pnp+r->Data-fb->short_size;
      else
        pnq=pnp+r->Data;

      islong=0;

      break;

    case 2:
      // LPIR specifying long term index
      pnq=r->Data;
      islong=1;

      break;

    case 3:
//      return;   // Tian: I don't think it is a return point, so I add the judgment (*) below.
      assert( r->Next == NULL );  // Tian assert ...
      break;

    }

    // now scan the frame buffer for the needed frame

    if ( r->RMPNI == 0 || r->RMPNI == 1 || r->RMPNI == 2 )  // Tian: judgment (*)
    {
      found=0;
      i=0;

      while ((!found)&&(i<size))
      {
        if (((!islong)&&(!fr[i]->islong) && (fr[i]->picID==pnq)) ||
            ((islong)&&(fr[i]->islong) && (fr[i]->lt_picID==pnq)))
        {
            found=1;
            index=i;
        }
        i++;
      }

      if (!found) error ("tried to remap non-existent picture",400);
      if ( fr[index]->valid == 0 )  // Tian Dong. June 10, 2002
        printf("Warning: an invalid reference frame is remapped.\n");

      // now do the actual reordering
      /* cycle frame buffer */
      f=fr[index];
      for (i=index-1;i>=0;i--)
      {
        fr[i+1]=fr[i];
      }
      fr[0]=f;

      // set the picture number prediction correctly
      pnp=pnq;
    }

    img->currentSlice->rmpni_buffer=r->Next;
    free (r);
    r=img->currentSlice->rmpni_buffer;
  }

  // at last init mref and mcef from temporary structure
  for (i=0;i<size;i++)
  {
    mref[i]=fr[i]->mref;
    mcef[i]=fr[i]->mcef;
	if(mref == mref_fld) parity_fld[i] = fr[i]->parity;
  }

  // free temporary memory
  free (fr);
#endif
}

/*!
 ************************************************************************
 * \brief
 *    mark all frames except last decoded unused
 ************************************************************************
 */
void reset_buffers()
{
  int i;

  /* mark short term pictures unused */
  for (i=1;i<fb->short_used;i++)
    fb->picbuf_short[i]->used=0;
  fb->short_used=1;

  /* mark short term pictures unused */
  for (i=0;i<fb->long_used;i++)
    fb->picbuf_short[i]->used=0;
  fb->long_used=0;

}

/*!
 ************************************************************************
 * \brief
 *    calculate the short term picture ID from DPN
 ************************************************************************
 */
int get_short_ID(int DPN, ImageParameters *img)
{
  if ((img->pn-DPN)<0)
    return (img->pn-DPN+img->buf_cycle);
  else
    return (img->pn-DPN);
}

/*!
 ************************************************************************
 * \brief
 *    store reconstructed frame in multiple reference buffer
 ************************************************************************
 */
void copy2fb(ImageParameters *img)
{
  int i,j,uv;
  Frame *f;
  MMCObuffer_t *tmp_mmco;

  /* delete frames with same short term ID */
  if(imgY == imgY_frm||imgY == imgY_top) remove_short_term(img->pn);

  /* cycle frame buffer */
  f=fb->picbuf_short[fb->short_size-1];

  for (i=fb->short_size-2;i>=0;i--)
    fb->picbuf_short[i+1]=fb->picbuf_short[i];

  fb->picbuf_short[0]=f;


  fb->picbuf_short[0]->used=1;
  fb->picbuf_short[0]->picID=img->pn;
  fb->picbuf_short[0]->lt_picID=-1;
  fb->picbuf_short[0]->valid=1;     // Tian Dong: This is a normal reference frame.
  if(fb == fld) fb->picbuf_short[0]->parity = img->structure;

  (fb->short_used)++;
  if (fb->short_used>fb->short_size)
    fb->short_used=fb->short_size;
  
  for (j=0; j < img->height; j++)
    for (i=0; i < img->width; i++)
      fb->picbuf_short[0]->mref[j][i]=imgY[j][i]; 
  
  for (uv=0; uv < 2; uv++)
    for (i=0; i < img->width_cr; i++)
      for (j=0; j < img->height_cr; j++)
        fb->picbuf_short[0]->mcef[uv][j][i]=imgUV[uv][j][i];// just copy 1/1 pix, interpolate "online"  

//  fb->picbuf_short[0]->layerNumber = currPictureInfo.layerNumber;
//  fb->picbuf_short[0]->subSequenceIdentifier = currPictureInfo.subSequenceIdentifier;

  // MMCO will be done after storing the decoded frame
  while (img->mmco_buffer)
  {
    tmp_mmco=img->mmco_buffer;
    switch (tmp_mmco->MMCO)
    {
    case 1: // Mark Short-Term Picture as "Unused"
      remove_short_term(get_short_ID(tmp_mmco->DPN,img));
      break;
    case 2: // Mark Long-Term Picture as "Unused"
      remove_long_term(tmp_mmco->LPIN);
      break;
    case 3: // Assign a Long-Term Index to a Picture
      assign_long_term_id(get_short_ID(tmp_mmco->DPN,img),tmp_mmco->LPIN,img);
      break;
    case 4: // Specify the Maximum Long-Term Picture Index
      init_long_term_buffer(tmp_mmco->MLIP1-1,img);
      break;
    case 5: // Reset
      reset_buffers();
      break;
    }

    img->mmco_buffer=tmp_mmco->Next;
    free (tmp_mmco);
  }
}

/*!
 ************************************************************************
 * \brief
 *      Tian Dong, June 13, 2002
 *      If a PN gap is found, try to fill the gap
 * \param pn_expected
 *      which picture will be added to the buffer
 * \param valid
 *      1: a normal reference frame is added to the buffer
 *      0: a blank reference frame is inserted to the buffer for filling
 *          the PN gap
 ************************************************************************
 */
void add_frame(int pn_expected, int valid)
{
  Frame *f;
  int i;

  f=fb->picbuf_short[fb->short_size-1];

  for (i=fb->short_size-2;i>=0;i--)
    fb->picbuf_short[i+1]=fb->picbuf_short[i];

  fb->picbuf_short[0]=f;


  fb->picbuf_short[0]->used=1;
  fb->picbuf_short[0]->picID=pn_expected;
  fb->picbuf_short[0]->lt_picID=-1;
  fb->picbuf_short[0]->valid=valid;

  (fb->short_used)++;
  if (fb->short_used>fb->short_size)
    fb->short_used=fb->short_size;
}

/*!
 ************************************************************************
 * \brief
 *      Tian Dong, June 13, 2002
 *      If a PN gap is found, try to fill the gap
 * \param img
 *      
 ************************************************************************
 */
void fill_PN_gap(ImageParameters *img)
{
  int pn_expected, pn_new;

  if (fb==0 || fb!=frm) return;

  if ( img->type == B_SLICE ) return;

  pn_expected = (fb->picbuf_short[0]->picID+1) % (img->buf_cycle);
  pn_new = img->pn;

  while ( pn_new != pn_expected)
  {
    fb = frm;
    add_frame(pn_expected, 0);

    fb = fld;
    add_frame(pn_expected, 0);
    add_frame(pn_expected, 0);

    pn_expected = (fb->picbuf_short[0]->picID + 1) % (img->buf_cycle);
    img->number++;
  }
  fb = frm;
}


void alloc_ref_pic_list_reordering_buffer(Slice *currSlice)
{
  int size = img->num_ref_pic_active_fwd;

  if (img->type!=I_SLICE && img->type!=SI_SLICE)
  {
    if ((currSlice->remapping_of_pic_nums_idc_l0 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: remapping_of_pic_nums_idc_l0");
    if ((currSlice->abs_diff_pic_num_minus1_l0 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: abs_diff_pic_num_minus1_l0");
    if ((currSlice->long_term_pic_idx_l0 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: long_term_pic_idx_l0");
  }
  else
  {
    currSlice->remapping_of_pic_nums_idc_l0 = NULL;
    currSlice->abs_diff_pic_num_minus1_l0 = NULL;
    currSlice->long_term_pic_idx_l0 = NULL;
  }
  
  size = img->num_ref_pic_active_bwd;

  if (img->type!=B_SLICE)
  {
    if ((currSlice->remapping_of_pic_nums_idc_l1 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: remapping_of_pic_nums_idc_l1");
    if ((currSlice->abs_diff_pic_num_minus1_l1 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: abs_diff_pic_num_minus1_l1");
    if ((currSlice->long_term_pic_idx_l1 = calloc(size,sizeof(int)))==NULL) no_mem_exit("alloc_ref_pic_list_reordering_buffer: long_term_pic_idx_l1");
  }
  else
  {
    currSlice->remapping_of_pic_nums_idc_l1 = NULL;
    currSlice->abs_diff_pic_num_minus1_l1 = NULL;
    currSlice->long_term_pic_idx_l1 = NULL;
  }
}

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;
  
  if (currSlice->remapping_of_pic_nums_idc_l1)
    free(currSlice->remapping_of_pic_nums_idc_l1);
  if (currSlice->abs_diff_pic_num_minus1_l1)
    free(currSlice->abs_diff_pic_num_minus1_l1);
  if (currSlice->long_term_pic_idx_l1)
    free(currSlice->long_term_pic_idx_l1);
  
  currSlice->remapping_of_pic_nums_idc_l1 = NULL;
  currSlice->abs_diff_pic_num_minus1_l1 = NULL;
  currSlice->long_term_pic_idx_l1 = NULL;
}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -