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.

1597 lines
51KB

  1. /*
  2. * Monkey's Audio lossless audio decoder
  3. * Copyright (c) 2007 Benjamin Zores <ben@geexbox.org>
  4. * based upon libdemac from Dave Chapman.
  5. *
  6. * This file is part of FFmpeg.
  7. *
  8. * FFmpeg is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU Lesser General Public
  10. * License as published by the Free Software Foundation; either
  11. * version 2.1 of the License, or (at your option) any later version.
  12. *
  13. * FFmpeg is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  16. * Lesser General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU Lesser General Public
  19. * License along with FFmpeg; if not, write to the Free Software
  20. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  21. */
  22. #include <inttypes.h>
  23. #include "libavutil/avassert.h"
  24. #include "libavutil/channel_layout.h"
  25. #include "libavutil/opt.h"
  26. #include "lossless_audiodsp.h"
  27. #include "avcodec.h"
  28. #include "bswapdsp.h"
  29. #include "bytestream.h"
  30. #include "internal.h"
  31. #include "get_bits.h"
  32. #include "unary.h"
  33. /**
  34. * @file
  35. * Monkey's Audio lossless audio decoder
  36. */
  37. #define MAX_CHANNELS 2
  38. #define MAX_BYTESPERSAMPLE 3
  39. #define APE_FRAMECODE_MONO_SILENCE 1
  40. #define APE_FRAMECODE_STEREO_SILENCE 3
  41. #define APE_FRAMECODE_PSEUDO_STEREO 4
  42. #define HISTORY_SIZE 512
  43. #define PREDICTOR_ORDER 8
  44. /** Total size of all predictor histories */
  45. #define PREDICTOR_SIZE 50
  46. #define YDELAYA (18 + PREDICTOR_ORDER*4)
  47. #define YDELAYB (18 + PREDICTOR_ORDER*3)
  48. #define XDELAYA (18 + PREDICTOR_ORDER*2)
  49. #define XDELAYB (18 + PREDICTOR_ORDER)
  50. #define YADAPTCOEFFSA 18
  51. #define XADAPTCOEFFSA 14
  52. #define YADAPTCOEFFSB 10
  53. #define XADAPTCOEFFSB 5
  54. /**
  55. * Possible compression levels
  56. * @{
  57. */
  58. enum APECompressionLevel {
  59. COMPRESSION_LEVEL_FAST = 1000,
  60. COMPRESSION_LEVEL_NORMAL = 2000,
  61. COMPRESSION_LEVEL_HIGH = 3000,
  62. COMPRESSION_LEVEL_EXTRA_HIGH = 4000,
  63. COMPRESSION_LEVEL_INSANE = 5000
  64. };
  65. /** @} */
  66. #define APE_FILTER_LEVELS 3
  67. /** Filter orders depending on compression level */
  68. static const uint16_t ape_filter_orders[5][APE_FILTER_LEVELS] = {
  69. { 0, 0, 0 },
  70. { 16, 0, 0 },
  71. { 64, 0, 0 },
  72. { 32, 256, 0 },
  73. { 16, 256, 1280 }
  74. };
  75. /** Filter fraction bits depending on compression level */
  76. static const uint8_t ape_filter_fracbits[5][APE_FILTER_LEVELS] = {
  77. { 0, 0, 0 },
  78. { 11, 0, 0 },
  79. { 11, 0, 0 },
  80. { 10, 13, 0 },
  81. { 11, 13, 15 }
  82. };
  83. /** Filters applied to the decoded data */
  84. typedef struct APEFilter {
  85. int16_t *coeffs; ///< actual coefficients used in filtering
  86. int16_t *adaptcoeffs; ///< adaptive filter coefficients used for correcting of actual filter coefficients
  87. int16_t *historybuffer; ///< filter memory
  88. int16_t *delay; ///< filtered values
  89. int avg;
  90. } APEFilter;
  91. typedef struct APERice {
  92. uint32_t k;
  93. uint32_t ksum;
  94. } APERice;
  95. typedef struct APERangecoder {
  96. uint32_t low; ///< low end of interval
  97. uint32_t range; ///< length of interval
  98. uint32_t help; ///< bytes_to_follow resp. intermediate value
  99. unsigned int buffer; ///< buffer for input/output
  100. } APERangecoder;
  101. /** Filter histories */
  102. typedef struct APEPredictor {
  103. int32_t *buf;
  104. int32_t lastA[2];
  105. int32_t filterA[2];
  106. int32_t filterB[2];
  107. int32_t coeffsA[2][4]; ///< adaption coefficients
  108. int32_t coeffsB[2][5]; ///< adaption coefficients
  109. int32_t historybuffer[HISTORY_SIZE + PREDICTOR_SIZE];
  110. unsigned int sample_pos;
  111. } APEPredictor;
  112. /** Decoder context */
  113. typedef struct APEContext {
  114. AVClass *class; ///< class for AVOptions
  115. AVCodecContext *avctx;
  116. BswapDSPContext bdsp;
  117. LLAudDSPContext adsp;
  118. int channels;
  119. int samples; ///< samples left to decode in current frame
  120. int bps;
  121. int fileversion; ///< codec version, very important in decoding process
  122. int compression_level; ///< compression levels
  123. int fset; ///< which filter set to use (calculated from compression level)
  124. int flags; ///< global decoder flags
  125. uint32_t CRC; ///< frame CRC
  126. int frameflags; ///< frame flags
  127. APEPredictor predictor; ///< predictor used for final reconstruction
  128. int32_t *decoded_buffer;
  129. int decoded_size;
  130. int32_t *decoded[MAX_CHANNELS]; ///< decoded data for each channel
  131. int blocks_per_loop; ///< maximum number of samples to decode for each call
  132. int16_t* filterbuf[APE_FILTER_LEVELS]; ///< filter memory
  133. APERangecoder rc; ///< rangecoder used to decode actual values
  134. APERice riceX; ///< rice code parameters for the second channel
  135. APERice riceY; ///< rice code parameters for the first channel
  136. APEFilter filters[APE_FILTER_LEVELS][2]; ///< filters used for reconstruction
  137. GetBitContext gb;
  138. uint8_t *data; ///< current frame data
  139. uint8_t *data_end; ///< frame data end
  140. int data_size; ///< frame data allocated size
  141. const uint8_t *ptr; ///< current position in frame data
  142. int error;
  143. void (*entropy_decode_mono)(struct APEContext *ctx, int blockstodecode);
  144. void (*entropy_decode_stereo)(struct APEContext *ctx, int blockstodecode);
  145. void (*predictor_decode_mono)(struct APEContext *ctx, int count);
  146. void (*predictor_decode_stereo)(struct APEContext *ctx, int count);
  147. } APEContext;
  148. static void ape_apply_filters(APEContext *ctx, int32_t *decoded0,
  149. int32_t *decoded1, int count);
  150. static void entropy_decode_mono_0000(APEContext *ctx, int blockstodecode);
  151. static void entropy_decode_stereo_0000(APEContext *ctx, int blockstodecode);
  152. static void entropy_decode_mono_3860(APEContext *ctx, int blockstodecode);
  153. static void entropy_decode_stereo_3860(APEContext *ctx, int blockstodecode);
  154. static void entropy_decode_mono_3900(APEContext *ctx, int blockstodecode);
  155. static void entropy_decode_stereo_3900(APEContext *ctx, int blockstodecode);
  156. static void entropy_decode_stereo_3930(APEContext *ctx, int blockstodecode);
  157. static void entropy_decode_mono_3990(APEContext *ctx, int blockstodecode);
  158. static void entropy_decode_stereo_3990(APEContext *ctx, int blockstodecode);
  159. static void predictor_decode_mono_3800(APEContext *ctx, int count);
  160. static void predictor_decode_stereo_3800(APEContext *ctx, int count);
  161. static void predictor_decode_mono_3930(APEContext *ctx, int count);
  162. static void predictor_decode_stereo_3930(APEContext *ctx, int count);
  163. static void predictor_decode_mono_3950(APEContext *ctx, int count);
  164. static void predictor_decode_stereo_3950(APEContext *ctx, int count);
  165. static av_cold int ape_decode_close(AVCodecContext *avctx)
  166. {
  167. APEContext *s = avctx->priv_data;
  168. int i;
  169. for (i = 0; i < APE_FILTER_LEVELS; i++)
  170. av_freep(&s->filterbuf[i]);
  171. av_freep(&s->decoded_buffer);
  172. av_freep(&s->data);
  173. s->decoded_size = s->data_size = 0;
  174. return 0;
  175. }
  176. static av_cold int ape_decode_init(AVCodecContext *avctx)
  177. {
  178. APEContext *s = avctx->priv_data;
  179. int i;
  180. if (avctx->extradata_size != 6) {
  181. av_log(avctx, AV_LOG_ERROR, "Incorrect extradata\n");
  182. return AVERROR(EINVAL);
  183. }
  184. if (avctx->channels > 2) {
  185. av_log(avctx, AV_LOG_ERROR, "Only mono and stereo is supported\n");
  186. return AVERROR(EINVAL);
  187. }
  188. s->bps = avctx->bits_per_coded_sample;
  189. switch (s->bps) {
  190. case 8:
  191. avctx->sample_fmt = AV_SAMPLE_FMT_U8P;
  192. break;
  193. case 16:
  194. avctx->sample_fmt = AV_SAMPLE_FMT_S16P;
  195. break;
  196. case 24:
  197. avctx->sample_fmt = AV_SAMPLE_FMT_S32P;
  198. break;
  199. default:
  200. avpriv_request_sample(avctx,
  201. "%d bits per coded sample", s->bps);
  202. return AVERROR_PATCHWELCOME;
  203. }
  204. s->avctx = avctx;
  205. s->channels = avctx->channels;
  206. s->fileversion = AV_RL16(avctx->extradata);
  207. s->compression_level = AV_RL16(avctx->extradata + 2);
  208. s->flags = AV_RL16(avctx->extradata + 4);
  209. av_log(avctx, AV_LOG_VERBOSE, "Compression Level: %d - Flags: %d\n",
  210. s->compression_level, s->flags);
  211. if (s->compression_level % 1000 || s->compression_level > COMPRESSION_LEVEL_INSANE ||
  212. !s->compression_level ||
  213. (s->fileversion < 3930 && s->compression_level == COMPRESSION_LEVEL_INSANE)) {
  214. av_log(avctx, AV_LOG_ERROR, "Incorrect compression level %d\n",
  215. s->compression_level);
  216. return AVERROR_INVALIDDATA;
  217. }
  218. s->fset = s->compression_level / 1000 - 1;
  219. for (i = 0; i < APE_FILTER_LEVELS; i++) {
  220. if (!ape_filter_orders[s->fset][i])
  221. break;
  222. FF_ALLOC_OR_GOTO(avctx, s->filterbuf[i],
  223. (ape_filter_orders[s->fset][i] * 3 + HISTORY_SIZE) * 4,
  224. filter_alloc_fail);
  225. }
  226. if (s->fileversion < 3860) {
  227. s->entropy_decode_mono = entropy_decode_mono_0000;
  228. s->entropy_decode_stereo = entropy_decode_stereo_0000;
  229. } else if (s->fileversion < 3900) {
  230. s->entropy_decode_mono = entropy_decode_mono_3860;
  231. s->entropy_decode_stereo = entropy_decode_stereo_3860;
  232. } else if (s->fileversion < 3930) {
  233. s->entropy_decode_mono = entropy_decode_mono_3900;
  234. s->entropy_decode_stereo = entropy_decode_stereo_3900;
  235. } else if (s->fileversion < 3990) {
  236. s->entropy_decode_mono = entropy_decode_mono_3900;
  237. s->entropy_decode_stereo = entropy_decode_stereo_3930;
  238. } else {
  239. s->entropy_decode_mono = entropy_decode_mono_3990;
  240. s->entropy_decode_stereo = entropy_decode_stereo_3990;
  241. }
  242. if (s->fileversion < 3930) {
  243. s->predictor_decode_mono = predictor_decode_mono_3800;
  244. s->predictor_decode_stereo = predictor_decode_stereo_3800;
  245. } else if (s->fileversion < 3950) {
  246. s->predictor_decode_mono = predictor_decode_mono_3930;
  247. s->predictor_decode_stereo = predictor_decode_stereo_3930;
  248. } else {
  249. s->predictor_decode_mono = predictor_decode_mono_3950;
  250. s->predictor_decode_stereo = predictor_decode_stereo_3950;
  251. }
  252. ff_bswapdsp_init(&s->bdsp);
  253. ff_llauddsp_init(&s->adsp);
  254. avctx->channel_layout = (avctx->channels==2) ? AV_CH_LAYOUT_STEREO : AV_CH_LAYOUT_MONO;
  255. return 0;
  256. filter_alloc_fail:
  257. ape_decode_close(avctx);
  258. return AVERROR(ENOMEM);
  259. }
  260. /**
  261. * @name APE range decoding functions
  262. * @{
  263. */
  264. #define CODE_BITS 32
  265. #define TOP_VALUE ((unsigned int)1 << (CODE_BITS-1))
  266. #define SHIFT_BITS (CODE_BITS - 9)
  267. #define EXTRA_BITS ((CODE_BITS-2) % 8 + 1)
  268. #define BOTTOM_VALUE (TOP_VALUE >> 8)
  269. /** Start the decoder */
  270. static inline void range_start_decoding(APEContext *ctx)
  271. {
  272. ctx->rc.buffer = bytestream_get_byte(&ctx->ptr);
  273. ctx->rc.low = ctx->rc.buffer >> (8 - EXTRA_BITS);
  274. ctx->rc.range = (uint32_t) 1 << EXTRA_BITS;
  275. }
  276. /** Perform normalization */
  277. static inline void range_dec_normalize(APEContext *ctx)
  278. {
  279. while (ctx->rc.range <= BOTTOM_VALUE) {
  280. ctx->rc.buffer <<= 8;
  281. if(ctx->ptr < ctx->data_end) {
  282. ctx->rc.buffer += *ctx->ptr;
  283. ctx->ptr++;
  284. } else {
  285. ctx->error = 1;
  286. }
  287. ctx->rc.low = (ctx->rc.low << 8) | ((ctx->rc.buffer >> 1) & 0xFF);
  288. ctx->rc.range <<= 8;
  289. }
  290. }
  291. /**
  292. * Calculate cumulative frequency for next symbol. Does NO update!
  293. * @param ctx decoder context
  294. * @param tot_f is the total frequency or (code_value)1<<shift
  295. * @return the cumulative frequency
  296. */
  297. static inline int range_decode_culfreq(APEContext *ctx, int tot_f)
  298. {
  299. range_dec_normalize(ctx);
  300. ctx->rc.help = ctx->rc.range / tot_f;
  301. return ctx->rc.low / ctx->rc.help;
  302. }
  303. /**
  304. * Decode value with given size in bits
  305. * @param ctx decoder context
  306. * @param shift number of bits to decode
  307. */
  308. static inline int range_decode_culshift(APEContext *ctx, int shift)
  309. {
  310. range_dec_normalize(ctx);
  311. ctx->rc.help = ctx->rc.range >> shift;
  312. return ctx->rc.low / ctx->rc.help;
  313. }
  314. /**
  315. * Update decoding state
  316. * @param ctx decoder context
  317. * @param sy_f the interval length (frequency of the symbol)
  318. * @param lt_f the lower end (frequency sum of < symbols)
  319. */
  320. static inline void range_decode_update(APEContext *ctx, int sy_f, int lt_f)
  321. {
  322. ctx->rc.low -= ctx->rc.help * lt_f;
  323. ctx->rc.range = ctx->rc.help * sy_f;
  324. }
  325. /** Decode n bits (n <= 16) without modelling */
  326. static inline int range_decode_bits(APEContext *ctx, int n)
  327. {
  328. int sym = range_decode_culshift(ctx, n);
  329. range_decode_update(ctx, 1, sym);
  330. return sym;
  331. }
  332. #define MODEL_ELEMENTS 64
  333. /**
  334. * Fixed probabilities for symbols in Monkey Audio version 3.97
  335. */
  336. static const uint16_t counts_3970[22] = {
  337. 0, 14824, 28224, 39348, 47855, 53994, 58171, 60926,
  338. 62682, 63786, 64463, 64878, 65126, 65276, 65365, 65419,
  339. 65450, 65469, 65480, 65487, 65491, 65493,
  340. };
  341. /**
  342. * Probability ranges for symbols in Monkey Audio version 3.97
  343. */
  344. static const uint16_t counts_diff_3970[21] = {
  345. 14824, 13400, 11124, 8507, 6139, 4177, 2755, 1756,
  346. 1104, 677, 415, 248, 150, 89, 54, 31,
  347. 19, 11, 7, 4, 2,
  348. };
  349. /**
  350. * Fixed probabilities for symbols in Monkey Audio version 3.98
  351. */
  352. static const uint16_t counts_3980[22] = {
  353. 0, 19578, 36160, 48417, 56323, 60899, 63265, 64435,
  354. 64971, 65232, 65351, 65416, 65447, 65466, 65476, 65482,
  355. 65485, 65488, 65490, 65491, 65492, 65493,
  356. };
  357. /**
  358. * Probability ranges for symbols in Monkey Audio version 3.98
  359. */
  360. static const uint16_t counts_diff_3980[21] = {
  361. 19578, 16582, 12257, 7906, 4576, 2366, 1170, 536,
  362. 261, 119, 65, 31, 19, 10, 6, 3,
  363. 3, 2, 1, 1, 1,
  364. };
  365. /**
  366. * Decode symbol
  367. * @param ctx decoder context
  368. * @param counts probability range start position
  369. * @param counts_diff probability range widths
  370. */
  371. static inline int range_get_symbol(APEContext *ctx,
  372. const uint16_t counts[],
  373. const uint16_t counts_diff[])
  374. {
  375. int symbol, cf;
  376. cf = range_decode_culshift(ctx, 16);
  377. if(cf > 65492){
  378. symbol= cf - 65535 + 63;
  379. range_decode_update(ctx, 1, cf);
  380. if(cf > 65535)
  381. ctx->error=1;
  382. return symbol;
  383. }
  384. /* figure out the symbol inefficiently; a binary search would be much better */
  385. for (symbol = 0; counts[symbol + 1] <= cf; symbol++);
  386. range_decode_update(ctx, counts_diff[symbol], counts[symbol]);
  387. return symbol;
  388. }
  389. /** @} */ // group rangecoder
  390. static inline void update_rice(APERice *rice, unsigned int x)
  391. {
  392. int lim = rice->k ? (1 << (rice->k + 4)) : 0;
  393. rice->ksum += ((x + 1) / 2) - ((rice->ksum + 16) >> 5);
  394. if (rice->ksum < lim)
  395. rice->k--;
  396. else if (rice->ksum >= (1 << (rice->k + 5)) && rice->k < 24)
  397. rice->k++;
  398. }
  399. static inline int get_rice_ook(GetBitContext *gb, int k)
  400. {
  401. unsigned int x;
  402. x = get_unary(gb, 1, get_bits_left(gb));
  403. if (k)
  404. x = (x << k) | get_bits(gb, k);
  405. return x;
  406. }
  407. static inline int ape_decode_value_3860(APEContext *ctx, GetBitContext *gb,
  408. APERice *rice)
  409. {
  410. unsigned int x, overflow;
  411. overflow = get_unary(gb, 1, get_bits_left(gb));
  412. if (ctx->fileversion > 3880) {
  413. while (overflow >= 16) {
  414. overflow -= 16;
  415. rice->k += 4;
  416. }
  417. }
  418. if (!rice->k)
  419. x = overflow;
  420. else if(rice->k <= MIN_CACHE_BITS) {
  421. x = (overflow << rice->k) + get_bits(gb, rice->k);
  422. } else {
  423. av_log(ctx->avctx, AV_LOG_ERROR, "Too many bits: %d\n", rice->k);
  424. return AVERROR_INVALIDDATA;
  425. }
  426. rice->ksum += x - (rice->ksum + 8 >> 4);
  427. if (rice->ksum < (rice->k ? 1 << (rice->k + 4) : 0))
  428. rice->k--;
  429. else if (rice->ksum >= (1 << (rice->k + 5)) && rice->k < 24)
  430. rice->k++;
  431. /* Convert to signed */
  432. return ((x >> 1) ^ ((x & 1) - 1)) + 1;
  433. }
  434. static inline int ape_decode_value_3900(APEContext *ctx, APERice *rice)
  435. {
  436. unsigned int x, overflow;
  437. int tmpk;
  438. overflow = range_get_symbol(ctx, counts_3970, counts_diff_3970);
  439. if (overflow == (MODEL_ELEMENTS - 1)) {
  440. tmpk = range_decode_bits(ctx, 5);
  441. overflow = 0;
  442. } else
  443. tmpk = (rice->k < 1) ? 0 : rice->k - 1;
  444. if (tmpk <= 16 || ctx->fileversion < 3910) {
  445. if (tmpk > 23) {
  446. av_log(ctx->avctx, AV_LOG_ERROR, "Too many bits: %d\n", tmpk);
  447. return AVERROR_INVALIDDATA;
  448. }
  449. x = range_decode_bits(ctx, tmpk);
  450. } else if (tmpk <= 31) {
  451. x = range_decode_bits(ctx, 16);
  452. x |= (range_decode_bits(ctx, tmpk - 16) << 16);
  453. } else {
  454. av_log(ctx->avctx, AV_LOG_ERROR, "Too many bits: %d\n", tmpk);
  455. return AVERROR_INVALIDDATA;
  456. }
  457. x += overflow << tmpk;
  458. update_rice(rice, x);
  459. /* Convert to signed */
  460. return ((x >> 1) ^ ((x & 1) - 1)) + 1;
  461. }
  462. static inline int ape_decode_value_3990(APEContext *ctx, APERice *rice)
  463. {
  464. unsigned int x, overflow;
  465. int base, pivot;
  466. pivot = rice->ksum >> 5;
  467. if (pivot == 0)
  468. pivot = 1;
  469. overflow = range_get_symbol(ctx, counts_3980, counts_diff_3980);
  470. if (overflow == (MODEL_ELEMENTS - 1)) {
  471. overflow = (unsigned)range_decode_bits(ctx, 16) << 16;
  472. overflow |= range_decode_bits(ctx, 16);
  473. }
  474. if (pivot < 0x10000) {
  475. base = range_decode_culfreq(ctx, pivot);
  476. range_decode_update(ctx, 1, base);
  477. } else {
  478. int base_hi = pivot, base_lo;
  479. int bbits = 0;
  480. while (base_hi & ~0xFFFF) {
  481. base_hi >>= 1;
  482. bbits++;
  483. }
  484. base_hi = range_decode_culfreq(ctx, base_hi + 1);
  485. range_decode_update(ctx, 1, base_hi);
  486. base_lo = range_decode_culfreq(ctx, 1 << bbits);
  487. range_decode_update(ctx, 1, base_lo);
  488. base = (base_hi << bbits) + base_lo;
  489. }
  490. x = base + overflow * pivot;
  491. update_rice(rice, x);
  492. /* Convert to signed */
  493. return ((x >> 1) ^ ((x & 1) - 1)) + 1;
  494. }
  495. static void decode_array_0000(APEContext *ctx, GetBitContext *gb,
  496. int32_t *out, APERice *rice, int blockstodecode)
  497. {
  498. int i;
  499. unsigned ksummax, ksummin;
  500. rice->ksum = 0;
  501. for (i = 0; i < FFMIN(blockstodecode, 5); i++) {
  502. out[i] = get_rice_ook(&ctx->gb, 10);
  503. rice->ksum += out[i];
  504. }
  505. rice->k = av_log2(rice->ksum / 10) + 1;
  506. if (rice->k >= 24)
  507. return;
  508. for (; i < FFMIN(blockstodecode, 64); i++) {
  509. out[i] = get_rice_ook(&ctx->gb, rice->k);
  510. rice->ksum += out[i];
  511. rice->k = av_log2(rice->ksum / ((i + 1) * 2)) + 1;
  512. if (rice->k >= 24)
  513. return;
  514. }
  515. ksummax = 1 << rice->k + 7;
  516. ksummin = rice->k ? (1 << rice->k + 6) : 0;
  517. for (; i < blockstodecode; i++) {
  518. out[i] = get_rice_ook(&ctx->gb, rice->k);
  519. rice->ksum += out[i] - (unsigned)out[i - 64];
  520. while (rice->ksum < ksummin) {
  521. rice->k--;
  522. ksummin = rice->k ? ksummin >> 1 : 0;
  523. ksummax >>= 1;
  524. }
  525. while (rice->ksum >= ksummax) {
  526. rice->k++;
  527. if (rice->k > 24)
  528. return;
  529. ksummax <<= 1;
  530. ksummin = ksummin ? ksummin << 1 : 128;
  531. }
  532. }
  533. for (i = 0; i < blockstodecode; i++)
  534. out[i] = ((out[i] >> 1) ^ ((out[i] & 1) - 1)) + 1;
  535. }
  536. static void entropy_decode_mono_0000(APEContext *ctx, int blockstodecode)
  537. {
  538. decode_array_0000(ctx, &ctx->gb, ctx->decoded[0], &ctx->riceY,
  539. blockstodecode);
  540. }
  541. static void entropy_decode_stereo_0000(APEContext *ctx, int blockstodecode)
  542. {
  543. decode_array_0000(ctx, &ctx->gb, ctx->decoded[0], &ctx->riceY,
  544. blockstodecode);
  545. decode_array_0000(ctx, &ctx->gb, ctx->decoded[1], &ctx->riceX,
  546. blockstodecode);
  547. }
  548. static void entropy_decode_mono_3860(APEContext *ctx, int blockstodecode)
  549. {
  550. int32_t *decoded0 = ctx->decoded[0];
  551. while (blockstodecode--)
  552. *decoded0++ = ape_decode_value_3860(ctx, &ctx->gb, &ctx->riceY);
  553. }
  554. static void entropy_decode_stereo_3860(APEContext *ctx, int blockstodecode)
  555. {
  556. int32_t *decoded0 = ctx->decoded[0];
  557. int32_t *decoded1 = ctx->decoded[1];
  558. int blocks = blockstodecode;
  559. while (blockstodecode--)
  560. *decoded0++ = ape_decode_value_3860(ctx, &ctx->gb, &ctx->riceY);
  561. while (blocks--)
  562. *decoded1++ = ape_decode_value_3860(ctx, &ctx->gb, &ctx->riceX);
  563. }
  564. static void entropy_decode_mono_3900(APEContext *ctx, int blockstodecode)
  565. {
  566. int32_t *decoded0 = ctx->decoded[0];
  567. while (blockstodecode--)
  568. *decoded0++ = ape_decode_value_3900(ctx, &ctx->riceY);
  569. }
  570. static void entropy_decode_stereo_3900(APEContext *ctx, int blockstodecode)
  571. {
  572. int32_t *decoded0 = ctx->decoded[0];
  573. int32_t *decoded1 = ctx->decoded[1];
  574. int blocks = blockstodecode;
  575. while (blockstodecode--)
  576. *decoded0++ = ape_decode_value_3900(ctx, &ctx->riceY);
  577. range_dec_normalize(ctx);
  578. // because of some implementation peculiarities we need to backpedal here
  579. ctx->ptr -= 1;
  580. range_start_decoding(ctx);
  581. while (blocks--)
  582. *decoded1++ = ape_decode_value_3900(ctx, &ctx->riceX);
  583. }
  584. static void entropy_decode_stereo_3930(APEContext *ctx, int blockstodecode)
  585. {
  586. int32_t *decoded0 = ctx->decoded[0];
  587. int32_t *decoded1 = ctx->decoded[1];
  588. while (blockstodecode--) {
  589. *decoded0++ = ape_decode_value_3900(ctx, &ctx->riceY);
  590. *decoded1++ = ape_decode_value_3900(ctx, &ctx->riceX);
  591. }
  592. }
  593. static void entropy_decode_mono_3990(APEContext *ctx, int blockstodecode)
  594. {
  595. int32_t *decoded0 = ctx->decoded[0];
  596. while (blockstodecode--)
  597. *decoded0++ = ape_decode_value_3990(ctx, &ctx->riceY);
  598. }
  599. static void entropy_decode_stereo_3990(APEContext *ctx, int blockstodecode)
  600. {
  601. int32_t *decoded0 = ctx->decoded[0];
  602. int32_t *decoded1 = ctx->decoded[1];
  603. while (blockstodecode--) {
  604. *decoded0++ = ape_decode_value_3990(ctx, &ctx->riceY);
  605. *decoded1++ = ape_decode_value_3990(ctx, &ctx->riceX);
  606. }
  607. }
  608. static int init_entropy_decoder(APEContext *ctx)
  609. {
  610. /* Read the CRC */
  611. if (ctx->fileversion >= 3900) {
  612. if (ctx->data_end - ctx->ptr < 6)
  613. return AVERROR_INVALIDDATA;
  614. ctx->CRC = bytestream_get_be32(&ctx->ptr);
  615. } else {
  616. ctx->CRC = get_bits_long(&ctx->gb, 32);
  617. }
  618. /* Read the frame flags if they exist */
  619. ctx->frameflags = 0;
  620. if ((ctx->fileversion > 3820) && (ctx->CRC & 0x80000000)) {
  621. ctx->CRC &= ~0x80000000;
  622. if (ctx->data_end - ctx->ptr < 6)
  623. return AVERROR_INVALIDDATA;
  624. ctx->frameflags = bytestream_get_be32(&ctx->ptr);
  625. }
  626. /* Initialize the rice structs */
  627. ctx->riceX.k = 10;
  628. ctx->riceX.ksum = (1 << ctx->riceX.k) * 16;
  629. ctx->riceY.k = 10;
  630. ctx->riceY.ksum = (1 << ctx->riceY.k) * 16;
  631. if (ctx->fileversion >= 3900) {
  632. /* The first 8 bits of input are ignored. */
  633. ctx->ptr++;
  634. range_start_decoding(ctx);
  635. }
  636. return 0;
  637. }
  638. static const int32_t initial_coeffs_fast_3320[1] = {
  639. 375,
  640. };
  641. static const int32_t initial_coeffs_a_3800[3] = {
  642. 64, 115, 64,
  643. };
  644. static const int32_t initial_coeffs_b_3800[2] = {
  645. 740, 0
  646. };
  647. static const int32_t initial_coeffs_3930[4] = {
  648. 360, 317, -109, 98
  649. };
  650. static void init_predictor_decoder(APEContext *ctx)
  651. {
  652. APEPredictor *p = &ctx->predictor;
  653. /* Zero the history buffers */
  654. memset(p->historybuffer, 0, PREDICTOR_SIZE * sizeof(*p->historybuffer));
  655. p->buf = p->historybuffer;
  656. /* Initialize and zero the coefficients */
  657. if (ctx->fileversion < 3930) {
  658. if (ctx->compression_level == COMPRESSION_LEVEL_FAST) {
  659. memcpy(p->coeffsA[0], initial_coeffs_fast_3320,
  660. sizeof(initial_coeffs_fast_3320));
  661. memcpy(p->coeffsA[1], initial_coeffs_fast_3320,
  662. sizeof(initial_coeffs_fast_3320));
  663. } else {
  664. memcpy(p->coeffsA[0], initial_coeffs_a_3800,
  665. sizeof(initial_coeffs_a_3800));
  666. memcpy(p->coeffsA[1], initial_coeffs_a_3800,
  667. sizeof(initial_coeffs_a_3800));
  668. }
  669. } else {
  670. memcpy(p->coeffsA[0], initial_coeffs_3930, sizeof(initial_coeffs_3930));
  671. memcpy(p->coeffsA[1], initial_coeffs_3930, sizeof(initial_coeffs_3930));
  672. }
  673. memset(p->coeffsB, 0, sizeof(p->coeffsB));
  674. if (ctx->fileversion < 3930) {
  675. memcpy(p->coeffsB[0], initial_coeffs_b_3800,
  676. sizeof(initial_coeffs_b_3800));
  677. memcpy(p->coeffsB[1], initial_coeffs_b_3800,
  678. sizeof(initial_coeffs_b_3800));
  679. }
  680. p->filterA[0] = p->filterA[1] = 0;
  681. p->filterB[0] = p->filterB[1] = 0;
  682. p->lastA[0] = p->lastA[1] = 0;
  683. p->sample_pos = 0;
  684. }
  685. /** Get inverse sign of integer (-1 for positive, 1 for negative and 0 for zero) */
  686. static inline int APESIGN(int32_t x) {
  687. return (x < 0) - (x > 0);
  688. }
  689. static av_always_inline int filter_fast_3320(APEPredictor *p,
  690. const int decoded, const int filter,
  691. const int delayA)
  692. {
  693. int32_t predictionA;
  694. p->buf[delayA] = p->lastA[filter];
  695. if (p->sample_pos < 3) {
  696. p->lastA[filter] = decoded;
  697. p->filterA[filter] = decoded;
  698. return decoded;
  699. }
  700. predictionA = p->buf[delayA] * 2 - p->buf[delayA - 1];
  701. p->lastA[filter] = decoded + (predictionA * p->coeffsA[filter][0] >> 9);
  702. if ((decoded ^ predictionA) > 0)
  703. p->coeffsA[filter][0]++;
  704. else
  705. p->coeffsA[filter][0]--;
  706. p->filterA[filter] += (unsigned)p->lastA[filter];
  707. return p->filterA[filter];
  708. }
  709. static av_always_inline int filter_3800(APEPredictor *p,
  710. const int decoded, const int filter,
  711. const int delayA, const int delayB,
  712. const int start, const int shift)
  713. {
  714. int32_t predictionA, predictionB, sign;
  715. int32_t d0, d1, d2, d3, d4;
  716. p->buf[delayA] = p->lastA[filter];
  717. p->buf[delayB] = p->filterB[filter];
  718. if (p->sample_pos < start) {
  719. predictionA = decoded + p->filterA[filter];
  720. p->lastA[filter] = decoded;
  721. p->filterB[filter] = decoded;
  722. p->filterA[filter] = predictionA;
  723. return predictionA;
  724. }
  725. d2 = p->buf[delayA];
  726. d1 = (p->buf[delayA] - p->buf[delayA - 1]) * 2U;
  727. d0 = p->buf[delayA] + ((p->buf[delayA - 2] - p->buf[delayA - 1]) * 8U);
  728. d3 = p->buf[delayB] * 2U - p->buf[delayB - 1];
  729. d4 = p->buf[delayB];
  730. predictionA = d0 * p->coeffsA[filter][0] +
  731. d1 * p->coeffsA[filter][1] +
  732. d2 * p->coeffsA[filter][2];
  733. sign = APESIGN(decoded);
  734. p->coeffsA[filter][0] += (((d0 >> 30) & 2) - 1) * sign;
  735. p->coeffsA[filter][1] += (((d1 >> 28) & 8) - 4) * sign;
  736. p->coeffsA[filter][2] += (((d2 >> 28) & 8) - 4) * sign;
  737. predictionB = d3 * p->coeffsB[filter][0] -
  738. d4 * p->coeffsB[filter][1];
  739. p->lastA[filter] = decoded + (predictionA >> 11);
  740. sign = APESIGN(p->lastA[filter]);
  741. p->coeffsB[filter][0] += (((d3 >> 29) & 4) - 2) * sign;
  742. p->coeffsB[filter][1] -= (((d4 >> 30) & 2) - 1) * sign;
  743. p->filterB[filter] = p->lastA[filter] + (predictionB >> shift);
  744. p->filterA[filter] = p->filterB[filter] + (unsigned)((int)(p->filterA[filter] * 31U) >> 5);
  745. return p->filterA[filter];
  746. }
  747. static void long_filter_high_3800(int32_t *buffer, int order, int shift, int length)
  748. {
  749. int i, j;
  750. int32_t dotprod, sign;
  751. int32_t coeffs[256], delay[256];
  752. if (order >= length)
  753. return;
  754. memset(coeffs, 0, order * sizeof(*coeffs));
  755. for (i = 0; i < order; i++)
  756. delay[i] = buffer[i];
  757. for (i = order; i < length; i++) {
  758. dotprod = 0;
  759. sign = APESIGN(buffer[i]);
  760. for (j = 0; j < order; j++) {
  761. dotprod += delay[j] * (unsigned)coeffs[j];
  762. coeffs[j] += ((delay[j] >> 31) | 1) * sign;
  763. }
  764. buffer[i] -= dotprod >> shift;
  765. for (j = 0; j < order - 1; j++)
  766. delay[j] = delay[j + 1];
  767. delay[order - 1] = buffer[i];
  768. }
  769. }
  770. static void long_filter_ehigh_3830(int32_t *buffer, int length)
  771. {
  772. int i, j;
  773. int32_t dotprod, sign;
  774. int32_t delay[8] = { 0 };
  775. uint32_t coeffs[8] = { 0 };
  776. for (i = 0; i < length; i++) {
  777. dotprod = 0;
  778. sign = APESIGN(buffer[i]);
  779. for (j = 7; j >= 0; j--) {
  780. dotprod += delay[j] * coeffs[j];
  781. coeffs[j] += ((delay[j] >> 31) | 1) * sign;
  782. }
  783. for (j = 7; j > 0; j--)
  784. delay[j] = delay[j - 1];
  785. delay[0] = buffer[i];
  786. buffer[i] -= dotprod >> 9;
  787. }
  788. }
  789. static void predictor_decode_stereo_3800(APEContext *ctx, int count)
  790. {
  791. APEPredictor *p = &ctx->predictor;
  792. int32_t *decoded0 = ctx->decoded[0];
  793. int32_t *decoded1 = ctx->decoded[1];
  794. int start = 4, shift = 10;
  795. if (ctx->compression_level == COMPRESSION_LEVEL_HIGH) {
  796. start = 16;
  797. long_filter_high_3800(decoded0, 16, 9, count);
  798. long_filter_high_3800(decoded1, 16, 9, count);
  799. } else if (ctx->compression_level == COMPRESSION_LEVEL_EXTRA_HIGH) {
  800. int order = 128, shift2 = 11;
  801. if (ctx->fileversion >= 3830) {
  802. order <<= 1;
  803. shift++;
  804. shift2++;
  805. long_filter_ehigh_3830(decoded0 + order, count - order);
  806. long_filter_ehigh_3830(decoded1 + order, count - order);
  807. }
  808. start = order;
  809. long_filter_high_3800(decoded0, order, shift2, count);
  810. long_filter_high_3800(decoded1, order, shift2, count);
  811. }
  812. while (count--) {
  813. int X = *decoded0, Y = *decoded1;
  814. if (ctx->compression_level == COMPRESSION_LEVEL_FAST) {
  815. *decoded0 = filter_fast_3320(p, Y, 0, YDELAYA);
  816. decoded0++;
  817. *decoded1 = filter_fast_3320(p, X, 1, XDELAYA);
  818. decoded1++;
  819. } else {
  820. *decoded0 = filter_3800(p, Y, 0, YDELAYA, YDELAYB,
  821. start, shift);
  822. decoded0++;
  823. *decoded1 = filter_3800(p, X, 1, XDELAYA, XDELAYB,
  824. start, shift);
  825. decoded1++;
  826. }
  827. /* Combined */
  828. p->buf++;
  829. p->sample_pos++;
  830. /* Have we filled the history buffer? */
  831. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  832. memmove(p->historybuffer, p->buf,
  833. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  834. p->buf = p->historybuffer;
  835. }
  836. }
  837. }
  838. static void predictor_decode_mono_3800(APEContext *ctx, int count)
  839. {
  840. APEPredictor *p = &ctx->predictor;
  841. int32_t *decoded0 = ctx->decoded[0];
  842. int start = 4, shift = 10;
  843. if (ctx->compression_level == COMPRESSION_LEVEL_HIGH) {
  844. start = 16;
  845. long_filter_high_3800(decoded0, 16, 9, count);
  846. } else if (ctx->compression_level == COMPRESSION_LEVEL_EXTRA_HIGH) {
  847. int order = 128, shift2 = 11;
  848. if (ctx->fileversion >= 3830) {
  849. order <<= 1;
  850. shift++;
  851. shift2++;
  852. long_filter_ehigh_3830(decoded0 + order, count - order);
  853. }
  854. start = order;
  855. long_filter_high_3800(decoded0, order, shift2, count);
  856. }
  857. while (count--) {
  858. if (ctx->compression_level == COMPRESSION_LEVEL_FAST) {
  859. *decoded0 = filter_fast_3320(p, *decoded0, 0, YDELAYA);
  860. decoded0++;
  861. } else {
  862. *decoded0 = filter_3800(p, *decoded0, 0, YDELAYA, YDELAYB,
  863. start, shift);
  864. decoded0++;
  865. }
  866. /* Combined */
  867. p->buf++;
  868. p->sample_pos++;
  869. /* Have we filled the history buffer? */
  870. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  871. memmove(p->historybuffer, p->buf,
  872. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  873. p->buf = p->historybuffer;
  874. }
  875. }
  876. }
  877. static av_always_inline int predictor_update_3930(APEPredictor *p,
  878. const int decoded, const int filter,
  879. const int delayA)
  880. {
  881. int32_t predictionA, sign;
  882. int32_t d0, d1, d2, d3;
  883. p->buf[delayA] = p->lastA[filter];
  884. d0 = p->buf[delayA ];
  885. d1 = p->buf[delayA ] - p->buf[delayA - 1];
  886. d2 = p->buf[delayA - 1] - p->buf[delayA - 2];
  887. d3 = p->buf[delayA - 2] - p->buf[delayA - 3];
  888. predictionA = d0 * p->coeffsA[filter][0] +
  889. d1 * p->coeffsA[filter][1] +
  890. d2 * p->coeffsA[filter][2] +
  891. d3 * p->coeffsA[filter][3];
  892. p->lastA[filter] = decoded + (predictionA >> 9);
  893. p->filterA[filter] = p->lastA[filter] + ((int)(p->filterA[filter] * 31U) >> 5);
  894. sign = APESIGN(decoded);
  895. p->coeffsA[filter][0] += ((d0 < 0) * 2 - 1) * sign;
  896. p->coeffsA[filter][1] += ((d1 < 0) * 2 - 1) * sign;
  897. p->coeffsA[filter][2] += ((d2 < 0) * 2 - 1) * sign;
  898. p->coeffsA[filter][3] += ((d3 < 0) * 2 - 1) * sign;
  899. return p->filterA[filter];
  900. }
  901. static void predictor_decode_stereo_3930(APEContext *ctx, int count)
  902. {
  903. APEPredictor *p = &ctx->predictor;
  904. int32_t *decoded0 = ctx->decoded[0];
  905. int32_t *decoded1 = ctx->decoded[1];
  906. ape_apply_filters(ctx, ctx->decoded[0], ctx->decoded[1], count);
  907. while (count--) {
  908. /* Predictor Y */
  909. int Y = *decoded1, X = *decoded0;
  910. *decoded0 = predictor_update_3930(p, Y, 0, YDELAYA);
  911. decoded0++;
  912. *decoded1 = predictor_update_3930(p, X, 1, XDELAYA);
  913. decoded1++;
  914. /* Combined */
  915. p->buf++;
  916. /* Have we filled the history buffer? */
  917. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  918. memmove(p->historybuffer, p->buf,
  919. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  920. p->buf = p->historybuffer;
  921. }
  922. }
  923. }
  924. static void predictor_decode_mono_3930(APEContext *ctx, int count)
  925. {
  926. APEPredictor *p = &ctx->predictor;
  927. int32_t *decoded0 = ctx->decoded[0];
  928. ape_apply_filters(ctx, ctx->decoded[0], NULL, count);
  929. while (count--) {
  930. *decoded0 = predictor_update_3930(p, *decoded0, 0, YDELAYA);
  931. decoded0++;
  932. p->buf++;
  933. /* Have we filled the history buffer? */
  934. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  935. memmove(p->historybuffer, p->buf,
  936. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  937. p->buf = p->historybuffer;
  938. }
  939. }
  940. }
  941. static av_always_inline int predictor_update_filter(APEPredictor *p,
  942. const int decoded, const int filter,
  943. const int delayA, const int delayB,
  944. const int adaptA, const int adaptB)
  945. {
  946. int32_t predictionA, predictionB, sign;
  947. p->buf[delayA] = p->lastA[filter];
  948. p->buf[adaptA] = APESIGN(p->buf[delayA]);
  949. p->buf[delayA - 1] = p->buf[delayA] - (unsigned)p->buf[delayA - 1];
  950. p->buf[adaptA - 1] = APESIGN(p->buf[delayA - 1]);
  951. predictionA = p->buf[delayA ] * p->coeffsA[filter][0] +
  952. p->buf[delayA - 1] * p->coeffsA[filter][1] +
  953. p->buf[delayA - 2] * p->coeffsA[filter][2] +
  954. p->buf[delayA - 3] * p->coeffsA[filter][3];
  955. /* Apply a scaled first-order filter compression */
  956. p->buf[delayB] = p->filterA[filter ^ 1] - ((int)(p->filterB[filter] * 31U) >> 5);
  957. p->buf[adaptB] = APESIGN(p->buf[delayB]);
  958. p->buf[delayB - 1] = p->buf[delayB] - (unsigned)p->buf[delayB - 1];
  959. p->buf[adaptB - 1] = APESIGN(p->buf[delayB - 1]);
  960. p->filterB[filter] = p->filterA[filter ^ 1];
  961. predictionB = p->buf[delayB ] * p->coeffsB[filter][0] +
  962. p->buf[delayB - 1] * p->coeffsB[filter][1] +
  963. p->buf[delayB - 2] * p->coeffsB[filter][2] +
  964. p->buf[delayB - 3] * p->coeffsB[filter][3] +
  965. p->buf[delayB - 4] * p->coeffsB[filter][4];
  966. p->lastA[filter] = decoded + ((int)((unsigned)predictionA + (predictionB >> 1)) >> 10);
  967. p->filterA[filter] = p->lastA[filter] + ((int)(p->filterA[filter] * 31U) >> 5);
  968. sign = APESIGN(decoded);
  969. p->coeffsA[filter][0] += p->buf[adaptA ] * sign;
  970. p->coeffsA[filter][1] += p->buf[adaptA - 1] * sign;
  971. p->coeffsA[filter][2] += p->buf[adaptA - 2] * sign;
  972. p->coeffsA[filter][3] += p->buf[adaptA - 3] * sign;
  973. p->coeffsB[filter][0] += p->buf[adaptB ] * sign;
  974. p->coeffsB[filter][1] += p->buf[adaptB - 1] * sign;
  975. p->coeffsB[filter][2] += p->buf[adaptB - 2] * sign;
  976. p->coeffsB[filter][3] += p->buf[adaptB - 3] * sign;
  977. p->coeffsB[filter][4] += p->buf[adaptB - 4] * sign;
  978. return p->filterA[filter];
  979. }
  980. static void predictor_decode_stereo_3950(APEContext *ctx, int count)
  981. {
  982. APEPredictor *p = &ctx->predictor;
  983. int32_t *decoded0 = ctx->decoded[0];
  984. int32_t *decoded1 = ctx->decoded[1];
  985. ape_apply_filters(ctx, ctx->decoded[0], ctx->decoded[1], count);
  986. while (count--) {
  987. /* Predictor Y */
  988. *decoded0 = predictor_update_filter(p, *decoded0, 0, YDELAYA, YDELAYB,
  989. YADAPTCOEFFSA, YADAPTCOEFFSB);
  990. decoded0++;
  991. *decoded1 = predictor_update_filter(p, *decoded1, 1, XDELAYA, XDELAYB,
  992. XADAPTCOEFFSA, XADAPTCOEFFSB);
  993. decoded1++;
  994. /* Combined */
  995. p->buf++;
  996. /* Have we filled the history buffer? */
  997. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  998. memmove(p->historybuffer, p->buf,
  999. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  1000. p->buf = p->historybuffer;
  1001. }
  1002. }
  1003. }
  1004. static void predictor_decode_mono_3950(APEContext *ctx, int count)
  1005. {
  1006. APEPredictor *p = &ctx->predictor;
  1007. int32_t *decoded0 = ctx->decoded[0];
  1008. int32_t predictionA, currentA, A, sign;
  1009. ape_apply_filters(ctx, ctx->decoded[0], NULL, count);
  1010. currentA = p->lastA[0];
  1011. while (count--) {
  1012. A = *decoded0;
  1013. p->buf[YDELAYA] = currentA;
  1014. p->buf[YDELAYA - 1] = p->buf[YDELAYA] - (unsigned)p->buf[YDELAYA - 1];
  1015. predictionA = p->buf[YDELAYA ] * p->coeffsA[0][0] +
  1016. p->buf[YDELAYA - 1] * p->coeffsA[0][1] +
  1017. p->buf[YDELAYA - 2] * p->coeffsA[0][2] +
  1018. p->buf[YDELAYA - 3] * p->coeffsA[0][3];
  1019. currentA = A + (unsigned)(predictionA >> 10);
  1020. p->buf[YADAPTCOEFFSA] = APESIGN(p->buf[YDELAYA ]);
  1021. p->buf[YADAPTCOEFFSA - 1] = APESIGN(p->buf[YDELAYA - 1]);
  1022. sign = APESIGN(A);
  1023. p->coeffsA[0][0] += p->buf[YADAPTCOEFFSA ] * sign;
  1024. p->coeffsA[0][1] += p->buf[YADAPTCOEFFSA - 1] * sign;
  1025. p->coeffsA[0][2] += p->buf[YADAPTCOEFFSA - 2] * sign;
  1026. p->coeffsA[0][3] += p->buf[YADAPTCOEFFSA - 3] * sign;
  1027. p->buf++;
  1028. /* Have we filled the history buffer? */
  1029. if (p->buf == p->historybuffer + HISTORY_SIZE) {
  1030. memmove(p->historybuffer, p->buf,
  1031. PREDICTOR_SIZE * sizeof(*p->historybuffer));
  1032. p->buf = p->historybuffer;
  1033. }
  1034. p->filterA[0] = currentA + (unsigned)((int)(p->filterA[0] * 31U) >> 5);
  1035. *(decoded0++) = p->filterA[0];
  1036. }
  1037. p->lastA[0] = currentA;
  1038. }
  1039. static void do_init_filter(APEFilter *f, int16_t *buf, int order)
  1040. {
  1041. f->coeffs = buf;
  1042. f->historybuffer = buf + order;
  1043. f->delay = f->historybuffer + order * 2;
  1044. f->adaptcoeffs = f->historybuffer + order;
  1045. memset(f->historybuffer, 0, (order * 2) * sizeof(*f->historybuffer));
  1046. memset(f->coeffs, 0, order * sizeof(*f->coeffs));
  1047. f->avg = 0;
  1048. }
  1049. static void init_filter(APEContext *ctx, APEFilter *f, int16_t *buf, int order)
  1050. {
  1051. do_init_filter(&f[0], buf, order);
  1052. do_init_filter(&f[1], buf + order * 3 + HISTORY_SIZE, order);
  1053. }
  1054. static void do_apply_filter(APEContext *ctx, int version, APEFilter *f,
  1055. int32_t *data, int count, int order, int fracbits)
  1056. {
  1057. int res;
  1058. int absres;
  1059. while (count--) {
  1060. /* round fixedpoint scalar product */
  1061. res = ctx->adsp.scalarproduct_and_madd_int16(f->coeffs,
  1062. f->delay - order,
  1063. f->adaptcoeffs - order,
  1064. order, APESIGN(*data));
  1065. res = (int)(res + (1U << (fracbits - 1))) >> fracbits;
  1066. res += (unsigned)*data;
  1067. *data++ = res;
  1068. /* Update the output history */
  1069. *f->delay++ = av_clip_int16(res);
  1070. if (version < 3980) {
  1071. /* Version ??? to < 3.98 files (untested) */
  1072. f->adaptcoeffs[0] = (res == 0) ? 0 : ((res >> 28) & 8) - 4;
  1073. f->adaptcoeffs[-4] >>= 1;
  1074. f->adaptcoeffs[-8] >>= 1;
  1075. } else {
  1076. /* Version 3.98 and later files */
  1077. /* Update the adaption coefficients */
  1078. absres = res < 0 ? -(unsigned)res : res;
  1079. if (absres)
  1080. *f->adaptcoeffs = APESIGN(res) *
  1081. (8 << ((absres > f->avg * 3) + (absres > f->avg * 4 / 3)));
  1082. /* equivalent to the following code
  1083. if (absres <= f->avg * 4 / 3)
  1084. *f->adaptcoeffs = APESIGN(res) * 8;
  1085. else if (absres <= f->avg * 3)
  1086. *f->adaptcoeffs = APESIGN(res) * 16;
  1087. else
  1088. *f->adaptcoeffs = APESIGN(res) * 32;
  1089. */
  1090. else
  1091. *f->adaptcoeffs = 0;
  1092. f->avg += (int)(absres - (unsigned)f->avg) / 16;
  1093. f->adaptcoeffs[-1] >>= 1;
  1094. f->adaptcoeffs[-2] >>= 1;
  1095. f->adaptcoeffs[-8] >>= 1;
  1096. }
  1097. f->adaptcoeffs++;
  1098. /* Have we filled the history buffer? */
  1099. if (f->delay == f->historybuffer + HISTORY_SIZE + (order * 2)) {
  1100. memmove(f->historybuffer, f->delay - (order * 2),
  1101. (order * 2) * sizeof(*f->historybuffer));
  1102. f->delay = f->historybuffer + order * 2;
  1103. f->adaptcoeffs = f->historybuffer + order;
  1104. }
  1105. }
  1106. }
  1107. static void apply_filter(APEContext *ctx, APEFilter *f,
  1108. int32_t *data0, int32_t *data1,
  1109. int count, int order, int fracbits)
  1110. {
  1111. do_apply_filter(ctx, ctx->fileversion, &f[0], data0, count, order, fracbits);
  1112. if (data1)
  1113. do_apply_filter(ctx, ctx->fileversion, &f[1], data1, count, order, fracbits);
  1114. }
  1115. static void ape_apply_filters(APEContext *ctx, int32_t *decoded0,
  1116. int32_t *decoded1, int count)
  1117. {
  1118. int i;
  1119. for (i = 0; i < APE_FILTER_LEVELS; i++) {
  1120. if (!ape_filter_orders[ctx->fset][i])
  1121. break;
  1122. apply_filter(ctx, ctx->filters[i], decoded0, decoded1, count,
  1123. ape_filter_orders[ctx->fset][i],
  1124. ape_filter_fracbits[ctx->fset][i]);
  1125. }
  1126. }
  1127. static int init_frame_decoder(APEContext *ctx)
  1128. {
  1129. int i, ret;
  1130. if ((ret = init_entropy_decoder(ctx)) < 0)
  1131. return ret;
  1132. init_predictor_decoder(ctx);
  1133. for (i = 0; i < APE_FILTER_LEVELS; i++) {
  1134. if (!ape_filter_orders[ctx->fset][i])
  1135. break;
  1136. init_filter(ctx, ctx->filters[i], ctx->filterbuf[i],
  1137. ape_filter_orders[ctx->fset][i]);
  1138. }
  1139. return 0;
  1140. }
  1141. static void ape_unpack_mono(APEContext *ctx, int count)
  1142. {
  1143. if (ctx->frameflags & APE_FRAMECODE_STEREO_SILENCE) {
  1144. /* We are pure silence, so we're done. */
  1145. av_log(ctx->avctx, AV_LOG_DEBUG, "pure silence mono\n");
  1146. return;
  1147. }
  1148. ctx->entropy_decode_mono(ctx, count);
  1149. /* Now apply the predictor decoding */
  1150. ctx->predictor_decode_mono(ctx, count);
  1151. /* Pseudo-stereo - just copy left channel to right channel */
  1152. if (ctx->channels == 2) {
  1153. memcpy(ctx->decoded[1], ctx->decoded[0], count * sizeof(*ctx->decoded[1]));
  1154. }
  1155. }
  1156. static void ape_unpack_stereo(APEContext *ctx, int count)
  1157. {
  1158. unsigned left, right;
  1159. int32_t *decoded0 = ctx->decoded[0];
  1160. int32_t *decoded1 = ctx->decoded[1];
  1161. if ((ctx->frameflags & APE_FRAMECODE_STEREO_SILENCE) == APE_FRAMECODE_STEREO_SILENCE) {
  1162. /* We are pure silence, so we're done. */
  1163. av_log(ctx->avctx, AV_LOG_DEBUG, "pure silence stereo\n");
  1164. return;
  1165. }
  1166. ctx->entropy_decode_stereo(ctx, count);
  1167. /* Now apply the predictor decoding */
  1168. ctx->predictor_decode_stereo(ctx, count);
  1169. /* Decorrelate and scale to output depth */
  1170. while (count--) {
  1171. left = *decoded1 - (unsigned)(*decoded0 / 2);
  1172. right = left + *decoded0;
  1173. *(decoded0++) = left;
  1174. *(decoded1++) = right;
  1175. }
  1176. }
  1177. static int ape_decode_frame(AVCodecContext *avctx, void *data,
  1178. int *got_frame_ptr, AVPacket *avpkt)
  1179. {
  1180. AVFrame *frame = data;
  1181. const uint8_t *buf = avpkt->data;
  1182. APEContext *s = avctx->priv_data;
  1183. uint8_t *sample8;
  1184. int16_t *sample16;
  1185. int32_t *sample24;
  1186. int i, ch, ret;
  1187. int blockstodecode;
  1188. uint64_t decoded_buffer_size;
  1189. /* this should never be negative, but bad things will happen if it is, so
  1190. check it just to make sure. */
  1191. av_assert0(s->samples >= 0);
  1192. if(!s->samples){
  1193. uint32_t nblocks, offset;
  1194. int buf_size;
  1195. if (!avpkt->size) {
  1196. *got_frame_ptr = 0;
  1197. return 0;
  1198. }
  1199. if (avpkt->size < 8) {
  1200. av_log(avctx, AV_LOG_ERROR, "Packet is too small\n");
  1201. return AVERROR_INVALIDDATA;
  1202. }
  1203. buf_size = avpkt->size & ~3;
  1204. if (buf_size != avpkt->size) {
  1205. av_log(avctx, AV_LOG_WARNING, "packet size is not a multiple of 4. "
  1206. "extra bytes at the end will be skipped.\n");
  1207. }
  1208. if (s->fileversion < 3950) // previous versions overread two bytes
  1209. buf_size += 2;
  1210. av_fast_padded_malloc(&s->data, &s->data_size, buf_size);
  1211. if (!s->data)
  1212. return AVERROR(ENOMEM);
  1213. s->bdsp.bswap_buf((uint32_t *) s->data, (const uint32_t *) buf,
  1214. buf_size >> 2);
  1215. memset(s->data + (buf_size & ~3), 0, buf_size & 3);
  1216. s->ptr = s->data;
  1217. s->data_end = s->data + buf_size;
  1218. nblocks = bytestream_get_be32(&s->ptr);
  1219. offset = bytestream_get_be32(&s->ptr);
  1220. if (s->fileversion >= 3900) {
  1221. if (offset > 3) {
  1222. av_log(avctx, AV_LOG_ERROR, "Incorrect offset passed\n");
  1223. av_freep(&s->data);
  1224. s->data_size = 0;
  1225. return AVERROR_INVALIDDATA;
  1226. }
  1227. if (s->data_end - s->ptr < offset) {
  1228. av_log(avctx, AV_LOG_ERROR, "Packet is too small\n");
  1229. return AVERROR_INVALIDDATA;
  1230. }
  1231. s->ptr += offset;
  1232. } else {
  1233. if ((ret = init_get_bits8(&s->gb, s->ptr, s->data_end - s->ptr)) < 0)
  1234. return ret;
  1235. if (s->fileversion > 3800)
  1236. skip_bits_long(&s->gb, offset * 8);
  1237. else
  1238. skip_bits_long(&s->gb, offset);
  1239. }
  1240. if (!nblocks || nblocks > INT_MAX / 2 / sizeof(*s->decoded_buffer) - 8) {
  1241. av_log(avctx, AV_LOG_ERROR, "Invalid sample count: %"PRIu32".\n",
  1242. nblocks);
  1243. return AVERROR_INVALIDDATA;
  1244. }
  1245. /* Initialize the frame decoder */
  1246. if (init_frame_decoder(s) < 0) {
  1247. av_log(avctx, AV_LOG_ERROR, "Error reading frame header\n");
  1248. return AVERROR_INVALIDDATA;
  1249. }
  1250. s->samples = nblocks;
  1251. }
  1252. if (!s->data) {
  1253. *got_frame_ptr = 0;
  1254. return avpkt->size;
  1255. }
  1256. blockstodecode = FFMIN(s->blocks_per_loop, s->samples);
  1257. // for old files coefficients were not interleaved,
  1258. // so we need to decode all of them at once
  1259. if (s->fileversion < 3930)
  1260. blockstodecode = s->samples;
  1261. /* reallocate decoded sample buffer if needed */
  1262. decoded_buffer_size = 2LL * FFALIGN(blockstodecode, 8) * sizeof(*s->decoded_buffer);
  1263. av_assert0(decoded_buffer_size <= INT_MAX);
  1264. av_fast_malloc(&s->decoded_buffer, &s->decoded_size, decoded_buffer_size);
  1265. if (!s->decoded_buffer)
  1266. return AVERROR(ENOMEM);
  1267. memset(s->decoded_buffer, 0, decoded_buffer_size);
  1268. s->decoded[0] = s->decoded_buffer;
  1269. s->decoded[1] = s->decoded_buffer + FFALIGN(blockstodecode, 8);
  1270. /* get output buffer */
  1271. frame->nb_samples = blockstodecode;
  1272. if ((ret = ff_get_buffer(avctx, frame, 0)) < 0)
  1273. return ret;
  1274. s->error=0;
  1275. if ((s->channels == 1) || (s->frameflags & APE_FRAMECODE_PSEUDO_STEREO))
  1276. ape_unpack_mono(s, blockstodecode);
  1277. else
  1278. ape_unpack_stereo(s, blockstodecode);
  1279. emms_c();
  1280. if (s->error) {
  1281. s->samples=0;
  1282. av_log(avctx, AV_LOG_ERROR, "Error decoding frame\n");
  1283. return AVERROR_INVALIDDATA;
  1284. }
  1285. switch (s->bps) {
  1286. case 8:
  1287. for (ch = 0; ch < s->channels; ch++) {
  1288. sample8 = (uint8_t *)frame->data[ch];
  1289. for (i = 0; i < blockstodecode; i++)
  1290. *sample8++ = (s->decoded[ch][i] + 0x80) & 0xff;
  1291. }
  1292. break;
  1293. case 16:
  1294. for (ch = 0; ch < s->channels; ch++) {
  1295. sample16 = (int16_t *)frame->data[ch];
  1296. for (i = 0; i < blockstodecode; i++)
  1297. *sample16++ = s->decoded[ch][i];
  1298. }
  1299. break;
  1300. case 24:
  1301. for (ch = 0; ch < s->channels; ch++) {
  1302. sample24 = (int32_t *)frame->data[ch];
  1303. for (i = 0; i < blockstodecode; i++)
  1304. *sample24++ = s->decoded[ch][i] * 256;
  1305. }
  1306. break;
  1307. }
  1308. s->samples -= blockstodecode;
  1309. *got_frame_ptr = 1;
  1310. return !s->samples ? avpkt->size : 0;
  1311. }
  1312. static void ape_flush(AVCodecContext *avctx)
  1313. {
  1314. APEContext *s = avctx->priv_data;
  1315. s->samples= 0;
  1316. }
  1317. #define OFFSET(x) offsetof(APEContext, x)
  1318. #define PAR (AV_OPT_FLAG_DECODING_PARAM | AV_OPT_FLAG_AUDIO_PARAM)
  1319. static const AVOption options[] = {
  1320. { "max_samples", "maximum number of samples decoded per call", OFFSET(blocks_per_loop), AV_OPT_TYPE_INT, { .i64 = 4608 }, 1, INT_MAX, PAR, "max_samples" },
  1321. { "all", "no maximum. decode all samples for each packet at once", 0, AV_OPT_TYPE_CONST, { .i64 = INT_MAX }, INT_MIN, INT_MAX, PAR, "max_samples" },
  1322. { NULL},
  1323. };
  1324. static const AVClass ape_decoder_class = {
  1325. .class_name = "APE decoder",
  1326. .item_name = av_default_item_name,
  1327. .option = options,
  1328. .version = LIBAVUTIL_VERSION_INT,
  1329. };
  1330. AVCodec ff_ape_decoder = {
  1331. .name = "ape",
  1332. .long_name = NULL_IF_CONFIG_SMALL("Monkey's Audio"),
  1333. .type = AVMEDIA_TYPE_AUDIO,
  1334. .id = AV_CODEC_ID_APE,
  1335. .priv_data_size = sizeof(APEContext),
  1336. .init = ape_decode_init,
  1337. .close = ape_decode_close,
  1338. .decode = ape_decode_frame,
  1339. .capabilities = AV_CODEC_CAP_SUBFRAMES | AV_CODEC_CAP_DELAY |
  1340. AV_CODEC_CAP_DR1,
  1341. .flush = ape_flush,
  1342. .sample_fmts = (const enum AVSampleFormat[]) { AV_SAMPLE_FMT_U8P,
  1343. AV_SAMPLE_FMT_S16P,
  1344. AV_SAMPLE_FMT_S32P,
  1345. AV_SAMPLE_FMT_NONE },
  1346. .priv_class = &ape_decoder_class,
  1347. };