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.

633 lines
19KB

  1. /*
  2. * Lagarith lossless decoder
  3. * Copyright (c) 2009 Nathan Caldwell <saintdev (at) gmail.com>
  4. *
  5. * This file is part of FFmpeg.
  6. *
  7. * FFmpeg is free software; you can redistribute it and/or
  8. * modify it under the terms of the GNU Lesser General Public
  9. * License as published by the Free Software Foundation; either
  10. * version 2.1 of the License, or (at your option) any later version.
  11. *
  12. * FFmpeg is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * Lesser General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU Lesser General Public
  18. * License along with FFmpeg; if not, write to the Free Software
  19. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  20. */
  21. /**
  22. * @file
  23. * Lagarith lossless decoder
  24. * @author Nathan Caldwell
  25. */
  26. #include "avcodec.h"
  27. #include "get_bits.h"
  28. #include "mathops.h"
  29. #include "dsputil.h"
  30. #include "lagarithrac.h"
  31. enum LagarithFrameType {
  32. FRAME_RAW = 1, /**< uncompressed */
  33. FRAME_U_RGB24 = 2, /**< unaligned RGB24 */
  34. FRAME_ARITH_YUY2 = 3, /**< arithmetic coded YUY2 */
  35. FRAME_ARITH_RGB24 = 4, /**< arithmetic coded RGB24 */
  36. FRAME_SOLID_GRAY = 5, /**< solid grayscale color frame */
  37. FRAME_SOLID_COLOR = 6, /**< solid non-grayscale color frame */
  38. FRAME_OLD_ARITH_RGB = 7, /**< obsolete arithmetic coded RGB (no longer encoded by upstream since version 1.1.0) */
  39. FRAME_ARITH_RGBA = 8, /**< arithmetic coded RGBA */
  40. FRAME_SOLID_RGBA = 9, /**< solid RGBA color frame */
  41. FRAME_ARITH_YV12 = 10, /**< arithmetic coded YV12 */
  42. FRAME_REDUCED_RES = 11, /**< reduced resolution YV12 frame */
  43. };
  44. typedef struct LagarithContext {
  45. AVCodecContext *avctx;
  46. AVFrame picture;
  47. DSPContext dsp;
  48. int zeros; /**< number of consecutive zero bytes encountered */
  49. int zeros_rem; /**< number of zero bytes remaining to output */
  50. uint8_t *rgb_planes;
  51. int rgb_stride;
  52. } LagarithContext;
  53. /**
  54. * Compute the 52bit mantissa of 1/(double)denom.
  55. * This crazy format uses floats in an entropy coder and we have to match x86
  56. * rounding exactly, thus ordinary floats aren't portable enough.
  57. * @param denom denominator
  58. * @return 52bit mantissa
  59. * @see softfloat_mul
  60. */
  61. static uint64_t softfloat_reciprocal(uint32_t denom)
  62. {
  63. int shift = av_log2(denom - 1) + 1;
  64. uint64_t ret = (1ULL << 52) / denom;
  65. uint64_t err = (1ULL << 52) - ret * denom;
  66. ret <<= shift;
  67. err <<= shift;
  68. err += denom / 2;
  69. return ret + err / denom;
  70. }
  71. /**
  72. * (uint32_t)(x*f), where f has the given mantissa, and exponent 0
  73. * Used in combination with softfloat_reciprocal computes x/(double)denom.
  74. * @param x 32bit integer factor
  75. * @param mantissa mantissa of f with exponent 0
  76. * @return 32bit integer value (x*f)
  77. * @see softfloat_reciprocal
  78. */
  79. static uint32_t softfloat_mul(uint32_t x, uint64_t mantissa)
  80. {
  81. uint64_t l = x * (mantissa & 0xffffffff);
  82. uint64_t h = x * (mantissa >> 32);
  83. h += l >> 32;
  84. l &= 0xffffffff;
  85. l += 1 << av_log2(h >> 21);
  86. h += l >> 32;
  87. return h >> 20;
  88. }
  89. static uint8_t lag_calc_zero_run(int8_t x)
  90. {
  91. return (x << 1) ^ (x >> 7);
  92. }
  93. static int lag_decode_prob(GetBitContext *gb, uint32_t *value)
  94. {
  95. static const uint8_t series[] = { 1, 2, 3, 5, 8, 13, 21 };
  96. int i;
  97. int bit = 0;
  98. int bits = 0;
  99. int prevbit = 0;
  100. unsigned val;
  101. for (i = 0; i < 7; i++) {
  102. if (prevbit && bit)
  103. break;
  104. prevbit = bit;
  105. bit = get_bits1(gb);
  106. if (bit && !prevbit)
  107. bits += series[i];
  108. }
  109. bits--;
  110. if (bits < 0 || bits > 31) {
  111. *value = 0;
  112. return -1;
  113. } else if (bits == 0) {
  114. *value = 0;
  115. return 0;
  116. }
  117. val = get_bits_long(gb, bits);
  118. val |= 1 << bits;
  119. *value = val - 1;
  120. return 0;
  121. }
  122. static int lag_read_prob_header(lag_rac *rac, GetBitContext *gb)
  123. {
  124. int i, j, scale_factor;
  125. unsigned prob, cumulative_target;
  126. unsigned cumul_prob = 0;
  127. unsigned scaled_cumul_prob = 0;
  128. rac->prob[0] = 0;
  129. rac->prob[257] = UINT_MAX;
  130. /* Read probabilities from bitstream */
  131. for (i = 1; i < 257; i++) {
  132. if (lag_decode_prob(gb, &rac->prob[i]) < 0) {
  133. av_log(rac->avctx, AV_LOG_ERROR, "Invalid probability encountered.\n");
  134. return -1;
  135. }
  136. if ((uint64_t)cumul_prob + rac->prob[i] > UINT_MAX) {
  137. av_log(rac->avctx, AV_LOG_ERROR, "Integer overflow encountered in cumulative probability calculation.\n");
  138. return -1;
  139. }
  140. cumul_prob += rac->prob[i];
  141. if (!rac->prob[i]) {
  142. if (lag_decode_prob(gb, &prob)) {
  143. av_log(rac->avctx, AV_LOG_ERROR, "Invalid probability run encountered.\n");
  144. return -1;
  145. }
  146. if (prob > 257 - i)
  147. prob = 257 - i;
  148. for (j = 0; j < prob; j++)
  149. rac->prob[++i] = 0;
  150. }
  151. }
  152. if (!cumul_prob) {
  153. av_log(rac->avctx, AV_LOG_ERROR, "All probabilities are 0!\n");
  154. return -1;
  155. }
  156. /* Scale probabilities so cumulative probability is an even power of 2. */
  157. scale_factor = av_log2(cumul_prob);
  158. if (cumul_prob & (cumul_prob - 1)) {
  159. uint64_t mul = softfloat_reciprocal(cumul_prob);
  160. for (i = 1; i < 257; i++) {
  161. rac->prob[i] = softfloat_mul(rac->prob[i], mul);
  162. scaled_cumul_prob += rac->prob[i];
  163. }
  164. scale_factor++;
  165. cumulative_target = 1 << scale_factor;
  166. if (scaled_cumul_prob > cumulative_target) {
  167. av_log(rac->avctx, AV_LOG_ERROR,
  168. "Scaled probabilities are larger than target!\n");
  169. return -1;
  170. }
  171. scaled_cumul_prob = cumulative_target - scaled_cumul_prob;
  172. for (i = 1; scaled_cumul_prob; i = (i & 0x7f) + 1) {
  173. if (rac->prob[i]) {
  174. rac->prob[i]++;
  175. scaled_cumul_prob--;
  176. }
  177. /* Comment from reference source:
  178. * if (b & 0x80 == 0) { // order of operations is 'wrong'; it has been left this way
  179. * // since the compression change is negligable and fixing it
  180. * // breaks backwards compatibilty
  181. * b =- (signed int)b;
  182. * b &= 0xFF;
  183. * } else {
  184. * b++;
  185. * b &= 0x7f;
  186. * }
  187. */
  188. }
  189. }
  190. rac->scale = scale_factor;
  191. /* Fill probability array with cumulative probability for each symbol. */
  192. for (i = 1; i < 257; i++)
  193. rac->prob[i] += rac->prob[i - 1];
  194. return 0;
  195. }
  196. static void add_lag_median_prediction(uint8_t *dst, uint8_t *src1,
  197. uint8_t *diff, int w, int *left,
  198. int *left_top)
  199. {
  200. /* This is almost identical to add_hfyu_median_prediction in dsputil.h.
  201. * However the &0xFF on the gradient predictor yealds incorrect output
  202. * for lagarith.
  203. */
  204. int i;
  205. uint8_t l, lt;
  206. l = *left;
  207. lt = *left_top;
  208. for (i = 0; i < w; i++) {
  209. l = mid_pred(l, src1[i], l + src1[i] - lt) + diff[i];
  210. lt = src1[i];
  211. dst[i] = l;
  212. }
  213. *left = l;
  214. *left_top = lt;
  215. }
  216. static void lag_pred_line(LagarithContext *l, uint8_t *buf,
  217. int width, int stride, int line)
  218. {
  219. int L, TL;
  220. /* Left pixel is actually prev_row[width] */
  221. L = buf[width - stride - 1];
  222. if (!line) {
  223. /* Left prediction only for first line */
  224. L = l->dsp.add_hfyu_left_prediction(buf + 1, buf + 1,
  225. width - 1, buf[0]);
  226. return;
  227. } else if (line == 1) {
  228. /* Second line, left predict first pixel, the rest of the line is median predicted
  229. * NOTE: In the case of RGB this pixel is top predicted */
  230. TL = l->avctx->pix_fmt == PIX_FMT_YUV420P ? buf[-stride] : L;
  231. } else {
  232. /* Top left is 2 rows back, last pixel */
  233. TL = buf[width - (2 * stride) - 1];
  234. }
  235. add_lag_median_prediction(buf, buf - stride, buf,
  236. width, &L, &TL);
  237. }
  238. static int lag_decode_line(LagarithContext *l, lag_rac *rac,
  239. uint8_t *dst, int width, int stride,
  240. int esc_count)
  241. {
  242. int i = 0;
  243. int ret = 0;
  244. if (!esc_count)
  245. esc_count = -1;
  246. /* Output any zeros remaining from the previous run */
  247. handle_zeros:
  248. if (l->zeros_rem) {
  249. int count = FFMIN(l->zeros_rem, width - i);
  250. memset(dst + i, 0, count);
  251. i += count;
  252. l->zeros_rem -= count;
  253. }
  254. while (i < width) {
  255. dst[i] = lag_get_rac(rac);
  256. ret++;
  257. if (dst[i])
  258. l->zeros = 0;
  259. else
  260. l->zeros++;
  261. i++;
  262. if (l->zeros == esc_count) {
  263. int index = lag_get_rac(rac);
  264. ret++;
  265. l->zeros = 0;
  266. l->zeros_rem = lag_calc_zero_run(index);
  267. goto handle_zeros;
  268. }
  269. }
  270. return ret;
  271. }
  272. static int lag_decode_zero_run_line(LagarithContext *l, uint8_t *dst,
  273. const uint8_t *src, int width,
  274. int esc_count)
  275. {
  276. int i = 0;
  277. int count;
  278. uint8_t zero_run = 0;
  279. const uint8_t *start = src;
  280. uint8_t mask1 = -(esc_count < 2);
  281. uint8_t mask2 = -(esc_count < 3);
  282. uint8_t *end = dst + (width - 2);
  283. output_zeros:
  284. if (l->zeros_rem) {
  285. count = FFMIN(l->zeros_rem, width - i);
  286. memset(dst, 0, count);
  287. l->zeros_rem -= count;
  288. dst += count;
  289. }
  290. while (dst < end) {
  291. i = 0;
  292. while (!zero_run && dst + i < end) {
  293. i++;
  294. zero_run =
  295. !(src[i] | (src[i + 1] & mask1) | (src[i + 2] & mask2));
  296. }
  297. if (zero_run) {
  298. zero_run = 0;
  299. i += esc_count;
  300. memcpy(dst, src, i);
  301. dst += i;
  302. l->zeros_rem = lag_calc_zero_run(src[i]);
  303. src += i + 1;
  304. goto output_zeros;
  305. } else {
  306. memcpy(dst, src, i);
  307. src += i;
  308. }
  309. }
  310. return start - src;
  311. }
  312. static int lag_decode_arith_plane(LagarithContext *l, uint8_t *dst,
  313. int width, int height, int stride,
  314. const uint8_t *src, int src_size)
  315. {
  316. int i = 0;
  317. int read = 0;
  318. uint32_t length;
  319. uint32_t offset = 1;
  320. int esc_count = src[0];
  321. GetBitContext gb;
  322. lag_rac rac;
  323. rac.avctx = l->avctx;
  324. l->zeros = 0;
  325. if (esc_count < 4) {
  326. length = width * height;
  327. if (esc_count && AV_RL32(src + 1) < length) {
  328. length = AV_RL32(src + 1);
  329. offset += 4;
  330. }
  331. init_get_bits(&gb, src + offset, src_size * 8);
  332. if (lag_read_prob_header(&rac, &gb) < 0)
  333. return -1;
  334. lag_rac_init(&rac, &gb, length - stride);
  335. for (i = 0; i < height; i++)
  336. read += lag_decode_line(l, &rac, dst + (i * stride), width,
  337. stride, esc_count);
  338. if (read > length)
  339. av_log(l->avctx, AV_LOG_WARNING,
  340. "Output more bytes than length (%d of %d)\n", read,
  341. length);
  342. } else if (esc_count < 8) {
  343. esc_count -= 4;
  344. if (esc_count > 0) {
  345. /* Zero run coding only, no range coding. */
  346. for (i = 0; i < height; i++)
  347. src += lag_decode_zero_run_line(l, dst + (i * stride), src,
  348. width, esc_count);
  349. } else {
  350. /* Plane is stored uncompressed */
  351. for (i = 0; i < height; i++) {
  352. memcpy(dst + (i * stride), src, width);
  353. src += width;
  354. }
  355. }
  356. } else if (esc_count == 0xff) {
  357. /* Plane is a solid run of given value */
  358. for (i = 0; i < height; i++)
  359. memset(dst + i * stride, src[1], width);
  360. /* Do not apply prediction.
  361. Note: memset to 0 above, setting first value to src[1]
  362. and applying prediction gives the same result. */
  363. return 0;
  364. } else {
  365. av_log(l->avctx, AV_LOG_ERROR,
  366. "Invalid zero run escape code! (%#x)\n", esc_count);
  367. return -1;
  368. }
  369. for (i = 0; i < height; i++) {
  370. lag_pred_line(l, dst, width, stride, i);
  371. dst += stride;
  372. }
  373. return 0;
  374. }
  375. /**
  376. * Decode a frame.
  377. * @param avctx codec context
  378. * @param data output AVFrame
  379. * @param data_size size of output data or 0 if no picture is returned
  380. * @param avpkt input packet
  381. * @return number of consumed bytes on success or negative if decode fails
  382. */
  383. static int lag_decode_frame(AVCodecContext *avctx,
  384. void *data, int *data_size, AVPacket *avpkt)
  385. {
  386. const uint8_t *buf = avpkt->data;
  387. int buf_size = avpkt->size;
  388. LagarithContext *l = avctx->priv_data;
  389. AVFrame *const p = &l->picture;
  390. uint8_t frametype = 0;
  391. uint32_t offset_gu = 0, offset_bv = 0, offset_ry = 9;
  392. int offs[4];
  393. uint8_t *srcs[4], *dst;
  394. int i, j;
  395. AVFrame *picture = data;
  396. if (p->data[0])
  397. avctx->release_buffer(avctx, p);
  398. p->reference = 0;
  399. p->key_frame = 1;
  400. frametype = buf[0];
  401. offset_gu = AV_RL32(buf + 1);
  402. offset_bv = AV_RL32(buf + 5);
  403. switch (frametype) {
  404. case FRAME_SOLID_RGBA:
  405. avctx->pix_fmt = PIX_FMT_RGB32;
  406. if (avctx->get_buffer(avctx, p) < 0) {
  407. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  408. return -1;
  409. }
  410. dst = p->data[0];
  411. for (j = 0; j < avctx->height; j++) {
  412. for (i = 0; i < avctx->width; i++)
  413. AV_WN32(dst + i * 4, offset_gu);
  414. dst += p->linesize[0];
  415. }
  416. break;
  417. case FRAME_ARITH_RGBA:
  418. avctx->pix_fmt = PIX_FMT_RGB32;
  419. if (avctx->get_buffer(avctx, p) < 0) {
  420. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  421. return -1;
  422. }
  423. offs[0] = offset_bv;
  424. offs[1] = offset_gu;
  425. offs[2] = 13;
  426. offs[3] = AV_RL32(buf + 9);
  427. if (!l->rgb_planes) {
  428. l->rgb_stride = FFALIGN(avctx->width, 16);
  429. l->rgb_planes = av_malloc(l->rgb_stride * avctx->height * 4);
  430. if (!l->rgb_planes) {
  431. av_log(avctx, AV_LOG_ERROR, "cannot allocate temporary buffer\n");
  432. return AVERROR(ENOMEM);
  433. }
  434. }
  435. for (i = 0; i < 4; i++)
  436. srcs[i] = l->rgb_planes + (i + 1) * l->rgb_stride * avctx->height - l->rgb_stride;
  437. for (i = 0; i < 4; i++)
  438. lag_decode_arith_plane(l, srcs[i],
  439. avctx->width, avctx->height,
  440. -l->rgb_stride, buf + offs[i],
  441. buf_size);
  442. dst = p->data[0];
  443. for (i = 0; i < 4; i++)
  444. srcs[i] = l->rgb_planes + i * l->rgb_stride * avctx->height;
  445. for (j = 0; j < avctx->height; j++) {
  446. for (i = 0; i < avctx->width; i++) {
  447. uint8_t r, g, b, a;
  448. r = srcs[0][i];
  449. g = srcs[1][i];
  450. b = srcs[2][i];
  451. a = srcs[3][i];
  452. r += g;
  453. b += g;
  454. AV_WN32(dst + i * 4, MKBETAG(a, r, g, b));
  455. }
  456. dst += p->linesize[0];
  457. for (i = 0; i < 4; i++)
  458. srcs[i] += l->rgb_stride;
  459. }
  460. break;
  461. case FRAME_ARITH_RGB24:
  462. avctx->pix_fmt = PIX_FMT_RGB24;
  463. if (avctx->get_buffer(avctx, p) < 0) {
  464. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  465. return -1;
  466. }
  467. offs[0] = offset_bv;
  468. offs[1] = offset_gu;
  469. offs[2] = 9;
  470. if (!l->rgb_planes) {
  471. l->rgb_stride = FFALIGN(avctx->width, 16);
  472. l->rgb_planes = av_malloc(l->rgb_stride * avctx->height * 3);
  473. if (!l->rgb_planes) {
  474. av_log(avctx, AV_LOG_ERROR, "cannot allocate temporary buffer\n");
  475. return AVERROR(ENOMEM);
  476. }
  477. }
  478. for (i = 0; i < 3; i++)
  479. srcs[i] = l->rgb_planes + (i + 1) * l->rgb_stride * avctx->height - l->rgb_stride;
  480. for (i = 0; i < 3; i++)
  481. lag_decode_arith_plane(l, srcs[i],
  482. avctx->width, avctx->height,
  483. -l->rgb_stride, buf + offs[i],
  484. buf_size);
  485. dst = p->data[0];
  486. for (i = 0; i < 3; i++)
  487. srcs[i] = l->rgb_planes + i * l->rgb_stride * avctx->height;
  488. for (j = 0; j < avctx->height; j++) {
  489. for (i = 0; i < avctx->width; i++) {
  490. uint8_t r, g, b;
  491. r = srcs[0][i];
  492. g = srcs[1][i];
  493. b = srcs[2][i];
  494. dst[3*i+0] = r+g;
  495. dst[3*i+1] = g;
  496. dst[3*i+2] = b+g;
  497. }
  498. dst += p->linesize[0];
  499. for (i = 0; i < 3; i++)
  500. srcs[i] += l->rgb_stride;
  501. }
  502. break;
  503. case FRAME_ARITH_YV12:
  504. avctx->pix_fmt = PIX_FMT_YUV420P;
  505. if (avctx->get_buffer(avctx, p) < 0) {
  506. av_log(avctx, AV_LOG_ERROR, "get_buffer() failed\n");
  507. return -1;
  508. }
  509. lag_decode_arith_plane(l, p->data[0], avctx->width, avctx->height,
  510. p->linesize[0], buf + offset_ry,
  511. buf_size);
  512. lag_decode_arith_plane(l, p->data[2], avctx->width / 2,
  513. avctx->height / 2, p->linesize[2],
  514. buf + offset_gu, buf_size);
  515. lag_decode_arith_plane(l, p->data[1], avctx->width / 2,
  516. avctx->height / 2, p->linesize[1],
  517. buf + offset_bv, buf_size);
  518. break;
  519. default:
  520. av_log(avctx, AV_LOG_ERROR,
  521. "Unsupported Lagarith frame type: %#x\n", frametype);
  522. return -1;
  523. }
  524. *picture = *p;
  525. *data_size = sizeof(AVFrame);
  526. return buf_size;
  527. }
  528. static av_cold int lag_decode_init(AVCodecContext *avctx)
  529. {
  530. LagarithContext *l = avctx->priv_data;
  531. l->avctx = avctx;
  532. dsputil_init(&l->dsp, avctx);
  533. return 0;
  534. }
  535. static av_cold int lag_decode_end(AVCodecContext *avctx)
  536. {
  537. LagarithContext *l = avctx->priv_data;
  538. if (l->picture.data[0])
  539. avctx->release_buffer(avctx, &l->picture);
  540. av_freep(&l->rgb_planes);
  541. return 0;
  542. }
  543. AVCodec ff_lagarith_decoder = {
  544. .name = "lagarith",
  545. .type = AVMEDIA_TYPE_VIDEO,
  546. .id = CODEC_ID_LAGARITH,
  547. .priv_data_size = sizeof(LagarithContext),
  548. .init = lag_decode_init,
  549. .close = lag_decode_end,
  550. .decode = lag_decode_frame,
  551. .capabilities = CODEC_CAP_DR1,
  552. .long_name = NULL_IF_CONFIG_SMALL("Lagarith lossless"),
  553. };