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.

2118 lines
75KB

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