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.

354 lines
15KB

  1. /*
  2. * VC-1 and WMV3 decoder
  3. * Copyright (c) 2011 Mashiat Sarker Shakkhar
  4. * Copyright (c) 2006-2007 Konstantin Shishkov
  5. * Partly based on vc9.c (c) 2005 Anonymous, Alex Beregszaszi, Michael Niedermayer
  6. *
  7. * This file is part of Libav.
  8. *
  9. * Libav is free software; you can redistribute it and/or
  10. * modify it under the terms of the GNU Lesser General Public
  11. * License as published by the Free Software Foundation; either
  12. * version 2.1 of the License, or (at your option) any later version.
  13. *
  14. * Libav is distributed in the hope that it will be useful,
  15. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  16. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  17. * Lesser General Public License for more details.
  18. *
  19. * You should have received a copy of the GNU Lesser General Public
  20. * License along with Libav; if not, write to the Free Software
  21. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  22. */
  23. /**
  24. * @file
  25. * VC-1 and WMV3 loopfilter
  26. */
  27. #include "avcodec.h"
  28. #include "mpegvideo.h"
  29. #include "vc1.h"
  30. #include "vc1dsp.h"
  31. void ff_vc1_loop_filter_iblk(VC1Context *v, int pq)
  32. {
  33. MpegEncContext *s = &v->s;
  34. int j;
  35. if (!s->first_slice_line) {
  36. v->vc1dsp.vc1_v_loop_filter16(s->dest[0], s->linesize, pq);
  37. if (s->mb_x)
  38. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize, s->linesize, pq);
  39. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize + 8, s->linesize, pq);
  40. for (j = 0; j < 2; j++) {
  41. v->vc1dsp.vc1_v_loop_filter8(s->dest[j + 1], s->uvlinesize, pq);
  42. if (s->mb_x)
  43. v->vc1dsp.vc1_h_loop_filter8(s->dest[j + 1] - 8 * s->uvlinesize, s->uvlinesize, pq);
  44. }
  45. }
  46. v->vc1dsp.vc1_v_loop_filter16(s->dest[0] + 8 * s->linesize, s->linesize, pq);
  47. if (s->mb_y == s->end_mb_y - 1) {
  48. if (s->mb_x) {
  49. v->vc1dsp.vc1_h_loop_filter16(s->dest[0], s->linesize, pq);
  50. v->vc1dsp.vc1_h_loop_filter8(s->dest[1], s->uvlinesize, pq);
  51. v->vc1dsp.vc1_h_loop_filter8(s->dest[2], s->uvlinesize, pq);
  52. }
  53. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] + 8, s->linesize, pq);
  54. }
  55. }
  56. void ff_vc1_loop_filter_iblk_delayed(VC1Context *v, int pq)
  57. {
  58. MpegEncContext *s = &v->s;
  59. int j;
  60. /* The loopfilter runs 1 row and 1 column behind the overlap filter, which
  61. * means it runs two rows/cols behind the decoding loop. */
  62. if (!s->first_slice_line) {
  63. if (s->mb_x) {
  64. if (s->mb_y >= s->start_mb_y + 2) {
  65. v->vc1dsp.vc1_v_loop_filter16(s->dest[0] - 16 * s->linesize - 16, s->linesize, pq);
  66. if (s->mb_x >= 2)
  67. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 32 * s->linesize - 16, s->linesize, pq);
  68. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 32 * s->linesize - 8, s->linesize, pq);
  69. for (j = 0; j < 2; j++) {
  70. v->vc1dsp.vc1_v_loop_filter8(s->dest[j + 1] - 8 * s->uvlinesize - 8, s->uvlinesize, pq);
  71. if (s->mb_x >= 2) {
  72. v->vc1dsp.vc1_h_loop_filter8(s->dest[j + 1] - 16 * s->uvlinesize - 8, s->uvlinesize, pq);
  73. }
  74. }
  75. }
  76. v->vc1dsp.vc1_v_loop_filter16(s->dest[0] - 8 * s->linesize - 16, s->linesize, pq);
  77. }
  78. if (s->mb_x == s->mb_width - 1) {
  79. if (s->mb_y >= s->start_mb_y + 2) {
  80. v->vc1dsp.vc1_v_loop_filter16(s->dest[0] - 16 * s->linesize, s->linesize, pq);
  81. if (s->mb_x)
  82. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 32 * s->linesize, s->linesize, pq);
  83. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 32 * s->linesize + 8, s->linesize, pq);
  84. for (j = 0; j < 2; j++) {
  85. v->vc1dsp.vc1_v_loop_filter8(s->dest[j + 1] - 8 * s->uvlinesize, s->uvlinesize, pq);
  86. if (s->mb_x >= 2) {
  87. v->vc1dsp.vc1_h_loop_filter8(s->dest[j + 1] - 16 * s->uvlinesize, s->uvlinesize, pq);
  88. }
  89. }
  90. }
  91. v->vc1dsp.vc1_v_loop_filter16(s->dest[0] - 8 * s->linesize, s->linesize, pq);
  92. }
  93. if (s->mb_y == s->end_mb_y) {
  94. if (s->mb_x) {
  95. if (s->mb_x >= 2)
  96. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize - 16, s->linesize, pq);
  97. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize - 8, s->linesize, pq);
  98. if (s->mb_x >= 2) {
  99. for (j = 0; j < 2; j++) {
  100. v->vc1dsp.vc1_h_loop_filter8(s->dest[j + 1] - 8 * s->uvlinesize - 8, s->uvlinesize, pq);
  101. }
  102. }
  103. }
  104. if (s->mb_x == s->mb_width - 1) {
  105. if (s->mb_x)
  106. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize, s->linesize, pq);
  107. v->vc1dsp.vc1_h_loop_filter16(s->dest[0] - 16 * s->linesize + 8, s->linesize, pq);
  108. if (s->mb_x) {
  109. for (j = 0; j < 2; j++) {
  110. v->vc1dsp.vc1_h_loop_filter8(s->dest[j + 1] - 8 * s->uvlinesize, s->uvlinesize, pq);
  111. }
  112. }
  113. }
  114. }
  115. }
  116. }
  117. void ff_vc1_smooth_overlap_filter_iblk(VC1Context *v)
  118. {
  119. MpegEncContext *s = &v->s;
  120. int mb_pos;
  121. if (v->condover == CONDOVER_NONE)
  122. return;
  123. mb_pos = s->mb_x + s->mb_y * s->mb_stride;
  124. /* Within a MB, the horizontal overlap always runs before the vertical.
  125. * To accomplish that, we run the H on left and internal borders of the
  126. * currently decoded MB. Then, we wait for the next overlap iteration
  127. * to do H overlap on the right edge of this MB, before moving over and
  128. * running the V overlap. Therefore, the V overlap makes us trail by one
  129. * MB col and the H overlap filter makes us trail by one MB row. This
  130. * is reflected in the time at which we run the put_pixels loop. */
  131. if (v->condover == CONDOVER_ALL || v->pq >= 9 || v->over_flags_plane[mb_pos]) {
  132. if (s->mb_x && (v->condover == CONDOVER_ALL || v->pq >= 9 ||
  133. v->over_flags_plane[mb_pos - 1])) {
  134. v->vc1dsp.vc1_h_s_overlap(v->block[v->left_blk_idx][1],
  135. v->block[v->cur_blk_idx][0]);
  136. v->vc1dsp.vc1_h_s_overlap(v->block[v->left_blk_idx][3],
  137. v->block[v->cur_blk_idx][2]);
  138. if (!(s->avctx->flags & AV_CODEC_FLAG_GRAY)) {
  139. v->vc1dsp.vc1_h_s_overlap(v->block[v->left_blk_idx][4],
  140. v->block[v->cur_blk_idx][4]);
  141. v->vc1dsp.vc1_h_s_overlap(v->block[v->left_blk_idx][5],
  142. v->block[v->cur_blk_idx][5]);
  143. }
  144. }
  145. v->vc1dsp.vc1_h_s_overlap(v->block[v->cur_blk_idx][0],
  146. v->block[v->cur_blk_idx][1]);
  147. v->vc1dsp.vc1_h_s_overlap(v->block[v->cur_blk_idx][2],
  148. v->block[v->cur_blk_idx][3]);
  149. if (s->mb_x == s->mb_width - 1) {
  150. if (!s->first_slice_line && (v->condover == CONDOVER_ALL || v->pq >= 9 ||
  151. v->over_flags_plane[mb_pos - s->mb_stride])) {
  152. v->vc1dsp.vc1_v_s_overlap(v->block[v->top_blk_idx][2],
  153. v->block[v->cur_blk_idx][0]);
  154. v->vc1dsp.vc1_v_s_overlap(v->block[v->top_blk_idx][3],
  155. v->block[v->cur_blk_idx][1]);
  156. if (!(s->avctx->flags & AV_CODEC_FLAG_GRAY)) {
  157. v->vc1dsp.vc1_v_s_overlap(v->block[v->top_blk_idx][4],
  158. v->block[v->cur_blk_idx][4]);
  159. v->vc1dsp.vc1_v_s_overlap(v->block[v->top_blk_idx][5],
  160. v->block[v->cur_blk_idx][5]);
  161. }
  162. }
  163. v->vc1dsp.vc1_v_s_overlap(v->block[v->cur_blk_idx][0],
  164. v->block[v->cur_blk_idx][2]);
  165. v->vc1dsp.vc1_v_s_overlap(v->block[v->cur_blk_idx][1],
  166. v->block[v->cur_blk_idx][3]);
  167. }
  168. }
  169. if (s->mb_x && (v->condover == CONDOVER_ALL || v->over_flags_plane[mb_pos - 1])) {
  170. if (!s->first_slice_line && (v->condover == CONDOVER_ALL || v->pq >= 9 ||
  171. v->over_flags_plane[mb_pos - s->mb_stride - 1])) {
  172. v->vc1dsp.vc1_v_s_overlap(v->block[v->topleft_blk_idx][2],
  173. v->block[v->left_blk_idx][0]);
  174. v->vc1dsp.vc1_v_s_overlap(v->block[v->topleft_blk_idx][3],
  175. v->block[v->left_blk_idx][1]);
  176. if (!(s->avctx->flags & AV_CODEC_FLAG_GRAY)) {
  177. v->vc1dsp.vc1_v_s_overlap(v->block[v->topleft_blk_idx][4],
  178. v->block[v->left_blk_idx][4]);
  179. v->vc1dsp.vc1_v_s_overlap(v->block[v->topleft_blk_idx][5],
  180. v->block[v->left_blk_idx][5]);
  181. }
  182. }
  183. v->vc1dsp.vc1_v_s_overlap(v->block[v->left_blk_idx][0],
  184. v->block[v->left_blk_idx][2]);
  185. v->vc1dsp.vc1_v_s_overlap(v->block[v->left_blk_idx][1],
  186. v->block[v->left_blk_idx][3]);
  187. }
  188. }
  189. static av_always_inline void vc1_apply_p_v_loop_filter(VC1Context *v, int block_num)
  190. {
  191. MpegEncContext *s = &v->s;
  192. int mb_cbp = v->cbp[s->mb_x - s->mb_stride],
  193. block_cbp = mb_cbp >> (block_num * 4), bottom_cbp,
  194. mb_is_intra = v->is_intra[s->mb_x - s->mb_stride],
  195. block_is_intra = mb_is_intra >> (block_num * 4), bottom_is_intra;
  196. int idx, linesize = block_num > 3 ? s->uvlinesize : s->linesize, ttblk;
  197. uint8_t *dst;
  198. if (block_num > 3) {
  199. dst = s->dest[block_num - 3];
  200. } else {
  201. dst = s->dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 8) * linesize;
  202. }
  203. if (s->mb_y != s->end_mb_y || block_num < 2) {
  204. int16_t (*mv)[2];
  205. int mv_stride;
  206. if (block_num > 3) {
  207. bottom_cbp = v->cbp[s->mb_x] >> (block_num * 4);
  208. bottom_is_intra = v->is_intra[s->mb_x] >> block_num;
  209. mv = &v->luma_mv[s->mb_x - s->mb_stride];
  210. mv_stride = s->mb_stride;
  211. } else {
  212. bottom_cbp = (block_num < 2) ? (mb_cbp >> ((block_num + 2) * 4))
  213. : (v->cbp[s->mb_x] >> ((block_num - 2) * 4));
  214. bottom_is_intra = (block_num < 2) ? (mb_is_intra >> (block_num + 2))
  215. : (v->is_intra[s->mb_x] >> (block_num - 2));
  216. mv_stride = s->b8_stride;
  217. mv = &s->current_picture.motion_val[0][s->block_index[block_num] - 2 * mv_stride];
  218. }
  219. if (bottom_is_intra & 1 || block_is_intra & 1 ||
  220. mv[0][0] != mv[mv_stride][0] || mv[0][1] != mv[mv_stride][1]) {
  221. v->vc1dsp.vc1_v_loop_filter8(dst, linesize, v->pq);
  222. } else {
  223. idx = ((bottom_cbp >> 2) | block_cbp) & 3;
  224. if (idx == 3) {
  225. v->vc1dsp.vc1_v_loop_filter8(dst, linesize, v->pq);
  226. } else if (idx) {
  227. if (idx == 1)
  228. v->vc1dsp.vc1_v_loop_filter4(dst + 4, linesize, v->pq);
  229. else
  230. v->vc1dsp.vc1_v_loop_filter4(dst, linesize, v->pq);
  231. }
  232. }
  233. }
  234. dst -= 4 * linesize;
  235. ttblk = (v->ttblk[s->mb_x - s->mb_stride] >> (block_num * 4)) & 0xF;
  236. if (ttblk == TT_4X4 || ttblk == TT_8X4) {
  237. idx = (block_cbp | (block_cbp >> 2)) & 3;
  238. if (idx == 3) {
  239. v->vc1dsp.vc1_v_loop_filter8(dst, linesize, v->pq);
  240. } else if (idx) {
  241. if (idx == 1)
  242. v->vc1dsp.vc1_v_loop_filter4(dst + 4, linesize, v->pq);
  243. else
  244. v->vc1dsp.vc1_v_loop_filter4(dst, linesize, v->pq);
  245. }
  246. }
  247. }
  248. static av_always_inline void vc1_apply_p_h_loop_filter(VC1Context *v, int block_num)
  249. {
  250. MpegEncContext *s = &v->s;
  251. int mb_cbp = v->cbp[s->mb_x - 1 - s->mb_stride],
  252. block_cbp = mb_cbp >> (block_num * 4), right_cbp,
  253. mb_is_intra = v->is_intra[s->mb_x - 1 - s->mb_stride],
  254. block_is_intra = mb_is_intra >> block_num, right_is_intra;
  255. int idx, linesize = block_num > 3 ? s->uvlinesize : s->linesize, ttblk;
  256. uint8_t *dst;
  257. if (block_num > 3) {
  258. dst = s->dest[block_num - 3] - 8 * linesize;
  259. } else {
  260. dst = s->dest[0] + (block_num & 1) * 8 + ((block_num & 2) * 4 - 16) * linesize - 8;
  261. }
  262. if (s->mb_x != s->mb_width || !(block_num & 5)) {
  263. int16_t (*mv)[2];
  264. if (block_num > 3) {
  265. right_cbp = v->cbp[s->mb_x - s->mb_stride] >> (block_num * 4);
  266. right_is_intra = v->is_intra[s->mb_x - s->mb_stride] >> block_num;
  267. mv = &v->luma_mv[s->mb_x - s->mb_stride - 1];
  268. } else {
  269. right_cbp = (block_num & 1) ? (v->cbp[s->mb_x - s->mb_stride] >> ((block_num - 1) * 4))
  270. : (mb_cbp >> ((block_num + 1) * 4));
  271. right_is_intra = (block_num & 1) ? (v->is_intra[s->mb_x - s->mb_stride] >> (block_num - 1))
  272. : (mb_is_intra >> (block_num + 1));
  273. mv = &s->current_picture.motion_val[0][s->block_index[block_num] - s->b8_stride * 2 - 2];
  274. }
  275. if (block_is_intra & 1 || right_is_intra & 1 || mv[0][0] != mv[1][0] || mv[0][1] != mv[1][1]) {
  276. v->vc1dsp.vc1_h_loop_filter8(dst, linesize, v->pq);
  277. } else {
  278. idx = ((right_cbp >> 1) | block_cbp) & 5; // FIXME check
  279. if (idx == 5) {
  280. v->vc1dsp.vc1_h_loop_filter8(dst, linesize, v->pq);
  281. } else if (idx) {
  282. if (idx == 1)
  283. v->vc1dsp.vc1_h_loop_filter4(dst + 4 * linesize, linesize, v->pq);
  284. else
  285. v->vc1dsp.vc1_h_loop_filter4(dst, linesize, v->pq);
  286. }
  287. }
  288. }
  289. dst -= 4;
  290. ttblk = (v->ttblk[s->mb_x - s->mb_stride - 1] >> (block_num * 4)) & 0xf;
  291. if (ttblk == TT_4X4 || ttblk == TT_4X8) {
  292. idx = (block_cbp | (block_cbp >> 1)) & 5;
  293. if (idx == 5) {
  294. v->vc1dsp.vc1_h_loop_filter8(dst, linesize, v->pq);
  295. } else if (idx) {
  296. if (idx == 1)
  297. v->vc1dsp.vc1_h_loop_filter4(dst + linesize * 4, linesize, v->pq);
  298. else
  299. v->vc1dsp.vc1_h_loop_filter4(dst, linesize, v->pq);
  300. }
  301. }
  302. }
  303. void ff_vc1_apply_p_loop_filter(VC1Context *v)
  304. {
  305. MpegEncContext *s = &v->s;
  306. int i;
  307. for (i = 0; i < 6; i++) {
  308. vc1_apply_p_v_loop_filter(v, i);
  309. }
  310. /* V always precedes H, therefore we run H one MB before V;
  311. * at the end of a row, we catch up to complete the row */
  312. if (s->mb_x) {
  313. for (i = 0; i < 6; i++) {
  314. vc1_apply_p_h_loop_filter(v, i);
  315. }
  316. if (s->mb_x == s->mb_width - 1) {
  317. s->mb_x++;
  318. ff_update_block_index(s);
  319. for (i = 0; i < 6; i++) {
  320. vc1_apply_p_h_loop_filter(v, i);
  321. }
  322. }
  323. }
  324. }