You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

2039 lines
71KB

  1. /*
  2. * Motion estimation
  3. * Copyright (c) 2000,2001 Fabrice Bellard.
  4. * Copyright (c) 2002-2004 Michael Niedermayer
  5. *
  6. *
  7. * This library is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2 of the License, or (at your option) any later version.
  11. *
  12. * This library is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with this library; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
  20. *
  21. * new Motion Estimation (X1/EPZS) by Michael Niedermayer <michaelni@gmx.at>
  22. */
  23. /**
  24. * @file motion_est.c
  25. * Motion estimation.
  26. */
  27. #include <stdlib.h>
  28. #include <stdio.h>
  29. #include <limits.h>
  30. #include "avcodec.h"
  31. #include "dsputil.h"
  32. #include "mpegvideo.h"
  33. #undef NDEBUG
  34. #include <assert.h>
  35. #define SQ(a) ((a)*(a))
  36. #define P_LEFT P[1]
  37. #define P_TOP P[2]
  38. #define P_TOPRIGHT P[3]
  39. #define P_MEDIAN P[4]
  40. #define P_MV1 P[9]
  41. static inline int sad_hpel_motion_search(MpegEncContext * s,
  42. int *mx_ptr, int *my_ptr, int dmin,
  43. int src_index, int ref_index,
  44. int size, int h);
  45. static inline int update_map_generation(MotionEstContext *c)
  46. {
  47. c->map_generation+= 1<<(ME_MAP_MV_BITS*2);
  48. if(c->map_generation==0){
  49. c->map_generation= 1<<(ME_MAP_MV_BITS*2);
  50. memset(c->map, 0, sizeof(uint32_t)*ME_MAP_SIZE);
  51. }
  52. return c->map_generation;
  53. }
  54. /* shape adaptive search stuff */
  55. typedef struct Minima{
  56. int height;
  57. int x, y;
  58. int checked;
  59. }Minima;
  60. static int minima_cmp(const void *a, const void *b){
  61. const Minima *da = (const Minima *) a;
  62. const Minima *db = (const Minima *) b;
  63. return da->height - db->height;
  64. }
  65. #define FLAG_QPEL 1 //must be 1
  66. #define FLAG_CHROMA 2
  67. #define FLAG_DIRECT 4
  68. static inline void init_ref(MotionEstContext *c, uint8_t *src[3], uint8_t *ref[3], uint8_t *ref2[3], int x, int y, int ref_index){
  69. const int offset[3]= {
  70. y*c-> stride + x,
  71. ((y*c->uvstride + x)>>1),
  72. ((y*c->uvstride + x)>>1),
  73. };
  74. int i;
  75. for(i=0; i<3; i++){
  76. c->src[0][i]= src [i] + offset[i];
  77. c->ref[0][i]= ref [i] + offset[i];
  78. }
  79. if(ref_index){
  80. for(i=0; i<3; i++){
  81. c->ref[ref_index][i]= ref2[i] + offset[i];
  82. }
  83. }
  84. }
  85. static int get_flags(MotionEstContext *c, int direct, int chroma){
  86. return ((c->avctx->flags&CODEC_FLAG_QPEL) ? FLAG_QPEL : 0)
  87. + (direct ? FLAG_DIRECT : 0)
  88. + (chroma ? FLAG_CHROMA : 0);
  89. }
  90. static always_inline int cmp(MpegEncContext *s, const int x, const int y, const int subx, const int suby,
  91. const int size, const int h, int ref_index, int src_index,
  92. me_cmp_func cmp_func, me_cmp_func chroma_cmp_func, const int flags){
  93. MotionEstContext * const c= &s->me;
  94. const int stride= c->stride;
  95. const int uvstride= c->uvstride;
  96. const int qpel= flags&FLAG_QPEL;
  97. const int chroma= flags&FLAG_CHROMA;
  98. const int dxy= subx + (suby<<(1+qpel)); //FIXME log2_subpel?
  99. const int hx= subx + (x<<(1+qpel));
  100. const int hy= suby + (y<<(1+qpel));
  101. uint8_t * const * const ref= c->ref[ref_index];
  102. uint8_t * const * const src= c->src[src_index];
  103. int d;
  104. //FIXME check chroma 4mv, (no crashes ...)
  105. if(flags&FLAG_DIRECT){
  106. if(x >= c->xmin && hx <= c->xmax<<(qpel+1) && y >= c->ymin && hy <= c->ymax<<(qpel+1)){
  107. const int time_pp= s->pp_time;
  108. const int time_pb= s->pb_time;
  109. const int mask= 2*qpel+1;
  110. if(s->mv_type==MV_TYPE_8X8){
  111. int i;
  112. for(i=0; i<4; i++){
  113. int fx = c->direct_basis_mv[i][0] + hx;
  114. int fy = c->direct_basis_mv[i][1] + hy;
  115. int bx = hx ? fx - c->co_located_mv[i][0] : c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(qpel+4));
  116. int by = hy ? fy - c->co_located_mv[i][1] : c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(qpel+4));
  117. int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));
  118. int bxy= (bx&mask) + ((by&mask)<<(qpel+1));
  119. uint8_t *dst= c->temp + 8*(i&1) + 8*stride*(i>>1);
  120. if(qpel){
  121. c->qpel_put[1][fxy](dst, ref[0] + (fx>>2) + (fy>>2)*stride, stride);
  122. c->qpel_avg[1][bxy](dst, ref[8] + (bx>>2) + (by>>2)*stride, stride);
  123. }else{
  124. c->hpel_put[1][fxy](dst, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 8);
  125. c->hpel_avg[1][bxy](dst, ref[8] + (bx>>1) + (by>>1)*stride, stride, 8);
  126. }
  127. }
  128. }else{
  129. int fx = c->direct_basis_mv[0][0] + hx;
  130. int fy = c->direct_basis_mv[0][1] + hy;
  131. int bx = hx ? fx - c->co_located_mv[0][0] : (c->co_located_mv[0][0]*(time_pb - time_pp)/time_pp);
  132. int by = hy ? fy - c->co_located_mv[0][1] : (c->co_located_mv[0][1]*(time_pb - time_pp)/time_pp);
  133. int fxy= (fx&mask) + ((fy&mask)<<(qpel+1));
  134. int bxy= (bx&mask) + ((by&mask)<<(qpel+1));
  135. if(qpel){
  136. c->qpel_put[1][fxy](c->temp , ref[0] + (fx>>2) + (fy>>2)*stride , stride);
  137. c->qpel_put[1][fxy](c->temp + 8 , ref[0] + (fx>>2) + (fy>>2)*stride + 8 , stride);
  138. c->qpel_put[1][fxy](c->temp + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8*stride, stride);
  139. c->qpel_put[1][fxy](c->temp + 8 + 8*stride, ref[0] + (fx>>2) + (fy>>2)*stride + 8 + 8*stride, stride);
  140. c->qpel_avg[1][bxy](c->temp , ref[8] + (bx>>2) + (by>>2)*stride , stride);
  141. c->qpel_avg[1][bxy](c->temp + 8 , ref[8] + (bx>>2) + (by>>2)*stride + 8 , stride);
  142. c->qpel_avg[1][bxy](c->temp + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8*stride, stride);
  143. c->qpel_avg[1][bxy](c->temp + 8 + 8*stride, ref[8] + (bx>>2) + (by>>2)*stride + 8 + 8*stride, stride);
  144. }else{
  145. assert((fx>>1) + 16*s->mb_x >= -16);
  146. assert((fy>>1) + 16*s->mb_y >= -16);
  147. assert((fx>>1) + 16*s->mb_x <= s->width);
  148. assert((fy>>1) + 16*s->mb_y <= s->height);
  149. assert((bx>>1) + 16*s->mb_x >= -16);
  150. assert((by>>1) + 16*s->mb_y >= -16);
  151. assert((bx>>1) + 16*s->mb_x <= s->width);
  152. assert((by>>1) + 16*s->mb_y <= s->height);
  153. c->hpel_put[0][fxy](c->temp, ref[0] + (fx>>1) + (fy>>1)*stride, stride, 16);
  154. c->hpel_avg[0][bxy](c->temp, ref[8] + (bx>>1) + (by>>1)*stride, stride, 16);
  155. }
  156. }
  157. d = cmp_func(s, c->temp, src[0], stride, 16);
  158. }else
  159. d= 256*256*256*32;
  160. }else{
  161. int uvdxy;
  162. if(dxy){
  163. if(qpel){
  164. c->qpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride); //FIXME prototype (add h)
  165. if(chroma){
  166. int cx= hx/2;
  167. int cy= hy/2;
  168. cx= (cx>>1)|(cx&1);
  169. cy= (cy>>1)|(cy&1);
  170. uvdxy= (cx&1) + 2*(cy&1);
  171. //FIXME x/y wrong, but mpeg4 qpel is sick anyway, we should drop as much of it as possible in favor for h264
  172. }
  173. }else{
  174. c->hpel_put[size][dxy](c->temp, ref[0] + x + y*stride, stride, h);
  175. if(chroma)
  176. uvdxy= dxy | (x&1) | (2*(y&1));
  177. }
  178. d = cmp_func(s, c->temp, src[0], stride, h);
  179. }else{
  180. d = cmp_func(s, src[0], ref[0] + x + y*stride, stride, h);
  181. if(chroma)
  182. uvdxy= (x&1) + 2*(y&1);
  183. }
  184. if(chroma){
  185. uint8_t * const uvtemp= c->temp + 16*stride;
  186. c->hpel_put[size+1][uvdxy](uvtemp , ref[1] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
  187. c->hpel_put[size+1][uvdxy](uvtemp+8, ref[2] + (x>>1) + (y>>1)*uvstride, uvstride, h>>1);
  188. d += chroma_cmp_func(s, uvtemp , src[1], uvstride, h>>1);
  189. d += chroma_cmp_func(s, uvtemp+8, src[2], uvstride, h>>1);
  190. }
  191. }
  192. #if 0
  193. if(full_pel){
  194. const int index= (((y)<<ME_MAP_SHIFT) + (x))&(ME_MAP_SIZE-1);
  195. score_map[index]= d;
  196. }
  197. d += (c->mv_penalty[hx - c->pred_x] + c->mv_penalty[hy - c->pred_y])*c->penalty_factor;
  198. #endif
  199. return d;
  200. }
  201. #include "motion_est_template.c"
  202. static inline int get_penalty_factor(MpegEncContext *s, int type){
  203. switch(type&0xFF){
  204. default:
  205. case FF_CMP_SAD:
  206. return s->lambda>>FF_LAMBDA_SHIFT;
  207. case FF_CMP_DCT:
  208. return (3*s->lambda)>>(FF_LAMBDA_SHIFT+1);
  209. case FF_CMP_SATD:
  210. return (2*s->lambda)>>FF_LAMBDA_SHIFT;
  211. case FF_CMP_RD:
  212. case FF_CMP_PSNR:
  213. case FF_CMP_SSE:
  214. case FF_CMP_NSSE:
  215. return s->lambda2>>FF_LAMBDA_SHIFT;
  216. case FF_CMP_BIT:
  217. return 1;
  218. }
  219. }
  220. static int zero_cmp(void *s, uint8_t *a, uint8_t *b, int stride, int h){
  221. return 0;
  222. }
  223. static void zero_hpel(uint8_t *a, const uint8_t *b, int stride, int h){
  224. }
  225. void ff_init_me(MpegEncContext *s){
  226. MotionEstContext * const c= &s->me;
  227. c->avctx= s->avctx;
  228. ff_set_cmp(&s->dsp, s->dsp.me_pre_cmp, c->avctx->me_pre_cmp);
  229. ff_set_cmp(&s->dsp, s->dsp.me_cmp, c->avctx->me_cmp);
  230. ff_set_cmp(&s->dsp, s->dsp.me_sub_cmp, c->avctx->me_sub_cmp);
  231. ff_set_cmp(&s->dsp, s->dsp.mb_cmp, c->avctx->mb_cmp);
  232. c->flags = get_flags(c, 0, c->avctx->me_cmp &FF_CMP_CHROMA);
  233. c->sub_flags= get_flags(c, 0, c->avctx->me_sub_cmp&FF_CMP_CHROMA);
  234. c->mb_flags = get_flags(c, 0, c->avctx->mb_cmp &FF_CMP_CHROMA);
  235. /*FIXME s->no_rounding b_type*/
  236. if(s->flags&CODEC_FLAG_QPEL){
  237. c->sub_motion_search= qpel_motion_search;
  238. c->qpel_avg= s->dsp.avg_qpel_pixels_tab;
  239. if(s->no_rounding) c->qpel_put= s->dsp.put_no_rnd_qpel_pixels_tab;
  240. else c->qpel_put= s->dsp.put_qpel_pixels_tab;
  241. }else{
  242. if(c->avctx->me_sub_cmp&FF_CMP_CHROMA)
  243. c->sub_motion_search= hpel_motion_search;
  244. else if( c->avctx->me_sub_cmp == FF_CMP_SAD
  245. && c->avctx-> me_cmp == FF_CMP_SAD
  246. && c->avctx-> mb_cmp == FF_CMP_SAD)
  247. c->sub_motion_search= sad_hpel_motion_search; // 2050 vs. 2450 cycles
  248. else
  249. c->sub_motion_search= hpel_motion_search;
  250. }
  251. c->hpel_avg= s->dsp.avg_pixels_tab;
  252. if(s->no_rounding) c->hpel_put= s->dsp.put_no_rnd_pixels_tab;
  253. else c->hpel_put= s->dsp.put_pixels_tab;
  254. if(s->linesize){
  255. c->stride = s->linesize;
  256. c->uvstride= s->uvlinesize;
  257. }else{
  258. c->stride = 16*s->mb_width + 32;
  259. c->uvstride= 8*s->mb_width + 16;
  260. }
  261. // 8x8 fullpel search would need a 4x4 chroma compare, which we dont have yet, and even if we had the motion estimation code doesnt expect it
  262. if((c->avctx->me_cmp&FF_CMP_CHROMA) && !s->dsp.me_cmp[2]){
  263. s->dsp.me_cmp[2]= zero_cmp;
  264. }
  265. if((c->avctx->me_sub_cmp&FF_CMP_CHROMA) && !s->dsp.me_sub_cmp[2]){
  266. s->dsp.me_sub_cmp[2]= zero_cmp;
  267. }
  268. c->hpel_put[2][0]= c->hpel_put[2][1]=
  269. c->hpel_put[2][2]= c->hpel_put[2][3]= zero_hpel;
  270. c->temp= c->scratchpad;
  271. }
  272. #if 0
  273. static int pix_dev(uint8_t * pix, int line_size, int mean)
  274. {
  275. int s, i, j;
  276. s = 0;
  277. for (i = 0; i < 16; i++) {
  278. for (j = 0; j < 16; j += 8) {
  279. s += ABS(pix[0]-mean);
  280. s += ABS(pix[1]-mean);
  281. s += ABS(pix[2]-mean);
  282. s += ABS(pix[3]-mean);
  283. s += ABS(pix[4]-mean);
  284. s += ABS(pix[5]-mean);
  285. s += ABS(pix[6]-mean);
  286. s += ABS(pix[7]-mean);
  287. pix += 8;
  288. }
  289. pix += line_size - 16;
  290. }
  291. return s;
  292. }
  293. #endif
  294. static inline void no_motion_search(MpegEncContext * s,
  295. int *mx_ptr, int *my_ptr)
  296. {
  297. *mx_ptr = 16 * s->mb_x;
  298. *my_ptr = 16 * s->mb_y;
  299. }
  300. static int full_motion_search(MpegEncContext * s,
  301. int *mx_ptr, int *my_ptr, int range,
  302. int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture)
  303. {
  304. int x1, y1, x2, y2, xx, yy, x, y;
  305. int mx, my, dmin, d;
  306. uint8_t *pix;
  307. xx = 16 * s->mb_x;
  308. yy = 16 * s->mb_y;
  309. x1 = xx - range + 1; /* we loose one pixel to avoid boundary pb with half pixel pred */
  310. if (x1 < xmin)
  311. x1 = xmin;
  312. x2 = xx + range - 1;
  313. if (x2 > xmax)
  314. x2 = xmax;
  315. y1 = yy - range + 1;
  316. if (y1 < ymin)
  317. y1 = ymin;
  318. y2 = yy + range - 1;
  319. if (y2 > ymax)
  320. y2 = ymax;
  321. pix = s->new_picture.data[0] + (yy * s->linesize) + xx;
  322. dmin = 0x7fffffff;
  323. mx = 0;
  324. my = 0;
  325. for (y = y1; y <= y2; y++) {
  326. for (x = x1; x <= x2; x++) {
  327. d = s->dsp.pix_abs[0][0](NULL, pix, ref_picture + (y * s->linesize) + x,
  328. s->linesize, 16);
  329. if (d < dmin ||
  330. (d == dmin &&
  331. (abs(x - xx) + abs(y - yy)) <
  332. (abs(mx - xx) + abs(my - yy)))) {
  333. dmin = d;
  334. mx = x;
  335. my = y;
  336. }
  337. }
  338. }
  339. *mx_ptr = mx;
  340. *my_ptr = my;
  341. #if 0
  342. if (*mx_ptr < -(2 * range) || *mx_ptr >= (2 * range) ||
  343. *my_ptr < -(2 * range) || *my_ptr >= (2 * range)) {
  344. fprintf(stderr, "error %d %d\n", *mx_ptr, *my_ptr);
  345. }
  346. #endif
  347. return dmin;
  348. }
  349. static int log_motion_search(MpegEncContext * s,
  350. int *mx_ptr, int *my_ptr, int range,
  351. int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture)
  352. {
  353. int x1, y1, x2, y2, xx, yy, x, y;
  354. int mx, my, dmin, d;
  355. uint8_t *pix;
  356. xx = s->mb_x << 4;
  357. yy = s->mb_y << 4;
  358. /* Left limit */
  359. x1 = xx - range;
  360. if (x1 < xmin)
  361. x1 = xmin;
  362. /* Right limit */
  363. x2 = xx + range;
  364. if (x2 > xmax)
  365. x2 = xmax;
  366. /* Upper limit */
  367. y1 = yy - range;
  368. if (y1 < ymin)
  369. y1 = ymin;
  370. /* Lower limit */
  371. y2 = yy + range;
  372. if (y2 > ymax)
  373. y2 = ymax;
  374. pix = s->new_picture.data[0] + (yy * s->linesize) + xx;
  375. dmin = 0x7fffffff;
  376. mx = 0;
  377. my = 0;
  378. do {
  379. for (y = y1; y <= y2; y += range) {
  380. for (x = x1; x <= x2; x += range) {
  381. d = s->dsp.pix_abs[0][0](NULL, pix, ref_picture + (y * s->linesize) + x, s->linesize, 16);
  382. if (d < dmin || (d == dmin && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) {
  383. dmin = d;
  384. mx = x;
  385. my = y;
  386. }
  387. }
  388. }
  389. range = range >> 1;
  390. x1 = mx - range;
  391. if (x1 < xmin)
  392. x1 = xmin;
  393. x2 = mx + range;
  394. if (x2 > xmax)
  395. x2 = xmax;
  396. y1 = my - range;
  397. if (y1 < ymin)
  398. y1 = ymin;
  399. y2 = my + range;
  400. if (y2 > ymax)
  401. y2 = ymax;
  402. } while (range >= 1);
  403. #ifdef DEBUG
  404. fprintf(stderr, "log - MX: %d\tMY: %d\n", mx, my);
  405. #endif
  406. *mx_ptr = mx;
  407. *my_ptr = my;
  408. return dmin;
  409. }
  410. static int phods_motion_search(MpegEncContext * s,
  411. int *mx_ptr, int *my_ptr, int range,
  412. int xmin, int ymin, int xmax, int ymax, uint8_t *ref_picture)
  413. {
  414. int x1, y1, x2, y2, xx, yy, x, y, lastx, d;
  415. int mx, my, dminx, dminy;
  416. uint8_t *pix;
  417. xx = s->mb_x << 4;
  418. yy = s->mb_y << 4;
  419. /* Left limit */
  420. x1 = xx - range;
  421. if (x1 < xmin)
  422. x1 = xmin;
  423. /* Right limit */
  424. x2 = xx + range;
  425. if (x2 > xmax)
  426. x2 = xmax;
  427. /* Upper limit */
  428. y1 = yy - range;
  429. if (y1 < ymin)
  430. y1 = ymin;
  431. /* Lower limit */
  432. y2 = yy + range;
  433. if (y2 > ymax)
  434. y2 = ymax;
  435. pix = s->new_picture.data[0] + (yy * s->linesize) + xx;
  436. mx = 0;
  437. my = 0;
  438. x = xx;
  439. y = yy;
  440. do {
  441. dminx = 0x7fffffff;
  442. dminy = 0x7fffffff;
  443. lastx = x;
  444. for (x = x1; x <= x2; x += range) {
  445. d = s->dsp.pix_abs[0][0](NULL, pix, ref_picture + (y * s->linesize) + x, s->linesize, 16);
  446. if (d < dminx || (d == dminx && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) {
  447. dminx = d;
  448. mx = x;
  449. }
  450. }
  451. x = lastx;
  452. for (y = y1; y <= y2; y += range) {
  453. d = s->dsp.pix_abs[0][0](NULL, pix, ref_picture + (y * s->linesize) + x, s->linesize, 16);
  454. if (d < dminy || (d == dminy && (abs(x - xx) + abs(y - yy)) < (abs(mx - xx) + abs(my - yy)))) {
  455. dminy = d;
  456. my = y;
  457. }
  458. }
  459. range = range >> 1;
  460. x = mx;
  461. y = my;
  462. x1 = mx - range;
  463. if (x1 < xmin)
  464. x1 = xmin;
  465. x2 = mx + range;
  466. if (x2 > xmax)
  467. x2 = xmax;
  468. y1 = my - range;
  469. if (y1 < ymin)
  470. y1 = ymin;
  471. y2 = my + range;
  472. if (y2 > ymax)
  473. y2 = ymax;
  474. } while (range >= 1);
  475. #ifdef DEBUG
  476. fprintf(stderr, "phods - MX: %d\tMY: %d\n", mx, my);
  477. #endif
  478. /* half pixel search */
  479. *mx_ptr = mx;
  480. *my_ptr = my;
  481. return dminy;
  482. }
  483. #define Z_THRESHOLD 256
  484. #define CHECK_SAD_HALF_MV(suffix, x, y) \
  485. {\
  486. d= s->dsp.pix_abs[size][(x?1:0)+(y?2:0)](NULL, pix, ptr+((x)>>1), stride, h);\
  487. d += (mv_penalty[pen_x + x] + mv_penalty[pen_y + y])*penalty_factor;\
  488. COPY3_IF_LT(dminh, d, dx, x, dy, y)\
  489. }
  490. static inline int sad_hpel_motion_search(MpegEncContext * s,
  491. int *mx_ptr, int *my_ptr, int dmin,
  492. int src_index, int ref_index,
  493. int size, int h)
  494. {
  495. MotionEstContext * const c= &s->me;
  496. const int penalty_factor= c->sub_penalty_factor;
  497. int mx, my, dminh;
  498. uint8_t *pix, *ptr;
  499. int stride= c->stride;
  500. const int flags= c->sub_flags;
  501. LOAD_COMMON
  502. assert(flags == 0);
  503. if(c->skip){
  504. // printf("S");
  505. *mx_ptr = 0;
  506. *my_ptr = 0;
  507. return dmin;
  508. }
  509. // printf("N");
  510. pix = c->src[src_index][0];
  511. mx = *mx_ptr;
  512. my = *my_ptr;
  513. ptr = c->ref[ref_index][0] + (my * stride) + mx;
  514. dminh = dmin;
  515. if (mx > xmin && mx < xmax &&
  516. my > ymin && my < ymax) {
  517. int dx=0, dy=0;
  518. int d, pen_x, pen_y;
  519. const int index= (my<<ME_MAP_SHIFT) + mx;
  520. const int t= score_map[(index-(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)];
  521. const int l= score_map[(index- 1 )&(ME_MAP_SIZE-1)];
  522. const int r= score_map[(index+ 1 )&(ME_MAP_SIZE-1)];
  523. const int b= score_map[(index+(1<<ME_MAP_SHIFT))&(ME_MAP_SIZE-1)];
  524. mx<<=1;
  525. my<<=1;
  526. pen_x= pred_x + mx;
  527. pen_y= pred_y + my;
  528. ptr-= stride;
  529. if(t<=b){
  530. CHECK_SAD_HALF_MV(y2 , 0, -1)
  531. if(l<=r){
  532. CHECK_SAD_HALF_MV(xy2, -1, -1)
  533. if(t+r<=b+l){
  534. CHECK_SAD_HALF_MV(xy2, +1, -1)
  535. ptr+= stride;
  536. }else{
  537. ptr+= stride;
  538. CHECK_SAD_HALF_MV(xy2, -1, +1)
  539. }
  540. CHECK_SAD_HALF_MV(x2 , -1, 0)
  541. }else{
  542. CHECK_SAD_HALF_MV(xy2, +1, -1)
  543. if(t+l<=b+r){
  544. CHECK_SAD_HALF_MV(xy2, -1, -1)
  545. ptr+= stride;
  546. }else{
  547. ptr+= stride;
  548. CHECK_SAD_HALF_MV(xy2, +1, +1)
  549. }
  550. CHECK_SAD_HALF_MV(x2 , +1, 0)
  551. }
  552. }else{
  553. if(l<=r){
  554. if(t+l<=b+r){
  555. CHECK_SAD_HALF_MV(xy2, -1, -1)
  556. ptr+= stride;
  557. }else{
  558. ptr+= stride;
  559. CHECK_SAD_HALF_MV(xy2, +1, +1)
  560. }
  561. CHECK_SAD_HALF_MV(x2 , -1, 0)
  562. CHECK_SAD_HALF_MV(xy2, -1, +1)
  563. }else{
  564. if(t+r<=b+l){
  565. CHECK_SAD_HALF_MV(xy2, +1, -1)
  566. ptr+= stride;
  567. }else{
  568. ptr+= stride;
  569. CHECK_SAD_HALF_MV(xy2, -1, +1)
  570. }
  571. CHECK_SAD_HALF_MV(x2 , +1, 0)
  572. CHECK_SAD_HALF_MV(xy2, +1, +1)
  573. }
  574. CHECK_SAD_HALF_MV(y2 , 0, +1)
  575. }
  576. mx+=dx;
  577. my+=dy;
  578. }else{
  579. mx<<=1;
  580. my<<=1;
  581. }
  582. *mx_ptr = mx;
  583. *my_ptr = my;
  584. return dminh;
  585. }
  586. static inline void set_p_mv_tables(MpegEncContext * s, int mx, int my, int mv4)
  587. {
  588. const int xy= s->mb_x + s->mb_y*s->mb_stride;
  589. s->p_mv_table[xy][0] = mx;
  590. s->p_mv_table[xy][1] = my;
  591. /* has allready been set to the 4 MV if 4MV is done */
  592. if(mv4){
  593. int mot_xy= s->block_index[0];
  594. s->current_picture.motion_val[0][mot_xy ][0]= mx;
  595. s->current_picture.motion_val[0][mot_xy ][1]= my;
  596. s->current_picture.motion_val[0][mot_xy+1][0]= mx;
  597. s->current_picture.motion_val[0][mot_xy+1][1]= my;
  598. mot_xy += s->b8_stride;
  599. s->current_picture.motion_val[0][mot_xy ][0]= mx;
  600. s->current_picture.motion_val[0][mot_xy ][1]= my;
  601. s->current_picture.motion_val[0][mot_xy+1][0]= mx;
  602. s->current_picture.motion_val[0][mot_xy+1][1]= my;
  603. }
  604. }
  605. /**
  606. * get fullpel ME search limits.
  607. */
  608. static inline void get_limits(MpegEncContext *s, int x, int y)
  609. {
  610. MotionEstContext * const c= &s->me;
  611. /*
  612. if(c->avctx->me_range) c->range= c->avctx->me_range >> 1;
  613. else c->range= 16;
  614. */
  615. if (s->unrestricted_mv) {
  616. c->xmin = - x - 16;
  617. c->ymin = - y - 16;
  618. c->xmax = - x + s->mb_width *16;
  619. c->ymax = - y + s->mb_height*16;
  620. } else {
  621. c->xmin = - x;
  622. c->ymin = - y;
  623. c->xmax = - x + s->mb_width *16 - 16;
  624. c->ymax = - y + s->mb_height*16 - 16;
  625. }
  626. }
  627. static inline void init_mv4_ref(MotionEstContext *c){
  628. const int stride= c->stride;
  629. c->ref[1][0] = c->ref[0][0] + 8;
  630. c->ref[2][0] = c->ref[0][0] + 8*stride;
  631. c->ref[3][0] = c->ref[2][0] + 8;
  632. c->src[1][0] = c->src[0][0] + 8;
  633. c->src[2][0] = c->src[0][0] + 8*stride;
  634. c->src[3][0] = c->src[2][0] + 8;
  635. }
  636. static inline int h263_mv4_search(MpegEncContext *s, int mx, int my, int shift)
  637. {
  638. MotionEstContext * const c= &s->me;
  639. const int size= 1;
  640. const int h=8;
  641. int block;
  642. int P[10][2];
  643. int dmin_sum=0, mx4_sum=0, my4_sum=0;
  644. int same=1;
  645. const int stride= c->stride;
  646. const int uvstride= c->uvstride;
  647. uint8_t *mv_penalty= c->current_mv_penalty;
  648. init_mv4_ref(c);
  649. for(block=0; block<4; block++){
  650. int mx4, my4;
  651. int pred_x4, pred_y4;
  652. int dmin4;
  653. static const int off[4]= {2, 1, 1, -1};
  654. const int mot_stride = s->b8_stride;
  655. const int mot_xy = s->block_index[block];
  656. P_LEFT[0] = s->current_picture.motion_val[0][mot_xy - 1][0];
  657. P_LEFT[1] = s->current_picture.motion_val[0][mot_xy - 1][1];
  658. if(P_LEFT[0] > (c->xmax<<shift)) P_LEFT[0] = (c->xmax<<shift);
  659. /* special case for first line */
  660. if (s->first_slice_line && block<2) {
  661. c->pred_x= pred_x4= P_LEFT[0];
  662. c->pred_y= pred_y4= P_LEFT[1];
  663. } else {
  664. P_TOP[0] = s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
  665. P_TOP[1] = s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
  666. P_TOPRIGHT[0] = s->current_picture.motion_val[0][mot_xy - mot_stride + off[block]][0];
  667. P_TOPRIGHT[1] = s->current_picture.motion_val[0][mot_xy - mot_stride + off[block]][1];
  668. if(P_TOP[1] > (c->ymax<<shift)) P_TOP[1] = (c->ymax<<shift);
  669. if(P_TOPRIGHT[0] < (c->xmin<<shift)) P_TOPRIGHT[0]= (c->xmin<<shift);
  670. if(P_TOPRIGHT[0] > (c->xmax<<shift)) P_TOPRIGHT[0]= (c->xmax<<shift);
  671. if(P_TOPRIGHT[1] > (c->ymax<<shift)) P_TOPRIGHT[1]= (c->ymax<<shift);
  672. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  673. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  674. c->pred_x= pred_x4 = P_MEDIAN[0];
  675. c->pred_y= pred_y4 = P_MEDIAN[1];
  676. }
  677. P_MV1[0]= mx;
  678. P_MV1[1]= my;
  679. dmin4 = epzs_motion_search4(s, &mx4, &my4, P, block, block, s->p_mv_table, (1<<16)>>shift);
  680. dmin4= c->sub_motion_search(s, &mx4, &my4, dmin4, block, block, size, h);
  681. if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){
  682. int dxy;
  683. const int offset= ((block&1) + (block>>1)*stride)*8;
  684. uint8_t *dest_y = c->scratchpad + offset;
  685. if(s->quarter_sample){
  686. uint8_t *ref= c->ref[block][0] + (mx4>>2) + (my4>>2)*stride;
  687. dxy = ((my4 & 3) << 2) | (mx4 & 3);
  688. if(s->no_rounding)
  689. s->dsp.put_no_rnd_qpel_pixels_tab[1][dxy](dest_y , ref , stride);
  690. else
  691. s->dsp.put_qpel_pixels_tab [1][dxy](dest_y , ref , stride);
  692. }else{
  693. uint8_t *ref= c->ref[block][0] + (mx4>>1) + (my4>>1)*stride;
  694. dxy = ((my4 & 1) << 1) | (mx4 & 1);
  695. if(s->no_rounding)
  696. s->dsp.put_no_rnd_pixels_tab[1][dxy](dest_y , ref , stride, h);
  697. else
  698. s->dsp.put_pixels_tab [1][dxy](dest_y , ref , stride, h);
  699. }
  700. dmin_sum+= (mv_penalty[mx4-pred_x4] + mv_penalty[my4-pred_y4])*c->mb_penalty_factor;
  701. }else
  702. dmin_sum+= dmin4;
  703. if(s->quarter_sample){
  704. mx4_sum+= mx4/2;
  705. my4_sum+= my4/2;
  706. }else{
  707. mx4_sum+= mx4;
  708. my4_sum+= my4;
  709. }
  710. s->current_picture.motion_val[0][ s->block_index[block] ][0]= mx4;
  711. s->current_picture.motion_val[0][ s->block_index[block] ][1]= my4;
  712. if(mx4 != mx || my4 != my) same=0;
  713. }
  714. if(same)
  715. return INT_MAX;
  716. if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){
  717. dmin_sum += s->dsp.mb_cmp[0](s, s->new_picture.data[0] + s->mb_x*16 + s->mb_y*16*stride, c->scratchpad, stride, 16);
  718. }
  719. if(c->avctx->mb_cmp&FF_CMP_CHROMA){
  720. int dxy;
  721. int mx, my;
  722. int offset;
  723. mx= ff_h263_round_chroma(mx4_sum);
  724. my= ff_h263_round_chroma(my4_sum);
  725. dxy = ((my & 1) << 1) | (mx & 1);
  726. offset= (s->mb_x*8 + (mx>>1)) + (s->mb_y*8 + (my>>1))*s->uvlinesize;
  727. if(s->no_rounding){
  728. s->dsp.put_no_rnd_pixels_tab[1][dxy](c->scratchpad , s->last_picture.data[1] + offset, s->uvlinesize, 8);
  729. s->dsp.put_no_rnd_pixels_tab[1][dxy](c->scratchpad+8 , s->last_picture.data[2] + offset, s->uvlinesize, 8);
  730. }else{
  731. s->dsp.put_pixels_tab [1][dxy](c->scratchpad , s->last_picture.data[1] + offset, s->uvlinesize, 8);
  732. s->dsp.put_pixels_tab [1][dxy](c->scratchpad+8 , s->last_picture.data[2] + offset, s->uvlinesize, 8);
  733. }
  734. dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.data[1] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, c->scratchpad , s->uvlinesize, 8);
  735. dmin_sum += s->dsp.mb_cmp[1](s, s->new_picture.data[2] + s->mb_x*8 + s->mb_y*8*s->uvlinesize, c->scratchpad+8, s->uvlinesize, 8);
  736. }
  737. c->pred_x= mx;
  738. c->pred_y= my;
  739. switch(c->avctx->mb_cmp&0xFF){
  740. /*case FF_CMP_SSE:
  741. return dmin_sum+ 32*s->qscale*s->qscale;*/
  742. case FF_CMP_RD:
  743. return dmin_sum;
  744. default:
  745. return dmin_sum+ 11*c->mb_penalty_factor;
  746. }
  747. }
  748. static inline void init_interlaced_ref(MpegEncContext *s, int ref_index){
  749. MotionEstContext * const c= &s->me;
  750. c->ref[1+ref_index][0] = c->ref[0+ref_index][0] + s->linesize;
  751. c->src[1][0] = c->src[0][0] + s->linesize;
  752. if(c->flags & FLAG_CHROMA){
  753. c->ref[1+ref_index][1] = c->ref[0+ref_index][1] + s->uvlinesize;
  754. c->ref[1+ref_index][2] = c->ref[0+ref_index][2] + s->uvlinesize;
  755. c->src[1][1] = c->src[0][1] + s->uvlinesize;
  756. c->src[1][2] = c->src[0][2] + s->uvlinesize;
  757. }
  758. }
  759. static int interlaced_search(MpegEncContext *s, int ref_index,
  760. int16_t (*mv_tables[2][2])[2], uint8_t *field_select_tables[2], int mx, int my, int user_field_select)
  761. {
  762. MotionEstContext * const c= &s->me;
  763. const int size=0;
  764. const int h=8;
  765. int block;
  766. int P[10][2];
  767. uint8_t * const mv_penalty= c->current_mv_penalty;
  768. int same=1;
  769. const int stride= 2*s->linesize;
  770. const int uvstride= 2*s->uvlinesize;
  771. int dmin_sum= 0;
  772. const int mot_stride= s->mb_stride;
  773. const int xy= s->mb_x + s->mb_y*mot_stride;
  774. c->ymin>>=1;
  775. c->ymax>>=1;
  776. c->stride<<=1;
  777. c->uvstride<<=1;
  778. init_interlaced_ref(s, ref_index);
  779. for(block=0; block<2; block++){
  780. int field_select;
  781. int best_dmin= INT_MAX;
  782. int best_field= -1;
  783. for(field_select=0; field_select<2; field_select++){
  784. int dmin, mx_i, my_i;
  785. int16_t (*mv_table)[2]= mv_tables[block][field_select];
  786. if(user_field_select){
  787. if(field_select_tables[block][xy] != field_select)
  788. continue;
  789. }
  790. P_LEFT[0] = mv_table[xy - 1][0];
  791. P_LEFT[1] = mv_table[xy - 1][1];
  792. if(P_LEFT[0] > (c->xmax<<1)) P_LEFT[0] = (c->xmax<<1);
  793. c->pred_x= P_LEFT[0];
  794. c->pred_y= P_LEFT[1];
  795. if(!s->first_slice_line){
  796. P_TOP[0] = mv_table[xy - mot_stride][0];
  797. P_TOP[1] = mv_table[xy - mot_stride][1];
  798. P_TOPRIGHT[0] = mv_table[xy - mot_stride + 1][0];
  799. P_TOPRIGHT[1] = mv_table[xy - mot_stride + 1][1];
  800. if(P_TOP[1] > (c->ymax<<1)) P_TOP[1] = (c->ymax<<1);
  801. if(P_TOPRIGHT[0] < (c->xmin<<1)) P_TOPRIGHT[0]= (c->xmin<<1);
  802. if(P_TOPRIGHT[0] > (c->xmax<<1)) P_TOPRIGHT[0]= (c->xmax<<1);
  803. if(P_TOPRIGHT[1] > (c->ymax<<1)) P_TOPRIGHT[1]= (c->ymax<<1);
  804. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  805. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  806. }
  807. P_MV1[0]= mx; //FIXME not correct if block != field_select
  808. P_MV1[1]= my / 2;
  809. dmin = epzs_motion_search2(s, &mx_i, &my_i, P, block, field_select+ref_index, mv_table, (1<<16)>>1);
  810. dmin= c->sub_motion_search(s, &mx_i, &my_i, dmin, block, field_select+ref_index, size, h);
  811. mv_table[xy][0]= mx_i;
  812. mv_table[xy][1]= my_i;
  813. if(s->dsp.me_sub_cmp[0] != s->dsp.mb_cmp[0]){
  814. int dxy;
  815. //FIXME chroma ME
  816. uint8_t *ref= c->ref[field_select+ref_index][0] + (mx_i>>1) + (my_i>>1)*stride;
  817. dxy = ((my_i & 1) << 1) | (mx_i & 1);
  818. if(s->no_rounding){
  819. s->dsp.put_no_rnd_pixels_tab[size][dxy](c->scratchpad, ref , stride, h);
  820. }else{
  821. s->dsp.put_pixels_tab [size][dxy](c->scratchpad, ref , stride, h);
  822. }
  823. dmin= s->dsp.mb_cmp[size](s, c->src[block][0], c->scratchpad, stride, h);
  824. dmin+= (mv_penalty[mx_i-c->pred_x] + mv_penalty[my_i-c->pred_y] + 1)*c->mb_penalty_factor;
  825. }else
  826. dmin+= c->mb_penalty_factor; //field_select bits
  827. dmin += field_select != block; //slightly prefer same field
  828. if(dmin < best_dmin){
  829. best_dmin= dmin;
  830. best_field= field_select;
  831. }
  832. }
  833. {
  834. int16_t (*mv_table)[2]= mv_tables[block][best_field];
  835. if(mv_table[xy][0] != mx) same=0; //FIXME check if these checks work and are any good at all
  836. if(mv_table[xy][1]&1) same=0;
  837. if(mv_table[xy][1]*2 != my) same=0;
  838. if(best_field != block) same=0;
  839. }
  840. field_select_tables[block][xy]= best_field;
  841. dmin_sum += best_dmin;
  842. }
  843. c->ymin<<=1;
  844. c->ymax<<=1;
  845. c->stride>>=1;
  846. c->uvstride>>=1;
  847. if(same)
  848. return INT_MAX;
  849. switch(c->avctx->mb_cmp&0xFF){
  850. /*case FF_CMP_SSE:
  851. return dmin_sum+ 32*s->qscale*s->qscale;*/
  852. case FF_CMP_RD:
  853. return dmin_sum;
  854. default:
  855. return dmin_sum+ 11*c->mb_penalty_factor;
  856. }
  857. }
  858. static void clip_input_mv(MpegEncContext * s, int16_t *mv, int interlaced){
  859. int ymax= s->me.ymax>>interlaced;
  860. int ymin= s->me.ymin>>interlaced;
  861. if(mv[0] < s->me.xmin) mv[0] = s->me.xmin;
  862. if(mv[0] > s->me.xmax) mv[0] = s->me.xmax;
  863. if(mv[1] < ymin) mv[1] = ymin;
  864. if(mv[1] > ymax) mv[1] = ymax;
  865. }
  866. static inline int check_input_motion(MpegEncContext * s, int mb_x, int mb_y, int p_type){
  867. MotionEstContext * const c= &s->me;
  868. Picture *p= s->current_picture_ptr;
  869. int mb_xy= mb_x + mb_y*s->mb_stride;
  870. int xy= 2*mb_x + 2*mb_y*s->b8_stride;
  871. int mb_type= s->current_picture.mb_type[mb_xy];
  872. int flags= c->flags;
  873. int shift= (flags&FLAG_QPEL) + 1;
  874. int mask= (1<<shift)-1;
  875. int x, y, i;
  876. int d=0;
  877. me_cmp_func cmpf= s->dsp.sse[0];
  878. me_cmp_func chroma_cmpf= s->dsp.sse[1];
  879. if(p_type && USES_LIST(mb_type, 1)){
  880. av_log(c->avctx, AV_LOG_ERROR, "backward motion vector in P frame\n");
  881. return INT_MAX;
  882. }
  883. assert(IS_INTRA(mb_type) || USES_LIST(mb_type,0) || USES_LIST(mb_type,1));
  884. for(i=0; i<4; i++){
  885. int xy= s->block_index[i];
  886. clip_input_mv(s, p->motion_val[0][xy], !!IS_INTERLACED(mb_type));
  887. clip_input_mv(s, p->motion_val[1][xy], !!IS_INTERLACED(mb_type));
  888. }
  889. if(IS_INTERLACED(mb_type)){
  890. int xy2= xy + s->b8_stride;
  891. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_INTRA;
  892. c->stride<<=1;
  893. c->uvstride<<=1;
  894. if(!(s->flags & CODEC_FLAG_INTERLACED_ME)){
  895. av_log(c->avctx, AV_LOG_ERROR, "Interlaced macroblock selected but interlaced motion estimation disabled\n");
  896. return INT_MAX;
  897. }
  898. if(USES_LIST(mb_type, 0)){
  899. int field_select0= p->ref_index[0][xy ];
  900. int field_select1= p->ref_index[0][xy2];
  901. assert(field_select0==0 ||field_select0==1);
  902. assert(field_select1==0 ||field_select1==1);
  903. init_interlaced_ref(s, 0);
  904. if(p_type){
  905. s->p_field_select_table[0][mb_xy]= field_select0;
  906. s->p_field_select_table[1][mb_xy]= field_select1;
  907. *(uint32_t*)s->p_field_mv_table[0][field_select0][mb_xy]= *(uint32_t*)p->motion_val[0][xy ];
  908. *(uint32_t*)s->p_field_mv_table[1][field_select1][mb_xy]= *(uint32_t*)p->motion_val[0][xy2];
  909. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_INTER_I;
  910. }else{
  911. s->b_field_select_table[0][0][mb_xy]= field_select0;
  912. s->b_field_select_table[0][1][mb_xy]= field_select1;
  913. *(uint32_t*)s->b_field_mv_table[0][0][field_select0][mb_xy]= *(uint32_t*)p->motion_val[0][xy ];
  914. *(uint32_t*)s->b_field_mv_table[0][1][field_select1][mb_xy]= *(uint32_t*)p->motion_val[0][xy2];
  915. s->mb_type[mb_xy]= CANDIDATE_MB_TYPE_FORWARD_I;
  916. }
  917. x= p->motion_val[0][xy ][0];
  918. y= p->motion_val[0][xy ][1];
  919. d = cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select0, 0, cmpf, chroma_cmpf, flags);
  920. x= p->motion_val[0][xy2][0];
  921. y= p->motion_val[0][xy2][1];
  922. d+= cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select1, 1, cmpf, chroma_cmpf, flags);
  923. }
  924. if(USES_LIST(mb_type, 1)){
  925. int field_select0= p->ref_index[1][xy ];
  926. int field_select1= p->ref_index[1][xy2];
  927. assert(field_select0==0 ||field_select0==1);
  928. assert(field_select1==0 ||field_select1==1);
  929. init_interlaced_ref(s, 2);
  930. s->b_field_select_table[1][0][mb_xy]= field_select0;
  931. s->b_field_select_table[1][1][mb_xy]= field_select1;
  932. *(uint32_t*)s->b_field_mv_table[1][0][field_select0][mb_xy]= *(uint32_t*)p->motion_val[1][xy ];
  933. *(uint32_t*)s->b_field_mv_table[1][1][field_select1][mb_xy]= *(uint32_t*)p->motion_val[1][xy2];
  934. if(USES_LIST(mb_type, 0)){
  935. s->mb_type[mb_xy]= CANDIDATE_MB_TYPE_BIDIR_I;
  936. }else{
  937. s->mb_type[mb_xy]= CANDIDATE_MB_TYPE_BACKWARD_I;
  938. }
  939. x= p->motion_val[1][xy ][0];
  940. y= p->motion_val[1][xy ][1];
  941. d = cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select0+2, 0, cmpf, chroma_cmpf, flags);
  942. x= p->motion_val[1][xy2][0];
  943. y= p->motion_val[1][xy2][1];
  944. d+= cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 8, field_select1+2, 1, cmpf, chroma_cmpf, flags);
  945. //FIXME bidir scores
  946. }
  947. c->stride>>=1;
  948. c->uvstride>>=1;
  949. }else if(IS_8X8(mb_type)){
  950. if(!(s->flags & CODEC_FLAG_4MV)){
  951. av_log(c->avctx, AV_LOG_ERROR, "4MV macroblock selected but 4MV encoding disabled\n");
  952. return INT_MAX;
  953. }
  954. cmpf= s->dsp.sse[1];
  955. chroma_cmpf= s->dsp.sse[1];
  956. init_mv4_ref(c);
  957. for(i=0; i<4; i++){
  958. xy= s->block_index[i];
  959. x= p->motion_val[0][xy][0];
  960. y= p->motion_val[0][xy][1];
  961. d+= cmp(s, x>>shift, y>>shift, x&mask, y&mask, 1, 8, i, i, cmpf, chroma_cmpf, flags);
  962. }
  963. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_INTER4V;
  964. }else{
  965. if(USES_LIST(mb_type, 0)){
  966. if(p_type){
  967. *(uint32_t*)s->p_mv_table[mb_xy]= *(uint32_t*)p->motion_val[0][xy];
  968. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_INTER;
  969. }else if(USES_LIST(mb_type, 1)){
  970. *(uint32_t*)s->b_bidir_forw_mv_table[mb_xy]= *(uint32_t*)p->motion_val[0][xy];
  971. *(uint32_t*)s->b_bidir_back_mv_table[mb_xy]= *(uint32_t*)p->motion_val[1][xy];
  972. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_BIDIR;
  973. }else{
  974. *(uint32_t*)s->b_forw_mv_table[mb_xy]= *(uint32_t*)p->motion_val[0][xy];
  975. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_FORWARD;
  976. }
  977. x= p->motion_val[0][xy][0];
  978. y= p->motion_val[0][xy][1];
  979. d = cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 16, 0, 0, cmpf, chroma_cmpf, flags);
  980. }else if(USES_LIST(mb_type, 1)){
  981. *(uint32_t*)s->b_back_mv_table[mb_xy]= *(uint32_t*)p->motion_val[1][xy];
  982. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_BACKWARD;
  983. x= p->motion_val[1][xy][0];
  984. y= p->motion_val[1][xy][1];
  985. d = cmp(s, x>>shift, y>>shift, x&mask, y&mask, 0, 16, 2, 0, cmpf, chroma_cmpf, flags);
  986. }else
  987. s->mb_type[mb_xy]=CANDIDATE_MB_TYPE_INTRA;
  988. }
  989. return d;
  990. }
  991. void ff_estimate_p_frame_motion(MpegEncContext * s,
  992. int mb_x, int mb_y)
  993. {
  994. MotionEstContext * const c= &s->me;
  995. uint8_t *pix, *ppix;
  996. int sum, varc, vard, mx, my, dmin;
  997. int P[10][2];
  998. const int shift= 1+s->quarter_sample;
  999. int mb_type=0;
  1000. Picture * const pic= &s->current_picture;
  1001. init_ref(c, s->new_picture.data, s->last_picture.data, NULL, 16*mb_x, 16*mb_y, 0);
  1002. assert(s->quarter_sample==0 || s->quarter_sample==1);
  1003. assert(s->linesize == c->stride);
  1004. assert(s->uvlinesize == c->uvstride);
  1005. c->penalty_factor = get_penalty_factor(s, c->avctx->me_cmp);
  1006. c->sub_penalty_factor= get_penalty_factor(s, c->avctx->me_sub_cmp);
  1007. c->mb_penalty_factor = get_penalty_factor(s, c->avctx->mb_cmp);
  1008. c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;
  1009. get_limits(s, 16*mb_x, 16*mb_y);
  1010. c->skip=0;
  1011. /* intra / predictive decision */
  1012. pix = c->src[0][0];
  1013. sum = s->dsp.pix_sum(pix, s->linesize);
  1014. varc = (s->dsp.pix_norm1(pix, s->linesize) - (((unsigned)(sum*sum))>>8) + 500 + 128)>>8;
  1015. pic->mb_mean[s->mb_stride * mb_y + mb_x] = (sum+128)>>8;
  1016. pic->mb_var [s->mb_stride * mb_y + mb_x] = varc;
  1017. c->mb_var_sum_temp += varc;
  1018. if(c->avctx->me_threshold){
  1019. vard= (check_input_motion(s, mb_x, mb_y, 1)+128)>>8;
  1020. if(vard<c->avctx->me_threshold){
  1021. pic->mc_mb_var[s->mb_stride * mb_y + mb_x] = vard;
  1022. c->mc_mb_var_sum_temp += vard;
  1023. if (vard <= 64 || vard < varc) { //FIXME
  1024. c->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc);
  1025. }else{
  1026. c->scene_change_score+= s->qscale;
  1027. }
  1028. return;
  1029. }
  1030. if(vard<c->avctx->mb_threshold)
  1031. mb_type= s->mb_type[mb_x + mb_y*s->mb_stride];
  1032. }
  1033. switch(s->me_method) {
  1034. case ME_ZERO:
  1035. default:
  1036. no_motion_search(s, &mx, &my);
  1037. mx-= mb_x*16;
  1038. my-= mb_y*16;
  1039. dmin = 0;
  1040. break;
  1041. #if 0
  1042. case ME_FULL:
  1043. dmin = full_motion_search(s, &mx, &my, range, ref_picture);
  1044. mx-= mb_x*16;
  1045. my-= mb_y*16;
  1046. break;
  1047. case ME_LOG:
  1048. dmin = log_motion_search(s, &mx, &my, range / 2, ref_picture);
  1049. mx-= mb_x*16;
  1050. my-= mb_y*16;
  1051. break;
  1052. case ME_PHODS:
  1053. dmin = phods_motion_search(s, &mx, &my, range / 2, ref_picture);
  1054. mx-= mb_x*16;
  1055. my-= mb_y*16;
  1056. break;
  1057. #endif
  1058. case ME_X1:
  1059. case ME_EPZS:
  1060. {
  1061. const int mot_stride = s->b8_stride;
  1062. const int mot_xy = s->block_index[0];
  1063. P_LEFT[0] = s->current_picture.motion_val[0][mot_xy - 1][0];
  1064. P_LEFT[1] = s->current_picture.motion_val[0][mot_xy - 1][1];
  1065. if(P_LEFT[0] > (c->xmax<<shift)) P_LEFT[0] = (c->xmax<<shift);
  1066. if(!s->first_slice_line) {
  1067. P_TOP[0] = s->current_picture.motion_val[0][mot_xy - mot_stride ][0];
  1068. P_TOP[1] = s->current_picture.motion_val[0][mot_xy - mot_stride ][1];
  1069. P_TOPRIGHT[0] = s->current_picture.motion_val[0][mot_xy - mot_stride + 2][0];
  1070. P_TOPRIGHT[1] = s->current_picture.motion_val[0][mot_xy - mot_stride + 2][1];
  1071. if(P_TOP[1] > (c->ymax<<shift)) P_TOP[1] = (c->ymax<<shift);
  1072. if(P_TOPRIGHT[0] < (c->xmin<<shift)) P_TOPRIGHT[0]= (c->xmin<<shift);
  1073. if(P_TOPRIGHT[1] > (c->ymax<<shift)) P_TOPRIGHT[1]= (c->ymax<<shift);
  1074. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  1075. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  1076. if(s->out_format == FMT_H263){
  1077. c->pred_x = P_MEDIAN[0];
  1078. c->pred_y = P_MEDIAN[1];
  1079. }else { /* mpeg1 at least */
  1080. c->pred_x= P_LEFT[0];
  1081. c->pred_y= P_LEFT[1];
  1082. }
  1083. }else{
  1084. c->pred_x= P_LEFT[0];
  1085. c->pred_y= P_LEFT[1];
  1086. }
  1087. }
  1088. dmin = epzs_motion_search(s, &mx, &my, P, 0, 0, s->p_mv_table, (1<<16)>>shift);
  1089. break;
  1090. }
  1091. /* At this point (mx,my) are full-pell and the relative displacement */
  1092. ppix = c->ref[0][0] + (my * s->linesize) + mx;
  1093. vard = (s->dsp.sse[0](NULL, pix, ppix, s->linesize, 16)+128)>>8;
  1094. pic->mc_mb_var[s->mb_stride * mb_y + mb_x] = vard;
  1095. // pic->mb_cmp_score[s->mb_stride * mb_y + mb_x] = dmin;
  1096. c->mc_mb_var_sum_temp += vard;
  1097. #if 0
  1098. printf("varc=%4d avg_var=%4d (sum=%4d) vard=%4d mx=%2d my=%2d\n",
  1099. varc, s->avg_mb_var, sum, vard, mx - xx, my - yy);
  1100. #endif
  1101. if(mb_type){
  1102. if (vard <= 64 || vard < varc)
  1103. c->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc);
  1104. else
  1105. c->scene_change_score+= s->qscale;
  1106. if(mb_type == CANDIDATE_MB_TYPE_INTER){
  1107. c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);
  1108. set_p_mv_tables(s, mx, my, 1);
  1109. }else{
  1110. mx <<=shift;
  1111. my <<=shift;
  1112. }
  1113. if(mb_type == CANDIDATE_MB_TYPE_INTER4V){
  1114. h263_mv4_search(s, mx, my, shift);
  1115. set_p_mv_tables(s, mx, my, 0);
  1116. }
  1117. if(mb_type == CANDIDATE_MB_TYPE_INTER_I){
  1118. interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 1);
  1119. }
  1120. }else if(c->avctx->mb_decision > FF_MB_DECISION_SIMPLE){
  1121. if (vard <= 64 || vard < varc)
  1122. c->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc);
  1123. else
  1124. c->scene_change_score+= s->qscale;
  1125. if (vard*2 + 200 > varc)
  1126. mb_type|= CANDIDATE_MB_TYPE_INTRA;
  1127. if (varc*2 + 200 > vard){
  1128. mb_type|= CANDIDATE_MB_TYPE_INTER;
  1129. c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);
  1130. if(s->flags&CODEC_FLAG_MV0)
  1131. if(mx || my)
  1132. mb_type |= CANDIDATE_MB_TYPE_SKIPED; //FIXME check difference
  1133. }else{
  1134. mx <<=shift;
  1135. my <<=shift;
  1136. }
  1137. if((s->flags&CODEC_FLAG_4MV)
  1138. && !c->skip && varc>50 && vard>10){
  1139. if(h263_mv4_search(s, mx, my, shift) < INT_MAX)
  1140. mb_type|=CANDIDATE_MB_TYPE_INTER4V;
  1141. set_p_mv_tables(s, mx, my, 0);
  1142. }else
  1143. set_p_mv_tables(s, mx, my, 1);
  1144. if((s->flags&CODEC_FLAG_INTERLACED_ME)
  1145. && !c->skip){ //FIXME varc/d checks
  1146. if(interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 0) < INT_MAX)
  1147. mb_type |= CANDIDATE_MB_TYPE_INTER_I;
  1148. }
  1149. }else{
  1150. int intra_score, i;
  1151. mb_type= CANDIDATE_MB_TYPE_INTER;
  1152. dmin= c->sub_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);
  1153. if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)
  1154. dmin= get_mb_score(s, mx, my, 0, 0);
  1155. if((s->flags&CODEC_FLAG_4MV)
  1156. && !c->skip && varc>50 && vard>10){
  1157. int dmin4= h263_mv4_search(s, mx, my, shift);
  1158. if(dmin4 < dmin){
  1159. mb_type= CANDIDATE_MB_TYPE_INTER4V;
  1160. dmin=dmin4;
  1161. }
  1162. }
  1163. if((s->flags&CODEC_FLAG_INTERLACED_ME)
  1164. && !c->skip){ //FIXME varc/d checks
  1165. int dmin_i= interlaced_search(s, 0, s->p_field_mv_table, s->p_field_select_table, mx, my, 0);
  1166. if(dmin_i < dmin){
  1167. mb_type = CANDIDATE_MB_TYPE_INTER_I;
  1168. dmin= dmin_i;
  1169. }
  1170. }
  1171. // pic->mb_cmp_score[s->mb_stride * mb_y + mb_x] = dmin;
  1172. set_p_mv_tables(s, mx, my, mb_type!=CANDIDATE_MB_TYPE_INTER4V);
  1173. /* get intra luma score */
  1174. if((c->avctx->mb_cmp&0xFF)==FF_CMP_SSE){
  1175. intra_score= (varc<<8) - 500; //FIXME dont scale it down so we dont have to fix it
  1176. }else{
  1177. int mean= (sum+128)>>8;
  1178. mean*= 0x01010101;
  1179. for(i=0; i<16; i++){
  1180. *(uint32_t*)(&c->scratchpad[i*s->linesize+ 0]) = mean;
  1181. *(uint32_t*)(&c->scratchpad[i*s->linesize+ 4]) = mean;
  1182. *(uint32_t*)(&c->scratchpad[i*s->linesize+ 8]) = mean;
  1183. *(uint32_t*)(&c->scratchpad[i*s->linesize+12]) = mean;
  1184. }
  1185. intra_score= s->dsp.mb_cmp[0](s, c->scratchpad, pix, s->linesize, 16);
  1186. }
  1187. #if 0 //FIXME
  1188. /* get chroma score */
  1189. if(c->avctx->mb_cmp&FF_CMP_CHROMA){
  1190. for(i=1; i<3; i++){
  1191. uint8_t *dest_c;
  1192. int mean;
  1193. if(s->out_format == FMT_H263){
  1194. mean= (s->dc_val[i][mb_x + mb_y*s->b8_stride] + 4)>>3; //FIXME not exact but simple ;)
  1195. }else{
  1196. mean= (s->last_dc[i] + 4)>>3;
  1197. }
  1198. dest_c = s->new_picture.data[i] + (mb_y * 8 * (s->uvlinesize)) + mb_x * 8;
  1199. mean*= 0x01010101;
  1200. for(i=0; i<8; i++){
  1201. *(uint32_t*)(&c->scratchpad[i*s->uvlinesize+ 0]) = mean;
  1202. *(uint32_t*)(&c->scratchpad[i*s->uvlinesize+ 4]) = mean;
  1203. }
  1204. intra_score+= s->dsp.mb_cmp[1](s, c->scratchpad, dest_c, s->uvlinesize);
  1205. }
  1206. }
  1207. #endif
  1208. intra_score += c->mb_penalty_factor*16;
  1209. if(intra_score < dmin){
  1210. mb_type= CANDIDATE_MB_TYPE_INTRA;
  1211. s->current_picture.mb_type[mb_y*s->mb_stride + mb_x]= CANDIDATE_MB_TYPE_INTRA; //FIXME cleanup
  1212. }else
  1213. s->current_picture.mb_type[mb_y*s->mb_stride + mb_x]= 0;
  1214. if (vard <= 64 || vard < varc) { //FIXME
  1215. c->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc);
  1216. }else{
  1217. c->scene_change_score+= s->qscale;
  1218. }
  1219. }
  1220. s->mb_type[mb_y*s->mb_stride + mb_x]= mb_type;
  1221. }
  1222. int ff_pre_estimate_p_frame_motion(MpegEncContext * s,
  1223. int mb_x, int mb_y)
  1224. {
  1225. MotionEstContext * const c= &s->me;
  1226. int mx, my, dmin;
  1227. int P[10][2];
  1228. const int shift= 1+s->quarter_sample;
  1229. const int xy= mb_x + mb_y*s->mb_stride;
  1230. init_ref(c, s->new_picture.data, s->last_picture.data, NULL, 16*mb_x, 16*mb_y, 0);
  1231. assert(s->quarter_sample==0 || s->quarter_sample==1);
  1232. c->pre_penalty_factor = get_penalty_factor(s, c->avctx->me_pre_cmp);
  1233. c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;
  1234. get_limits(s, 16*mb_x, 16*mb_y);
  1235. c->skip=0;
  1236. P_LEFT[0] = s->p_mv_table[xy + 1][0];
  1237. P_LEFT[1] = s->p_mv_table[xy + 1][1];
  1238. if(P_LEFT[0] < (c->xmin<<shift)) P_LEFT[0] = (c->xmin<<shift);
  1239. /* special case for first line */
  1240. if (s->first_slice_line) {
  1241. c->pred_x= P_LEFT[0];
  1242. c->pred_y= P_LEFT[1];
  1243. P_TOP[0]= P_TOPRIGHT[0]= P_MEDIAN[0]=
  1244. P_TOP[1]= P_TOPRIGHT[1]= P_MEDIAN[1]= 0; //FIXME
  1245. } else {
  1246. P_TOP[0] = s->p_mv_table[xy + s->mb_stride ][0];
  1247. P_TOP[1] = s->p_mv_table[xy + s->mb_stride ][1];
  1248. P_TOPRIGHT[0] = s->p_mv_table[xy + s->mb_stride - 1][0];
  1249. P_TOPRIGHT[1] = s->p_mv_table[xy + s->mb_stride - 1][1];
  1250. if(P_TOP[1] < (c->ymin<<shift)) P_TOP[1] = (c->ymin<<shift);
  1251. if(P_TOPRIGHT[0] > (c->xmax<<shift)) P_TOPRIGHT[0]= (c->xmax<<shift);
  1252. if(P_TOPRIGHT[1] < (c->ymin<<shift)) P_TOPRIGHT[1]= (c->ymin<<shift);
  1253. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  1254. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  1255. c->pred_x = P_MEDIAN[0];
  1256. c->pred_y = P_MEDIAN[1];
  1257. }
  1258. dmin = epzs_motion_search(s, &mx, &my, P, 0, 0, s->p_mv_table, (1<<16)>>shift);
  1259. s->p_mv_table[xy][0] = mx<<shift;
  1260. s->p_mv_table[xy][1] = my<<shift;
  1261. return dmin;
  1262. }
  1263. static int ff_estimate_motion_b(MpegEncContext * s,
  1264. int mb_x, int mb_y, int16_t (*mv_table)[2], int ref_index, int f_code)
  1265. {
  1266. MotionEstContext * const c= &s->me;
  1267. int mx, my, dmin;
  1268. int P[10][2];
  1269. const int shift= 1+s->quarter_sample;
  1270. const int mot_stride = s->mb_stride;
  1271. const int mot_xy = mb_y*mot_stride + mb_x;
  1272. uint8_t * const mv_penalty= c->mv_penalty[f_code] + MAX_MV;
  1273. int mv_scale;
  1274. c->penalty_factor = get_penalty_factor(s, c->avctx->me_cmp);
  1275. c->sub_penalty_factor= get_penalty_factor(s, c->avctx->me_sub_cmp);
  1276. c->mb_penalty_factor = get_penalty_factor(s, c->avctx->mb_cmp);
  1277. c->current_mv_penalty= mv_penalty;
  1278. get_limits(s, 16*mb_x, 16*mb_y);
  1279. switch(s->me_method) {
  1280. case ME_ZERO:
  1281. default:
  1282. no_motion_search(s, &mx, &my);
  1283. dmin = 0;
  1284. mx-= mb_x*16;
  1285. my-= mb_y*16;
  1286. break;
  1287. #if 0
  1288. case ME_FULL:
  1289. dmin = full_motion_search(s, &mx, &my, range, ref_picture);
  1290. mx-= mb_x*16;
  1291. my-= mb_y*16;
  1292. break;
  1293. case ME_LOG:
  1294. dmin = log_motion_search(s, &mx, &my, range / 2, ref_picture);
  1295. mx-= mb_x*16;
  1296. my-= mb_y*16;
  1297. break;
  1298. case ME_PHODS:
  1299. dmin = phods_motion_search(s, &mx, &my, range / 2, ref_picture);
  1300. mx-= mb_x*16;
  1301. my-= mb_y*16;
  1302. break;
  1303. #endif
  1304. case ME_X1:
  1305. case ME_EPZS:
  1306. {
  1307. P_LEFT[0] = mv_table[mot_xy - 1][0];
  1308. P_LEFT[1] = mv_table[mot_xy - 1][1];
  1309. if(P_LEFT[0] > (c->xmax<<shift)) P_LEFT[0] = (c->xmax<<shift);
  1310. /* special case for first line */
  1311. if (!s->first_slice_line) {
  1312. P_TOP[0] = mv_table[mot_xy - mot_stride ][0];
  1313. P_TOP[1] = mv_table[mot_xy - mot_stride ][1];
  1314. P_TOPRIGHT[0] = mv_table[mot_xy - mot_stride + 1 ][0];
  1315. P_TOPRIGHT[1] = mv_table[mot_xy - mot_stride + 1 ][1];
  1316. if(P_TOP[1] > (c->ymax<<shift)) P_TOP[1]= (c->ymax<<shift);
  1317. if(P_TOPRIGHT[0] < (c->xmin<<shift)) P_TOPRIGHT[0]= (c->xmin<<shift);
  1318. if(P_TOPRIGHT[1] > (c->ymax<<shift)) P_TOPRIGHT[1]= (c->ymax<<shift);
  1319. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  1320. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  1321. }
  1322. c->pred_x= P_LEFT[0];
  1323. c->pred_y= P_LEFT[1];
  1324. }
  1325. if(mv_table == s->b_forw_mv_table){
  1326. mv_scale= (s->pb_time<<16) / (s->pp_time<<shift);
  1327. }else{
  1328. mv_scale= ((s->pb_time - s->pp_time)<<16) / (s->pp_time<<shift);
  1329. }
  1330. dmin = epzs_motion_search(s, &mx, &my, P, 0, ref_index, s->p_mv_table, mv_scale);
  1331. break;
  1332. }
  1333. dmin= c->sub_motion_search(s, &mx, &my, dmin, 0, ref_index, 0, 16);
  1334. if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)
  1335. dmin= get_mb_score(s, mx, my, 0, ref_index);
  1336. //printf("%d %d %d %d//", s->mb_x, s->mb_y, mx, my);
  1337. // s->mb_type[mb_y*s->mb_width + mb_x]= mb_type;
  1338. mv_table[mot_xy][0]= mx;
  1339. mv_table[mot_xy][1]= my;
  1340. return dmin;
  1341. }
  1342. static inline int check_bidir_mv(MpegEncContext * s,
  1343. int motion_fx, int motion_fy,
  1344. int motion_bx, int motion_by,
  1345. int pred_fx, int pred_fy,
  1346. int pred_bx, int pred_by,
  1347. int size, int h)
  1348. {
  1349. //FIXME optimize?
  1350. //FIXME better f_code prediction (max mv & distance)
  1351. //FIXME pointers
  1352. MotionEstContext * const c= &s->me;
  1353. uint8_t * const mv_penalty= c->mv_penalty[s->f_code] + MAX_MV; // f_code of the prev frame
  1354. int stride= c->stride;
  1355. int uvstride= c->uvstride;
  1356. uint8_t *dest_y = c->scratchpad;
  1357. uint8_t *ptr;
  1358. int dxy;
  1359. int src_x, src_y;
  1360. int fbmin;
  1361. uint8_t **src_data= c->src[0];
  1362. uint8_t **ref_data= c->ref[0];
  1363. uint8_t **ref2_data= c->ref[2];
  1364. if(s->quarter_sample){
  1365. dxy = ((motion_fy & 3) << 2) | (motion_fx & 3);
  1366. src_x = motion_fx >> 2;
  1367. src_y = motion_fy >> 2;
  1368. ptr = ref_data[0] + (src_y * stride) + src_x;
  1369. s->dsp.put_qpel_pixels_tab[0][dxy](dest_y , ptr , stride);
  1370. dxy = ((motion_by & 3) << 2) | (motion_bx & 3);
  1371. src_x = motion_bx >> 2;
  1372. src_y = motion_by >> 2;
  1373. ptr = ref2_data[0] + (src_y * stride) + src_x;
  1374. s->dsp.avg_qpel_pixels_tab[size][dxy](dest_y , ptr , stride);
  1375. }else{
  1376. dxy = ((motion_fy & 1) << 1) | (motion_fx & 1);
  1377. src_x = motion_fx >> 1;
  1378. src_y = motion_fy >> 1;
  1379. ptr = ref_data[0] + (src_y * stride) + src_x;
  1380. s->dsp.put_pixels_tab[size][dxy](dest_y , ptr , stride, h);
  1381. dxy = ((motion_by & 1) << 1) | (motion_bx & 1);
  1382. src_x = motion_bx >> 1;
  1383. src_y = motion_by >> 1;
  1384. ptr = ref2_data[0] + (src_y * stride) + src_x;
  1385. s->dsp.avg_pixels_tab[size][dxy](dest_y , ptr , stride, h);
  1386. }
  1387. fbmin = (mv_penalty[motion_fx-pred_fx] + mv_penalty[motion_fy-pred_fy])*c->mb_penalty_factor
  1388. +(mv_penalty[motion_bx-pred_bx] + mv_penalty[motion_by-pred_by])*c->mb_penalty_factor
  1389. + s->dsp.mb_cmp[size](s, src_data[0], dest_y, stride, h); //FIXME new_pic
  1390. if(c->avctx->mb_cmp&FF_CMP_CHROMA){
  1391. }
  1392. //FIXME CHROMA !!!
  1393. return fbmin;
  1394. }
  1395. /* refine the bidir vectors in hq mode and return the score in both lq & hq mode*/
  1396. static inline int bidir_refine(MpegEncContext * s, int mb_x, int mb_y)
  1397. {
  1398. const int mot_stride = s->mb_stride;
  1399. const int xy = mb_y *mot_stride + mb_x;
  1400. int fbmin;
  1401. int pred_fx= s->b_bidir_forw_mv_table[xy-1][0];
  1402. int pred_fy= s->b_bidir_forw_mv_table[xy-1][1];
  1403. int pred_bx= s->b_bidir_back_mv_table[xy-1][0];
  1404. int pred_by= s->b_bidir_back_mv_table[xy-1][1];
  1405. int motion_fx= s->b_bidir_forw_mv_table[xy][0]= s->b_forw_mv_table[xy][0];
  1406. int motion_fy= s->b_bidir_forw_mv_table[xy][1]= s->b_forw_mv_table[xy][1];
  1407. int motion_bx= s->b_bidir_back_mv_table[xy][0]= s->b_back_mv_table[xy][0];
  1408. int motion_by= s->b_bidir_back_mv_table[xy][1]= s->b_back_mv_table[xy][1];
  1409. //FIXME do refinement and add flag
  1410. fbmin= check_bidir_mv(s, motion_fx, motion_fy,
  1411. motion_bx, motion_by,
  1412. pred_fx, pred_fy,
  1413. pred_bx, pred_by,
  1414. 0, 16);
  1415. return fbmin;
  1416. }
  1417. static inline int direct_search(MpegEncContext * s, int mb_x, int mb_y)
  1418. {
  1419. MotionEstContext * const c= &s->me;
  1420. int P[10][2];
  1421. const int mot_stride = s->mb_stride;
  1422. const int mot_xy = mb_y*mot_stride + mb_x;
  1423. const int shift= 1+s->quarter_sample;
  1424. int dmin, i;
  1425. const int time_pp= s->pp_time;
  1426. const int time_pb= s->pb_time;
  1427. int mx, my, xmin, xmax, ymin, ymax;
  1428. int16_t (*mv_table)[2]= s->b_direct_mv_table;
  1429. c->current_mv_penalty= c->mv_penalty[1] + MAX_MV;
  1430. ymin= xmin=(-32)>>shift;
  1431. ymax= xmax= 31>>shift;
  1432. if(IS_8X8(s->next_picture.mb_type[mot_xy])){
  1433. s->mv_type= MV_TYPE_8X8;
  1434. }else{
  1435. s->mv_type= MV_TYPE_16X16;
  1436. }
  1437. for(i=0; i<4; i++){
  1438. int index= s->block_index[i];
  1439. int min, max;
  1440. c->co_located_mv[i][0]= s->next_picture.motion_val[0][index][0];
  1441. c->co_located_mv[i][1]= s->next_picture.motion_val[0][index][1];
  1442. c->direct_basis_mv[i][0]= c->co_located_mv[i][0]*time_pb/time_pp + ((i& 1)<<(shift+3));
  1443. c->direct_basis_mv[i][1]= c->co_located_mv[i][1]*time_pb/time_pp + ((i>>1)<<(shift+3));
  1444. // c->direct_basis_mv[1][i][0]= c->co_located_mv[i][0]*(time_pb - time_pp)/time_pp + ((i &1)<<(shift+3);
  1445. // c->direct_basis_mv[1][i][1]= c->co_located_mv[i][1]*(time_pb - time_pp)/time_pp + ((i>>1)<<(shift+3);
  1446. max= FFMAX(c->direct_basis_mv[i][0], c->direct_basis_mv[i][0] - c->co_located_mv[i][0])>>shift;
  1447. min= FFMIN(c->direct_basis_mv[i][0], c->direct_basis_mv[i][0] - c->co_located_mv[i][0])>>shift;
  1448. max+= 16*mb_x + 1; // +-1 is for the simpler rounding
  1449. min+= 16*mb_x - 1;
  1450. xmax= FFMIN(xmax, s->width - max);
  1451. xmin= FFMAX(xmin, - 16 - min);
  1452. max= FFMAX(c->direct_basis_mv[i][1], c->direct_basis_mv[i][1] - c->co_located_mv[i][1])>>shift;
  1453. min= FFMIN(c->direct_basis_mv[i][1], c->direct_basis_mv[i][1] - c->co_located_mv[i][1])>>shift;
  1454. max+= 16*mb_y + 1; // +-1 is for the simpler rounding
  1455. min+= 16*mb_y - 1;
  1456. ymax= FFMIN(ymax, s->height - max);
  1457. ymin= FFMAX(ymin, - 16 - min);
  1458. if(s->mv_type == MV_TYPE_16X16) break;
  1459. }
  1460. assert(xmax <= 15 && ymax <= 15 && xmin >= -16 && ymin >= -16);
  1461. if(xmax < 0 || xmin >0 || ymax < 0 || ymin > 0){
  1462. s->b_direct_mv_table[mot_xy][0]= 0;
  1463. s->b_direct_mv_table[mot_xy][1]= 0;
  1464. return 256*256*256*64;
  1465. }
  1466. c->xmin= xmin;
  1467. c->ymin= ymin;
  1468. c->xmax= xmax;
  1469. c->ymax= ymax;
  1470. c->flags |= FLAG_DIRECT;
  1471. c->sub_flags |= FLAG_DIRECT;
  1472. c->pred_x=0;
  1473. c->pred_y=0;
  1474. P_LEFT[0] = clip(mv_table[mot_xy - 1][0], xmin<<shift, xmax<<shift);
  1475. P_LEFT[1] = clip(mv_table[mot_xy - 1][1], ymin<<shift, ymax<<shift);
  1476. /* special case for first line */
  1477. if (!s->first_slice_line) { //FIXME maybe allow this over thread boundary as its cliped
  1478. P_TOP[0] = clip(mv_table[mot_xy - mot_stride ][0], xmin<<shift, xmax<<shift);
  1479. P_TOP[1] = clip(mv_table[mot_xy - mot_stride ][1], ymin<<shift, ymax<<shift);
  1480. P_TOPRIGHT[0] = clip(mv_table[mot_xy - mot_stride + 1 ][0], xmin<<shift, xmax<<shift);
  1481. P_TOPRIGHT[1] = clip(mv_table[mot_xy - mot_stride + 1 ][1], ymin<<shift, ymax<<shift);
  1482. P_MEDIAN[0]= mid_pred(P_LEFT[0], P_TOP[0], P_TOPRIGHT[0]);
  1483. P_MEDIAN[1]= mid_pred(P_LEFT[1], P_TOP[1], P_TOPRIGHT[1]);
  1484. }
  1485. dmin = epzs_motion_search(s, &mx, &my, P, 0, 0, mv_table, 1<<(16-shift));
  1486. if(c->sub_flags&FLAG_QPEL)
  1487. dmin = qpel_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);
  1488. else
  1489. dmin = hpel_motion_search(s, &mx, &my, dmin, 0, 0, 0, 16);
  1490. if(c->avctx->me_sub_cmp != c->avctx->mb_cmp && !c->skip)
  1491. dmin= get_mb_score(s, mx, my, 0, 0);
  1492. get_limits(s, 16*mb_x, 16*mb_y); //restore c->?min/max, maybe not needed
  1493. s->b_direct_mv_table[mot_xy][0]= mx;
  1494. s->b_direct_mv_table[mot_xy][1]= my;
  1495. c->flags &= ~FLAG_DIRECT;
  1496. c->sub_flags &= ~FLAG_DIRECT;
  1497. return dmin;
  1498. }
  1499. void ff_estimate_b_frame_motion(MpegEncContext * s,
  1500. int mb_x, int mb_y)
  1501. {
  1502. MotionEstContext * const c= &s->me;
  1503. const int penalty_factor= c->mb_penalty_factor;
  1504. int fmin, bmin, dmin, fbmin, bimin, fimin;
  1505. int type=0;
  1506. const int xy = mb_y*s->mb_stride + mb_x;
  1507. init_ref(c, s->new_picture.data, s->last_picture.data, s->next_picture.data, 16*mb_x, 16*mb_y, 2);
  1508. get_limits(s, 16*mb_x, 16*mb_y);
  1509. c->skip=0;
  1510. if(c->avctx->me_threshold){
  1511. int vard= (check_input_motion(s, mb_x, mb_y, 0)+128)>>8;
  1512. if(vard<c->avctx->me_threshold){
  1513. // pix = c->src[0][0];
  1514. // sum = s->dsp.pix_sum(pix, s->linesize);
  1515. // varc = (s->dsp.pix_norm1(pix, s->linesize) - (((unsigned)(sum*sum))>>8) + 500 + 128)>>8;
  1516. // pic->mb_var [s->mb_stride * mb_y + mb_x] = varc;
  1517. s->current_picture.mc_mb_var[s->mb_stride * mb_y + mb_x] = vard;
  1518. /* pic->mb_mean [s->mb_stride * mb_y + mb_x] = (sum+128)>>8;
  1519. c->mb_var_sum_temp += varc;*/
  1520. c->mc_mb_var_sum_temp += vard;
  1521. /* if (vard <= 64 || vard < varc) {
  1522. c->scene_change_score+= ff_sqrt(vard) - ff_sqrt(varc);
  1523. }else{
  1524. c->scene_change_score+= s->qscale;
  1525. }*/
  1526. return;
  1527. }
  1528. if(vard<c->avctx->mb_threshold){
  1529. type= s->mb_type[mb_y*s->mb_stride + mb_x];
  1530. if(type == CANDIDATE_MB_TYPE_DIRECT){
  1531. direct_search(s, mb_x, mb_y);
  1532. }
  1533. if(type == CANDIDATE_MB_TYPE_FORWARD || type == CANDIDATE_MB_TYPE_BIDIR){
  1534. c->skip=0;
  1535. ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code);
  1536. }
  1537. if(type == CANDIDATE_MB_TYPE_BACKWARD || type == CANDIDATE_MB_TYPE_BIDIR){
  1538. c->skip=0;
  1539. ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code);
  1540. }
  1541. if(type == CANDIDATE_MB_TYPE_FORWARD_I || type == CANDIDATE_MB_TYPE_BIDIR_I){
  1542. c->skip=0;
  1543. c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;
  1544. interlaced_search(s, 0,
  1545. s->b_field_mv_table[0], s->b_field_select_table[0],
  1546. s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 1);
  1547. }
  1548. if(type == CANDIDATE_MB_TYPE_BACKWARD_I || type == CANDIDATE_MB_TYPE_BIDIR_I){
  1549. c->skip=0;
  1550. c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;
  1551. interlaced_search(s, 2,
  1552. s->b_field_mv_table[1], s->b_field_select_table[1],
  1553. s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 1);
  1554. }
  1555. return;
  1556. }
  1557. }
  1558. if (s->codec_id == CODEC_ID_MPEG4)
  1559. dmin= direct_search(s, mb_x, mb_y);
  1560. else
  1561. dmin= INT_MAX;
  1562. //FIXME penalty stuff for non mpeg4
  1563. c->skip=0;
  1564. fmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_forw_mv_table, 0, s->f_code) + 3*penalty_factor;
  1565. c->skip=0;
  1566. bmin= ff_estimate_motion_b(s, mb_x, mb_y, s->b_back_mv_table, 2, s->b_code) + 2*penalty_factor;
  1567. //printf(" %d %d ", s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1]);
  1568. c->skip=0;
  1569. fbmin= bidir_refine(s, mb_x, mb_y) + penalty_factor;
  1570. //printf("%d %d %d %d\n", dmin, fmin, bmin, fbmin);
  1571. if(s->flags & CODEC_FLAG_INTERLACED_ME){
  1572. //FIXME mb type penalty
  1573. c->skip=0;
  1574. c->current_mv_penalty= c->mv_penalty[s->f_code] + MAX_MV;
  1575. fimin= interlaced_search(s, 0,
  1576. s->b_field_mv_table[0], s->b_field_select_table[0],
  1577. s->b_forw_mv_table[xy][0], s->b_forw_mv_table[xy][1], 0);
  1578. c->current_mv_penalty= c->mv_penalty[s->b_code] + MAX_MV;
  1579. bimin= interlaced_search(s, 2,
  1580. s->b_field_mv_table[1], s->b_field_select_table[1],
  1581. s->b_back_mv_table[xy][0], s->b_back_mv_table[xy][1], 0);
  1582. }else
  1583. fimin= bimin= INT_MAX;
  1584. {
  1585. int score= fmin;
  1586. type = CANDIDATE_MB_TYPE_FORWARD;
  1587. if (dmin <= score){
  1588. score = dmin;
  1589. type = CANDIDATE_MB_TYPE_DIRECT;
  1590. }
  1591. if(bmin<score){
  1592. score=bmin;
  1593. type= CANDIDATE_MB_TYPE_BACKWARD;
  1594. }
  1595. if(fbmin<score){
  1596. score=fbmin;
  1597. type= CANDIDATE_MB_TYPE_BIDIR;
  1598. }
  1599. if(fimin<score){
  1600. score=fimin;
  1601. type= CANDIDATE_MB_TYPE_FORWARD_I;
  1602. }
  1603. if(bimin<score){
  1604. score=bimin;
  1605. type= CANDIDATE_MB_TYPE_BACKWARD_I;
  1606. }
  1607. score= ((unsigned)(score*score + 128*256))>>16;
  1608. c->mc_mb_var_sum_temp += score;
  1609. s->current_picture.mc_mb_var[mb_y*s->mb_stride + mb_x] = score; //FIXME use SSE
  1610. }
  1611. if(c->avctx->mb_decision > FF_MB_DECISION_SIMPLE){
  1612. type= CANDIDATE_MB_TYPE_FORWARD | CANDIDATE_MB_TYPE_BACKWARD | CANDIDATE_MB_TYPE_BIDIR | CANDIDATE_MB_TYPE_DIRECT;
  1613. if(fimin < INT_MAX)
  1614. type |= CANDIDATE_MB_TYPE_FORWARD_I;
  1615. if(bimin < INT_MAX)
  1616. type |= CANDIDATE_MB_TYPE_BACKWARD_I;
  1617. if(fimin < INT_MAX && bimin < INT_MAX){
  1618. type |= CANDIDATE_MB_TYPE_BIDIR_I;
  1619. }
  1620. //FIXME something smarter
  1621. if(dmin>256*256*16) type&= ~CANDIDATE_MB_TYPE_DIRECT; //dont try direct mode if its invalid for this MB
  1622. #if 0
  1623. if(s->out_format == FMT_MPEG1)
  1624. type |= CANDIDATE_MB_TYPE_INTRA;
  1625. #endif
  1626. }
  1627. s->mb_type[mb_y*s->mb_stride + mb_x]= type;
  1628. }
  1629. /* find best f_code for ME which do unlimited searches */
  1630. int ff_get_best_fcode(MpegEncContext * s, int16_t (*mv_table)[2], int type)
  1631. {
  1632. if(s->me_method>=ME_EPZS){
  1633. int score[8];
  1634. int i, y;
  1635. uint8_t * fcode_tab= s->fcode_tab;
  1636. int best_fcode=-1;
  1637. int best_score=-10000000;
  1638. for(i=0; i<8; i++) score[i]= s->mb_num*(8-i);
  1639. for(y=0; y<s->mb_height; y++){
  1640. int x;
  1641. int xy= y*s->mb_stride;
  1642. for(x=0; x<s->mb_width; x++){
  1643. if(s->mb_type[xy] & type){
  1644. int fcode= FFMAX(fcode_tab[mv_table[xy][0] + MAX_MV],
  1645. fcode_tab[mv_table[xy][1] + MAX_MV]);
  1646. int j;
  1647. for(j=0; j<fcode && j<8; j++){
  1648. if(s->pict_type==B_TYPE || s->current_picture.mc_mb_var[xy] < s->current_picture.mb_var[xy])
  1649. score[j]-= 170;
  1650. }
  1651. }
  1652. xy++;
  1653. }
  1654. }
  1655. for(i=1; i<8; i++){
  1656. if(score[i] > best_score){
  1657. best_score= score[i];
  1658. best_fcode= i;
  1659. }
  1660. // printf("%d %d\n", i, score[i]);
  1661. }
  1662. // printf("fcode: %d type: %d\n", i, s->pict_type);
  1663. return best_fcode;
  1664. /* for(i=0; i<=MAX_FCODE; i++){
  1665. printf("%d ", mv_num[i]);
  1666. }
  1667. printf("\n");*/
  1668. }else{
  1669. return 1;
  1670. }
  1671. }
  1672. void ff_fix_long_p_mvs(MpegEncContext * s)
  1673. {
  1674. MotionEstContext * const c= &s->me;
  1675. const int f_code= s->f_code;
  1676. int y, range;
  1677. assert(s->pict_type==P_TYPE);
  1678. range = (((s->out_format == FMT_MPEG1) ? 8 : 16) << f_code);
  1679. if(s->msmpeg4_version) range= 16;
  1680. if(c->avctx->me_range && range > c->avctx->me_range) range= c->avctx->me_range;
  1681. //printf("%d no:%d %d//\n", clip, noclip, f_code);
  1682. if(s->flags&CODEC_FLAG_4MV){
  1683. const int wrap= s->b8_stride;
  1684. /* clip / convert to intra 8x8 type MVs */
  1685. for(y=0; y<s->mb_height; y++){
  1686. int xy= y*2*wrap;
  1687. int i= y*s->mb_stride;
  1688. int x;
  1689. for(x=0; x<s->mb_width; x++){
  1690. if(s->mb_type[i]&CANDIDATE_MB_TYPE_INTER4V){
  1691. int block;
  1692. for(block=0; block<4; block++){
  1693. int off= (block& 1) + (block>>1)*wrap;
  1694. int mx= s->current_picture.motion_val[0][ xy + off ][0];
  1695. int my= s->current_picture.motion_val[0][ xy + off ][1];
  1696. if( mx >=range || mx <-range
  1697. || my >=range || my <-range){
  1698. s->mb_type[i] &= ~CANDIDATE_MB_TYPE_INTER4V;
  1699. s->mb_type[i] |= CANDIDATE_MB_TYPE_INTRA;
  1700. s->current_picture.mb_type[i]= CANDIDATE_MB_TYPE_INTRA;
  1701. }
  1702. }
  1703. }
  1704. xy+=2;
  1705. i++;
  1706. }
  1707. }
  1708. }
  1709. }
  1710. /**
  1711. *
  1712. * @param truncate 1 for truncation, 0 for using intra
  1713. */
  1714. void ff_fix_long_mvs(MpegEncContext * s, uint8_t *field_select_table, int field_select,
  1715. int16_t (*mv_table)[2], int f_code, int type, int truncate)
  1716. {
  1717. MotionEstContext * const c= &s->me;
  1718. int y, h_range, v_range;
  1719. // RAL: 8 in MPEG-1, 16 in MPEG-4
  1720. int range = (((s->out_format == FMT_MPEG1) ? 8 : 16) << f_code);
  1721. if(s->msmpeg4_version) range= 16;
  1722. if(c->avctx->me_range && range > c->avctx->me_range) range= c->avctx->me_range;
  1723. h_range= range;
  1724. v_range= field_select_table ? range>>1 : range;
  1725. /* clip / convert to intra 16x16 type MVs */
  1726. for(y=0; y<s->mb_height; y++){
  1727. int x;
  1728. int xy= y*s->mb_stride;
  1729. for(x=0; x<s->mb_width; x++){
  1730. if (s->mb_type[xy] & type){ // RAL: "type" test added...
  1731. if(field_select_table==NULL || field_select_table[xy] == field_select){
  1732. if( mv_table[xy][0] >=h_range || mv_table[xy][0] <-h_range
  1733. || mv_table[xy][1] >=v_range || mv_table[xy][1] <-v_range){
  1734. if(truncate){
  1735. if (mv_table[xy][0] > h_range-1) mv_table[xy][0]= h_range-1;
  1736. else if(mv_table[xy][0] < -h_range ) mv_table[xy][0]= -h_range;
  1737. if (mv_table[xy][1] > v_range-1) mv_table[xy][1]= v_range-1;
  1738. else if(mv_table[xy][1] < -v_range ) mv_table[xy][1]= -v_range;
  1739. }else{
  1740. s->mb_type[xy] &= ~type;
  1741. s->mb_type[xy] |= CANDIDATE_MB_TYPE_INTRA;
  1742. mv_table[xy][0]=
  1743. mv_table[xy][1]= 0;
  1744. }
  1745. }
  1746. }
  1747. }
  1748. xy++;
  1749. }
  1750. }
  1751. }