亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

? 歡迎來到蟲蟲下載站! | ?? 資源下載 ?? 資源專輯 ?? 關(guān)于我們
? 蟲蟲下載站

?? mv-search.c

?? 一個簡單的視頻會議VC++MFC工程文件
?? C
?? 第 1 頁 / 共 5 頁
字號:

/*!
 *************************************************************************************
 * \file mv-search.c
 *
 * \brief
 *    Motion Vector Search, unified for B and P Pictures
 *
 * \author
 *    Main contributors (see contributors.h for copyright, address and affiliation details)
 *      - Stephan Wenger                  <stewe@cs.tu-berlin.de>
 *      - Inge Lille-Lang鴜               <inge.lille-langoy@telenor.com>
 *      - Rickard Sjoberg                 <rickard.sjoberg@era.ericsson.se>
 *      - Stephan Wenger                  <stewe@cs.tu-berlin.de>
 *      - Jani Lainema                    <jani.lainema@nokia.com>
 *      - Detlev Marpe                    <marpe@hhi.de>
 *      - Thomas Wedi                     <wedi@tnt.uni-hannover.de>
 *      - Heiko Schwarz                   <hschwarz@hhi.de>
 *
 *************************************************************************************
*/

#include "contributors.h"

#include <math.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>

#include "global.h"
#include "image.h"
#include "mv-search.h"
#include "refbuf.h"
#include "memalloc.h"
#include "mb_access.h"
#include "fast_me.h"

#include <time.h>
#include <sys/timeb.h>

// These procedure pointers are used by motion_search() and one_eigthpel()
static pel_t  (*PelY_14)     (pel_t**, int, int, int, int);
static pel_t *(*PelYline_11) (pel_t *, int, int, int, int);

// Statistics, temporary
int     max_mvd;
int*    spiral_search_x;
int*    spiral_search_y;
int*    mvbits;
int*    refbits;
int*    byte_abs;
int**** motion_cost;


void SetMotionVectorPredictor (int  pmv[2],
                               int  ***refPic,
                               int  ****tmp_mv,
                               int  ref_frame,
                               int  list,
                               int  block_x,
                               int  block_y,
                               int  blockshape_x,
                               int  blockshape_y);

#ifdef _FAST_FULL_ME_

/*****
 *****  static variables for fast integer motion estimation
 *****
 */
static int  **search_setup_done;  //!< flag if all block SAD's have been calculated yet
static int  **search_center_x;    //!< absolute search center for fast full motion search
static int  **search_center_y;    //!< absolute search center for fast full motion search
static int  **pos_00;             //!< position of (0,0) vector
static int  *****BlockSAD;        //!< SAD for all blocksize, ref. frames and motion vectors
static int  **max_search_range;

extern ColocatedParams *Co_located;

/*!
 ***********************************************************************
 * \brief
 *    function creating arrays for fast integer motion estimation
 ***********************************************************************
 */
