svq1dec.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832
  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 libavcodec/svq1.c
  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. //#define DEBUG_SVQ1
  34. #include "avcodec.h"
  35. #include "dsputil.h"
  36. #include "mpegvideo.h"
  37. #include "mathops.h"
  38. #include "svq1.h"
  39. #undef NDEBUG
  40. #include <assert.h>
  41. extern const uint8_t 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. static const uint16_t checksum_table[256] = {
  54. 0x0000, 0x1021, 0x2042, 0x3063, 0x4084, 0x50A5, 0x60C6, 0x70E7,
  55. 0x8108, 0x9129, 0xA14A, 0xB16B, 0xC18C, 0xD1AD, 0xE1CE, 0xF1EF,
  56. 0x1231, 0x0210, 0x3273, 0x2252, 0x52B5, 0x4294, 0x72F7, 0x62D6,
  57. 0x9339, 0x8318, 0xB37B, 0xA35A, 0xD3BD, 0xC39C, 0xF3FF, 0xE3DE,
  58. 0x2462, 0x3443, 0x0420, 0x1401, 0x64E6, 0x74C7, 0x44A4, 0x5485,
  59. 0xA56A, 0xB54B, 0x8528, 0x9509, 0xE5EE, 0xF5CF, 0xC5AC, 0xD58D,
  60. 0x3653, 0x2672, 0x1611, 0x0630, 0x76D7, 0x66F6, 0x5695, 0x46B4,
  61. 0xB75B, 0xA77A, 0x9719, 0x8738, 0xF7DF, 0xE7FE, 0xD79D, 0xC7BC,
  62. 0x48C4, 0x58E5, 0x6886, 0x78A7, 0x0840, 0x1861, 0x2802, 0x3823,
  63. 0xC9CC, 0xD9ED, 0xE98E, 0xF9AF, 0x8948, 0x9969, 0xA90A, 0xB92B,
  64. 0x5AF5, 0x4AD4, 0x7AB7, 0x6A96, 0x1A71, 0x0A50, 0x3A33, 0x2A12,
  65. 0xDBFD, 0xCBDC, 0xFBBF, 0xEB9E, 0x9B79, 0x8B58, 0xBB3B, 0xAB1A,
  66. 0x6CA6, 0x7C87, 0x4CE4, 0x5CC5, 0x2C22, 0x3C03, 0x0C60, 0x1C41,
  67. 0xEDAE, 0xFD8F, 0xCDEC, 0xDDCD, 0xAD2A, 0xBD0B, 0x8D68, 0x9D49,
  68. 0x7E97, 0x6EB6, 0x5ED5, 0x4EF4, 0x3E13, 0x2E32, 0x1E51, 0x0E70,
  69. 0xFF9F, 0xEFBE, 0xDFDD, 0xCFFC, 0xBF1B, 0xAF3A, 0x9F59, 0x8F78,
  70. 0x9188, 0x81A9, 0xB1CA, 0xA1EB, 0xD10C, 0xC12D, 0xF14E, 0xE16F,
  71. 0x1080, 0x00A1, 0x30C2, 0x20E3, 0x5004, 0x4025, 0x7046, 0x6067,
  72. 0x83B9, 0x9398, 0xA3FB, 0xB3DA, 0xC33D, 0xD31C, 0xE37F, 0xF35E,
  73. 0x02B1, 0x1290, 0x22F3, 0x32D2, 0x4235, 0x5214, 0x6277, 0x7256,
  74. 0xB5EA, 0xA5CB, 0x95A8, 0x8589, 0xF56E, 0xE54F, 0xD52C, 0xC50D,
  75. 0x34E2, 0x24C3, 0x14A0, 0x0481, 0x7466, 0x6447, 0x5424, 0x4405,
  76. 0xA7DB, 0xB7FA, 0x8799, 0x97B8, 0xE75F, 0xF77E, 0xC71D, 0xD73C,
  77. 0x26D3, 0x36F2, 0x0691, 0x16B0, 0x6657, 0x7676, 0x4615, 0x5634,
  78. 0xD94C, 0xC96D, 0xF90E, 0xE92F, 0x99C8, 0x89E9, 0xB98A, 0xA9AB,
  79. 0x5844, 0x4865, 0x7806, 0x6827, 0x18C0, 0x08E1, 0x3882, 0x28A3,
  80. 0xCB7D, 0xDB5C, 0xEB3F, 0xFB1E, 0x8BF9, 0x9BD8, 0xABBB, 0xBB9A,
  81. 0x4A75, 0x5A54, 0x6A37, 0x7A16, 0x0AF1, 0x1AD0, 0x2AB3, 0x3A92,
  82. 0xFD2E, 0xED0F, 0xDD6C, 0xCD4D, 0xBDAA, 0xAD8B, 0x9DE8, 0x8DC9,
  83. 0x7C26, 0x6C07, 0x5C64, 0x4C45, 0x3CA2, 0x2C83, 0x1CE0, 0x0CC1,
  84. 0xEF1F, 0xFF3E, 0xCF5D, 0xDF7C, 0xAF9B, 0xBFBA, 0x8FD9, 0x9FF8,
  85. 0x6E17, 0x7E36, 0x4E55, 0x5E74, 0x2E93, 0x3EB2, 0x0ED1, 0x1EF0
  86. };
  87. static const uint8_t string_table[256] = {
  88. 0x00, 0xD5, 0x7F, 0xAA, 0xFE, 0x2B, 0x81, 0x54,
  89. 0x29, 0xFC, 0x56, 0x83, 0xD7, 0x02, 0xA8, 0x7D,
  90. 0x52, 0x87, 0x2D, 0xF8, 0xAC, 0x79, 0xD3, 0x06,
  91. 0x7B, 0xAE, 0x04, 0xD1, 0x85, 0x50, 0xFA, 0x2F,
  92. 0xA4, 0x71, 0xDB, 0x0E, 0x5A, 0x8F, 0x25, 0xF0,
  93. 0x8D, 0x58, 0xF2, 0x27, 0x73, 0xA6, 0x0C, 0xD9,
  94. 0xF6, 0x23, 0x89, 0x5C, 0x08, 0xDD, 0x77, 0xA2,
  95. 0xDF, 0x0A, 0xA0, 0x75, 0x21, 0xF4, 0x5E, 0x8B,
  96. 0x9D, 0x48, 0xE2, 0x37, 0x63, 0xB6, 0x1C, 0xC9,
  97. 0xB4, 0x61, 0xCB, 0x1E, 0x4A, 0x9F, 0x35, 0xE0,
  98. 0xCF, 0x1A, 0xB0, 0x65, 0x31, 0xE4, 0x4E, 0x9B,
  99. 0xE6, 0x33, 0x99, 0x4C, 0x18, 0xCD, 0x67, 0xB2,
  100. 0x39, 0xEC, 0x46, 0x93, 0xC7, 0x12, 0xB8, 0x6D,
  101. 0x10, 0xC5, 0x6F, 0xBA, 0xEE, 0x3B, 0x91, 0x44,
  102. 0x6B, 0xBE, 0x14, 0xC1, 0x95, 0x40, 0xEA, 0x3F,
  103. 0x42, 0x97, 0x3D, 0xE8, 0xBC, 0x69, 0xC3, 0x16,
  104. 0xEF, 0x3A, 0x90, 0x45, 0x11, 0xC4, 0x6E, 0xBB,
  105. 0xC6, 0x13, 0xB9, 0x6C, 0x38, 0xED, 0x47, 0x92,
  106. 0xBD, 0x68, 0xC2, 0x17, 0x43, 0x96, 0x3C, 0xE9,
  107. 0x94, 0x41, 0xEB, 0x3E, 0x6A, 0xBF, 0x15, 0xC0,
  108. 0x4B, 0x9E, 0x34, 0xE1, 0xB5, 0x60, 0xCA, 0x1F,
  109. 0x62, 0xB7, 0x1D, 0xC8, 0x9C, 0x49, 0xE3, 0x36,
  110. 0x19, 0xCC, 0x66, 0xB3, 0xE7, 0x32, 0x98, 0x4D,
  111. 0x30, 0xE5, 0x4F, 0x9A, 0xCE, 0x1B, 0xB1, 0x64,
  112. 0x72, 0xA7, 0x0D, 0xD8, 0x8C, 0x59, 0xF3, 0x26,
  113. 0x5B, 0x8E, 0x24, 0xF1, 0xA5, 0x70, 0xDA, 0x0F,
  114. 0x20, 0xF5, 0x5F, 0x8A, 0xDE, 0x0B, 0xA1, 0x74,
  115. 0x09, 0xDC, 0x76, 0xA3, 0xF7, 0x22, 0x88, 0x5D,
  116. 0xD6, 0x03, 0xA9, 0x7C, 0x28, 0xFD, 0x57, 0x82,
  117. 0xFF, 0x2A, 0x80, 0x55, 0x01, 0xD4, 0x7E, 0xAB,
  118. 0x84, 0x51, 0xFB, 0x2E, 0x7A, 0xAF, 0x05, 0xD0,
  119. 0xAD, 0x78, 0xD2, 0x07, 0x53, 0x86, 0x2C, 0xF9
  120. };
  121. #define SVQ1_PROCESS_VECTOR()\
  122. for (; level > 0; i++) {\
  123. /* process next depth */\
  124. if (i == m) {\
  125. m = n;\
  126. if (--level == 0)\
  127. break;\
  128. }\
  129. /* divide block if next bit set */\
  130. if (get_bits1 (bitbuf) == 0)\
  131. break;\
  132. /* add child nodes */\
  133. list[n++] = list[i];\
  134. list[n++] = list[i] + (((level & 1) ? pitch : 1) << ((level / 2) + 1));\
  135. }
  136. #define SVQ1_ADD_CODEBOOK()\
  137. /* add codebook entries to vector */\
  138. for (j=0; j < stages; j++) {\
  139. n3 = codebook[entries[j]] ^ 0x80808080;\
  140. n1 += ((n3 & 0xFF00FF00) >> 8);\
  141. n2 += (n3 & 0x00FF00FF);\
  142. }\
  143. \
  144. /* clip to [0..255] */\
  145. if (n1 & 0xFF00FF00) {\
  146. n3 = ((( n1 >> 15) & 0x00010001) | 0x01000100) - 0x00010001;\
  147. n1 += 0x7F007F00;\
  148. n1 |= (((~n1 >> 15) & 0x00010001) | 0x01000100) - 0x00010001;\
  149. n1 &= (n3 & 0x00FF00FF);\
  150. }\
  151. \
  152. if (n2 & 0xFF00FF00) {\
  153. n3 = ((( n2 >> 15) & 0x00010001) | 0x01000100) - 0x00010001;\
  154. n2 += 0x7F007F00;\
  155. n2 |= (((~n2 >> 15) & 0x00010001) | 0x01000100) - 0x00010001;\
  156. n2 &= (n3 & 0x00FF00FF);\
  157. }
  158. #define SVQ1_DO_CODEBOOK_INTRA()\
  159. for (y=0; y < height; y++) {\
  160. for (x=0; x < (width / 4); x++, codebook++) {\
  161. n1 = n4;\
  162. n2 = n4;\
  163. SVQ1_ADD_CODEBOOK()\
  164. /* store result */\
  165. dst[x] = (n1 << 8) | n2;\
  166. }\
  167. dst += (pitch / 4);\
  168. }
  169. #define SVQ1_DO_CODEBOOK_NONINTRA()\
  170. for (y=0; y < height; y++) {\
  171. for (x=0; x < (width / 4); x++, codebook++) {\
  172. n3 = dst[x];\
  173. /* add mean value to vector */\
  174. n1 = ((n3 & 0xFF00FF00) >> 8) + n4;\
  175. n2 = (n3 & 0x00FF00FF) + n4;\
  176. SVQ1_ADD_CODEBOOK()\
  177. /* store result */\
  178. dst[x] = (n1 << 8) | n2;\
  179. }\
  180. dst += (pitch / 4);\
  181. }
  182. #define SVQ1_CALC_CODEBOOK_ENTRIES(cbook)\
  183. codebook = (const uint32_t *) cbook[level];\
  184. bit_cache = get_bits (bitbuf, 4*stages);\
  185. /* calculate codebook entries for this vector */\
  186. for (j=0; j < stages; j++) {\
  187. entries[j] = (((bit_cache >> (4*(stages - j - 1))) & 0xF) + 16*j) << (level + 1);\
  188. }\
  189. mean -= (stages * 128);\
  190. n4 = ((mean + (mean >> 31)) << 16) | (mean & 0xFFFF);
  191. static int svq1_decode_block_intra (GetBitContext *bitbuf, uint8_t *pixels, int pitch ) {
  192. uint32_t bit_cache;
  193. uint8_t *list[63];
  194. uint32_t *dst;
  195. const uint32_t *codebook;
  196. int entries[6];
  197. int i, j, m, n;
  198. int mean, stages;
  199. unsigned x, y, width, height, level;
  200. uint32_t n1, n2, n3, n4;
  201. /* initialize list for breadth first processing of vectors */
  202. list[0] = pixels;
  203. /* recursively process vector */
  204. for (i=0, m=1, n=1, level=5; i < n; i++) {
  205. SVQ1_PROCESS_VECTOR();
  206. /* destination address and vector size */
  207. dst = (uint32_t *) list[i];
  208. width = 1 << ((4 + level) /2);
  209. height = 1 << ((3 + level) /2);
  210. /* get number of stages (-1 skips vector, 0 for mean only) */
  211. stages = get_vlc2(bitbuf, svq1_intra_multistage[level].table, 3, 3) - 1;
  212. if (stages == -1) {
  213. for (y=0; y < height; y++) {
  214. memset (&dst[y*(pitch / 4)], 0, width);
  215. }
  216. continue; /* skip vector */
  217. }
  218. if ((stages > 0) && (level >= 4)) {
  219. #ifdef DEBUG_SVQ1
  220. av_log(s->avctx, AV_LOG_INFO, "Error (svq1_decode_block_intra): invalid vector: stages=%i level=%i\n",stages,level);
  221. #endif
  222. return -1; /* invalid vector */
  223. }
  224. mean = get_vlc2(bitbuf, svq1_intra_mean.table, 8, 3);
  225. if (stages == 0) {
  226. for (y=0; y < height; y++) {
  227. memset (&dst[y*(pitch / 4)], mean, width);
  228. }
  229. } else {
  230. SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_intra_codebooks);
  231. SVQ1_DO_CODEBOOK_INTRA()
  232. }
  233. }
  234. return 0;
  235. }
  236. static int svq1_decode_block_non_intra (GetBitContext *bitbuf, uint8_t *pixels, int pitch ) {
  237. uint32_t bit_cache;
  238. uint8_t *list[63];
  239. uint32_t *dst;
  240. const uint32_t *codebook;
  241. int entries[6];
  242. int i, j, m, n;
  243. int mean, stages;
  244. int x, y, width, height, level;
  245. uint32_t n1, n2, n3, n4;
  246. /* initialize list for breadth first processing of vectors */
  247. list[0] = pixels;
  248. /* recursively process vector */
  249. for (i=0, m=1, n=1, level=5; i < n; i++) {
  250. SVQ1_PROCESS_VECTOR();
  251. /* destination address and vector size */
  252. dst = (uint32_t *) list[i];
  253. width = 1 << ((4 + level) /2);
  254. height = 1 << ((3 + level) /2);
  255. /* get number of stages (-1 skips vector, 0 for mean only) */
  256. stages = get_vlc2(bitbuf, svq1_inter_multistage[level].table, 3, 2) - 1;
  257. if (stages == -1) continue; /* skip vector */
  258. if ((stages > 0) && (level >= 4)) {
  259. #ifdef DEBUG_SVQ1
  260. av_log(s->avctx, AV_LOG_INFO, "Error (svq1_decode_block_non_intra): invalid vector: stages=%i level=%i\n",stages,level);
  261. #endif
  262. return -1; /* invalid vector */
  263. }
  264. mean = get_vlc2(bitbuf, svq1_inter_mean.table, 9, 3) - 256;
  265. SVQ1_CALC_CODEBOOK_ENTRIES(ff_svq1_inter_codebooks);
  266. SVQ1_DO_CODEBOOK_NONINTRA()
  267. }
  268. return 0;
  269. }
  270. static int svq1_decode_motion_vector (GetBitContext *bitbuf, svq1_pmv *mv, svq1_pmv **pmv) {
  271. int diff;
  272. int i;
  273. for (i=0; i < 2; i++) {
  274. /* get motion code */
  275. diff = get_vlc2(bitbuf, svq1_motion_component.table, 7, 2);
  276. if(diff<0)
  277. return -1;
  278. else if(diff){
  279. if(get_bits1(bitbuf)) diff= -diff;
  280. }
  281. /* add median of motion vector predictors and clip result */
  282. if (i == 1)
  283. mv->y = ((diff + mid_pred(pmv[0]->y, pmv[1]->y, pmv[2]->y)) << 26) >> 26;
  284. else
  285. mv->x = ((diff + mid_pred(pmv[0]->x, pmv[1]->x, pmv[2]->x)) << 26) >> 26;
  286. }
  287. return 0;
  288. }
  289. static void svq1_skip_block (uint8_t *current, uint8_t *previous, int pitch, int x, int y) {
  290. uint8_t *src;
  291. uint8_t *dst;
  292. int i;
  293. src = &previous[x + y*pitch];
  294. dst = current;
  295. for (i=0; i < 16; i++) {
  296. memcpy (dst, src, 16);
  297. src += pitch;
  298. dst += pitch;
  299. }
  300. }
  301. static int svq1_motion_inter_block (MpegEncContext *s, GetBitContext *bitbuf,
  302. uint8_t *current, uint8_t *previous, int pitch,
  303. svq1_pmv *motion, int x, int y) {
  304. uint8_t *src;
  305. uint8_t *dst;
  306. svq1_pmv mv;
  307. svq1_pmv *pmv[3];
  308. int result;
  309. /* predict and decode motion vector */
  310. pmv[0] = &motion[0];
  311. if (y == 0) {
  312. pmv[1] =
  313. pmv[2] = pmv[0];
  314. }
  315. else {
  316. pmv[1] = &motion[(x / 8) + 2];
  317. pmv[2] = &motion[(x / 8) + 4];
  318. }
  319. result = svq1_decode_motion_vector (bitbuf, &mv, pmv);
  320. if (result != 0)
  321. return result;
  322. motion[0].x =
  323. motion[(x / 8) + 2].x =
  324. motion[(x / 8) + 3].x = mv.x;
  325. motion[0].y =
  326. motion[(x / 8) + 2].y =
  327. motion[(x / 8) + 3].y = mv.y;
  328. if(y + (mv.y >> 1)<0)
  329. mv.y= 0;
  330. if(x + (mv.x >> 1)<0)
  331. mv.x= 0;
  332. #if 0
  333. int w= (s->width+15)&~15;
  334. int h= (s->height+15)&~15;
  335. if(x + (mv.x >> 1)<0 || y + (mv.y >> 1)<0 || x + (mv.x >> 1) + 16 > w || y + (mv.y >> 1) + 16> h)
  336. av_log(s->avctx, AV_LOG_INFO, "%d %d %d %d\n", x, y, x + (mv.x >> 1), y + (mv.y >> 1));
  337. #endif
  338. src = &previous[(x + (mv.x >> 1)) + (y + (mv.y >> 1))*pitch];
  339. dst = current;
  340. s->dsp.put_pixels_tab[0][((mv.y & 1) << 1) | (mv.x & 1)](dst,src,pitch,16);
  341. return 0;
  342. }
  343. static int svq1_motion_inter_4v_block (MpegEncContext *s, GetBitContext *bitbuf,
  344. uint8_t *current, uint8_t *previous, int pitch,
  345. svq1_pmv *motion,int x, int y) {
  346. uint8_t *src;
  347. uint8_t *dst;
  348. svq1_pmv mv;
  349. svq1_pmv *pmv[4];
  350. int i, result;
  351. /* predict and decode motion vector (0) */
  352. pmv[0] = &motion[0];
  353. if (y == 0) {
  354. pmv[1] =
  355. pmv[2] = pmv[0];
  356. }
  357. else {
  358. pmv[1] = &motion[(x / 8) + 2];
  359. pmv[2] = &motion[(x / 8) + 4];
  360. }
  361. result = svq1_decode_motion_vector (bitbuf, &mv, pmv);
  362. if (result != 0)
  363. return result;
  364. /* predict and decode motion vector (1) */
  365. pmv[0] = &mv;
  366. if (y == 0) {
  367. pmv[1] =
  368. pmv[2] = pmv[0];
  369. }
  370. else {
  371. pmv[1] = &motion[(x / 8) + 3];
  372. }
  373. result = svq1_decode_motion_vector (bitbuf, &motion[0], pmv);
  374. if (result != 0)
  375. return result;
  376. /* predict and decode motion vector (2) */
  377. pmv[1] = &motion[0];
  378. pmv[2] = &motion[(x / 8) + 1];
  379. result = svq1_decode_motion_vector (bitbuf, &motion[(x / 8) + 2], pmv);
  380. if (result != 0)
  381. return result;
  382. /* predict and decode motion vector (3) */
  383. pmv[2] = &motion[(x / 8) + 2];
  384. pmv[3] = &motion[(x / 8) + 3];
  385. result = svq1_decode_motion_vector (bitbuf, pmv[3], pmv);
  386. if (result != 0)
  387. return result;
  388. /* form predictions */
  389. for (i=0; i < 4; i++) {
  390. int mvx= pmv[i]->x + (i&1)*16;
  391. int mvy= pmv[i]->y + (i>>1)*16;
  392. ///XXX /FIXME clipping or padding?
  393. if(y + (mvy >> 1)<0)
  394. mvy= 0;
  395. if(x + (mvx >> 1)<0)
  396. mvx= 0;
  397. #if 0
  398. int w= (s->width+15)&~15;
  399. int h= (s->height+15)&~15;
  400. if(x + (mvx >> 1)<0 || y + (mvy >> 1)<0 || x + (mvx >> 1) + 8 > w || y + (mvy >> 1) + 8> h)
  401. av_log(s->avctx, AV_LOG_INFO, "%d %d %d %d\n", x, y, x + (mvx >> 1), y + (mvy >> 1));
  402. #endif
  403. src = &previous[(x + (mvx >> 1)) + (y + (mvy >> 1))*pitch];
  404. dst = current;
  405. s->dsp.put_pixels_tab[1][((mvy & 1) << 1) | (mvx & 1)](dst,src,pitch,8);
  406. /* select next block */
  407. if (i & 1) {
  408. current += 8*(pitch - 1);
  409. } else {
  410. current += 8;
  411. }
  412. }
  413. return 0;
  414. }
  415. static int svq1_decode_delta_block (MpegEncContext *s, GetBitContext *bitbuf,
  416. uint8_t *current, uint8_t *previous, int pitch,
  417. svq1_pmv *motion, int x, int y) {
  418. uint32_t block_type;
  419. int result = 0;
  420. /* get block type */
  421. block_type = get_vlc2(bitbuf, svq1_block_type.table, 2, 2);
  422. /* reset motion vectors */
  423. if (block_type == SVQ1_BLOCK_SKIP || block_type == SVQ1_BLOCK_INTRA) {
  424. motion[0].x =
  425. motion[0].y =
  426. motion[(x / 8) + 2].x =
  427. motion[(x / 8) + 2].y =
  428. motion[(x / 8) + 3].x =
  429. motion[(x / 8) + 3].y = 0;
  430. }
  431. switch (block_type) {
  432. case SVQ1_BLOCK_SKIP:
  433. svq1_skip_block (current, previous, pitch, x, y);
  434. break;
  435. case SVQ1_BLOCK_INTER:
  436. result = svq1_motion_inter_block (s, bitbuf, current, previous, pitch, motion, x, y);
  437. if (result != 0)
  438. {
  439. #ifdef DEBUG_SVQ1
  440. av_log(s->avctx, AV_LOG_INFO, "Error in svq1_motion_inter_block %i\n",result);
  441. #endif
  442. break;
  443. }
  444. result = svq1_decode_block_non_intra (bitbuf, current, pitch);
  445. break;
  446. case SVQ1_BLOCK_INTER_4V:
  447. result = svq1_motion_inter_4v_block (s, bitbuf, current, previous, pitch, motion, x, y);
  448. if (result != 0)
  449. {
  450. #ifdef DEBUG_SVQ1
  451. av_log(s->avctx, AV_LOG_INFO, "Error in svq1_motion_inter_4v_block %i\n",result);
  452. #endif
  453. break;
  454. }
  455. result = svq1_decode_block_non_intra (bitbuf, current, pitch);
  456. break;
  457. case SVQ1_BLOCK_INTRA:
  458. result = svq1_decode_block_intra (bitbuf, current, pitch);
  459. break;
  460. }
  461. return result;
  462. }
  463. uint16_t ff_svq1_packet_checksum (const uint8_t *data, const int length, int value) {
  464. int i;
  465. for (i=0; i < length; i++) {
  466. value = checksum_table[data[i] ^ (value >> 8)] ^ ((value & 0xFF) << 8);
  467. }
  468. return value;
  469. }
  470. static void svq1_parse_string (GetBitContext *bitbuf, uint8_t *out) {
  471. uint8_t seed;
  472. int i;
  473. out[0] = get_bits (bitbuf, 8);
  474. seed = string_table[out[0]];
  475. for (i=1; i <= out[0]; i++) {
  476. out[i] = get_bits (bitbuf, 8) ^ seed;
  477. seed = string_table[out[i] ^ seed];
  478. }
  479. }
  480. static int svq1_decode_frame_header (GetBitContext *bitbuf,MpegEncContext *s) {
  481. int frame_size_code;
  482. int temporal_reference;
  483. temporal_reference = get_bits (bitbuf, 8);
  484. /* frame type */
  485. s->pict_type= get_bits (bitbuf, 2)+1;
  486. if(s->pict_type==4)
  487. return -1;
  488. if (s->pict_type == FF_I_TYPE) {
  489. /* unknown fields */
  490. if (s->f_code == 0x50 || s->f_code == 0x60) {
  491. int csum = get_bits (bitbuf, 16);
  492. csum = ff_svq1_packet_checksum (bitbuf->buffer, bitbuf->size_in_bits>>3, csum);
  493. // av_log(s->avctx, AV_LOG_INFO, "%s checksum (%02x) for packet data\n",
  494. // (csum == 0) ? "correct" : "incorrect", csum);
  495. }
  496. if ((s->f_code ^ 0x10) >= 0x50) {
  497. uint8_t msg[256];
  498. svq1_parse_string (bitbuf, msg);
  499. av_log(s->avctx, AV_LOG_INFO, "embedded message: \"%s\"\n", (char *) msg);
  500. }
  501. skip_bits (bitbuf, 2);
  502. skip_bits (bitbuf, 2);
  503. skip_bits1 (bitbuf);
  504. /* load frame size */
  505. frame_size_code = get_bits (bitbuf, 3);
  506. if (frame_size_code == 7) {
  507. /* load width, height (12 bits each) */
  508. s->width = get_bits (bitbuf, 12);
  509. s->height = get_bits (bitbuf, 12);
  510. if (!s->width || !s->height)
  511. return -1;
  512. } else {
  513. /* get width, height from table */
  514. s->width = ff_svq1_frame_size_table[frame_size_code].width;
  515. s->height = ff_svq1_frame_size_table[frame_size_code].height;
  516. }
  517. }
  518. /* unknown fields */
  519. if (get_bits1 (bitbuf) == 1) {
  520. skip_bits1 (bitbuf); /* use packet checksum if (1) */
  521. skip_bits1 (bitbuf); /* component checksums after image data if (1) */
  522. if (get_bits (bitbuf, 2) != 0)
  523. return -1;
  524. }
  525. if (get_bits1 (bitbuf) == 1) {
  526. skip_bits1 (bitbuf);
  527. skip_bits (bitbuf, 4);
  528. skip_bits1 (bitbuf);
  529. skip_bits (bitbuf, 2);
  530. while (get_bits1 (bitbuf) == 1) {
  531. skip_bits (bitbuf, 8);
  532. }
  533. }
  534. return 0;
  535. }
  536. static int svq1_decode_frame(AVCodecContext *avctx,
  537. void *data, int *data_size,
  538. const uint8_t *buf, int buf_size)
  539. {
  540. MpegEncContext *s=avctx->priv_data;
  541. uint8_t *current, *previous;
  542. int result, i, x, y, width, height;
  543. AVFrame *pict = data;
  544. /* initialize bit buffer */
  545. init_get_bits(&s->gb,buf,buf_size*8);
  546. /* decode frame header */
  547. s->f_code = get_bits (&s->gb, 22);
  548. if ((s->f_code & ~0x70) || !(s->f_code & 0x60))
  549. return -1;
  550. /* swap some header bytes (why?) */
  551. if (s->f_code != 0x20) {
  552. uint32_t *src = (uint32_t *) (buf + 4);
  553. for (i=0; i < 4; i++) {
  554. src[i] = ((src[i] << 16) | (src[i] >> 16)) ^ src[7 - i];
  555. }
  556. }
  557. result = svq1_decode_frame_header (&s->gb, s);
  558. if (result != 0)
  559. {
  560. #ifdef DEBUG_SVQ1
  561. av_log(s->avctx, AV_LOG_INFO, "Error in svq1_decode_frame_header %i\n",result);
  562. #endif
  563. return result;
  564. }
  565. avcodec_set_dimensions(avctx, s->width, s->height);
  566. //FIXME this avoids some confusion for "B frames" without 2 references
  567. //this should be removed after libavcodec can handle more flexible picture types & ordering
  568. if(s->pict_type==FF_B_TYPE && s->last_picture_ptr==NULL) return buf_size;
  569. if(avctx->hurry_up && s->pict_type==FF_B_TYPE) return buf_size;
  570. if( (avctx->skip_frame >= AVDISCARD_NONREF && s->pict_type==FF_B_TYPE)
  571. ||(avctx->skip_frame >= AVDISCARD_NONKEY && s->pict_type!=FF_I_TYPE)
  572. || avctx->skip_frame >= AVDISCARD_ALL)
  573. return buf_size;
  574. if(MPV_frame_start(s, avctx) < 0)
  575. return -1;
  576. /* decode y, u and v components */
  577. for (i=0; i < 3; i++) {
  578. int linesize;
  579. if (i == 0) {
  580. width = (s->width+15)&~15;
  581. height = (s->height+15)&~15;
  582. linesize= s->linesize;
  583. } else {
  584. if(s->flags&CODEC_FLAG_GRAY) break;
  585. width = (s->width/4+15)&~15;
  586. height = (s->height/4+15)&~15;
  587. linesize= s->uvlinesize;
  588. }
  589. current = s->current_picture.data[i];
  590. if(s->pict_type==FF_B_TYPE){
  591. previous = s->next_picture.data[i];
  592. }else{
  593. previous = s->last_picture.data[i];
  594. }
  595. if (s->pict_type == FF_I_TYPE) {
  596. /* keyframe */
  597. for (y=0; y < height; y+=16) {
  598. for (x=0; x < width; x+=16) {
  599. result = svq1_decode_block_intra (&s->gb, &current[x], linesize);
  600. if (result != 0)
  601. {
  602. //#ifdef DEBUG_SVQ1
  603. av_log(s->avctx, AV_LOG_INFO, "Error in svq1_decode_block %i (keyframe)\n",result);
  604. //#endif
  605. return result;
  606. }
  607. }
  608. current += 16*linesize;
  609. }
  610. } else {
  611. svq1_pmv pmv[width/8+3];
  612. /* delta frame */
  613. memset (pmv, 0, ((width / 8) + 3) * sizeof(svq1_pmv));
  614. for (y=0; y < height; y+=16) {
  615. for (x=0; x < width; x+=16) {
  616. result = svq1_decode_delta_block (s, &s->gb, &current[x], previous,
  617. linesize, pmv, x, y);
  618. if (result != 0)
  619. {
  620. #ifdef DEBUG_SVQ1
  621. av_log(s->avctx, AV_LOG_INFO, "Error in svq1_decode_delta_block %i\n",result);
  622. #endif
  623. return result;
  624. }
  625. }
  626. pmv[0].x =
  627. pmv[0].y = 0;
  628. current += 16*linesize;
  629. }
  630. }
  631. }
  632. *pict = *(AVFrame*)&s->current_picture;
  633. MPV_frame_end(s);
  634. *data_size=sizeof(AVFrame);
  635. return buf_size;
  636. }
  637. static av_cold int svq1_decode_init(AVCodecContext *avctx)
  638. {
  639. MpegEncContext *s = avctx->priv_data;
  640. int i;
  641. MPV_decode_defaults(s);
  642. s->avctx = avctx;
  643. s->width = (avctx->width+3)&~3;
  644. s->height = (avctx->height+3)&~3;
  645. s->codec_id= avctx->codec->id;
  646. avctx->pix_fmt = PIX_FMT_YUV410P;
  647. avctx->has_b_frames= 1; // not true, but DP frames and these behave like unidirectional b frames
  648. s->flags= avctx->flags;
  649. if (MPV_common_init(s) < 0) return -1;
  650. init_vlc(&svq1_block_type, 2, 4,
  651. &ff_svq1_block_type_vlc[0][1], 2, 1,
  652. &ff_svq1_block_type_vlc[0][0], 2, 1, 1);
  653. init_vlc(&svq1_motion_component, 7, 33,
  654. &mvtab[0][1], 2, 1,
  655. &mvtab[0][0], 2, 1, 1);
  656. for (i = 0; i < 6; i++) {
  657. init_vlc(&svq1_intra_multistage[i], 3, 8,
  658. &ff_svq1_intra_multistage_vlc[i][0][1], 2, 1,
  659. &ff_svq1_intra_multistage_vlc[i][0][0], 2, 1, 1);
  660. init_vlc(&svq1_inter_multistage[i], 3, 8,
  661. &ff_svq1_inter_multistage_vlc[i][0][1], 2, 1,
  662. &ff_svq1_inter_multistage_vlc[i][0][0], 2, 1, 1);
  663. }
  664. init_vlc(&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, 1);
  667. init_vlc(&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, 1);
  670. return 0;
  671. }
  672. static av_cold int svq1_decode_end(AVCodecContext *avctx)
  673. {
  674. MpegEncContext *s = avctx->priv_data;
  675. MPV_common_end(s);
  676. return 0;
  677. }
  678. AVCodec svq1_decoder = {
  679. "svq1",
  680. CODEC_TYPE_VIDEO,
  681. CODEC_ID_SVQ1,
  682. sizeof(MpegEncContext),
  683. svq1_decode_init,
  684. NULL,
  685. svq1_decode_end,
  686. svq1_decode_frame,
  687. CODEC_CAP_DR1,
  688. .flush= ff_mpeg_flush,
  689. .pix_fmts= (enum PixelFormat[]){PIX_FMT_YUV410P, PIX_FMT_NONE},
  690. .long_name= NULL_IF_CONFIG_SMALL("Sorenson Vector Quantizer 1"),
  691. };