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.

1995 lines
70KB

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