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.

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