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.

243 lines
8.5KB

  1. /*
  2. * H.26L/H.264/AVC/JVT/14496-10/... motion vector predicion
  3. * Copyright (c) 2003 Michael Niedermayer <michaelni@gmx.at>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg 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.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg 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 FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file libavcodec/h264_mvpred.h
  23. * H.264 / AVC / MPEG4 part10 motion vector predicion.
  24. * @author Michael Niedermayer <michaelni@gmx.at>
  25. */
  26. #ifndef AVCODEC_H264_MVPRED_H
  27. #define AVCODEC_H264_MVPRED_H
  28. #include "internal.h"
  29. #include "avcodec.h"
  30. #include "h264.h"
  31. //#undef NDEBUG
  32. #include <assert.h>
  33. static inline int fetch_diagonal_mv(H264Context *h, const int16_t **C, int i, int list, int part_width){
  34. const int topright_ref= h->ref_cache[list][ i - 8 + part_width ];
  35. MpegEncContext *s = &h->s;
  36. /* there is no consistent mapping of mvs to neighboring locations that will
  37. * make mbaff happy, so we can't move all this logic to fill_caches */
  38. if(FRAME_MBAFF){
  39. const uint32_t *mb_types = s->current_picture_ptr->mb_type;
  40. const int16_t *mv;
  41. *(uint32_t*)h->mv_cache[list][scan8[0]-2] = 0;
  42. *C = h->mv_cache[list][scan8[0]-2];
  43. if(!MB_FIELD
  44. && (s->mb_y&1) && i < scan8[0]+8 && topright_ref != PART_NOT_AVAILABLE){
  45. int topright_xy = s->mb_x + (s->mb_y-1)*s->mb_stride + (i == scan8[0]+3);
  46. if(IS_INTERLACED(mb_types[topright_xy])){
  47. #define SET_DIAG_MV(MV_OP, REF_OP, X4, Y4)\
  48. const int x4 = X4, y4 = Y4;\
  49. const int mb_type = mb_types[(x4>>2)+(y4>>2)*s->mb_stride];\
  50. if(!USES_LIST(mb_type,list))\
  51. return LIST_NOT_USED;\
  52. mv = s->current_picture_ptr->motion_val[list][x4 + y4*h->b_stride];\
  53. h->mv_cache[list][scan8[0]-2][0] = mv[0];\
  54. h->mv_cache[list][scan8[0]-2][1] = mv[1] MV_OP;\
  55. return s->current_picture_ptr->ref_index[list][(x4>>1) + (y4>>1)*h->b8_stride] REF_OP;
  56. SET_DIAG_MV(*2, >>1, s->mb_x*4+(i&7)-4+part_width, s->mb_y*4-1);
  57. }
  58. }
  59. if(topright_ref == PART_NOT_AVAILABLE
  60. && ((s->mb_y&1) || i >= scan8[0]+8) && (i&7)==4
  61. && h->ref_cache[list][scan8[0]-1] != PART_NOT_AVAILABLE){
  62. if(!MB_FIELD
  63. && IS_INTERLACED(mb_types[h->left_mb_xy[0]])){
  64. SET_DIAG_MV(*2, >>1, s->mb_x*4-1, (s->mb_y|1)*4+(s->mb_y&1)*2+(i>>4)-1);
  65. }
  66. if(MB_FIELD
  67. && !IS_INTERLACED(mb_types[h->left_mb_xy[0]])
  68. && i >= scan8[0]+8){
  69. // left shift will turn LIST_NOT_USED into PART_NOT_AVAILABLE, but that's OK.
  70. SET_DIAG_MV(/2, <<1, s->mb_x*4-1, (s->mb_y&~1)*4 - 1 + ((i-scan8[0])>>3)*2);
  71. }
  72. }
  73. #undef SET_DIAG_MV
  74. }
  75. if(topright_ref != PART_NOT_AVAILABLE){
  76. *C= h->mv_cache[list][ i - 8 + part_width ];
  77. return topright_ref;
  78. }else{
  79. tprintf(s->avctx, "topright MV not available\n");
  80. *C= h->mv_cache[list][ i - 8 - 1 ];
  81. return h->ref_cache[list][ i - 8 - 1 ];
  82. }
  83. }
  84. /**
  85. * gets the predicted MV.
  86. * @param n the block index
  87. * @param part_width the width of the partition (4, 8,16) -> (1, 2, 4)
  88. * @param mx the x component of the predicted motion vector
  89. * @param my the y component of the predicted motion vector
  90. */
  91. static inline void pred_motion(H264Context * const h, int n, int part_width, int list, int ref, int * const mx, int * const my){
  92. const int index8= scan8[n];
  93. const int top_ref= h->ref_cache[list][ index8 - 8 ];
  94. const int left_ref= h->ref_cache[list][ index8 - 1 ];
  95. const int16_t * const A= h->mv_cache[list][ index8 - 1 ];
  96. const int16_t * const B= h->mv_cache[list][ index8 - 8 ];
  97. const int16_t * C;
  98. int diagonal_ref, match_count;
  99. assert(part_width==1 || part_width==2 || part_width==4);
  100. /* mv_cache
  101. B . . A T T T T
  102. U . . L . . , .
  103. U . . L . . . .
  104. U . . L . . , .
  105. . . . L . . . .
  106. */
  107. diagonal_ref= fetch_diagonal_mv(h, &C, index8, list, part_width);
  108. match_count= (diagonal_ref==ref) + (top_ref==ref) + (left_ref==ref);
  109. tprintf(h->s.avctx, "pred_motion match_count=%d\n", match_count);
  110. if(match_count > 1){ //most common
  111. *mx= mid_pred(A[0], B[0], C[0]);
  112. *my= mid_pred(A[1], B[1], C[1]);
  113. }else if(match_count==1){
  114. if(left_ref==ref){
  115. *mx= A[0];
  116. *my= A[1];
  117. }else if(top_ref==ref){
  118. *mx= B[0];
  119. *my= B[1];
  120. }else{
  121. *mx= C[0];
  122. *my= C[1];
  123. }
  124. }else{
  125. if(top_ref == PART_NOT_AVAILABLE && diagonal_ref == PART_NOT_AVAILABLE && left_ref != PART_NOT_AVAILABLE){
  126. *mx= A[0];
  127. *my= A[1];
  128. }else{
  129. *mx= mid_pred(A[0], B[0], C[0]);
  130. *my= mid_pred(A[1], B[1], C[1]);
  131. }
  132. }
  133. tprintf(h->s.avctx, "pred_motion (%2d %2d %2d) (%2d %2d %2d) (%2d %2d %2d) -> (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], diagonal_ref, C[0], C[1], left_ref, A[0], A[1], ref, *mx, *my, h->s.mb_x, h->s.mb_y, n, list);
  134. }
  135. /**
  136. * gets the directionally predicted 16x8 MV.
  137. * @param n the block index
  138. * @param mx the x component of the predicted motion vector
  139. * @param my the y component of the predicted motion vector
  140. */
  141. static inline void pred_16x8_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  142. if(n==0){
  143. const int top_ref= h->ref_cache[list][ scan8[0] - 8 ];
  144. const int16_t * const B= h->mv_cache[list][ scan8[0] - 8 ];
  145. tprintf(h->s.avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", top_ref, B[0], B[1], h->s.mb_x, h->s.mb_y, n, list);
  146. if(top_ref == ref){
  147. *mx= B[0];
  148. *my= B[1];
  149. return;
  150. }
  151. }else{
  152. const int left_ref= h->ref_cache[list][ scan8[8] - 1 ];
  153. const int16_t * const A= h->mv_cache[list][ scan8[8] - 1 ];
  154. tprintf(h->s.avctx, "pred_16x8: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  155. if(left_ref == ref){
  156. *mx= A[0];
  157. *my= A[1];
  158. return;
  159. }
  160. }
  161. //RARE
  162. pred_motion(h, n, 4, list, ref, mx, my);
  163. }
  164. /**
  165. * gets the directionally predicted 8x16 MV.
  166. * @param n the block index
  167. * @param mx the x component of the predicted motion vector
  168. * @param my the y component of the predicted motion vector
  169. */
  170. static inline void pred_8x16_motion(H264Context * const h, int n, int list, int ref, int * const mx, int * const my){
  171. if(n==0){
  172. const int left_ref= h->ref_cache[list][ scan8[0] - 1 ];
  173. const int16_t * const A= h->mv_cache[list][ scan8[0] - 1 ];
  174. tprintf(h->s.avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", left_ref, A[0], A[1], h->s.mb_x, h->s.mb_y, n, list);
  175. if(left_ref == ref){
  176. *mx= A[0];
  177. *my= A[1];
  178. return;
  179. }
  180. }else{
  181. const int16_t * C;
  182. int diagonal_ref;
  183. diagonal_ref= fetch_diagonal_mv(h, &C, scan8[4], list, 2);
  184. tprintf(h->s.avctx, "pred_8x16: (%2d %2d %2d) at %2d %2d %d list %d\n", diagonal_ref, C[0], C[1], h->s.mb_x, h->s.mb_y, n, list);
  185. if(diagonal_ref == ref){
  186. *mx= C[0];
  187. *my= C[1];
  188. return;
  189. }
  190. }
  191. //RARE
  192. pred_motion(h, n, 2, list, ref, mx, my);
  193. }
  194. static inline void pred_pskip_motion(H264Context * const h, int * const mx, int * const my){
  195. const int top_ref = h->ref_cache[0][ scan8[0] - 8 ];
  196. const int left_ref= h->ref_cache[0][ scan8[0] - 1 ];
  197. tprintf(h->s.avctx, "pred_pskip: (%d) (%d) at %2d %2d\n", top_ref, left_ref, h->s.mb_x, h->s.mb_y);
  198. if(top_ref == PART_NOT_AVAILABLE || left_ref == PART_NOT_AVAILABLE
  199. || !( top_ref | *(uint32_t*)h->mv_cache[0][ scan8[0] - 8 ])
  200. || !(left_ref | *(uint32_t*)h->mv_cache[0][ scan8[0] - 1 ])){
  201. *mx = *my = 0;
  202. return;
  203. }
  204. pred_motion(h, 0, 4, 0, 0, mx, my);
  205. return;
  206. }
  207. #endif /* AVCODEC_H264_MVPRED_H */