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.

850 lines
27KB

  1. /*
  2. * This file is part of Libav.
  3. *
  4. * Libav is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU Lesser General Public
  6. * License as published by the Free Software Foundation; either
  7. * version 2.1 of the License, or (at your option) any later version.
  8. *
  9. * Libav is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  12. * Lesser General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU Lesser General Public
  15. * License along with Libav; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. /**
  19. * @file
  20. * @brief IntraX8 (J-Frame) subdecoder, used by WMV2 and VC-1
  21. */
  22. #include "avcodec.h"
  23. #include "get_bits.h"
  24. #include "idctdsp.h"
  25. #include "mpegvideo.h"
  26. #include "msmpeg4data.h"
  27. #include "intrax8huf.h"
  28. #include "intrax8.h"
  29. #include "intrax8dsp.h"
  30. #define MAX_TABLE_DEPTH(table_bits, max_bits) \
  31. ((max_bits + table_bits - 1) / table_bits)
  32. #define DC_VLC_BITS 9
  33. #define AC_VLC_BITS 9
  34. #define OR_VLC_BITS 7
  35. #define DC_VLC_MTD MAX_TABLE_DEPTH(DC_VLC_BITS, MAX_DC_VLC_BITS)
  36. #define AC_VLC_MTD MAX_TABLE_DEPTH(AC_VLC_BITS, MAX_AC_VLC_BITS)
  37. #define OR_VLC_MTD MAX_TABLE_DEPTH(OR_VLC_BITS, MAX_OR_VLC_BITS)
  38. static VLC j_ac_vlc[2][2][8]; // [quant < 13], [intra / inter], [select]
  39. static VLC j_dc_vlc[2][8]; // [quant], [select]
  40. static VLC j_orient_vlc[2][4]; // [quant], [select]
  41. static av_cold void x8_vlc_init(void)
  42. {
  43. int i;
  44. int offset = 0;
  45. int sizeidx = 0;
  46. static const uint16_t sizes[8 * 4 + 8 * 2 + 2 + 4] = {
  47. 576, 548, 582, 618, 546, 616, 560, 642,
  48. 584, 582, 704, 664, 512, 544, 656, 640,
  49. 512, 648, 582, 566, 532, 614, 596, 648,
  50. 586, 552, 584, 590, 544, 578, 584, 624,
  51. 528, 528, 526, 528, 536, 528, 526, 544,
  52. 544, 512, 512, 528, 528, 544, 512, 544,
  53. 128, 128, 128, 128, 128, 128,
  54. };
  55. static VLC_TYPE table[28150][2];
  56. // set ac tables
  57. #define init_ac_vlc(dst, src) \
  58. do { \
  59. dst.table = &table[offset]; \
  60. dst.table_allocated = sizes[sizeidx]; \
  61. offset += sizes[sizeidx++]; \
  62. init_vlc(&dst, AC_VLC_BITS, 77, &src[1], 4, 2, &src[0], 4, 2, \
  63. INIT_VLC_USE_NEW_STATIC); \
  64. } while(0)
  65. for (i = 0; i < 8; i++) {
  66. init_ac_vlc(j_ac_vlc[0][0][i], x8_ac0_highquant_table[i][0]);
  67. init_ac_vlc(j_ac_vlc[0][1][i], x8_ac1_highquant_table[i][0]);
  68. init_ac_vlc(j_ac_vlc[1][0][i], x8_ac0_lowquant_table[i][0]);
  69. init_ac_vlc(j_ac_vlc[1][1][i], x8_ac1_lowquant_table[i][0]);
  70. }
  71. #undef init_ac_vlc
  72. // set dc tables
  73. #define init_dc_vlc(dst, src) \
  74. do { \
  75. dst.table = &table[offset]; \
  76. dst.table_allocated = sizes[sizeidx]; \
  77. offset += sizes[sizeidx++]; \
  78. init_vlc(&dst, DC_VLC_BITS, 34, &src[1], 4, 2, &src[0], 4, 2, \
  79. INIT_VLC_USE_NEW_STATIC); \
  80. } while(0)
  81. for (i = 0; i < 8; i++) {
  82. init_dc_vlc(j_dc_vlc[0][i], x8_dc_highquant_table[i][0]);
  83. init_dc_vlc(j_dc_vlc[1][i], x8_dc_lowquant_table[i][0]);
  84. }
  85. #undef init_dc_vlc
  86. // set orient tables
  87. #define init_or_vlc(dst, src) \
  88. do { \
  89. dst.table = &table[offset]; \
  90. dst.table_allocated = sizes[sizeidx]; \
  91. offset += sizes[sizeidx++]; \
  92. init_vlc(&dst, OR_VLC_BITS, 12, &src[1], 4, 2, &src[0], 4, 2, \
  93. INIT_VLC_USE_NEW_STATIC); \
  94. } while(0)
  95. for (i = 0; i < 2; i++)
  96. init_or_vlc(j_orient_vlc[0][i], x8_orient_highquant_table[i][0]);
  97. for (i = 0; i < 4; i++)
  98. init_or_vlc(j_orient_vlc[1][i], x8_orient_lowquant_table[i][0]);
  99. #undef init_or_vlc
  100. if (offset != sizeof(table)/sizeof(VLC_TYPE)/2)
  101. av_log(NULL, AV_LOG_ERROR, "table size %zd does not match needed %i\n",
  102. sizeof(table) / sizeof(VLC_TYPE) / 2, offset);
  103. }
  104. static void x8_reset_vlc_tables(IntraX8Context *w)
  105. {
  106. memset(w->j_dc_vlc, 0, sizeof(w->j_dc_vlc));
  107. memset(w->j_ac_vlc, 0, sizeof(w->j_ac_vlc));
  108. w->j_orient_vlc = NULL;
  109. }
  110. static inline void x8_select_ac_table(IntraX8Context *const w, int mode)
  111. {
  112. MpegEncContext *const s = w->s;
  113. int table_index;
  114. assert(mode < 4);
  115. if (w->j_ac_vlc[mode])
  116. return;
  117. table_index = get_bits(&s->gb, 3);
  118. // 2 modes use same tables
  119. w->j_ac_vlc[mode] = &j_ac_vlc[w->quant < 13][mode >> 1][table_index];
  120. assert(w->j_ac_vlc[mode]);
  121. }
  122. static inline int x8_get_orient_vlc(IntraX8Context *w)
  123. {
  124. MpegEncContext *const s = w->s;
  125. if (!w->j_orient_vlc) {
  126. int table_index = get_bits(&s->gb, 1 + (w->quant < 13));
  127. w->j_orient_vlc = &j_orient_vlc[w->quant < 13][table_index];
  128. }
  129. assert(w->j_orient_vlc);
  130. assert(w->j_orient_vlc->table);
  131. return get_vlc2(&s->gb, w->j_orient_vlc->table, OR_VLC_BITS, OR_VLC_MTD);
  132. }
  133. #define extra_bits(eb) (eb) // 3 bits
  134. #define extra_run (0xFF << 8) // 1 bit
  135. #define extra_level (0x00 << 8) // 1 bit
  136. #define run_offset(r) ((r) << 16) // 6 bits
  137. #define level_offset(l) ((l) << 24) // 5 bits
  138. static const uint32_t ac_decode_table[] = {
  139. /* 46 */ extra_bits(3) | extra_run | run_offset(16) | level_offset(0),
  140. /* 47 */ extra_bits(3) | extra_run | run_offset(24) | level_offset(0),
  141. /* 48 */ extra_bits(2) | extra_run | run_offset(4) | level_offset(1),
  142. /* 49 */ extra_bits(3) | extra_run | run_offset(8) | level_offset(1),
  143. /* 50 */ extra_bits(5) | extra_run | run_offset(32) | level_offset(0),
  144. /* 51 */ extra_bits(4) | extra_run | run_offset(16) | level_offset(1),
  145. /* 52 */ extra_bits(2) | extra_level | run_offset(0) | level_offset(4),
  146. /* 53 */ extra_bits(2) | extra_level | run_offset(0) | level_offset(8),
  147. /* 54 */ extra_bits(2) | extra_level | run_offset(0) | level_offset(12),
  148. /* 55 */ extra_bits(3) | extra_level | run_offset(0) | level_offset(16),
  149. /* 56 */ extra_bits(3) | extra_level | run_offset(0) | level_offset(24),
  150. /* 57 */ extra_bits(2) | extra_level | run_offset(1) | level_offset(3),
  151. /* 58 */ extra_bits(3) | extra_level | run_offset(1) | level_offset(7),
  152. /* 59 */ extra_bits(2) | extra_run | run_offset(16) | level_offset(0),
  153. /* 60 */ extra_bits(2) | extra_run | run_offset(20) | level_offset(0),
  154. /* 61 */ extra_bits(2) | extra_run | run_offset(24) | level_offset(0),
  155. /* 62 */ extra_bits(2) | extra_run | run_offset(28) | level_offset(0),
  156. /* 63 */ extra_bits(4) | extra_run | run_offset(32) | level_offset(0),
  157. /* 64 */ extra_bits(4) | extra_run | run_offset(48) | level_offset(0),
  158. /* 65 */ extra_bits(2) | extra_run | run_offset(4) | level_offset(1),
  159. /* 66 */ extra_bits(3) | extra_run | run_offset(8) | level_offset(1),
  160. /* 67 */ extra_bits(4) | extra_run | run_offset(16) | level_offset(1),
  161. /* 68 */ extra_bits(2) | extra_level | run_offset(0) | level_offset(4),
  162. /* 69 */ extra_bits(3) | extra_level | run_offset(0) | level_offset(8),
  163. /* 70 */ extra_bits(4) | extra_level | run_offset(0) | level_offset(16),
  164. /* 71 */ extra_bits(2) | extra_level | run_offset(1) | level_offset(3),
  165. /* 72 */ extra_bits(3) | extra_level | run_offset(1) | level_offset(7),
  166. };
  167. #undef extra_bits
  168. #undef extra_run
  169. #undef extra_level
  170. #undef run_offset
  171. #undef level_offset
  172. static void x8_get_ac_rlf(IntraX8Context *const w, const int mode,
  173. int *const run, int *const level, int *const final)
  174. {
  175. MpegEncContext *const s = w->s;
  176. int i, e;
  177. // x8_select_ac_table(w, mode);
  178. i = get_vlc2(&s->gb, w->j_ac_vlc[mode]->table, AC_VLC_BITS, AC_VLC_MTD);
  179. if (i < 46) { // [0-45]
  180. int t, l;
  181. if (i < 0) {
  182. (*level) =
  183. (*final) = // prevent 'may be used unilitialized'
  184. (*run) = 64; // this would cause error exit in the ac loop
  185. return;
  186. }
  187. /*
  188. * i == 0-15 r = 0-15 l = 0; r = i & %01111
  189. * i == 16-19 r = 0-3 l = 1; r = i & %00011
  190. * i == 20-21 r = 0-1 l = 2; r = i & %00001
  191. * i == 22 r = 0 l = 3; r = i & %00000
  192. */
  193. (*final) =
  194. t = (i > 22);
  195. i -= 23 * t;
  196. /* l = lut_l[i / 2] = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 2, 3 }[i >> 1];
  197. * 11 10'01 01'00 00'00 00'00 00'00 00 => 0xE50000 */
  198. l = (0xE50000 >> (i & (0x1E))) & 3; // 0x1E or (~1) or ((i >> 1) << 1)
  199. /* t = lut_mask[l] = { 0x0f, 0x03, 0x01, 0x00 }[l];
  200. * as i < 256 the higher bits do not matter */
  201. t = (0x01030F >> (l << 3));
  202. (*run) = i & t;
  203. (*level) = l;
  204. } else if (i < 73) { // [46-72]
  205. uint32_t sm;
  206. uint32_t mask;
  207. i -= 46;
  208. sm = ac_decode_table[i];
  209. e = get_bits(&s->gb, sm & 0xF);
  210. sm >>= 8; // 3bits
  211. mask = sm & 0xff;
  212. sm >>= 8; // 1bit
  213. (*run) = (sm & 0xff) + (e & (mask)); // 6bits
  214. (*level) = (sm >> 8) + (e & (~mask)); // 5bits
  215. (*final) = i > (58 - 46);
  216. } else if (i < 75) { // [73-74]
  217. static const uint8_t crazy_mix_runlevel[32] = {
  218. 0x22, 0x32, 0x33, 0x53, 0x23, 0x42, 0x43, 0x63,
  219. 0x24, 0x52, 0x34, 0x73, 0x25, 0x62, 0x44, 0x83,
  220. 0x26, 0x72, 0x35, 0x54, 0x27, 0x82, 0x45, 0x64,
  221. 0x28, 0x92, 0x36, 0x74, 0x29, 0xa2, 0x46, 0x84,
  222. };
  223. (*final) = !(i & 1);
  224. e = get_bits(&s->gb, 5); // get the extra bits
  225. (*run) = crazy_mix_runlevel[e] >> 4;
  226. (*level) = crazy_mix_runlevel[e] & 0x0F;
  227. } else {
  228. (*level) = get_bits(&s->gb, 7 - 3 * (i & 1));
  229. (*run) = get_bits(&s->gb, 6);
  230. (*final) = get_bits1(&s->gb);
  231. }
  232. return;
  233. }
  234. /* static const uint8_t dc_extra_sbits[] = {
  235. * 0, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7,
  236. * }; */
  237. static const uint8_t dc_index_offset[] = {
  238. 0, 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
  239. };
  240. static int x8_get_dc_rlf(IntraX8Context *const w,
  241. int const mode, int *const level, int *const final)
  242. {
  243. MpegEncContext *const s = w->s;
  244. int i, e, c;
  245. assert(mode < 3);
  246. if (!w->j_dc_vlc[mode]) {
  247. int table_index = get_bits(&s->gb, 3);
  248. // 4 modes, same table
  249. w->j_dc_vlc[mode] = &j_dc_vlc[w->quant < 13][table_index];
  250. }
  251. assert(w->j_dc_vlc);
  252. assert(w->j_dc_vlc[mode]->table);
  253. i = get_vlc2(&s->gb, w->j_dc_vlc[mode]->table, DC_VLC_BITS, DC_VLC_MTD);
  254. /* (i >= 17) { i -= 17; final =1; } */
  255. c = i > 16;
  256. (*final) = c;
  257. i -= 17 * c;
  258. if (i <= 0) {
  259. (*level) = 0;
  260. return -i;
  261. }
  262. c = (i + 1) >> 1; // hackish way to calculate dc_extra_sbits[]
  263. c -= c > 1;
  264. e = get_bits(&s->gb, c); // get the extra bits
  265. i = dc_index_offset[i] + (e >> 1);
  266. e = -(e & 1); // 0, 0xffffff
  267. (*level) = (i ^ e) - e; // (i ^ 0) -0 , (i ^ 0xff) - (-1)
  268. return 0;
  269. }
  270. // end of huffman
  271. static int x8_setup_spatial_predictor(IntraX8Context *const w, const int chroma)
  272. {
  273. MpegEncContext *const s = w->s;
  274. int range;
  275. int sum;
  276. int quant;
  277. w->dsp.setup_spatial_compensation(s->dest[chroma], s->sc.edge_emu_buffer,
  278. s->current_picture.f->linesize[chroma > 0],
  279. &range, &sum, w->edges);
  280. if (chroma) {
  281. w->orient = w->chroma_orient;
  282. quant = w->quant_dc_chroma;
  283. } else {
  284. quant = w->quant;
  285. }
  286. w->flat_dc = 0;
  287. if (range < quant || range < 3) {
  288. w->orient = 0;
  289. // yep you read right, a +-1 idct error may break decoding!
  290. if (range < 3) {
  291. w->flat_dc = 1;
  292. sum += 9;
  293. // ((1 << 17) + 9) / (8 + 8 + 1 + 2) = 6899
  294. w->predicted_dc = (sum * 6899) >> 17;
  295. }
  296. }
  297. if (chroma)
  298. return 0;
  299. assert(w->orient < 3);
  300. if (range < 2 * w->quant) {
  301. if ((w->edges & 3) == 0) {
  302. if (w->orient == 1)
  303. w->orient = 11;
  304. if (w->orient == 2)
  305. w->orient = 10;
  306. } else {
  307. w->orient = 0;
  308. }
  309. w->raw_orient = 0;
  310. } else {
  311. static const uint8_t prediction_table[3][12] = {
  312. { 0, 8, 4, 10, 11, 2, 6, 9, 1, 3, 5, 7 },
  313. { 4, 0, 8, 11, 10, 3, 5, 2, 6, 9, 1, 7 },
  314. { 8, 0, 4, 10, 11, 1, 7, 2, 6, 9, 3, 5 },
  315. };
  316. w->raw_orient = x8_get_orient_vlc(w);
  317. if (w->raw_orient < 0)
  318. return -1;
  319. assert(w->raw_orient < 12);
  320. assert(w->orient < 3);
  321. w->orient = prediction_table[w->orient][w->raw_orient];
  322. }
  323. return 0;
  324. }
  325. static void x8_update_predictions(IntraX8Context *const w, const int orient,
  326. const int est_run)
  327. {
  328. MpegEncContext *const s = w->s;
  329. w->prediction_table[s->mb_x * 2 + (s->mb_y & 1)] = (est_run << 2) + 1 * (orient == 4) + 2 * (orient == 8);
  330. /*
  331. * y = 2n + 0 -> // 0 2 4
  332. * y = 2n + 1 -> // 1 3 5
  333. */
  334. }
  335. static void x8_get_prediction_chroma(IntraX8Context *const w)
  336. {
  337. MpegEncContext *const s = w->s;
  338. w->edges = 1 * (!(s->mb_x >> 1));
  339. w->edges |= 2 * (!(s->mb_y >> 1));
  340. w->edges |= 4 * (s->mb_x >= (2 * s->mb_width - 1)); // mb_x for chroma would always be odd
  341. w->raw_orient = 0;
  342. // lut_co[8] = {inv,4,8,8, inv,4,8,8} <- => {1,1,0,0;1,1,0,0} => 0xCC
  343. if (w->edges & 3) {
  344. w->chroma_orient = 4 << ((0xCC >> w->edges) & 1);
  345. return;
  346. }
  347. // block[x - 1][y | 1 - 1)]
  348. w->chroma_orient = (w->prediction_table[2 * s->mb_x - 2] & 0x03) << 2;
  349. }
  350. static void x8_get_prediction(IntraX8Context *const w)
  351. {
  352. MpegEncContext *const s = w->s;
  353. int a, b, c, i;
  354. w->edges = 1 * (!s->mb_x);
  355. w->edges |= 2 * (!s->mb_y);
  356. w->edges |= 4 * (s->mb_x >= (2 * s->mb_width - 1));
  357. switch (w->edges & 3) {
  358. case 0:
  359. break;
  360. case 1:
  361. // take the one from the above block[0][y - 1]
  362. w->est_run = w->prediction_table[!(s->mb_y & 1)] >> 2;
  363. w->orient = 1;
  364. return;
  365. case 2:
  366. // take the one from the previous block[x - 1][0]
  367. w->est_run = w->prediction_table[2 * s->mb_x - 2] >> 2;
  368. w->orient = 2;
  369. return;
  370. case 3:
  371. w->est_run = 16;
  372. w->orient = 0;
  373. return;
  374. }
  375. // no edge cases
  376. b = w->prediction_table[2 * s->mb_x + !(s->mb_y & 1)]; // block[x ][y - 1]
  377. a = w->prediction_table[2 * s->mb_x - 2 + (s->mb_y & 1)]; // block[x - 1][y ]
  378. c = w->prediction_table[2 * s->mb_x - 2 + !(s->mb_y & 1)]; // block[x - 1][y - 1]
  379. w->est_run = FFMIN(b, a);
  380. /* This condition has nothing to do with w->edges, even if it looks
  381. * similar it would trigger if e.g. x = 3; y = 2;
  382. * I guess somebody wrote something wrong and it became standard. */
  383. if ((s->mb_x & s->mb_y) != 0)
  384. w->est_run = FFMIN(c, w->est_run);
  385. w->est_run >>= 2;
  386. a &= 3;
  387. b &= 3;
  388. c &= 3;
  389. i = (0xFFEAF4C4 >> (2 * b + 8 * a)) & 3;
  390. if (i != 3)
  391. w->orient = i;
  392. else
  393. w->orient = (0xFFEAD8 >> (2 * c + 8 * (w->quant > 12))) & 3;
  394. /*
  395. * lut1[b][a] = {
  396. * ->{ 0, 1, 0, pad },
  397. * { 0, 1, X, pad },
  398. * { 2, 2, 2, pad }
  399. * }
  400. * pad 2 2 2;
  401. * pad X 1 0;
  402. * pad 0 1 0 <-
  403. * -> 11 10 '10 10 '11 11'01 00 '11 00'01 00 => 0xEAF4C4
  404. *
  405. * lut2[q>12][c] = {
  406. * ->{ 0, 2, 1, pad},
  407. * { 2, 2, 2, pad}
  408. * }
  409. * pad 2 2 2;
  410. * pad 1 2 0 <-
  411. * -> 11 10'10 10 '11 01'10 00 => 0xEAD8
  412. */
  413. }
  414. static void x8_ac_compensation(IntraX8Context *const w, int const direction,
  415. int const dc_level)
  416. {
  417. MpegEncContext *const s = w->s;
  418. int t;
  419. #define B(x, y) s->block[0][s->idsp.idct_permutation[(x) + (y) * 8]]
  420. #define T(x) ((x) * dc_level + 0x8000) >> 16;
  421. switch (direction) {
  422. case 0:
  423. t = T(3811); // h
  424. B(1, 0) -= t;
  425. B(0, 1) -= t;
  426. t = T(487); // e
  427. B(2, 0) -= t;
  428. B(0, 2) -= t;
  429. t = T(506); // f
  430. B(3, 0) -= t;
  431. B(0, 3) -= t;
  432. t = T(135); // c
  433. B(4, 0) -= t;
  434. B(0, 4) -= t;
  435. B(2, 1) += t;
  436. B(1, 2) += t;
  437. B(3, 1) += t;
  438. B(1, 3) += t;
  439. t = T(173); // d
  440. B(5, 0) -= t;
  441. B(0, 5) -= t;
  442. t = T(61); // b
  443. B(6, 0) -= t;
  444. B(0, 6) -= t;
  445. B(5, 1) += t;
  446. B(1, 5) += t;
  447. t = T(42); // a
  448. B(7, 0) -= t;
  449. B(0, 7) -= t;
  450. B(4, 1) += t;
  451. B(1, 4) += t;
  452. B(4, 4) += t;
  453. t = T(1084); // g
  454. B(1, 1) += t;
  455. s->block_last_index[0] = FFMAX(s->block_last_index[0], 7 * 8);
  456. break;
  457. case 1:
  458. B(0, 1) -= T(6269);
  459. B(0, 3) -= T(708);
  460. B(0, 5) -= T(172);
  461. B(0, 7) -= T(73);
  462. s->block_last_index[0] = FFMAX(s->block_last_index[0], 7 * 8);
  463. break;
  464. case 2:
  465. B(1, 0) -= T(6269);
  466. B(3, 0) -= T(708);
  467. B(5, 0) -= T(172);
  468. B(7, 0) -= T(73);
  469. s->block_last_index[0] = FFMAX(s->block_last_index[0], 7);
  470. break;
  471. }
  472. #undef B
  473. #undef T
  474. }
  475. static void dsp_x8_put_solidcolor(uint8_t const pix, uint8_t *dst,
  476. int const linesize)
  477. {
  478. int k;
  479. for (k = 0; k < 8; k++) {
  480. memset(dst, pix, 8);
  481. dst += linesize;
  482. }
  483. }
  484. static const int16_t quant_table[64] = {
  485. 256, 256, 256, 256, 256, 256, 259, 262,
  486. 265, 269, 272, 275, 278, 282, 285, 288,
  487. 292, 295, 299, 303, 306, 310, 314, 317,
  488. 321, 325, 329, 333, 337, 341, 345, 349,
  489. 353, 358, 362, 366, 371, 375, 379, 384,
  490. 389, 393, 398, 403, 408, 413, 417, 422,
  491. 428, 433, 438, 443, 448, 454, 459, 465,
  492. 470, 476, 482, 488, 493, 499, 505, 511,
  493. };
  494. static int x8_decode_intra_mb(IntraX8Context *const w, const int chroma)
  495. {
  496. MpegEncContext *const s = w->s;
  497. uint8_t *scantable;
  498. int final, run, level;
  499. int ac_mode, dc_mode, est_run, dc_level;
  500. int pos, n;
  501. int zeros_only;
  502. int use_quant_matrix;
  503. int sign;
  504. assert(w->orient < 12);
  505. s->bdsp.clear_block(s->block[0]);
  506. if (chroma)
  507. dc_mode = 2;
  508. else
  509. dc_mode = !!w->est_run; // 0, 1
  510. if (x8_get_dc_rlf(w, dc_mode, &dc_level, &final))
  511. return -1;
  512. n = 0;
  513. zeros_only = 0;
  514. if (!final) { // decode ac
  515. use_quant_matrix = w->use_quant_matrix;
  516. if (chroma) {
  517. ac_mode = 1;
  518. est_run = 64; // not used
  519. } else {
  520. if (w->raw_orient < 3)
  521. use_quant_matrix = 0;
  522. if (w->raw_orient > 4) {
  523. ac_mode = 0;
  524. est_run = 64;
  525. } else {
  526. if (w->est_run > 1) {
  527. ac_mode = 2;
  528. est_run = w->est_run;
  529. } else {
  530. ac_mode = 3;
  531. est_run = 64;
  532. }
  533. }
  534. }
  535. x8_select_ac_table(w, ac_mode);
  536. /* scantable_selector[12] = { 0, 2, 0, 1, 1, 1, 0, 2, 2, 0, 1, 2 }; <-
  537. * -> 10'01' 00'10' 10'00' 01'01' 01'00' 10'00 => 0x928548 */
  538. scantable = w->scantable[(0x928548 >> (2 * w->orient)) & 3].permutated;
  539. pos = 0;
  540. do {
  541. n++;
  542. if (n >= est_run) {
  543. ac_mode = 3;
  544. x8_select_ac_table(w, 3);
  545. }
  546. x8_get_ac_rlf(w, ac_mode, &run, &level, &final);
  547. pos += run + 1;
  548. if (pos > 63) {
  549. // this also handles vlc error in x8_get_ac_rlf
  550. return -1;
  551. }
  552. level = (level + 1) * w->dquant;
  553. level += w->qsum;
  554. sign = -get_bits1(&s->gb);
  555. level = (level ^ sign) - sign;
  556. if (use_quant_matrix)
  557. level = (level * quant_table[pos]) >> 8;
  558. s->block[0][scantable[pos]] = level;
  559. } while (!final);
  560. s->block_last_index[0] = pos;
  561. } else { // DC only
  562. s->block_last_index[0] = 0;
  563. if (w->flat_dc && ((unsigned) (dc_level + 1)) < 3) { // [-1; 1]
  564. int32_t divide_quant = !chroma ? w->divide_quant_dc_luma
  565. : w->divide_quant_dc_chroma;
  566. int32_t dc_quant = !chroma ? w->quant
  567. : w->quant_dc_chroma;
  568. // original intent dc_level += predicted_dc/quant;
  569. // but it got lost somewhere in the rounding
  570. dc_level += (w->predicted_dc * divide_quant + (1 << 12)) >> 13;
  571. dsp_x8_put_solidcolor(av_clip_uint8((dc_level * dc_quant + 4) >> 3),
  572. s->dest[chroma],
  573. s->current_picture.f->linesize[!!chroma]);
  574. goto block_placed;
  575. }
  576. zeros_only = (dc_level == 0);
  577. }
  578. if (!chroma)
  579. s->block[0][0] = dc_level * w->quant;
  580. else
  581. s->block[0][0] = dc_level * w->quant_dc_chroma;
  582. // there is !zero_only check in the original, but dc_level check is enough
  583. if ((unsigned int) (dc_level + 1) >= 3 && (w->edges & 3) != 3) {
  584. int direction;
  585. /* ac_comp_direction[orient] = { 0, 3, 3, 1, 1, 0, 0, 0, 2, 2, 2, 1 }; <-
  586. * -> 01'10' 10'10' 00'00' 00'01' 01'11' 11'00 => 0x6A017C */
  587. direction = (0x6A017C >> (w->orient * 2)) & 3;
  588. if (direction != 3) {
  589. // modify block_last[]
  590. x8_ac_compensation(w, direction, s->block[0][0]);
  591. }
  592. }
  593. if (w->flat_dc) {
  594. dsp_x8_put_solidcolor(w->predicted_dc, s->dest[chroma],
  595. s->current_picture.f->linesize[!!chroma]);
  596. } else {
  597. w->dsp.spatial_compensation[w->orient](s->sc.edge_emu_buffer,
  598. s->dest[chroma],
  599. s->current_picture.f->linesize[!!chroma]);
  600. }
  601. if (!zeros_only)
  602. s->idsp.idct_add(s->dest[chroma],
  603. s->current_picture.f->linesize[!!chroma],
  604. s->block[0]);
  605. block_placed:
  606. if (!chroma)
  607. x8_update_predictions(w, w->orient, n);
  608. if (s->loop_filter) {
  609. uint8_t *ptr = s->dest[chroma];
  610. int linesize = s->current_picture.f->linesize[!!chroma];
  611. if (!((w->edges & 2) || (zeros_only && (w->orient | 4) == 4)))
  612. w->dsp.h_loop_filter(ptr, linesize, w->quant);
  613. if (!((w->edges & 1) || (zeros_only && (w->orient | 8) == 8)))
  614. w->dsp.v_loop_filter(ptr, linesize, w->quant);
  615. }
  616. return 0;
  617. }
  618. // FIXME maybe merge with ff_*
  619. static void x8_init_block_index(MpegEncContext *s)
  620. {
  621. // not s->linesize as this would be wrong for field pics
  622. // not that IntraX8 has interlacing support ;)
  623. const int linesize = s->current_picture.f->linesize[0];
  624. const int uvlinesize = s->current_picture.f->linesize[1];
  625. s->dest[0] = s->current_picture.f->data[0];
  626. s->dest[1] = s->current_picture.f->data[1];
  627. s->dest[2] = s->current_picture.f->data[2];
  628. s->dest[0] += s->mb_y * linesize << 3;
  629. // chroma blocks are on add rows
  630. s->dest[1] += (s->mb_y & (~1)) * uvlinesize << 2;
  631. s->dest[2] += (s->mb_y & (~1)) * uvlinesize << 2;
  632. }
  633. /**
  634. * Initialize IntraX8 frame decoder.
  635. * Requires valid MpegEncContext with valid s->mb_width before calling.
  636. * @param w pointer to IntraX8Context
  637. * @param s pointer to MpegEncContext of the parent codec
  638. */
  639. av_cold void ff_intrax8_common_init(IntraX8Context *w, MpegEncContext *const s)
  640. {
  641. w->s = s;
  642. x8_vlc_init();
  643. assert(s->mb_width > 0);
  644. // two rows, 2 blocks per cannon mb
  645. w->prediction_table = av_mallocz(s->mb_width * 2 * 2);
  646. ff_init_scantable(s->idsp.idct_permutation, &w->scantable[0],
  647. ff_wmv1_scantable[0]);
  648. ff_init_scantable(s->idsp.idct_permutation, &w->scantable[1],
  649. ff_wmv1_scantable[2]);
  650. ff_init_scantable(s->idsp.idct_permutation, &w->scantable[2],
  651. ff_wmv1_scantable[3]);
  652. ff_intrax8dsp_init(&w->dsp);
  653. }
  654. /**
  655. * Destroy IntraX8 frame structure.
  656. * @param w pointer to IntraX8Context
  657. */
  658. av_cold void ff_intrax8_common_end(IntraX8Context *w)
  659. {
  660. av_freep(&w->prediction_table);
  661. }
  662. /**
  663. * Decode single IntraX8 frame.
  664. * The parent codec must fill s->loopfilter and s->gb (bitstream).
  665. * The parent codec must call ff_mpv_frame_start() before calling this function.
  666. * The parent codec must call ff_mpv_frame_end() after calling this function.
  667. * This function does not use ff_mpv_decode_mb().
  668. * @param w pointer to IntraX8Context
  669. * @param dquant doubled quantizer, it would be odd in case of VC-1 halfpq==1.
  670. * @param quant_offset offset away from zero
  671. */
  672. int ff_intrax8_decode_picture(IntraX8Context *const w, int dquant,
  673. int quant_offset)
  674. {
  675. MpegEncContext *const s = w->s;
  676. int mb_xy;
  677. assert(s);
  678. w->use_quant_matrix = get_bits1(&s->gb);
  679. w->dquant = dquant;
  680. w->quant = dquant >> 1;
  681. w->qsum = quant_offset;
  682. w->divide_quant_dc_luma = ((1 << 16) + (w->quant >> 1)) / w->quant;
  683. if (w->quant < 5) {
  684. w->quant_dc_chroma = w->quant;
  685. w->divide_quant_dc_chroma = w->divide_quant_dc_luma;
  686. } else {
  687. w->quant_dc_chroma = w->quant + ((w->quant + 3) >> 3);
  688. w->divide_quant_dc_chroma = ((1 << 16) + (w->quant_dc_chroma >> 1)) / w->quant_dc_chroma;
  689. }
  690. x8_reset_vlc_tables(w);
  691. for (s->mb_y = 0; s->mb_y < s->mb_height * 2; s->mb_y++) {
  692. x8_init_block_index(s);
  693. mb_xy = (s->mb_y >> 1) * s->mb_stride;
  694. for (s->mb_x = 0; s->mb_x < s->mb_width * 2; s->mb_x++) {
  695. x8_get_prediction(w);
  696. if (x8_setup_spatial_predictor(w, 0))
  697. goto error;
  698. if (x8_decode_intra_mb(w, 0))
  699. goto error;
  700. if (s->mb_x & s->mb_y & 1) {
  701. x8_get_prediction_chroma(w);
  702. /* when setting up chroma, no vlc is read,
  703. * so no error condition can be reached */
  704. x8_setup_spatial_predictor(w, 1);
  705. if (x8_decode_intra_mb(w, 1))
  706. goto error;
  707. x8_setup_spatial_predictor(w, 2);
  708. if (x8_decode_intra_mb(w, 2))
  709. goto error;
  710. s->dest[1] += 8;
  711. s->dest[2] += 8;
  712. /* emulate MB info in the relevant tables */
  713. s->mbskip_table[mb_xy] = 0;
  714. s->mbintra_table[mb_xy] = 1;
  715. s->current_picture.qscale_table[mb_xy] = w->quant;
  716. mb_xy++;
  717. }
  718. s->dest[0] += 8;
  719. }
  720. if (s->mb_y & 1)
  721. ff_mpeg_draw_horiz_band(s, (s->mb_y - 1) * 8, 16);
  722. }
  723. error:
  724. return 0;
  725. }