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.

792 lines
28KB

  1. /*
  2. * Chinese AVS video (AVS1-P2, JiZhun profile) decoder.
  3. * Copyright (c) 2006 Stefan Gehrer <stefan.gehrer@gmx.de>
  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
  23. * Chinese AVS video (AVS1-P2, JiZhun profile) decoder
  24. * @author Stefan Gehrer <stefan.gehrer@gmx.de>
  25. */
  26. #include "avcodec.h"
  27. #include "get_bits.h"
  28. #include "golomb.h"
  29. #include "h264chroma.h"
  30. #include "mathops.h"
  31. #include "cavs.h"
  32. static const uint8_t alpha_tab[64] = {
  33. 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 2, 3, 3,
  34. 4, 4, 5, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, 18, 20,
  35. 22, 24, 26, 28, 30, 33, 33, 35, 35, 36, 37, 37, 39, 39, 42, 44,
  36. 46, 48, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64
  37. };
  38. static const uint8_t beta_tab[64] = {
  39. 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2,
  40. 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6,
  41. 6, 7, 7, 7, 8, 8, 8, 9, 9, 10, 10, 11, 11, 12, 13, 14,
  42. 15, 16, 17, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 25, 26, 27
  43. };
  44. static const uint8_t tc_tab[64] = {
  45. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  46. 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2,
  47. 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4,
  48. 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9
  49. };
  50. /** mark block as unavailable, i.e. out of picture
  51. or not yet decoded */
  52. static const cavs_vector un_mv = { 0, 0, 1, NOT_AVAIL };
  53. static const int8_t left_modifier_l[8] = { 0, -1, 6, -1, -1, 7, 6, 7 };
  54. static const int8_t top_modifier_l[8] = { -1, 1, 5, -1, -1, 5, 7, 7 };
  55. static const int8_t left_modifier_c[7] = { 5, -1, 2, -1, 6, 5, 6 };
  56. static const int8_t top_modifier_c[7] = { 4, 1, -1, -1, 4, 6, 6 };
  57. /*****************************************************************************
  58. *
  59. * in-loop deblocking filter
  60. *
  61. ****************************************************************************/
  62. static inline int get_bs(cavs_vector *mvP, cavs_vector *mvQ, int b)
  63. {
  64. if ((mvP->ref == REF_INTRA) || (mvQ->ref == REF_INTRA))
  65. return 2;
  66. if ((abs(mvP->x - mvQ->x) >= 4) || (abs(mvP->y - mvQ->y) >= 4))
  67. return 1;
  68. if (b) {
  69. mvP += MV_BWD_OFFS;
  70. mvQ += MV_BWD_OFFS;
  71. if ((abs(mvP->x - mvQ->x) >= 4) || (abs(mvP->y - mvQ->y) >= 4))
  72. return 1;
  73. } else {
  74. if (mvP->ref != mvQ->ref)
  75. return 1;
  76. }
  77. return 0;
  78. }
  79. #define SET_PARAMS \
  80. alpha = alpha_tab[av_clip(qp_avg + h->alpha_offset, 0, 63)]; \
  81. beta = beta_tab[av_clip(qp_avg + h->beta_offset, 0, 63)]; \
  82. tc = tc_tab[av_clip(qp_avg + h->alpha_offset, 0, 63)];
  83. /**
  84. * in-loop deblocking filter for a single macroblock
  85. *
  86. * boundary strength (bs) mapping:
  87. *
  88. * --4---5--
  89. * 0 2 |
  90. * | 6 | 7 |
  91. * 1 3 |
  92. * ---------
  93. *
  94. */
  95. void ff_cavs_filter(AVSContext *h, enum cavs_mb mb_type)
  96. {
  97. uint8_t bs[8];
  98. int qp_avg, alpha, beta, tc;
  99. int i;
  100. /* save un-deblocked lines */
  101. h->topleft_border_y = h->top_border_y[h->mbx * 16 + 15];
  102. h->topleft_border_u = h->top_border_u[h->mbx * 10 + 8];
  103. h->topleft_border_v = h->top_border_v[h->mbx * 10 + 8];
  104. memcpy(&h->top_border_y[h->mbx * 16], h->cy + 15 * h->l_stride, 16);
  105. memcpy(&h->top_border_u[h->mbx * 10 + 1], h->cu + 7 * h->c_stride, 8);
  106. memcpy(&h->top_border_v[h->mbx * 10 + 1], h->cv + 7 * h->c_stride, 8);
  107. for (i = 0; i < 8; i++) {
  108. h->left_border_y[i * 2 + 1] = *(h->cy + 15 + (i * 2 + 0) * h->l_stride);
  109. h->left_border_y[i * 2 + 2] = *(h->cy + 15 + (i * 2 + 1) * h->l_stride);
  110. h->left_border_u[i + 1] = *(h->cu + 7 + i * h->c_stride);
  111. h->left_border_v[i + 1] = *(h->cv + 7 + i * h->c_stride);
  112. }
  113. if (!h->loop_filter_disable) {
  114. /* determine bs */
  115. if (mb_type == I_8X8)
  116. memset(bs, 2, 8);
  117. else{
  118. memset(bs, 0, 8);
  119. if (ff_cavs_partition_flags[mb_type] & SPLITV) {
  120. bs[2] = get_bs(&h->mv[MV_FWD_X0], &h->mv[MV_FWD_X1], mb_type > P_8X8);
  121. bs[3] = get_bs(&h->mv[MV_FWD_X2], &h->mv[MV_FWD_X3], mb_type > P_8X8);
  122. }
  123. if (ff_cavs_partition_flags[mb_type] & SPLITH) {
  124. bs[6] = get_bs(&h->mv[MV_FWD_X0], &h->mv[MV_FWD_X2], mb_type > P_8X8);
  125. bs[7] = get_bs(&h->mv[MV_FWD_X1], &h->mv[MV_FWD_X3], mb_type > P_8X8);
  126. }
  127. bs[0] = get_bs(&h->mv[MV_FWD_A1], &h->mv[MV_FWD_X0], mb_type > P_8X8);
  128. bs[1] = get_bs(&h->mv[MV_FWD_A3], &h->mv[MV_FWD_X2], mb_type > P_8X8);
  129. bs[4] = get_bs(&h->mv[MV_FWD_B2], &h->mv[MV_FWD_X0], mb_type > P_8X8);
  130. bs[5] = get_bs(&h->mv[MV_FWD_B3], &h->mv[MV_FWD_X1], mb_type > P_8X8);
  131. }
  132. if (AV_RN64(bs)) {
  133. if (h->flags & A_AVAIL) {
  134. qp_avg = (h->qp + h->left_qp + 1) >> 1;
  135. SET_PARAMS;
  136. h->cdsp.cavs_filter_lv(h->cy, h->l_stride, alpha, beta, tc, bs[0], bs[1]);
  137. h->cdsp.cavs_filter_cv(h->cu, h->c_stride, alpha, beta, tc, bs[0], bs[1]);
  138. h->cdsp.cavs_filter_cv(h->cv, h->c_stride, alpha, beta, tc, bs[0], bs[1]);
  139. }
  140. qp_avg = h->qp;
  141. SET_PARAMS;
  142. h->cdsp.cavs_filter_lv(h->cy + 8, h->l_stride, alpha, beta, tc, bs[2], bs[3]);
  143. h->cdsp.cavs_filter_lh(h->cy + 8 * h->l_stride, h->l_stride, alpha, beta, tc, bs[6], bs[7]);
  144. if (h->flags & B_AVAIL) {
  145. qp_avg = (h->qp + h->top_qp[h->mbx] + 1) >> 1;
  146. SET_PARAMS;
  147. h->cdsp.cavs_filter_lh(h->cy, h->l_stride, alpha, beta, tc, bs[4], bs[5]);
  148. h->cdsp.cavs_filter_ch(h->cu, h->c_stride, alpha, beta, tc, bs[4], bs[5]);
  149. h->cdsp.cavs_filter_ch(h->cv, h->c_stride, alpha, beta, tc, bs[4], bs[5]);
  150. }
  151. }
  152. }
  153. h->left_qp = h->qp;
  154. h->top_qp[h->mbx] = h->qp;
  155. }
  156. #undef SET_PARAMS
  157. /*****************************************************************************
  158. *
  159. * spatial intra prediction
  160. *
  161. ****************************************************************************/
  162. void ff_cavs_load_intra_pred_luma(AVSContext *h, uint8_t *top,
  163. uint8_t **left, int block)
  164. {
  165. int i;
  166. switch (block) {
  167. case 0:
  168. *left = h->left_border_y;
  169. h->left_border_y[0] = h->left_border_y[1];
  170. memset(&h->left_border_y[17], h->left_border_y[16], 9);
  171. memcpy(&top[1], &h->top_border_y[h->mbx * 16], 16);
  172. top[17] = top[16];
  173. top[0] = top[1];
  174. if ((h->flags & A_AVAIL) && (h->flags & B_AVAIL))
  175. h->left_border_y[0] = top[0] = h->topleft_border_y;
  176. break;
  177. case 1:
  178. *left = h->intern_border_y;
  179. for (i = 0; i < 8; i++)
  180. h->intern_border_y[i + 1] = *(h->cy + 7 + i * h->l_stride);
  181. memset(&h->intern_border_y[9], h->intern_border_y[8], 9);
  182. h->intern_border_y[0] = h->intern_border_y[1];
  183. memcpy(&top[1], &h->top_border_y[h->mbx * 16 + 8], 8);
  184. if (h->flags & C_AVAIL)
  185. memcpy(&top[9], &h->top_border_y[(h->mbx + 1) * 16], 8);
  186. else
  187. memset(&top[9], top[8], 9);
  188. top[17] = top[16];
  189. top[0] = top[1];
  190. if (h->flags & B_AVAIL)
  191. h->intern_border_y[0] = top[0] = h->top_border_y[h->mbx * 16 + 7];
  192. break;
  193. case 2:
  194. *left = &h->left_border_y[8];
  195. memcpy(&top[1], h->cy + 7 * h->l_stride, 16);
  196. top[17] = top[16];
  197. top[0] = top[1];
  198. if (h->flags & A_AVAIL)
  199. top[0] = h->left_border_y[8];
  200. break;
  201. case 3:
  202. *left = &h->intern_border_y[8];
  203. for (i = 0; i < 8; i++)
  204. h->intern_border_y[i + 9] = *(h->cy + 7 + (i + 8) * h->l_stride);
  205. memset(&h->intern_border_y[17], h->intern_border_y[16], 9);
  206. memcpy(&top[0], h->cy + 7 + 7 * h->l_stride, 9);
  207. memset(&top[9], top[8], 9);
  208. break;
  209. }
  210. }
  211. void ff_cavs_load_intra_pred_chroma(AVSContext *h)
  212. {
  213. /* extend borders by one pixel */
  214. h->left_border_u[9] = h->left_border_u[8];
  215. h->left_border_v[9] = h->left_border_v[8];
  216. h->top_border_u[h->mbx * 10 + 9] = h->top_border_u[h->mbx * 10 + 8];
  217. h->top_border_v[h->mbx * 10 + 9] = h->top_border_v[h->mbx * 10 + 8];
  218. if (h->mbx && h->mby) {
  219. h->top_border_u[h->mbx * 10] = h->left_border_u[0] = h->topleft_border_u;
  220. h->top_border_v[h->mbx * 10] = h->left_border_v[0] = h->topleft_border_v;
  221. } else {
  222. h->left_border_u[0] = h->left_border_u[1];
  223. h->left_border_v[0] = h->left_border_v[1];
  224. h->top_border_u[h->mbx * 10] = h->top_border_u[h->mbx * 10 + 1];
  225. h->top_border_v[h->mbx * 10] = h->top_border_v[h->mbx * 10 + 1];
  226. }
  227. }
  228. static void intra_pred_vert(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  229. {
  230. int y;
  231. uint64_t a = AV_RN64(&top[1]);
  232. for (y = 0; y < 8; y++) {
  233. *((uint64_t *)(d + y * stride)) = a;
  234. }
  235. }
  236. static void intra_pred_horiz(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  237. {
  238. int y;
  239. uint64_t a;
  240. for (y = 0; y < 8; y++) {
  241. a = left[y + 1] * 0x0101010101010101ULL;
  242. *((uint64_t *)(d + y * stride)) = a;
  243. }
  244. }
  245. static void intra_pred_dc_128(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  246. {
  247. int y;
  248. uint64_t a = 0x8080808080808080ULL;
  249. for (y = 0; y < 8; y++)
  250. *((uint64_t *)(d + y * stride)) = a;
  251. }
  252. static void intra_pred_plane(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  253. {
  254. int x, y, ia;
  255. int ih = 0;
  256. int iv = 0;
  257. const uint8_t *cm = ff_cropTbl + MAX_NEG_CROP;
  258. for (x = 0; x < 4; x++) {
  259. ih += (x + 1) * (top [5 + x] - top [3 - x]);
  260. iv += (x + 1) * (left[5 + x] - left[3 - x]);
  261. }
  262. ia = (top[8] + left[8]) << 4;
  263. ih = (17 * ih + 16) >> 5;
  264. iv = (17 * iv + 16) >> 5;
  265. for (y = 0; y < 8; y++)
  266. for (x = 0; x < 8; x++)
  267. d[y * stride + x] = cm[(ia + (x - 3) * ih + (y - 3) * iv + 16) >> 5];
  268. }
  269. #define LOWPASS(ARRAY,INDEX) \
  270. ((ARRAY[(INDEX) - 1] + 2 * ARRAY[(INDEX)] + ARRAY[(INDEX) + 1] + 2) >> 2)
  271. static void intra_pred_lp(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  272. {
  273. int x, y;
  274. for (y = 0; y < 8; y++)
  275. for (x = 0; x < 8; x++)
  276. d[y * stride + x] = (LOWPASS(top, x + 1) + LOWPASS(left, y + 1)) >> 1;
  277. }
  278. static void intra_pred_down_left(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  279. {
  280. int x, y;
  281. for (y = 0; y < 8; y++)
  282. for (x = 0; x < 8; x++)
  283. d[y * stride + x] = (LOWPASS(top, x + y + 2) + LOWPASS(left, x + y + 2)) >> 1;
  284. }
  285. static void intra_pred_down_right(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  286. {
  287. int x, y;
  288. for (y = 0; y < 8; y++)
  289. for (x = 0; x < 8; x++)
  290. if (x == y)
  291. d[y * stride + x] = (left[1] + 2 * top[0] + top[1] + 2) >> 2;
  292. else if (x > y)
  293. d[y * stride + x] = LOWPASS(top, x - y);
  294. else
  295. d[y * stride + x] = LOWPASS(left, y - x);
  296. }
  297. static void intra_pred_lp_left(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  298. {
  299. int x, y;
  300. for (y = 0; y < 8; y++)
  301. for (x = 0; x < 8; x++)
  302. d[y * stride + x] = LOWPASS(left, y + 1);
  303. }
  304. static void intra_pred_lp_top(uint8_t *d,uint8_t *top,uint8_t *left,int stride)
  305. {
  306. int x, y;
  307. for (y = 0; y < 8; y++)
  308. for (x = 0; x < 8; x++)
  309. d[y * stride + x] = LOWPASS(top, x + 1);
  310. }
  311. #undef LOWPASS
  312. static inline void modify_pred(const int8_t *mod_table, int *mode)
  313. {
  314. *mode = mod_table[*mode];
  315. if (*mode < 0) {
  316. av_log(NULL, AV_LOG_ERROR, "Illegal intra prediction mode\n");
  317. *mode = 0;
  318. }
  319. }
  320. void ff_cavs_modify_mb_i(AVSContext *h, int *pred_mode_uv)
  321. {
  322. /* save pred modes before they get modified */
  323. h->pred_mode_Y[3] = h->pred_mode_Y[5];
  324. h->pred_mode_Y[6] = h->pred_mode_Y[8];
  325. h->top_pred_Y[h->mbx * 2 + 0] = h->pred_mode_Y[7];
  326. h->top_pred_Y[h->mbx * 2 + 1] = h->pred_mode_Y[8];
  327. /* modify pred modes according to availability of neighbour samples */
  328. if (!(h->flags & A_AVAIL)) {
  329. modify_pred(left_modifier_l, &h->pred_mode_Y[4]);
  330. modify_pred(left_modifier_l, &h->pred_mode_Y[7]);
  331. modify_pred(left_modifier_c, pred_mode_uv);
  332. }
  333. if (!(h->flags & B_AVAIL)) {
  334. modify_pred(top_modifier_l, &h->pred_mode_Y[4]);
  335. modify_pred(top_modifier_l, &h->pred_mode_Y[5]);
  336. modify_pred(top_modifier_c, pred_mode_uv);
  337. }
  338. }
  339. /*****************************************************************************
  340. *
  341. * motion compensation
  342. *
  343. ****************************************************************************/
  344. static inline void mc_dir_part(AVSContext *h, AVFrame *pic,
  345. int chroma_height,int delta,int list,uint8_t *dest_y,
  346. uint8_t *dest_cb,uint8_t *dest_cr,int src_x_offset,
  347. int src_y_offset,qpel_mc_func *qpix_op,
  348. h264_chroma_mc_func chroma_op,cavs_vector *mv)
  349. {
  350. const int mx= mv->x + src_x_offset*8;
  351. const int my= mv->y + src_y_offset*8;
  352. const int luma_xy= (mx&3) + ((my&3)<<2);
  353. uint8_t * src_y = pic->data[0] + (mx >> 2) + (my >> 2) * h->l_stride;
  354. uint8_t * src_cb = pic->data[1] + (mx >> 3) + (my >> 3) * h->c_stride;
  355. uint8_t * src_cr = pic->data[2] + (mx >> 3) + (my >> 3) * h->c_stride;
  356. int extra_width = 0;
  357. int extra_height= extra_width;
  358. int emu=0;
  359. const int full_mx= mx>>2;
  360. const int full_my= my>>2;
  361. const int pic_width = 16*h->mb_width;
  362. const int pic_height = 16*h->mb_height;
  363. if (!pic->data[0])
  364. return;
  365. if(mx&7) extra_width -= 3;
  366. if(my&7) extra_height -= 3;
  367. if( full_mx < 0-extra_width
  368. || full_my < 0-extra_height
  369. || full_mx + 16/*FIXME*/ > pic_width + extra_width
  370. || full_my + 16/*FIXME*/ > pic_height + extra_height){
  371. h->vdsp.emulated_edge_mc(h->edge_emu_buffer, h->l_stride,
  372. src_y - 2 - 2*h->l_stride, h->l_stride,
  373. 16+5, 16+5/*FIXME*/, full_mx-2, full_my-2, pic_width, pic_height);
  374. src_y= h->edge_emu_buffer + 2 + 2*h->l_stride;
  375. emu=1;
  376. }
  377. qpix_op[luma_xy](dest_y, src_y, h->l_stride); //FIXME try variable height perhaps?
  378. if(emu){
  379. h->vdsp.emulated_edge_mc(h->edge_emu_buffer, h->c_stride, src_cb, h->c_stride,
  380. 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);
  381. src_cb= h->edge_emu_buffer;
  382. }
  383. chroma_op(dest_cb, src_cb, h->c_stride, chroma_height, mx&7, my&7);
  384. if(emu){
  385. h->vdsp.emulated_edge_mc(h->edge_emu_buffer, h->c_stride, src_cr, h->c_stride,
  386. 9, 9/*FIXME*/, (mx>>3), (my>>3), pic_width>>1, pic_height>>1);
  387. src_cr= h->edge_emu_buffer;
  388. }
  389. chroma_op(dest_cr, src_cr, h->c_stride, chroma_height, mx&7, my&7);
  390. }
  391. static inline void mc_part_std(AVSContext *h,int chroma_height,int delta,
  392. uint8_t *dest_y,uint8_t *dest_cb,uint8_t *dest_cr,
  393. int x_offset, int y_offset,qpel_mc_func *qpix_put,
  394. h264_chroma_mc_func chroma_put,qpel_mc_func *qpix_avg,
  395. h264_chroma_mc_func chroma_avg, cavs_vector *mv)
  396. {
  397. qpel_mc_func *qpix_op= qpix_put;
  398. h264_chroma_mc_func chroma_op= chroma_put;
  399. dest_y += 2*x_offset + 2*y_offset*h->l_stride;
  400. dest_cb += x_offset + y_offset*h->c_stride;
  401. dest_cr += x_offset + y_offset*h->c_stride;
  402. x_offset += 8*h->mbx;
  403. y_offset += 8*h->mby;
  404. if(mv->ref >= 0){
  405. AVFrame *ref = h->DPB[mv->ref].f;
  406. mc_dir_part(h, ref, chroma_height, delta, 0,
  407. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  408. qpix_op, chroma_op, mv);
  409. qpix_op= qpix_avg;
  410. chroma_op= chroma_avg;
  411. }
  412. if((mv+MV_BWD_OFFS)->ref >= 0){
  413. AVFrame *ref = h->DPB[0].f;
  414. mc_dir_part(h, ref, chroma_height, delta, 1,
  415. dest_y, dest_cb, dest_cr, x_offset, y_offset,
  416. qpix_op, chroma_op, mv+MV_BWD_OFFS);
  417. }
  418. }
  419. void ff_cavs_inter(AVSContext *h, enum cavs_mb mb_type) {
  420. if(ff_cavs_partition_flags[mb_type] == 0){ // 16x16
  421. mc_part_std(h, 8, 0, h->cy, h->cu, h->cv, 0, 0,
  422. h->cdsp.put_cavs_qpel_pixels_tab[0],
  423. h->h264chroma.put_h264_chroma_pixels_tab[0],
  424. h->cdsp.avg_cavs_qpel_pixels_tab[0],
  425. h->h264chroma.avg_h264_chroma_pixels_tab[0],
  426. &h->mv[MV_FWD_X0]);
  427. }else{
  428. mc_part_std(h, 4, 0, h->cy, h->cu, h->cv, 0, 0,
  429. h->cdsp.put_cavs_qpel_pixels_tab[1],
  430. h->h264chroma.put_h264_chroma_pixels_tab[1],
  431. h->cdsp.avg_cavs_qpel_pixels_tab[1],
  432. h->h264chroma.avg_h264_chroma_pixels_tab[1],
  433. &h->mv[MV_FWD_X0]);
  434. mc_part_std(h, 4, 0, h->cy, h->cu, h->cv, 4, 0,
  435. h->cdsp.put_cavs_qpel_pixels_tab[1],
  436. h->h264chroma.put_h264_chroma_pixels_tab[1],
  437. h->cdsp.avg_cavs_qpel_pixels_tab[1],
  438. h->h264chroma.avg_h264_chroma_pixels_tab[1],
  439. &h->mv[MV_FWD_X1]);
  440. mc_part_std(h, 4, 0, h->cy, h->cu, h->cv, 0, 4,
  441. h->cdsp.put_cavs_qpel_pixels_tab[1],
  442. h->h264chroma.put_h264_chroma_pixels_tab[1],
  443. h->cdsp.avg_cavs_qpel_pixels_tab[1],
  444. h->h264chroma.avg_h264_chroma_pixels_tab[1],
  445. &h->mv[MV_FWD_X2]);
  446. mc_part_std(h, 4, 0, h->cy, h->cu, h->cv, 4, 4,
  447. h->cdsp.put_cavs_qpel_pixels_tab[1],
  448. h->h264chroma.put_h264_chroma_pixels_tab[1],
  449. h->cdsp.avg_cavs_qpel_pixels_tab[1],
  450. h->h264chroma.avg_h264_chroma_pixels_tab[1],
  451. &h->mv[MV_FWD_X3]);
  452. }
  453. }
  454. /*****************************************************************************
  455. *
  456. * motion vector prediction
  457. *
  458. ****************************************************************************/
  459. static inline void scale_mv(AVSContext *h, int *d_x, int *d_y, cavs_vector *src, int distp) {
  460. int den = h->scale_den[src->ref];
  461. *d_x = (src->x*distp*den + 256 + (src->x>>31)) >> 9;
  462. *d_y = (src->y*distp*den + 256 + (src->y>>31)) >> 9;
  463. }
  464. static inline void mv_pred_median(AVSContext *h, cavs_vector *mvP,
  465. cavs_vector *mvA, cavs_vector *mvB, cavs_vector *mvC) {
  466. int ax, ay, bx, by, cx, cy;
  467. int len_ab, len_bc, len_ca, len_mid;
  468. /* scale candidates according to their temporal span */
  469. scale_mv(h, &ax, &ay, mvA, mvP->dist);
  470. scale_mv(h, &bx, &by, mvB, mvP->dist);
  471. scale_mv(h, &cx, &cy, mvC, mvP->dist);
  472. /* find the geometrical median of the three candidates */
  473. len_ab = abs(ax - bx) + abs(ay - by);
  474. len_bc = abs(bx - cx) + abs(by - cy);
  475. len_ca = abs(cx - ax) + abs(cy - ay);
  476. len_mid = mid_pred(len_ab, len_bc, len_ca);
  477. if(len_mid == len_ab) {
  478. mvP->x = cx;
  479. mvP->y = cy;
  480. } else if(len_mid == len_bc) {
  481. mvP->x = ax;
  482. mvP->y = ay;
  483. } else {
  484. mvP->x = bx;
  485. mvP->y = by;
  486. }
  487. }
  488. void ff_cavs_mv(AVSContext *h, enum cavs_mv_loc nP, enum cavs_mv_loc nC,
  489. enum cavs_mv_pred mode, enum cavs_block size, int ref) {
  490. cavs_vector *mvP = &h->mv[nP];
  491. cavs_vector *mvA = &h->mv[nP-1];
  492. cavs_vector *mvB = &h->mv[nP-4];
  493. cavs_vector *mvC = &h->mv[nC];
  494. const cavs_vector *mvP2 = NULL;
  495. mvP->ref = ref;
  496. mvP->dist = h->dist[mvP->ref];
  497. if(mvC->ref == NOT_AVAIL)
  498. mvC = &h->mv[nP-5]; // set to top-left (mvD)
  499. if((mode == MV_PRED_PSKIP) &&
  500. ((mvA->ref == NOT_AVAIL) || (mvB->ref == NOT_AVAIL) ||
  501. ((mvA->x | mvA->y | mvA->ref) == 0) ||
  502. ((mvB->x | mvB->y | mvB->ref) == 0) )) {
  503. mvP2 = &un_mv;
  504. /* if there is only one suitable candidate, take it */
  505. } else if((mvA->ref >= 0) && (mvB->ref < 0) && (mvC->ref < 0)) {
  506. mvP2= mvA;
  507. } else if((mvA->ref < 0) && (mvB->ref >= 0) && (mvC->ref < 0)) {
  508. mvP2= mvB;
  509. } else if((mvA->ref < 0) && (mvB->ref < 0) && (mvC->ref >= 0)) {
  510. mvP2= mvC;
  511. } else if(mode == MV_PRED_LEFT && mvA->ref == ref){
  512. mvP2= mvA;
  513. } else if(mode == MV_PRED_TOP && mvB->ref == ref){
  514. mvP2= mvB;
  515. } else if(mode == MV_PRED_TOPRIGHT && mvC->ref == ref){
  516. mvP2= mvC;
  517. }
  518. if(mvP2){
  519. mvP->x = mvP2->x;
  520. mvP->y = mvP2->y;
  521. }else
  522. mv_pred_median(h, mvP, mvA, mvB, mvC);
  523. if(mode < MV_PRED_PSKIP) {
  524. mvP->x += get_se_golomb(&h->gb);
  525. mvP->y += get_se_golomb(&h->gb);
  526. }
  527. set_mvs(mvP,size);
  528. }
  529. /*****************************************************************************
  530. *
  531. * macroblock level
  532. *
  533. ****************************************************************************/
  534. /**
  535. * initialise predictors for motion vectors and intra prediction
  536. */
  537. void ff_cavs_init_mb(AVSContext *h) {
  538. int i;
  539. /* copy predictors from top line (MB B and C) into cache */
  540. for(i=0;i<3;i++) {
  541. h->mv[MV_FWD_B2+i] = h->top_mv[0][h->mbx*2+i];
  542. h->mv[MV_BWD_B2+i] = h->top_mv[1][h->mbx*2+i];
  543. }
  544. h->pred_mode_Y[1] = h->top_pred_Y[h->mbx*2+0];
  545. h->pred_mode_Y[2] = h->top_pred_Y[h->mbx*2+1];
  546. /* clear top predictors if MB B is not available */
  547. if(!(h->flags & B_AVAIL)) {
  548. h->mv[MV_FWD_B2] = un_mv;
  549. h->mv[MV_FWD_B3] = un_mv;
  550. h->mv[MV_BWD_B2] = un_mv;
  551. h->mv[MV_BWD_B3] = un_mv;
  552. h->pred_mode_Y[1] = h->pred_mode_Y[2] = NOT_AVAIL;
  553. h->flags &= ~(C_AVAIL|D_AVAIL);
  554. } else if(h->mbx) {
  555. h->flags |= D_AVAIL;
  556. }
  557. if(h->mbx == h->mb_width-1) //MB C not available
  558. h->flags &= ~C_AVAIL;
  559. /* clear top-right predictors if MB C is not available */
  560. if(!(h->flags & C_AVAIL)) {
  561. h->mv[MV_FWD_C2] = un_mv;
  562. h->mv[MV_BWD_C2] = un_mv;
  563. }
  564. /* clear top-left predictors if MB D is not available */
  565. if(!(h->flags & D_AVAIL)) {
  566. h->mv[MV_FWD_D3] = un_mv;
  567. h->mv[MV_BWD_D3] = un_mv;
  568. }
  569. }
  570. /**
  571. * save predictors for later macroblocks and increase
  572. * macroblock address
  573. * @return 0 if end of frame is reached, 1 otherwise
  574. */
  575. int ff_cavs_next_mb(AVSContext *h) {
  576. int i;
  577. h->flags |= A_AVAIL;
  578. h->cy += 16;
  579. h->cu += 8;
  580. h->cv += 8;
  581. /* copy mvs as predictors to the left */
  582. for(i=0;i<=20;i+=4)
  583. h->mv[i] = h->mv[i+2];
  584. /* copy bottom mvs from cache to top line */
  585. h->top_mv[0][h->mbx*2+0] = h->mv[MV_FWD_X2];
  586. h->top_mv[0][h->mbx*2+1] = h->mv[MV_FWD_X3];
  587. h->top_mv[1][h->mbx*2+0] = h->mv[MV_BWD_X2];
  588. h->top_mv[1][h->mbx*2+1] = h->mv[MV_BWD_X3];
  589. /* next MB address */
  590. h->mbidx++;
  591. h->mbx++;
  592. if(h->mbx == h->mb_width) { //new mb line
  593. h->flags = B_AVAIL|C_AVAIL;
  594. /* clear left pred_modes */
  595. h->pred_mode_Y[3] = h->pred_mode_Y[6] = NOT_AVAIL;
  596. /* clear left mv predictors */
  597. for(i=0;i<=20;i+=4)
  598. h->mv[i] = un_mv;
  599. h->mbx = 0;
  600. h->mby++;
  601. /* re-calculate sample pointers */
  602. h->cy = h->cur.f->data[0] + h->mby * 16 * h->l_stride;
  603. h->cu = h->cur.f->data[1] + h->mby * 8 * h->c_stride;
  604. h->cv = h->cur.f->data[2] + h->mby * 8 * h->c_stride;
  605. if(h->mby == h->mb_height) { //frame end
  606. return 0;
  607. }
  608. }
  609. return 1;
  610. }
  611. /*****************************************************************************
  612. *
  613. * frame level
  614. *
  615. ****************************************************************************/
  616. int ff_cavs_init_pic(AVSContext *h) {
  617. int i;
  618. /* clear some predictors */
  619. for(i=0;i<=20;i+=4)
  620. h->mv[i] = un_mv;
  621. h->mv[MV_BWD_X0] = ff_cavs_dir_mv;
  622. set_mvs(&h->mv[MV_BWD_X0], BLK_16X16);
  623. h->mv[MV_FWD_X0] = ff_cavs_dir_mv;
  624. set_mvs(&h->mv[MV_FWD_X0], BLK_16X16);
  625. h->pred_mode_Y[3] = h->pred_mode_Y[6] = NOT_AVAIL;
  626. h->cy = h->cur.f->data[0];
  627. h->cu = h->cur.f->data[1];
  628. h->cv = h->cur.f->data[2];
  629. h->l_stride = h->cur.f->linesize[0];
  630. h->c_stride = h->cur.f->linesize[1];
  631. h->luma_scan[2] = 8*h->l_stride;
  632. h->luma_scan[3] = 8*h->l_stride+8;
  633. h->mbx = h->mby = h->mbidx = 0;
  634. h->flags = 0;
  635. return 0;
  636. }
  637. /*****************************************************************************
  638. *
  639. * headers and interface
  640. *
  641. ****************************************************************************/
  642. /**
  643. * some predictions require data from the top-neighbouring macroblock.
  644. * this data has to be stored for one complete row of macroblocks
  645. * and this storage space is allocated here
  646. */
  647. void ff_cavs_init_top_lines(AVSContext *h) {
  648. /* alloc top line of predictors */
  649. h->top_qp = av_mallocz( h->mb_width);
  650. h->top_mv[0] = av_mallocz((h->mb_width*2+1)*sizeof(cavs_vector));
  651. h->top_mv[1] = av_mallocz((h->mb_width*2+1)*sizeof(cavs_vector));
  652. h->top_pred_Y = av_mallocz( h->mb_width*2*sizeof(*h->top_pred_Y));
  653. h->top_border_y = av_mallocz((h->mb_width+1)*16);
  654. h->top_border_u = av_mallocz( h->mb_width * 10);
  655. h->top_border_v = av_mallocz( h->mb_width * 10);
  656. /* alloc space for co-located MVs and types */
  657. h->col_mv = av_mallocz( h->mb_width*h->mb_height*4*sizeof(cavs_vector));
  658. h->col_type_base = av_mallocz(h->mb_width*h->mb_height);
  659. h->block = av_mallocz(64*sizeof(int16_t));
  660. }
  661. av_cold int ff_cavs_init(AVCodecContext *avctx) {
  662. AVSContext *h = avctx->priv_data;
  663. ff_dsputil_init(&h->dsp, avctx);
  664. ff_h264chroma_init(&h->h264chroma, 8);
  665. ff_videodsp_init(&h->vdsp, 8);
  666. ff_cavsdsp_init(&h->cdsp, avctx);
  667. ff_init_scantable_permutation(h->dsp.idct_permutation,
  668. h->cdsp.idct_perm);
  669. ff_init_scantable(h->dsp.idct_permutation, &h->scantable, ff_zigzag_direct);
  670. h->avctx = avctx;
  671. avctx->pix_fmt= AV_PIX_FMT_YUV420P;
  672. h->cur.f = av_frame_alloc();
  673. h->DPB[0].f = av_frame_alloc();
  674. h->DPB[1].f = av_frame_alloc();
  675. if (!h->cur.f || !h->DPB[0].f || !h->DPB[1].f) {
  676. ff_cavs_end(avctx);
  677. return AVERROR(ENOMEM);
  678. }
  679. h->luma_scan[0] = 0;
  680. h->luma_scan[1] = 8;
  681. h->intra_pred_l[ INTRA_L_VERT] = intra_pred_vert;
  682. h->intra_pred_l[ INTRA_L_HORIZ] = intra_pred_horiz;
  683. h->intra_pred_l[ INTRA_L_LP] = intra_pred_lp;
  684. h->intra_pred_l[ INTRA_L_DOWN_LEFT] = intra_pred_down_left;
  685. h->intra_pred_l[INTRA_L_DOWN_RIGHT] = intra_pred_down_right;
  686. h->intra_pred_l[ INTRA_L_LP_LEFT] = intra_pred_lp_left;
  687. h->intra_pred_l[ INTRA_L_LP_TOP] = intra_pred_lp_top;
  688. h->intra_pred_l[ INTRA_L_DC_128] = intra_pred_dc_128;
  689. h->intra_pred_c[ INTRA_C_LP] = intra_pred_lp;
  690. h->intra_pred_c[ INTRA_C_HORIZ] = intra_pred_horiz;
  691. h->intra_pred_c[ INTRA_C_VERT] = intra_pred_vert;
  692. h->intra_pred_c[ INTRA_C_PLANE] = intra_pred_plane;
  693. h->intra_pred_c[ INTRA_C_LP_LEFT] = intra_pred_lp_left;
  694. h->intra_pred_c[ INTRA_C_LP_TOP] = intra_pred_lp_top;
  695. h->intra_pred_c[ INTRA_C_DC_128] = intra_pred_dc_128;
  696. h->mv[ 7] = un_mv;
  697. h->mv[19] = un_mv;
  698. return 0;
  699. }
  700. av_cold int ff_cavs_end(AVCodecContext *avctx) {
  701. AVSContext *h = avctx->priv_data;
  702. av_frame_free(&h->cur.f);
  703. av_frame_free(&h->DPB[0].f);
  704. av_frame_free(&h->DPB[1].f);
  705. av_free(h->top_qp);
  706. av_free(h->top_mv[0]);
  707. av_free(h->top_mv[1]);
  708. av_free(h->top_pred_Y);
  709. av_free(h->top_border_y);
  710. av_free(h->top_border_u);
  711. av_free(h->top_border_v);
  712. av_free(h->col_mv);
  713. av_free(h->col_type_base);
  714. av_free(h->block);
  715. av_freep(&h->edge_emu_buffer);
  716. return 0;
  717. }