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.

835 lines
27KB

  1. /*
  2. * SVQ1 decoder
  3. * ported to MPlayer by Arpi <arpi@thot.banki.hu>
  4. * ported to libavcodec by Nick Kurshev <nickols_k@mail.ru>
  5. *
  6. * Copyright (C) 2002 the xine project
  7. * Copyright (C) 2002 the ffmpeg project
  8. *
  9. * SVQ1 Encoder (c) 2004 Mike Melanson <melanson@pcisys.net>
  10. *
  11. * This file is part of FFmpeg.
  12. *
  13. * FFmpeg is free software; you can redistribute it and/or
  14. * modify it under the terms of the GNU Lesser General Public
  15. * License as published by the Free Software Foundation; either
  16. * version 2.1 of the License, or (at your option) any later version.
  17. *
  18. * FFmpeg is distributed in the hope that it will be useful,
  19. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  21. * Lesser General Public License for more details.
  22. *
  23. * You should have received a copy of the GNU Lesser General Public
  24. * License along with FFmpeg; if not, write to the Free Software
  25. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  26. */
  27. /**
  28. * @file
  29. * Sorenson Vector Quantizer #1 (SVQ1) video codec.
  30. * For more information of the SVQ1 algorithm, visit:
  31. * http://www.pcisys.net/~melanson/codecs/
  32. */
  33. #include "avcodec.h"
  34. #include "dsputil.h"
  35. #include "get_bits.h"
  36. #include "internal.h"
  37. #include "mathops.h"
  38. #include "svq1.h"
  39. #undef NDEBUG
  40. #include <assert.h>
  41. extern const uint8_t ff_mvtab[33][2];
  42. static VLC svq1_block_type;
  43. static VLC svq1_motion_component;
  44. static VLC svq1_intra_multistage[6];
  45. static VLC svq1_inter_multistage[6];
  46. static VLC svq1_intra_mean;
  47. static VLC svq1_inter_mean;
  48. /* motion vector (prediction) */
  49. typedef struct svq1_pmv_s {
  50. int x;
  51. int y;
  52. } svq1_pmv;
  53. typedef struct SVQ1Context {
  54. DSPContext dsp;
  55. GetBitContext gb;
  56. AVFrame *cur, *prev;
  57. int width;
  58. int height;
  59. int frame_code;
  60. int nonref; // 1 if the current frame won't be referenced
  61. } SVQ1Context;
  62. static const uint8_t string_table[256] = {
  63. 0x00, 0xD5, 0x7F, 0xAA, 0xFE, 0x2B, 0x81, 0x54,
  64. 0x29, 0xFC, 0x56, 0x83, 0xD7, 0x02, 0xA8, 0x7D,
  65. 0x52, 0x87, 0x2D, 0xF8, 0xAC, 0x79, 0xD3, 0x06,
  66. 0x7B, 0xAE, 0x04, 0xD1, 0x85, 0x50, 0xFA, 0x2F,
  67. 0xA4, 0x71, 0xDB, 0x0E, 0x5A, 0x8F, 0x25, 0xF0,
  68. 0x8D, 0x58, 0xF2, 0x27, 0x73, 0xA6, 0x0C, 0xD9,
  69. 0xF6, 0x23, 0x89, 0x5C, 0x08, 0xDD, 0x77, 0xA2,
  70. 0xDF, 0x0A, 0xA0, 0x75, 0x21, 0xF4, 0x5E, 0x8B,
  71. 0x9D, 0x48, 0xE2, 0x37, 0x63, 0xB6, 0x1C, 0xC9,
  72. 0xB4, 0x61, 0xCB, 0x1E, 0x4A, 0x9F, 0x35, 0xE0,
  73. 0xCF, 0x1A, 0xB0, 0x65, 0x31, 0xE4, 0x4E, 0x9B,
  74. 0xE6, 0x33, 0x99, 0x4C, 0x18, 0xCD, 0x67, 0xB2,
  75. 0x39, 0xEC, 0x46, 0x93, 0xC7, 0x12, 0xB8, 0x6D,
  76. 0x10, 0xC5, 0x6F, 0xBA, 0xEE, 0x3B, 0x91, 0x44,
  77. 0x6B, 0xBE, 0x14, 0xC1, 0x95, 0x40, 0xEA, 0x3F,
  78. 0x42, 0x97, 0x3D, 0xE8, 0xBC, 0x69, 0xC3, 0x16,
  79. 0xEF, 0x3A, 0x90, 0x45, 0x11, 0xC4, 0x6E, 0xBB,
  80. 0xC6, 0x13, 0xB9, 0x6C, 0x38, 0xED, 0x47, 0x92,
  81. 0xBD, 0x68, 0xC2, 0x17, 0x43, 0x96, 0x3C, 0xE9,
  82. 0x94, 0x41, 0xEB, 0x3E, 0x6A, 0xBF, 0x15, 0xC0,
  83. 0x4B, 0x9E, 0x34, 0xE1, 0xB5, 0x60, 0xCA, 0x1F,
  84. 0x62, 0xB7, 0x1D, 0xC8, 0x9C, 0x49, 0xE3, 0x36,
  85. 0x19, 0xCC, 0x66, 0xB3, 0xE7, 0x32, 0x98, 0x4D,
  86. 0x30, 0xE5, 0x4F, 0x9A, 0xCE, 0x1B, 0xB1, 0x64,
  87. 0x72, 0xA7, 0x0D, 0xD8, 0x8C, 0x59, 0xF3, 0x26,
  88. 0x5B, 0x8E, 0x24, 0xF1, 0xA5, 0x70, 0xDA, 0x0F,
  89. 0x20, 0xF5, 0x5F, 0x8A, 0xDE, 0x0B, 0xA1, 0x74,
  90. 0x09, 0xDC, 0x76, 0xA3, 0xF7, 0x22, 0x88, 0x5D,
  91. 0xD6, 0x03, 0xA9, 0x7C, 0x28, 0xFD, 0x57, 0x82,
  92. 0xFF, 0x2A, 0x80, 0x55, 0x01, 0xD4, 0x7E, 0xAB,
  93. 0x84, 0x51, 0xFB, 0x2E, 0x7A, 0xAF, 0x05, 0xD0,
  94. 0xAD, 0x78, 0xD2, 0x07, 0x53, 0x86, 0x2C, 0xF9
  95. };
  96. #define SVQ1_PROCESS_VECTOR() \
  97. for (; level > 0; i++) { \
  98. /* process next depth */ \
  99. if (i == m) { \
  100. m = n; \
  101. if (--level == 0) \
  102. break; \
  103. } \
  104. /* divide block if next bit set */ \
  105. if (!get_bits1(bitbuf)) \
  106. break; \
  107. /* add child nodes */ \
  108. list[n++] = list[i]; \
  109. list[n++] = list[i] + (((level & 1) ? pitch : 1) << ((level >> 1) + 1));\
  110. }
  111. #define SVQ1_ADD_CODEBOOK() \
  112. /* add codebook entries to vector */ \
  113. for (j = 0; j < stages; j++) { \
  114. n3 = codebook[entries[j]] ^ 0x80808080; \
  115. n1 += (n3 & 0xFF00FF00) >> 8; \
  116. n2 += n3 & 0x00FF00FF; \
  117. } \
  118. \
  119. /* clip to [0..255] */ \
  120. if (n1 & 0xFF00FF00) { \
  121. n3 = (n1 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
  122. n1 += 0x7F007F00; \
  123. n1 |= (~n1 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
  124. n1 &= n3 & 0x00FF00FF; \
  125. } \
  126. \
  127. if (n2 & 0xFF00FF00) { \
  128. n3 = (n2 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
  129. n2 += 0x7F007F00; \
  130. n2 |= (~n2 >> 15 & 0x00010001 | 0x01000100) - 0x00010001; \
  131. n2 &= n3 & 0x00FF00FF; \
  132. }
  133. #define SVQ1_CALC_CODEBOOK_ENTRIES(cbook) \
  134. codebook = (const uint32_t *)cbook[level]; \
  135. if (stages > 0) \
  136. bit_cache = get_bits(bitbuf, 4 * stages); \
  137. /* calculate codebook entries for this vector */ \
  138. for (j = 0; j < stages; j++) { \
  139. entries[j] = (((bit_cache >> (4 * (stages - j - 1))) & 0xF) + \
  140. 16 * j) << (level + 1); \
  141. } \
  142. mean -= stages * 128; \
  143. n4 = (mean << 16) + mean;
  144. static int svq1_decode_block_intra(GetBitContext *bitbuf, uint8_t *pixels,
  145. int pitch)
  146. {
  147. uint32_t bit_cache;
  148. uint8_t *list[63];
  149. uint32_t *dst;
  150. const uint32_t *codebook;
  151. int entries[6];
  152. int i, j, m, n;
  153. int mean, stages;
  154. unsigned x, y, width, height, level;
  155. uint32_t n1, n2, n3, n4;
  156. /* initialize list for breadth first processing of vectors */
  157. list[0] = pixels;
  158. /* recursively process vector */
  159. for (i = 0, m = 1, n = 1, level = 5; i < n; i++) {
  160. SVQ1_PROCESS_VECTOR();
  161. /* destination address and vector size */
  162. dst = (uint32_t *)list[i];
  163. width = 1 << ((4 + level) / 2);
  164. height = 1 << ((3 + level) / 2);
  165. /* get number of stages (-1 skips vector, 0 for mean only) */
  166. stages = get_vlc2(bitbuf, svq1_intra_multistage[level].table, 3, 3) - 1;
  167. if (stages == -1) {
  168. for (y = 0; y < height; y++)
  169. memset(&dst[y * (pitch / 4)], 0, width);
  170. continue; /* skip vector */
  171. }
  172. if (stages > 0 && level >= 4) {
  173. av_dlog(NULL,
  174. "Error (svq1_decode_block_intra): invalid vector: stages=%i level=%i\n",
  175. stages, level);
  176. return AVERROR_INVALIDDATA; /* invalid vector */
  177. }
  178. mean = get_vlc2(bitbuf, svq1_intra_mean.table, 8, 3);
  179. if (stages == 0) {
  180. for (y = 0; y < height; y++)
  181. memset(&dst[y * (pitch / 4)], mean, width);
  182. } else {
  183. SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_intra_codebooks);
  184. for (y = 0; y < height; y++) {
  185. for (x = 0; x < width / 4; x++, codebook++) {
  186. n1 = n4;
  187. n2 = n4;
  188. SVQ1_ADD_CODEBOOK()
  189. /* store result */
  190. dst[x] = n1 << 8 | n2;
  191. }
  192. dst += pitch / 4;
  193. }
  194. }
  195. }
  196. return 0;
  197. }
  198. static int svq1_decode_block_non_intra(GetBitContext *bitbuf, uint8_t *pixels,
  199. int pitch)
  200. {
  201. uint32_t bit_cache;
  202. uint8_t *list[63];
  203. uint32_t *dst;
  204. const uint32_t *codebook;
  205. int entries[6];
  206. int i, j, m, n;
  207. int mean, stages;
  208. int x, y, width, height, level;
  209. uint32_t n1, n2, n3, n4;
  210. /* initialize list for breadth first processing of vectors */
  211. list[0] = pixels;
  212. /* recursively process vector */
  213. for (i = 0, m = 1, n = 1, level = 5; i < n; i++) {
  214. SVQ1_PROCESS_VECTOR();
  215. /* destination address and vector size */
  216. dst = (uint32_t *)list[i];
  217. width = 1 << ((4 + level) / 2);
  218. height = 1 << ((3 + level) / 2);
  219. /* get number of stages (-1 skips vector, 0 for mean only) */
  220. stages = get_vlc2(bitbuf, svq1_inter_multistage[level].table, 3, 2) - 1;
  221. if (stages == -1)
  222. continue; /* skip vector */
  223. if ((stages > 0) && (level >= 4)) {
  224. av_dlog(NULL,
  225. "Error (svq1_decode_block_non_intra): invalid vector: stages=%i level=%i\n",
  226. stages, level);
  227. return AVERROR_INVALIDDATA; /* invalid vector */
  228. }
  229. mean = get_vlc2(bitbuf, svq1_inter_mean.table, 9, 3) - 256;
  230. SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_inter_codebooks);
  231. for (y = 0; y < height; y++) {
  232. for (x = 0; x < width / 4; x++, codebook++) {
  233. n3 = dst[x];
  234. /* add mean value to vector */
  235. n1 = n4 + ((n3 & 0xFF00FF00) >> 8);
  236. n2 = n4 + (n3 & 0x00FF00FF);
  237. SVQ1_ADD_CODEBOOK()
  238. /* store result */
  239. dst[x] = n1 << 8 | n2;
  240. }
  241. dst += pitch / 4;
  242. }
  243. }
  244. return 0;
  245. }
  246. static int svq1_decode_motion_vector(GetBitContext *bitbuf, svq1_pmv *mv,
  247. svq1_pmv **pmv)
  248. {
  249. int diff;
  250. int i;
  251. for (i = 0; i < 2; i++) {
  252. /* get motion code */
  253. diff = get_vlc2(bitbuf, svq1_motion_component.table, 7, 2);
  254. if (diff < 0)
  255. return AVERROR_INVALIDDATA;
  256. else if (diff) {
  257. if (get_bits1(bitbuf))
  258. diff = -diff;
  259. }
  260. /* add median of motion vector predictors and clip result */
  261. if (i == 1)
  262. mv->y = sign_extend(diff + mid_pred(pmv[0]->y, pmv[1]->y, pmv[2]->y), 6);
  263. else
  264. mv->x = sign_extend(diff + mid_pred(pmv[0]->x, pmv[1]->x, pmv[2]->x), 6);
  265. }
  266. return 0;
  267. }
  268. static void svq1_skip_block(uint8_t *current, uint8_t *previous,
  269. int pitch, int x, int y)
  270. {
  271. uint8_t *src;
  272. uint8_t *dst;
  273. int i;
  274. src = &previous[x + y * pitch];
  275. dst = current;
  276. for (i = 0; i < 16; i++) {
  277. memcpy(dst, src, 16);
  278. src += pitch;
  279. dst += pitch;
  280. }
  281. }
  282. static int svq1_motion_inter_block(DSPContext *dsp, GetBitContext *bitbuf,
  283. uint8_t *current, uint8_t *previous,
  284. int pitch, svq1_pmv *motion, int x, int y)
  285. {
  286. uint8_t *src;
  287. uint8_t *dst;
  288. svq1_pmv mv;
  289. svq1_pmv *pmv[3];
  290. int result;
  291. /* predict and decode motion vector */
  292. pmv[0] = &motion[0];
  293. if (y == 0) {
  294. pmv[1] =
  295. pmv[2] = pmv[0];
  296. } else {
  297. pmv[1] = &motion[x / 8 + 2];
  298. pmv[2] = &motion[x / 8 + 4];
  299. }
  300. result = svq1_decode_motion_vector(bitbuf, &mv, pmv);
  301. if (result)
  302. return result;
  303. motion[0].x =
  304. motion[x / 8 + 2].x =
  305. motion[x / 8 + 3].x = mv.x;
  306. motion[0].y =
  307. motion[x / 8 + 2].y =
  308. motion[x / 8 + 3].y = mv.y;
  309. if (y + (mv.y >> 1) < 0)
  310. mv.y = 0;
  311. if (x + (mv.x >> 1) < 0)
  312. mv.x = 0;
  313. src = &previous[(x + (mv.x >> 1)) + (y + (mv.y >> 1)) * pitch];
  314. dst = current;
  315. dsp->put_pixels_tab[0][(mv.y & 1) << 1 | (mv.x & 1)](dst, src, pitch, 16);
  316. return 0;
  317. }
  318. static int svq1_motion_inter_4v_block(DSPContext *dsp, GetBitContext *bitbuf,
  319. uint8_t *current, uint8_t *previous,
  320. int pitch, svq1_pmv *motion, int x, int y)
  321. {
  322. uint8_t *src;
  323. uint8_t *dst;
  324. svq1_pmv mv;
  325. svq1_pmv *pmv[4];
  326. int i, result;
  327. /* predict and decode motion vector (0) */
  328. pmv[0] = &motion[0];
  329. if (y == 0) {
  330. pmv[1] =
  331. pmv[2] = pmv[0];
  332. } else {
  333. pmv[1] = &motion[(x / 8) + 2];
  334. pmv[2] = &motion[(x / 8) + 4];
  335. }
  336. result = svq1_decode_motion_vector(bitbuf, &mv, pmv);
  337. if (result)
  338. return result;
  339. /* predict and decode motion vector (1) */
  340. pmv[0] = &mv;
  341. if (y == 0) {
  342. pmv[1] =
  343. pmv[2] = pmv[0];
  344. } else {
  345. pmv[1] = &motion[(x / 8) + 3];
  346. }
  347. result = svq1_decode_motion_vector(bitbuf, &motion[0], pmv);
  348. if (result)
  349. return result;
  350. /* predict and decode motion vector (2) */
  351. pmv[1] = &motion[0];
  352. pmv[2] = &motion[(x / 8) + 1];
  353. result = svq1_decode_motion_vector(bitbuf, &motion[(x / 8) + 2], pmv);
  354. if (result)
  355. return result;
  356. /* predict and decode motion vector (3) */
  357. pmv[2] = &motion[(x / 8) + 2];
  358. pmv[3] = &motion[(x / 8) + 3];
  359. result = svq1_decode_motion_vector(bitbuf, pmv[3], pmv);
  360. if (result)
  361. return result;
  362. /* form predictions */
  363. for (i = 0; i < 4; i++) {
  364. int mvx = pmv[i]->x + (i & 1) * 16;
  365. int mvy = pmv[i]->y + (i >> 1) * 16;
  366. // FIXME: clipping or padding?
  367. if (y + (mvy >> 1) < 0)
  368. mvy = 0;
  369. if (x + (mvx >> 1) < 0)
  370. mvx = 0;
  371. src = &previous[(x + (mvx >> 1)) + (y + (mvy >> 1)) * pitch];
  372. dst = current;
  373. dsp->put_pixels_tab[1][((mvy & 1) << 1) | (mvx & 1)](dst, src, pitch, 8);
  374. /* select next block */
  375. if (i & 1)
  376. current += 8 * (pitch - 1);
  377. else
  378. current += 8;
  379. }
  380. return 0;
  381. }
  382. static int svq1_decode_delta_block(AVCodecContext *avctx, DSPContext *dsp,
  383. GetBitContext *bitbuf,
  384. uint8_t *current, uint8_t *previous,
  385. int pitch, svq1_pmv *motion, int x, int y)
  386. {
  387. uint32_t block_type;
  388. int result = 0;
  389. /* get block type */
  390. block_type = get_vlc2(bitbuf, svq1_block_type.table, 2, 2);
  391. /* reset motion vectors */
  392. if (block_type == SVQ1_BLOCK_SKIP || block_type == SVQ1_BLOCK_INTRA) {
  393. motion[0].x =
  394. motion[0].y =
  395. motion[x / 8 + 2].x =
  396. motion[x / 8 + 2].y =
  397. motion[x / 8 + 3].x =
  398. motion[x / 8 + 3].y = 0;
  399. }
  400. switch (block_type) {
  401. case SVQ1_BLOCK_SKIP:
  402. svq1_skip_block(current, previous, pitch, x, y);
  403. break;
  404. case SVQ1_BLOCK_INTER:
  405. result = svq1_motion_inter_block(dsp, bitbuf, current, previous,
  406. pitch, motion, x, y);
  407. if (result != 0) {
  408. av_dlog(avctx, "Error in svq1_motion_inter_block %i\n", result);
  409. break;
  410. }
  411. result = svq1_decode_block_non_intra(bitbuf, current, pitch);
  412. break;
  413. case SVQ1_BLOCK_INTER_4V:
  414. result = svq1_motion_inter_4v_block(dsp, bitbuf, current, previous,
  415. pitch, motion, x, y);
  416. if (result != 0) {
  417. av_dlog(avctx, "Error in svq1_motion_inter_4v_block %i\n", result);
  418. break;
  419. }
  420. result = svq1_decode_block_non_intra(bitbuf, current, pitch);
  421. break;
  422. case SVQ1_BLOCK_INTRA:
  423. result = svq1_decode_block_intra(bitbuf, current, pitch);
  424. break;
  425. }
  426. return result;
  427. }
  428. static void svq1_parse_string(GetBitContext *bitbuf, uint8_t *out)
  429. {
  430. uint8_t seed;
  431. int i;
  432. out[0] = get_bits(bitbuf, 8);
  433. seed = string_table[out[0]];
  434. for (i = 1; i <= out[0]; i++) {
  435. out[i] = get_bits(bitbuf, 8) ^ seed;
  436. seed = string_table[out[i] ^ seed];
  437. }
  438. }
  439. static int svq1_decode_frame_header(AVCodecContext *avctx, AVFrame *frame)
  440. {
  441. SVQ1Context *s = avctx->priv_data;
  442. GetBitContext *bitbuf = &s->gb;
  443. int frame_size_code;
  444. int width = s->width;
  445. int height = s->height;
  446. skip_bits(bitbuf, 8); /* temporal_reference */
  447. /* frame type */
  448. s->nonref = 0;
  449. switch (get_bits(bitbuf, 2)) {
  450. case 0:
  451. frame->pict_type = AV_PICTURE_TYPE_I;
  452. break;
  453. case 2:
  454. s->nonref = 1;
  455. case 1:
  456. frame->pict_type = AV_PICTURE_TYPE_P;
  457. break;
  458. default:
  459. av_log(avctx, AV_LOG_ERROR, "Invalid frame type.\n");
  460. return AVERROR_INVALIDDATA;
  461. }
  462. if (frame->pict_type == AV_PICTURE_TYPE_I) {
  463. /* unknown fields */
  464. if (s->frame_code == 0x50 || s->frame_code == 0x60) {
  465. int csum = get_bits(bitbuf, 16);
  466. csum = ff_svq1_packet_checksum(bitbuf->buffer,
  467. bitbuf->size_in_bits >> 3,
  468. csum);
  469. av_dlog(avctx, "%s checksum (%02x) for packet data\n",
  470. (csum == 0) ? "correct" : "incorrect", csum);
  471. }
  472. if ((s->frame_code ^ 0x10) >= 0x50) {
  473. uint8_t msg[256];
  474. svq1_parse_string(bitbuf, msg);
  475. av_log(avctx, AV_LOG_INFO,
  476. "embedded message: \"%s\"\n", (char *)msg);
  477. }
  478. skip_bits(bitbuf, 2);
  479. skip_bits(bitbuf, 2);
  480. skip_bits1(bitbuf);
  481. /* load frame size */
  482. frame_size_code = get_bits(bitbuf, 3);
  483. if (frame_size_code == 7) {
  484. /* load width, height (12 bits each) */
  485. width = get_bits(bitbuf, 12);
  486. height = get_bits(bitbuf, 12);
  487. if (!width || !height)
  488. return AVERROR_INVALIDDATA;
  489. } else {
  490. /* get width, height from table */
  491. width = ff_svq1_frame_size_table[frame_size_code].width;
  492. height = ff_svq1_frame_size_table[frame_size_code].height;
  493. }
  494. }
  495. /* unknown fields */
  496. if (get_bits1(bitbuf)) {
  497. skip_bits1(bitbuf); /* use packet checksum if (1) */
  498. skip_bits1(bitbuf); /* component checksums after image data if (1) */
  499. if (get_bits(bitbuf, 2) != 0)
  500. return AVERROR_INVALIDDATA;
  501. }
  502. if (get_bits1(bitbuf)) {
  503. skip_bits1(bitbuf);
  504. skip_bits(bitbuf, 4);
  505. skip_bits1(bitbuf);
  506. skip_bits(bitbuf, 2);
  507. while (get_bits1(bitbuf))
  508. skip_bits(bitbuf, 8);
  509. }
  510. s->width = width;
  511. s->height = height;
  512. return 0;
  513. }
  514. static int svq1_decode_frame(AVCodecContext *avctx, void *data,
  515. int *got_frame, AVPacket *avpkt)
  516. {
  517. const uint8_t *buf = avpkt->data;
  518. int buf_size = avpkt->size;
  519. SVQ1Context *s = avctx->priv_data;
  520. AVFrame *cur = s->cur;
  521. uint8_t *current;
  522. int result, i, x, y, width, height;
  523. svq1_pmv *pmv;
  524. if (cur->data[0])
  525. avctx->release_buffer(avctx, cur);
  526. /* initialize bit buffer */
  527. init_get_bits(&s->gb, buf, buf_size * 8);
  528. /* decode frame header */
  529. s->frame_code = get_bits(&s->gb, 22);
  530. if ((s->frame_code & ~0x70) || !(s->frame_code & 0x60))
  531. return AVERROR_INVALIDDATA;
  532. /* swap some header bytes (why?) */
  533. if (s->frame_code != 0x20) {
  534. uint32_t *src = (uint32_t *)(buf + 4);
  535. if (buf_size < 36)
  536. return AVERROR_INVALIDDATA;
  537. for (i = 0; i < 4; i++)
  538. src[i] = ((src[i] << 16) | (src[i] >> 16)) ^ src[7 - i];
  539. }
  540. result = svq1_decode_frame_header(avctx, cur);
  541. if (result != 0) {
  542. av_dlog(avctx, "Error in svq1_decode_frame_header %i\n", result);
  543. return result;
  544. }
  545. avcodec_set_dimensions(avctx, s->width, s->height);
  546. if ((avctx->skip_frame >= AVDISCARD_NONREF && s->nonref) ||
  547. (avctx->skip_frame >= AVDISCARD_NONKEY &&
  548. cur->pict_type != AV_PICTURE_TYPE_I) ||
  549. avctx->skip_frame >= AVDISCARD_ALL)
  550. return buf_size;
  551. result = ff_get_buffer(avctx, cur);
  552. if (result < 0)
  553. return result;
  554. pmv = av_malloc((FFALIGN(s->width, 16) / 8 + 3) * sizeof(*pmv));
  555. if (!pmv)
  556. return AVERROR(ENOMEM);
  557. /* decode y, u and v components */
  558. for (i = 0; i < 3; i++) {
  559. int linesize = cur->linesize[i];
  560. if (i == 0) {
  561. width = FFALIGN(s->width, 16);
  562. height = FFALIGN(s->height, 16);
  563. } else {
  564. if (avctx->flags & CODEC_FLAG_GRAY)
  565. break;
  566. width = FFALIGN(s->width / 4, 16);
  567. height = FFALIGN(s->height / 4, 16);
  568. }
  569. current = cur->data[i];
  570. if (cur->pict_type == AV_PICTURE_TYPE_I) {
  571. /* keyframe */
  572. for (y = 0; y < height; y += 16) {
  573. for (x = 0; x < width; x += 16) {
  574. result = svq1_decode_block_intra(&s->gb, &current[x],
  575. linesize);
  576. if (result) {
  577. av_log(avctx, AV_LOG_ERROR,
  578. "Error in svq1_decode_block %i (keyframe)\n",
  579. result);
  580. goto err;
  581. }
  582. }
  583. current += 16 * linesize;
  584. }
  585. } else {
  586. /* delta frame */
  587. uint8_t *previous = s->prev->data[i];
  588. if (!previous) {
  589. av_log(avctx, AV_LOG_ERROR, "Missing reference frame.\n");
  590. result = AVERROR_INVALIDDATA;
  591. goto err;
  592. }
  593. memset(pmv, 0, ((width / 8) + 3) * sizeof(svq1_pmv));
  594. for (y = 0; y < height; y += 16) {
  595. for (x = 0; x < width; x += 16) {
  596. result = svq1_decode_delta_block(avctx, &s->dsp,
  597. &s->gb, &current[x],
  598. previous, linesize,
  599. pmv, x, y);
  600. if (result) {
  601. av_dlog(avctx,
  602. "Error in svq1_decode_delta_block %i\n",
  603. result);
  604. goto err;
  605. }
  606. }
  607. pmv[0].x =
  608. pmv[0].y = 0;
  609. current += 16 * linesize;
  610. }
  611. }
  612. }
  613. *(AVFrame*)data = *cur;
  614. cur->qscale_table = NULL;
  615. if (!s->nonref)
  616. FFSWAP(AVFrame*, s->cur, s->prev);
  617. *got_frame = 1;
  618. result = buf_size;
  619. err:
  620. av_free(pmv);
  621. return result;
  622. }
  623. static av_cold int svq1_decode_init(AVCodecContext *avctx)
  624. {
  625. SVQ1Context *s = avctx->priv_data;
  626. int i;
  627. int offset = 0;
  628. s->cur = avcodec_alloc_frame();
  629. s->prev = avcodec_alloc_frame();
  630. if (!s->cur || !s->prev) {
  631. avcodec_free_frame(&s->cur);
  632. avcodec_free_frame(&s->prev);
  633. return AVERROR(ENOMEM);
  634. }
  635. s->width = avctx->width + 3 & ~3;
  636. s->height = avctx->height + 3 & ~3;
  637. avctx->pix_fmt = AV_PIX_FMT_YUV410P;
  638. ff_dsputil_init(&s->dsp, avctx);
  639. INIT_VLC_STATIC(&svq1_block_type, 2, 4,
  640. &ff_svq1_block_type_vlc[0][1], 2, 1,
  641. &ff_svq1_block_type_vlc[0][0], 2, 1, 6);
  642. INIT_VLC_STATIC(&svq1_motion_component, 7, 33,
  643. &ff_mvtab[0][1], 2, 1,
  644. &ff_mvtab[0][0], 2, 1, 176);
  645. for (i = 0; i < 6; i++) {
  646. static const uint8_t sizes[2][6] = { { 14, 10, 14, 18, 16, 18 },
  647. { 10, 10, 14, 14, 14, 16 } };
  648. static VLC_TYPE table[168][2];
  649. svq1_intra_multistage[i].table = &table[offset];
  650. svq1_intra_multistage[i].table_allocated = sizes[0][i];
  651. offset += sizes[0][i];
  652. init_vlc(&svq1_intra_multistage[i], 3, 8,
  653. &ff_svq1_intra_multistage_vlc[i][0][1], 2, 1,
  654. &ff_svq1_intra_multistage_vlc[i][0][0], 2, 1,
  655. INIT_VLC_USE_NEW_STATIC);
  656. svq1_inter_multistage[i].table = &table[offset];
  657. svq1_inter_multistage[i].table_allocated = sizes[1][i];
  658. offset += sizes[1][i];
  659. init_vlc(&svq1_inter_multistage[i], 3, 8,
  660. &ff_svq1_inter_multistage_vlc[i][0][1], 2, 1,
  661. &ff_svq1_inter_multistage_vlc[i][0][0], 2, 1,
  662. INIT_VLC_USE_NEW_STATIC);
  663. }
  664. INIT_VLC_STATIC(&svq1_intra_mean, 8, 256,
  665. &ff_svq1_intra_mean_vlc[0][1], 4, 2,
  666. &ff_svq1_intra_mean_vlc[0][0], 4, 2, 632);
  667. INIT_VLC_STATIC(&svq1_inter_mean, 9, 512,
  668. &ff_svq1_inter_mean_vlc[0][1], 4, 2,
  669. &ff_svq1_inter_mean_vlc[0][0], 4, 2, 1434);
  670. return 0;
  671. }
  672. static av_cold int svq1_decode_end(AVCodecContext *avctx)
  673. {
  674. SVQ1Context *s = avctx->priv_data;
  675. if (s->cur->data[0])
  676. avctx->release_buffer(avctx, s->cur);
  677. if (s->prev->data[0])
  678. avctx->release_buffer(avctx, s->prev);
  679. avcodec_free_frame(&s->cur);
  680. avcodec_free_frame(&s->prev);
  681. return 0;
  682. }
  683. static void svq1_flush(AVCodecContext *avctx)
  684. {
  685. SVQ1Context *s = avctx->priv_data;
  686. if (s->cur->data[0])
  687. avctx->release_buffer(avctx, s->cur);
  688. if (s->prev->data[0])
  689. avctx->release_buffer(avctx, s->prev);
  690. }
  691. AVCodec ff_svq1_decoder = {
  692. .name = "svq1",
  693. .type = AVMEDIA_TYPE_VIDEO,
  694. .id = AV_CODEC_ID_SVQ1,
  695. .priv_data_size = sizeof(SVQ1Context),
  696. .init = svq1_decode_init,
  697. .close = svq1_decode_end,
  698. .decode = svq1_decode_frame,
  699. .capabilities = CODEC_CAP_DR1,
  700. .flush = svq1_flush,
  701. .pix_fmts = (const enum AVPixelFormat[]) { AV_PIX_FMT_YUV410P,
  702. AV_PIX_FMT_NONE },
  703. .long_name = NULL_IF_CONFIG_SMALL("Sorenson Vector Quantizer 1 / Sorenson Video 1 / SVQ1"),
  704. };