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.

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