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.

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