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.

859 lines
26KB

  1. /*
  2. * Microsoft Screen 2 (aka Windows Media Video V9 Screen) decoder
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with FFmpeg; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. /**
  21. * @file
  22. * Microsoft Screen 2 (aka Windows Media Video V9 Screen) decoder
  23. */
  24. #include "libavutil/avassert.h"
  25. #include "error_resilience.h"
  26. #include "internal.h"
  27. #include "mpeg_er.h"
  28. #include "msmpeg4.h"
  29. #include "msmpeg4data.h"
  30. #include "qpeldsp.h"
  31. #include "vc1.h"
  32. #include "mss12.h"
  33. #include "mss2dsp.h"
  34. typedef struct MSS2Context {
  35. VC1Context v;
  36. int split_position;
  37. AVFrame *last_pic;
  38. MSS12Context c;
  39. MSS2DSPContext dsp;
  40. QpelDSPContext qdsp;
  41. SliceContext sc[2];
  42. } MSS2Context;
  43. static void arith2_normalise(ArithCoder *c)
  44. {
  45. while ((c->high >> 15) - (c->low >> 15) < 2) {
  46. if ((c->low ^ c->high) & 0x10000) {
  47. c->high ^= 0x8000;
  48. c->value ^= 0x8000;
  49. c->low ^= 0x8000;
  50. }
  51. c->high = (uint16_t)c->high << 8 | 0xFF;
  52. c->value = (uint16_t)c->value << 8 | bytestream2_get_byte(c->gbc.gB);
  53. c->low = (uint16_t)c->low << 8;
  54. }
  55. }
  56. ARITH_GET_BIT(arith2)
  57. /* L. Stuiver and A. Moffat: "Piecewise Integer Mapping for Arithmetic Coding."
  58. * In Proc. 8th Data Compression Conference (DCC '98), pp. 3-12, Mar. 1998 */
  59. static int arith2_get_scaled_value(int value, int n, int range)
  60. {
  61. int split = (n << 1) - range;
  62. if (value > split)
  63. return split + (value - split >> 1);
  64. else
  65. return value;
  66. }
  67. static void arith2_rescale_interval(ArithCoder *c, int range,
  68. int low, int high, int n)
  69. {
  70. int split = (n << 1) - range;
  71. if (high > split)
  72. c->high = split + (high - split << 1);
  73. else
  74. c->high = high;
  75. c->high += c->low - 1;
  76. if (low > split)
  77. c->low += split + (low - split << 1);
  78. else
  79. c->low += low;
  80. }
  81. static int arith2_get_number(ArithCoder *c, int n)
  82. {
  83. int range = c->high - c->low + 1;
  84. int scale = av_log2(range) - av_log2(n);
  85. int val;
  86. if (n << scale > range)
  87. scale--;
  88. n <<= scale;
  89. val = arith2_get_scaled_value(c->value - c->low, n, range) >> scale;
  90. arith2_rescale_interval(c, range, val << scale, (val + 1) << scale, n);
  91. arith2_normalise(c);
  92. return val;
  93. }
  94. static int arith2_get_prob(ArithCoder *c, int16_t *probs)
  95. {
  96. int range = c->high - c->low + 1, n = *probs;
  97. int scale = av_log2(range) - av_log2(n);
  98. int i = 0, val;
  99. if (n << scale > range)
  100. scale--;
  101. n <<= scale;
  102. val = arith2_get_scaled_value(c->value - c->low, n, range) >> scale;
  103. while (probs[++i] > val) ;
  104. arith2_rescale_interval(c, range,
  105. probs[i] << scale, probs[i - 1] << scale, n);
  106. return i;
  107. }
  108. ARITH_GET_MODEL_SYM(arith2)
  109. static int arith2_get_consumed_bytes(ArithCoder *c)
  110. {
  111. int diff = (c->high >> 16) - (c->low >> 16);
  112. int bp = bytestream2_tell(c->gbc.gB) - 3 << 3;
  113. int bits = 1;
  114. while (!(diff & 0x80)) {
  115. bits++;
  116. diff <<= 1;
  117. }
  118. return (bits + bp + 7 >> 3) + ((c->low >> 16) + 1 == c->high >> 16);
  119. }
  120. static void arith2_init(ArithCoder *c, GetByteContext *gB)
  121. {
  122. c->low = 0;
  123. c->high = 0xFFFFFF;
  124. c->value = bytestream2_get_be24(gB);
  125. c->gbc.gB = gB;
  126. c->get_model_sym = arith2_get_model_sym;
  127. c->get_number = arith2_get_number;
  128. }
  129. static int decode_pal_v2(MSS12Context *ctx, const uint8_t *buf, int buf_size)
  130. {
  131. int i, ncol;
  132. uint32_t *pal = ctx->pal + 256 - ctx->free_colours;
  133. if (!ctx->free_colours)
  134. return 0;
  135. ncol = *buf++;
  136. if (ncol > ctx->free_colours || buf_size < 2 + ncol * 3)
  137. return AVERROR_INVALIDDATA;
  138. for (i = 0; i < ncol; i++)
  139. *pal++ = AV_RB24(buf + 3 * i);
  140. return 1 + ncol * 3;
  141. }
  142. static int decode_555(GetByteContext *gB, uint16_t *dst, int stride,
  143. int keyframe, int w, int h)
  144. {
  145. int last_symbol = 0, repeat = 0, prev_avail = 0;
  146. if (!keyframe) {
  147. int x, y, endx, endy, t;
  148. #define READ_PAIR(a, b) \
  149. a = bytestream2_get_byte(gB) << 4; \
  150. t = bytestream2_get_byte(gB); \
  151. a |= t >> 4; \
  152. b = (t & 0xF) << 8; \
  153. b |= bytestream2_get_byte(gB); \
  154. READ_PAIR(x, endx)
  155. READ_PAIR(y, endy)
  156. if (endx >= w || endy >= h || x > endx || y > endy)
  157. return AVERROR_INVALIDDATA;
  158. dst += x + stride * y;
  159. w = endx - x + 1;
  160. h = endy - y + 1;
  161. if (y)
  162. prev_avail = 1;
  163. }
  164. do {
  165. uint16_t *p = dst;
  166. do {
  167. if (repeat-- < 1) {
  168. int b = bytestream2_get_byte(gB);
  169. if (b < 128)
  170. last_symbol = b << 8 | bytestream2_get_byte(gB);
  171. else if (b > 129) {
  172. repeat = 0;
  173. while (b-- > 130) {
  174. if (repeat >= (INT_MAX >> 8) - 1) {
  175. av_log(NULL, AV_LOG_ERROR, "repeat overflow\n");
  176. return AVERROR_INVALIDDATA;
  177. }
  178. repeat = (repeat << 8) + bytestream2_get_byte(gB) + 1;
  179. }
  180. if (last_symbol == -2) {
  181. int skip = FFMIN((unsigned)repeat, dst + w - p);
  182. repeat -= skip;
  183. p += skip;
  184. }
  185. } else
  186. last_symbol = 127 - b;
  187. }
  188. if (last_symbol >= 0)
  189. *p = last_symbol;
  190. else if (last_symbol == -1 && prev_avail)
  191. *p = *(p - stride);
  192. } while (++p < dst + w);
  193. dst += stride;
  194. prev_avail = 1;
  195. } while (--h);
  196. return 0;
  197. }
  198. static int decode_rle(GetBitContext *gb, uint8_t *pal_dst, int pal_stride,
  199. uint8_t *rgb_dst, int rgb_stride, uint32_t *pal,
  200. int keyframe, int kf_slipt, int slice, int w, int h)
  201. {
  202. uint8_t bits[270] = { 0 };
  203. uint32_t codes[270];
  204. VLC vlc;
  205. int current_length = 0, read_codes = 0, next_code = 0, current_codes = 0;
  206. int remaining_codes, surplus_codes, i;
  207. const int alphabet_size = 270 - keyframe;
  208. int last_symbol = 0, repeat = 0, prev_avail = 0;
  209. if (!keyframe) {
  210. int x, y, clipw, cliph;
  211. x = get_bits(gb, 12);
  212. y = get_bits(gb, 12);
  213. clipw = get_bits(gb, 12) + 1;
  214. cliph = get_bits(gb, 12) + 1;
  215. if (x + clipw > w || y + cliph > h)
  216. return AVERROR_INVALIDDATA;
  217. pal_dst += pal_stride * y + x;
  218. rgb_dst += rgb_stride * y + x * 3;
  219. w = clipw;
  220. h = cliph;
  221. if (y)
  222. prev_avail = 1;
  223. } else {
  224. if (slice > 0) {
  225. pal_dst += pal_stride * kf_slipt;
  226. rgb_dst += rgb_stride * kf_slipt;
  227. prev_avail = 1;
  228. h -= kf_slipt;
  229. } else
  230. h = kf_slipt;
  231. }
  232. /* read explicit codes */
  233. do {
  234. while (current_codes--) {
  235. int symbol = get_bits(gb, 8);
  236. if (symbol >= 204 - keyframe)
  237. symbol += 14 - keyframe;
  238. else if (symbol > 189)
  239. symbol = get_bits1(gb) + (symbol << 1) - 190;
  240. if (bits[symbol])
  241. return AVERROR_INVALIDDATA;
  242. bits[symbol] = current_length;
  243. codes[symbol] = next_code++;
  244. read_codes++;
  245. }
  246. current_length++;
  247. next_code <<= 1;
  248. remaining_codes = (1 << current_length) - next_code;
  249. current_codes = get_bits(gb, av_ceil_log2(remaining_codes + 1));
  250. if (current_length > 22 || current_codes > remaining_codes)
  251. return AVERROR_INVALIDDATA;
  252. } while (current_codes != remaining_codes);
  253. remaining_codes = alphabet_size - read_codes;
  254. /* determine the minimum length to fit the rest of the alphabet */
  255. while ((surplus_codes = (2 << current_length) -
  256. (next_code << 1) - remaining_codes) < 0) {
  257. current_length++;
  258. next_code <<= 1;
  259. }
  260. /* add the rest of the symbols lexicographically */
  261. for (i = 0; i < alphabet_size; i++)
  262. if (!bits[i]) {
  263. if (surplus_codes-- == 0) {
  264. current_length++;
  265. next_code <<= 1;
  266. }
  267. bits[i] = current_length;
  268. codes[i] = next_code++;
  269. }
  270. if (next_code != 1 << current_length)
  271. return AVERROR_INVALIDDATA;
  272. if ((i = init_vlc(&vlc, 9, alphabet_size, bits, 1, 1, codes, 4, 4, 0)) < 0)
  273. return i;
  274. /* frame decode */
  275. do {
  276. uint8_t *pp = pal_dst;
  277. uint8_t *rp = rgb_dst;
  278. do {
  279. if (repeat-- < 1) {
  280. int b = get_vlc2(gb, vlc.table, 9, 3);
  281. if (b < 256)
  282. last_symbol = b;
  283. else if (b < 268) {
  284. b -= 256;
  285. if (b == 11)
  286. b = get_bits(gb, 4) + 10;
  287. if (!b)
  288. repeat = 0;
  289. else
  290. repeat = get_bits(gb, b);
  291. repeat += (1 << b) - 1;
  292. if (last_symbol == -2) {
  293. int skip = FFMIN(repeat, pal_dst + w - pp);
  294. repeat -= skip;
  295. pp += skip;
  296. rp += skip * 3;
  297. }
  298. } else
  299. last_symbol = 267 - b;
  300. }
  301. if (last_symbol >= 0) {
  302. *pp = last_symbol;
  303. AV_WB24(rp, pal[last_symbol]);
  304. } else if (last_symbol == -1 && prev_avail) {
  305. *pp = *(pp - pal_stride);
  306. memcpy(rp, rp - rgb_stride, 3);
  307. }
  308. rp += 3;
  309. } while (++pp < pal_dst + w);
  310. pal_dst += pal_stride;
  311. rgb_dst += rgb_stride;
  312. prev_avail = 1;
  313. } while (--h);
  314. ff_free_vlc(&vlc);
  315. return 0;
  316. }
  317. static int decode_wmv9(AVCodecContext *avctx, const uint8_t *buf, int buf_size,
  318. int x, int y, int w, int h, int wmv9_mask)
  319. {
  320. MSS2Context *ctx = avctx->priv_data;
  321. MSS12Context *c = &ctx->c;
  322. VC1Context *v = avctx->priv_data;
  323. MpegEncContext *s = &v->s;
  324. AVFrame *f;
  325. int ret;
  326. ff_mpeg_flush(avctx);
  327. if ((ret = init_get_bits8(&s->gb, buf, buf_size)) < 0)
  328. return ret;
  329. s->loop_filter = avctx->skip_loop_filter < AVDISCARD_ALL;
  330. if (ff_vc1_parse_frame_header(v, &s->gb) < 0) {
  331. av_log(v->s.avctx, AV_LOG_ERROR, "header error\n");
  332. return AVERROR_INVALIDDATA;
  333. }
  334. if (s->pict_type != AV_PICTURE_TYPE_I) {
  335. av_log(v->s.avctx, AV_LOG_ERROR, "expected I-frame\n");
  336. return AVERROR_INVALIDDATA;
  337. }
  338. avctx->pix_fmt = AV_PIX_FMT_YUV420P;
  339. if ((ret = ff_mpv_frame_start(s, avctx)) < 0) {
  340. av_log(v->s.avctx, AV_LOG_ERROR, "ff_mpv_frame_start error\n");
  341. avctx->pix_fmt = AV_PIX_FMT_RGB24;
  342. return ret;
  343. }
  344. ff_mpeg_er_frame_start(s);
  345. v->bits = buf_size * 8;
  346. v->end_mb_x = (w + 15) >> 4;
  347. s->end_mb_y = (h + 15) >> 4;
  348. if (v->respic & 1)
  349. v->end_mb_x = v->end_mb_x + 1 >> 1;
  350. if (v->respic & 2)
  351. s->end_mb_y = s->end_mb_y + 1 >> 1;
  352. ff_vc1_decode_blocks(v);
  353. ff_er_frame_end(&s->er);
  354. ff_mpv_frame_end(s);
  355. f = s->current_picture.f;
  356. if (v->respic == 3) {
  357. ctx->dsp.upsample_plane(f->data[0], f->linesize[0], w, h);
  358. ctx->dsp.upsample_plane(f->data[1], f->linesize[1], w+1 >> 1, h+1 >> 1);
  359. ctx->dsp.upsample_plane(f->data[2], f->linesize[2], w+1 >> 1, h+1 >> 1);
  360. } else if (v->respic)
  361. avpriv_request_sample(v->s.avctx,
  362. "Asymmetric WMV9 rectangle subsampling");
  363. av_assert0(f->linesize[1] == f->linesize[2]);
  364. if (wmv9_mask != -1)
  365. ctx->dsp.mss2_blit_wmv9_masked(c->rgb_pic + y * c->rgb_stride + x * 3,
  366. c->rgb_stride, wmv9_mask,
  367. c->pal_pic + y * c->pal_stride + x,
  368. c->pal_stride,
  369. f->data[0], f->linesize[0],
  370. f->data[1], f->data[2], f->linesize[1],
  371. w, h);
  372. else
  373. ctx->dsp.mss2_blit_wmv9(c->rgb_pic + y * c->rgb_stride + x * 3,
  374. c->rgb_stride,
  375. f->data[0], f->linesize[0],
  376. f->data[1], f->data[2], f->linesize[1],
  377. w, h);
  378. avctx->pix_fmt = AV_PIX_FMT_RGB24;
  379. return 0;
  380. }
  381. typedef struct Rectangle {
  382. int coded, x, y, w, h;
  383. } Rectangle;
  384. #define MAX_WMV9_RECTANGLES 20
  385. #define ARITH2_PADDING 2
  386. static int mss2_decode_frame(AVCodecContext *avctx, void *data, int *got_frame,
  387. AVPacket *avpkt)
  388. {
  389. const uint8_t *buf = avpkt->data;
  390. int buf_size = avpkt->size;
  391. MSS2Context *ctx = avctx->priv_data;
  392. MSS12Context *c = &ctx->c;
  393. AVFrame *frame = data;
  394. GetBitContext gb;
  395. GetByteContext gB;
  396. ArithCoder acoder;
  397. int keyframe, has_wmv9, has_mv, is_rle, is_555, ret;
  398. Rectangle wmv9rects[MAX_WMV9_RECTANGLES], *r;
  399. int used_rects = 0, i, implicit_rect = 0, av_uninit(wmv9_mask);
  400. av_assert0(AV_INPUT_BUFFER_PADDING_SIZE >=
  401. ARITH2_PADDING + (MIN_CACHE_BITS + 7) / 8);
  402. if ((ret = init_get_bits8(&gb, buf, buf_size)) < 0)
  403. return ret;
  404. if (keyframe = get_bits1(&gb))
  405. skip_bits(&gb, 7);
  406. has_wmv9 = get_bits1(&gb);
  407. has_mv = keyframe ? 0 : get_bits1(&gb);
  408. is_rle = get_bits1(&gb);
  409. is_555 = is_rle && get_bits1(&gb);
  410. if (c->slice_split > 0)
  411. ctx->split_position = c->slice_split;
  412. else if (c->slice_split < 0) {
  413. if (get_bits1(&gb)) {
  414. if (get_bits1(&gb)) {
  415. if (get_bits1(&gb))
  416. ctx->split_position = get_bits(&gb, 16);
  417. else
  418. ctx->split_position = get_bits(&gb, 12);
  419. } else
  420. ctx->split_position = get_bits(&gb, 8) << 4;
  421. } else {
  422. if (keyframe)
  423. ctx->split_position = avctx->height / 2;
  424. }
  425. } else
  426. ctx->split_position = avctx->height;
  427. if (c->slice_split && (ctx->split_position < 1 - is_555 ||
  428. ctx->split_position > avctx->height - 1))
  429. return AVERROR_INVALIDDATA;
  430. align_get_bits(&gb);
  431. buf += get_bits_count(&gb) >> 3;
  432. buf_size -= get_bits_count(&gb) >> 3;
  433. if (buf_size < 1)
  434. return AVERROR_INVALIDDATA;
  435. if (is_555 && (has_wmv9 || has_mv || c->slice_split && ctx->split_position))
  436. return AVERROR_INVALIDDATA;
  437. avctx->pix_fmt = is_555 ? AV_PIX_FMT_RGB555 : AV_PIX_FMT_RGB24;
  438. if (ctx->last_pic->format != avctx->pix_fmt)
  439. av_frame_unref(ctx->last_pic);
  440. if (has_wmv9) {
  441. bytestream2_init(&gB, buf, buf_size + ARITH2_PADDING);
  442. arith2_init(&acoder, &gB);
  443. implicit_rect = !arith2_get_bit(&acoder);
  444. while (arith2_get_bit(&acoder)) {
  445. if (used_rects == MAX_WMV9_RECTANGLES)
  446. return AVERROR_INVALIDDATA;
  447. r = &wmv9rects[used_rects];
  448. if (!used_rects)
  449. r->x = arith2_get_number(&acoder, avctx->width);
  450. else
  451. r->x = arith2_get_number(&acoder, avctx->width -
  452. wmv9rects[used_rects - 1].x) +
  453. wmv9rects[used_rects - 1].x;
  454. r->y = arith2_get_number(&acoder, avctx->height);
  455. r->w = arith2_get_number(&acoder, avctx->width - r->x) + 1;
  456. r->h = arith2_get_number(&acoder, avctx->height - r->y) + 1;
  457. used_rects++;
  458. }
  459. if (implicit_rect && used_rects) {
  460. av_log(avctx, AV_LOG_ERROR, "implicit_rect && used_rects > 0\n");
  461. return AVERROR_INVALIDDATA;
  462. }
  463. if (implicit_rect) {
  464. wmv9rects[0].x = 0;
  465. wmv9rects[0].y = 0;
  466. wmv9rects[0].w = avctx->width;
  467. wmv9rects[0].h = avctx->height;
  468. used_rects = 1;
  469. }
  470. for (i = 0; i < used_rects; i++) {
  471. if (!implicit_rect && arith2_get_bit(&acoder)) {
  472. av_log(avctx, AV_LOG_ERROR, "Unexpected grandchildren\n");
  473. return AVERROR_INVALIDDATA;
  474. }
  475. if (!i) {
  476. wmv9_mask = arith2_get_bit(&acoder) - 1;
  477. if (!wmv9_mask)
  478. wmv9_mask = arith2_get_number(&acoder, 256);
  479. }
  480. wmv9rects[i].coded = arith2_get_number(&acoder, 2);
  481. }
  482. buf += arith2_get_consumed_bytes(&acoder);
  483. buf_size -= arith2_get_consumed_bytes(&acoder);
  484. if (buf_size < 1)
  485. return AVERROR_INVALIDDATA;
  486. }
  487. c->mvX = c->mvY = 0;
  488. if (keyframe && !is_555) {
  489. if ((i = decode_pal_v2(c, buf, buf_size)) < 0)
  490. return AVERROR_INVALIDDATA;
  491. buf += i;
  492. buf_size -= i;
  493. } else if (has_mv) {
  494. buf += 4;
  495. buf_size -= 4;
  496. if (buf_size < 1)
  497. return AVERROR_INVALIDDATA;
  498. c->mvX = AV_RB16(buf - 4) - avctx->width;
  499. c->mvY = AV_RB16(buf - 2) - avctx->height;
  500. }
  501. if (c->mvX < 0 || c->mvY < 0) {
  502. FFSWAP(uint8_t *, c->pal_pic, c->last_pal_pic);
  503. if ((ret = ff_get_buffer(avctx, frame, AV_GET_BUFFER_FLAG_REF)) < 0)
  504. return ret;
  505. if (ctx->last_pic->data[0]) {
  506. av_assert0(frame->linesize[0] == ctx->last_pic->linesize[0]);
  507. c->last_rgb_pic = ctx->last_pic->data[0] +
  508. ctx->last_pic->linesize[0] * (avctx->height - 1);
  509. } else {
  510. av_log(avctx, AV_LOG_ERROR, "Missing keyframe\n");
  511. return AVERROR_INVALIDDATA;
  512. }
  513. } else {
  514. if ((ret = ff_reget_buffer(avctx, ctx->last_pic)) < 0)
  515. return ret;
  516. if ((ret = av_frame_ref(frame, ctx->last_pic)) < 0)
  517. return ret;
  518. c->last_rgb_pic = NULL;
  519. }
  520. c->rgb_pic = frame->data[0] +
  521. frame->linesize[0] * (avctx->height - 1);
  522. c->rgb_stride = -frame->linesize[0];
  523. frame->key_frame = keyframe;
  524. frame->pict_type = keyframe ? AV_PICTURE_TYPE_I : AV_PICTURE_TYPE_P;
  525. if (is_555) {
  526. bytestream2_init(&gB, buf, buf_size);
  527. if (decode_555(&gB, (uint16_t *)c->rgb_pic, c->rgb_stride >> 1,
  528. keyframe, avctx->width, avctx->height))
  529. return AVERROR_INVALIDDATA;
  530. buf_size -= bytestream2_tell(&gB);
  531. } else {
  532. if (keyframe) {
  533. c->corrupted = 0;
  534. ff_mss12_slicecontext_reset(&ctx->sc[0]);
  535. if (c->slice_split)
  536. ff_mss12_slicecontext_reset(&ctx->sc[1]);
  537. }
  538. if (is_rle) {
  539. if ((ret = init_get_bits8(&gb, buf, buf_size)) < 0)
  540. return ret;
  541. if (ret = decode_rle(&gb, c->pal_pic, c->pal_stride,
  542. c->rgb_pic, c->rgb_stride, c->pal, keyframe,
  543. ctx->split_position, 0,
  544. avctx->width, avctx->height))
  545. return ret;
  546. align_get_bits(&gb);
  547. if (c->slice_split)
  548. if (ret = decode_rle(&gb, c->pal_pic, c->pal_stride,
  549. c->rgb_pic, c->rgb_stride, c->pal, keyframe,
  550. ctx->split_position, 1,
  551. avctx->width, avctx->height))
  552. return ret;
  553. align_get_bits(&gb);
  554. buf += get_bits_count(&gb) >> 3;
  555. buf_size -= get_bits_count(&gb) >> 3;
  556. } else if (!implicit_rect || wmv9_mask != -1) {
  557. if (c->corrupted)
  558. return AVERROR_INVALIDDATA;
  559. bytestream2_init(&gB, buf, buf_size + ARITH2_PADDING);
  560. arith2_init(&acoder, &gB);
  561. c->keyframe = keyframe;
  562. if (c->corrupted = ff_mss12_decode_rect(&ctx->sc[0], &acoder, 0, 0,
  563. avctx->width,
  564. ctx->split_position))
  565. return AVERROR_INVALIDDATA;
  566. buf += arith2_get_consumed_bytes(&acoder);
  567. buf_size -= arith2_get_consumed_bytes(&acoder);
  568. if (c->slice_split) {
  569. if (buf_size < 1)
  570. return AVERROR_INVALIDDATA;
  571. bytestream2_init(&gB, buf, buf_size + ARITH2_PADDING);
  572. arith2_init(&acoder, &gB);
  573. if (c->corrupted = ff_mss12_decode_rect(&ctx->sc[1], &acoder, 0,
  574. ctx->split_position,
  575. avctx->width,
  576. avctx->height - ctx->split_position))
  577. return AVERROR_INVALIDDATA;
  578. buf += arith2_get_consumed_bytes(&acoder);
  579. buf_size -= arith2_get_consumed_bytes(&acoder);
  580. }
  581. } else
  582. memset(c->pal_pic, 0, c->pal_stride * avctx->height);
  583. }
  584. if (has_wmv9) {
  585. for (i = 0; i < used_rects; i++) {
  586. int x = wmv9rects[i].x;
  587. int y = wmv9rects[i].y;
  588. int w = wmv9rects[i].w;
  589. int h = wmv9rects[i].h;
  590. if (wmv9rects[i].coded) {
  591. int WMV9codedFrameSize;
  592. if (buf_size < 4 || !(WMV9codedFrameSize = AV_RL24(buf)))
  593. return AVERROR_INVALIDDATA;
  594. if (ret = decode_wmv9(avctx, buf + 3, buf_size - 3,
  595. x, y, w, h, wmv9_mask))
  596. return ret;
  597. buf += WMV9codedFrameSize + 3;
  598. buf_size -= WMV9codedFrameSize + 3;
  599. } else {
  600. uint8_t *dst = c->rgb_pic + y * c->rgb_stride + x * 3;
  601. if (wmv9_mask != -1) {
  602. ctx->dsp.mss2_gray_fill_masked(dst, c->rgb_stride,
  603. wmv9_mask,
  604. c->pal_pic + y * c->pal_stride + x,
  605. c->pal_stride,
  606. w, h);
  607. } else {
  608. do {
  609. memset(dst, 0x80, w * 3);
  610. dst += c->rgb_stride;
  611. } while (--h);
  612. }
  613. }
  614. }
  615. }
  616. if (buf_size)
  617. av_log(avctx, AV_LOG_WARNING, "buffer not fully consumed\n");
  618. if (c->mvX < 0 || c->mvY < 0) {
  619. av_frame_unref(ctx->last_pic);
  620. ret = av_frame_ref(ctx->last_pic, frame);
  621. if (ret < 0)
  622. return ret;
  623. }
  624. *got_frame = 1;
  625. return avpkt->size;
  626. }
  627. static av_cold int wmv9_init(AVCodecContext *avctx)
  628. {
  629. VC1Context *v = avctx->priv_data;
  630. int ret;
  631. v->s.avctx = avctx;
  632. if ((ret = ff_vc1_init_common(v)) < 0)
  633. return ret;
  634. ff_vc1dsp_init(&v->vc1dsp);
  635. v->profile = PROFILE_MAIN;
  636. v->zz_8x4 = ff_wmv2_scantableA;
  637. v->zz_4x8 = ff_wmv2_scantableB;
  638. v->res_y411 = 0;
  639. v->res_sprite = 0;
  640. v->frmrtq_postproc = 7;
  641. v->bitrtq_postproc = 31;
  642. v->res_x8 = 0;
  643. v->multires = 0;
  644. v->res_fasttx = 1;
  645. v->fastuvmc = 0;
  646. v->extended_mv = 0;
  647. v->dquant = 1;
  648. v->vstransform = 1;
  649. v->res_transtab = 0;
  650. v->overlap = 0;
  651. v->resync_marker = 0;
  652. v->rangered = 0;
  653. v->s.max_b_frames = avctx->max_b_frames = 0;
  654. v->quantizer_mode = 0;
  655. v->finterpflag = 0;
  656. v->res_rtm_flag = 1;
  657. ff_vc1_init_transposed_scantables(v);
  658. if ((ret = ff_msmpeg4_decode_init(avctx)) < 0 ||
  659. (ret = ff_vc1_decode_init_alloc_tables(v)) < 0)
  660. return ret;
  661. /* error concealment */
  662. v->s.me.qpel_put = v->s.qdsp.put_qpel_pixels_tab;
  663. v->s.me.qpel_avg = v->s.qdsp.avg_qpel_pixels_tab;
  664. return 0;
  665. }
  666. static av_cold int mss2_decode_end(AVCodecContext *avctx)
  667. {
  668. MSS2Context *const ctx = avctx->priv_data;
  669. av_frame_free(&ctx->last_pic);
  670. ff_mss12_decode_end(&ctx->c);
  671. av_freep(&ctx->c.pal_pic);
  672. av_freep(&ctx->c.last_pal_pic);
  673. ff_vc1_decode_end(avctx);
  674. return 0;
  675. }
  676. static av_cold int mss2_decode_init(AVCodecContext *avctx)
  677. {
  678. MSS2Context * const ctx = avctx->priv_data;
  679. MSS12Context *c = &ctx->c;
  680. int ret;
  681. c->avctx = avctx;
  682. if (ret = ff_mss12_decode_init(c, 1, &ctx->sc[0], &ctx->sc[1]))
  683. return ret;
  684. ctx->last_pic = av_frame_alloc();
  685. c->pal_stride = c->mask_stride;
  686. c->pal_pic = av_mallocz(c->pal_stride * avctx->height);
  687. c->last_pal_pic = av_mallocz(c->pal_stride * avctx->height);
  688. if (!c->pal_pic || !c->last_pal_pic || !ctx->last_pic) {
  689. mss2_decode_end(avctx);
  690. return AVERROR(ENOMEM);
  691. }
  692. if (ret = wmv9_init(avctx)) {
  693. mss2_decode_end(avctx);
  694. return ret;
  695. }
  696. ff_mss2dsp_init(&ctx->dsp);
  697. ff_qpeldsp_init(&ctx->qdsp);
  698. avctx->pix_fmt = c->free_colours == 127 ? AV_PIX_FMT_RGB555
  699. : AV_PIX_FMT_RGB24;
  700. return 0;
  701. }
  702. AVCodec ff_mss2_decoder = {
  703. .name = "mss2",
  704. .long_name = NULL_IF_CONFIG_SMALL("MS Windows Media Video V9 Screen"),
  705. .type = AVMEDIA_TYPE_VIDEO,
  706. .id = AV_CODEC_ID_MSS2,
  707. .priv_data_size = sizeof(MSS2Context),
  708. .init = mss2_decode_init,
  709. .close = mss2_decode_end,
  710. .decode = mss2_decode_frame,
  711. .capabilities = AV_CODEC_CAP_DR1,
  712. };