void
InitializeFastFullIntegerSearch ()
{
  int  i, j, k, list;
  int  search_range = input->search_range;
  int  max_pos      = (2*search_range+1) * (2*search_range+1);

  if ((BlockSAD = (int*****)malloc (2 * sizeof(int****))) == NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: BlockSAD");

  for (list=0; list<2;list++)
  {
    if ((BlockSAD[list] = (int****)malloc ((img->max_num_references+1) * sizeof(int***))) == NULL)
      no_mem_exit ("InitializeFastFullIntegerSearch: BlockSAD");
    for (i = 0; i <= img->max_num_references; i++)
    {
      if ((BlockSAD[list][i] = (int***)malloc (8 * sizeof(int**))) == NULL)
        no_mem_exit ("InitializeFastFullIntegerSearch: BlockSAD");
      for (j = 1; j < 8; j++)
      {
        if ((BlockSAD[list][i][j] = (int**)malloc (16 * sizeof(int*))) == NULL)
          no_mem_exit ("InitializeFastFullIntegerSearch: BlockSAD");
        for (k = 0; k < 16; k++)
        {
          if ((BlockSAD[list][i][j][k] = (int*)malloc (max_pos * sizeof(int))) == NULL)
            no_mem_exit ("InitializeFastFullIntegerSearch: BlockSAD");
        }
      }
    }
  }

  if ((search_setup_done = (int**)malloc (2*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_setup_done");
  if ((search_center_x = (int**)malloc (2*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_center_x");
  if ((search_center_y = (int**)malloc (2*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_center_y");
  if ((pos_00 = (int**)malloc (2*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: pos_00");
  if ((max_search_range = (int**)malloc (2*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: max_search_range");

  for (list=0; list<2; list++)
  {
  if ((search_setup_done[list] = (int*)malloc ((img->max_num_references+1)*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_setup_done");
  if ((search_center_x[list] = (int*)malloc ((img->max_num_references+1)*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_center_x");
  if ((search_center_y[list] = (int*)malloc ((img->max_num_references+1)*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: search_center_y");
  if ((pos_00[list] = (int*)malloc ((img->max_num_references+1)*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: pos_00");
  if ((max_search_range[list] = (int*)malloc ((img->max_num_references+1)*sizeof(int)))==NULL)
    no_mem_exit ("InitializeFastFullIntegerSearch: max_search_range");
  }

  // assign max search ranges for reference frames
  if (input->full_search == 2)
  {
    for (list=0;list<2;list++)
      for (i=0; i<=img->max_num_references; i++)  
        max_search_range[list][i] = search_range;
  }
  else
  {
    for (list=0;list<2;list++)
    {
      max_search_range[list][0] = max_search_range[list][img->max_num_references] = search_range;
      for (i=1; i< img->max_num_references; i++)  max_search_range[list][i] = search_range / 2;
    }
  }

}



/*!
 ***********************************************************************
 * \brief
 *    function for deleting the arrays for fast integer motion estimation
 ***********************************************************************
 */
void
ClearFastFullIntegerSearch ()
{
  int  i, j, k, list;

  for (list=0; list<2; list++)
  {
    for (i = 0; i <= img->max_num_references; i++)
    {
      for (j = 1; j < 8; j++)
      {
        for (k = 0; k < 16; k++)
        {
          free (BlockSAD[list][i][j][k]);
        }
        free (BlockSAD[list][i][j]);
      }
      free (BlockSAD[list][i]);
    }
    free (BlockSAD[list]);
  }
  free (BlockSAD);

  for (list=0; list<2; list++)
  {
    free (search_setup_done[list]);
    free (search_center_x[list]);
    free (search_center_y[list]);
    free (pos_00[list]);
    free (max_search_range[list]);
  }
  free (search_setup_done);
  free (search_center_x);
  free (search_center_y);
  free (pos_00);
  free (max_search_range);

}


/*!
 ***********************************************************************
 * \brief
 *    function resetting flags for fast integer motion estimation
 *    (have to be called in start_macroblock())
 ***********************************************************************
 */
void
ResetFastFullIntegerSearch ()
{
  int i,list;

  for (list=0; list<2; list++)
    for (i = 0; i <= img->max_num_references; i++)
      search_setup_done [list][i] = 0;
}

/*!
 ***********************************************************************
 * \brief
 *    calculation of SAD for larger blocks on the basis of 4x4 blocks
 ***********************************************************************
 */
void
SetupLargerBlocks (int list, int refindex, int max_pos)
{
#define ADD_UP_BLOCKS()   _o=*_bo; _i=*_bi; _j=*_bj; for(pos=0;pos<max_pos;pos++) _o[pos] = _i[pos] + _j[pos];
#define INCREMENT(inc)    _bo+=inc; _bi+=inc; _bj+=inc;

  int    pos, **_bo, **_bi, **_bj;
  register int *_o,   *_i,   *_j;

  //--- blocktype 6 ---
  _bo = BlockSAD[list][refindex][6];
  _bi = BlockSAD[list][refindex][7];
  _bj = _bi + 4;
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS(); INCREMENT(5);
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS(); INCREMENT(1);
  ADD_UP_BLOCKS();

  //--- blocktype 5 ---
  _bo = BlockSAD[list][refindex][5];
  _bi = BlockSAD[list][refindex][7];
  _bj = _bi + 1;
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS();

  //--- blocktype 4 ---
  _bo = BlockSAD[list][refindex][4];
  _bi = BlockSAD[list][refindex][6];
  _bj = _bi + 1;
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS(); INCREMENT(6);
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS();

  //--- blocktype 3 ---
  _bo = BlockSAD[list][refindex][3];
  _bi = BlockSAD[list][refindex][4];
  _bj = _bi + 8;
  ADD_UP_BLOCKS(); INCREMENT(2);
  ADD_UP_BLOCKS();

  //--- blocktype 2 ---
  _bo = BlockSAD[list][refindex][2];
  _bi = BlockSAD[list][refindex][4];
  _bj = _bi + 2;
  ADD_UP_BLOCKS(); INCREMENT(8);
  ADD_UP_BLOCKS();

  //--- blocktype 1 ---
  _bo = BlockSAD[list][refindex][1];
  _bi = BlockSAD[list][refindex][3];
  _bj = _bi + 2;
  ADD_UP_BLOCKS();
}


/*!
 ***********************************************************************
 * \brief
 *    Setup the fast search for an macroblock
 ***********************************************************************
 */
void SetupFastFullPelSearch (int ref, int list)  // <--  reference frame parameter, list0 or 1
{
  int     pmv[2];
  pel_t   orig_blocks[256], *orgptr=orig_blocks, *refptr;
  int     offset_x, offset_y, x, y, range_partly_outside, ref_x, ref_y, pos, abs_x, abs_y, bindex, blky;
  int     LineSadBlk0, LineSadBlk1, LineSadBlk2, LineSadBlk3;
  int     max_width, max_height;
  int     img_width, img_height;

  StorablePicture *ref_picture;
  pel_t   *ref_pic;

  int**   block_sad     = BlockSAD[list][ref][7];
  int     search_range  = max_search_range[list][ref];
  int     max_pos       = (2*search_range+1) * (2*search_range+1);

  int     list_offset   = ((img->MbaffFrameFlag)&&(img->mb_data[img->current_mb_nr].mb_field))? img->current_mb_nr%2 ? 4 : 2 : 0;

  int     apply_weights = ( (active_pps->weighted_pred_flag && (img->type == P_SLICE || img->type == SP_SLICE)) ||
                            (active_pps->weighted_bipred_idc && (img->type == B_SLICE)));

  
  ref_picture     = listX[list+list_offset][ref];

  if (apply_weights)
    ref_pic       = ref_picture->imgY_11_w;
  else
    ref_pic       = ref_picture->imgY_11;

  max_width     = ref_picture->size_x - 17;
  max_height    = ref_picture->size_y - 17;
  
  img_width     = ref_picture->size_x;
  img_height    = ref_picture->size_y;

  //===== get search center: predictor of 16x16 block =====
  SetMotionVectorPredictor (pmv, enc_picture->ref_idx, enc_picture->mv, ref, list, 0, 0, 16, 16);
  search_center_x[list][ref] = pmv[0] / 4;
  search_center_y[list][ref] = pmv[1] / 4;

  if (!input->rdopt)
  {
    //--- correct center so that (0,0) vector is inside ---
    search_center_x[list][ref] = max(-search_range, min(search_range, search_center_x[list][ref]));
    search_center_y[list][ref] = max(-search_range, min(search_range, search_center_y[list][ref]));
  }

  search_center_x[list][ref] += img->opix_x;
  search_center_y[list][ref] += img->opix_y;

?? 快捷鍵說明

復(fù)制代碼 Ctrl + C
搜索代碼 Ctrl + F
全屏模式 F11
切換主題 Ctrl + Shift + D
顯示快捷鍵 ?
增大字號 Ctrl + =
減小字號 Ctrl + -
亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频
亚洲精品免费在线| 亚洲精品一区二区精华| 最新久久zyz资源站| 国产99久久久精品| 亚洲免费高清视频在线| 欧美亚洲图片小说| 全部av―极品视觉盛宴亚洲| 日韩精品一区二区在线观看| 国产一区二区三区视频在线播放| 国产色91在线| 91丨porny丨户外露出| 亚洲自拍偷拍图区| 日韩视频一区二区三区在线播放| 国产精品一区在线观看你懂的| 中文字幕免费不卡在线| 欧洲视频一区二区| 蜜臀av性久久久久蜜臀aⅴ| ww亚洲ww在线观看国产| 99国产精品国产精品毛片| 一区二区三区日韩| 日韩三级视频在线观看| 成人午夜视频免费看| 亚洲国产日韩精品| 久久久久久久久99精品| 91成人在线观看喷潮| 久久国产精品无码网站| 亚洲日本成人在线观看| 在线不卡中文字幕| 不卡欧美aaaaa| 日韩精品一二区| 国产精品丝袜一区| 欧美精品99久久久**| 岛国av在线一区| 香蕉久久夜色精品国产使用方法| 久久精品视频一区二区三区| 欧洲国内综合视频| 丰满白嫩尤物一区二区| 日本免费在线视频不卡一不卡二| 国产精品热久久久久夜色精品三区 | 国产精品久久久久永久免费观看 | 欧美日韩精品一区二区三区四区 | 日韩欧美专区在线| 99免费精品视频| 国产在线一区二区综合免费视频| 亚洲女与黑人做爰| 国产欧美精品一区二区色综合| 欧美美女一区二区| thepron国产精品| 国产资源精品在线观看| 亚洲成人激情综合网| 中文字幕日本乱码精品影院| 欧美一区二区三区在| 色素色在线综合| 国产精品一品二品| 精品一二三四区| 日韩中文字幕av电影| 亚洲美女淫视频| 国产精品美女久久久久久久| 久久久久久久av麻豆果冻| 欧美一区二区三区在线| 欧美日韩亚洲不卡| 色综合天天性综合| 成人av片在线观看| 国产一区二区精品久久99| 免费观看在线综合| 午夜精品成人在线| 日韩精品亚洲一区二区三区免费| 亚洲亚洲精品在线观看| 有坂深雪av一区二区精品| ...xxx性欧美| 亚洲乱码中文字幕综合| 亚洲品质自拍视频| 一区二区三区四区视频精品免费| 亚洲欧洲色图综合| 亚洲欧洲成人自拍| 亚洲欧美经典视频| 亚洲国产综合91精品麻豆| 一区二区三区欧美亚洲| 亚洲午夜精品在线| 偷拍一区二区三区| 日韩成人免费电影| 九九精品一区二区| 国产成人亚洲综合a∨婷婷| 国产成人综合自拍| 91最新地址在线播放| 色系网站成人免费| 欧美亚洲一区二区在线观看| 久久综合久久鬼色| 国产日韩欧美电影| 国产精品国产精品国产专区不蜜| 国产精品免费人成网站| 亚洲色图欧美在线| 亚洲高清免费一级二级三级| 日韩高清欧美激情| 国内精品久久久久影院薰衣草| 国产精品99久久久久久久女警| 国产成人综合亚洲网站| 91天堂素人约啪| 欧美日韩精品福利| 亚洲精品一区二区三区在线观看| 久久久久久久电影| 亚洲日穴在线视频| 免费观看91视频大全| 国产成人在线看| 色欧美日韩亚洲| 日韩一区二区免费在线观看| 亚洲国产成人在线| 亚洲二区在线观看| 国产一区视频网站| 91丨九色丨蝌蚪丨老版| 日韩欧美激情一区| 国产精品热久久久久夜色精品三区 | 337p亚洲精品色噜噜狠狠| 精品av久久707| 亚洲美女电影在线| 久草在线在线精品观看| 99在线视频精品| 91精品国产福利| 中文字幕在线观看一区| 日本午夜一区二区| 北条麻妃一区二区三区| 91.com视频| 亚洲欧美中日韩| 久久精品噜噜噜成人88aⅴ| 91网站在线观看视频| 欧美变态tickling挠脚心| ...xxx性欧美| 国产精品小仙女| 91精品国产91久久久久久一区二区| 亚洲国产成人在线| 麻豆91精品视频| 在线精品观看国产| 国产精品污www在线观看| 日韩激情一二三区| 色婷婷激情一区二区三区| 久久精品一区二区三区不卡 | 久久―日本道色综合久久| 亚洲一区在线观看免费| 国产精品996| 日韩视频123| 亚洲综合在线视频| 成人开心网精品视频| 26uuu国产一区二区三区| 午夜久久久久久久久| 91激情五月电影| 国产精品美女久久久久aⅴ国产馆 国产精品美女久久久久av爽李琼 国产精品美女久久久久高潮 | 成人综合在线观看| 精品伦理精品一区| 天堂成人国产精品一区| 91极品美女在线| 自拍偷拍亚洲综合| 成人h动漫精品| 欧美激情一区在线观看| 国产乱子轮精品视频| 欧美一级生活片| 婷婷一区二区三区| 欧美日韩亚洲不卡| 亚洲成人av资源| 欧美美女bb生活片| 五月婷婷激情综合| 538在线一区二区精品国产| 香蕉加勒比综合久久| 欧美日韩你懂的| 午夜不卡av免费| 欧美日韩国产电影| 日本中文在线一区| 欧美一区二区在线免费播放| 视频一区二区国产| 日韩免费高清av| 精品系列免费在线观看| 337p日本欧洲亚洲大胆精品 | 亚洲人成网站色在线观看| 91亚洲男人天堂| 亚洲夂夂婷婷色拍ww47| 欧美日韩一区二区在线观看 | 亚洲国产日日夜夜| 在线91免费看| 久久成人18免费观看| 久久精品亚洲精品国产欧美kt∨| 国产精品影视在线| 国产精品高潮呻吟| 欧美在线制服丝袜| 欧美aaaaa成人免费观看视频| 日韩欧美色综合| 国产成人在线色| 亚洲美女屁股眼交| 在线电影一区二区三区| 久久狠狠亚洲综合| 亚洲国产成人在线| 欧美午夜精品久久久久久孕妇| 婷婷激情综合网| 久久久精品综合| 色婷婷av久久久久久久| 日本不卡123| 中文字幕国产一区| 欧美三级乱人伦电影| 国产一区在线观看麻豆| 亚洲男人的天堂网| 日韩欧美国产三级电影视频| 成人激情动漫在线观看|