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.

2116 lines
75KB

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