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.

395 lines
10KB

  1. /*
  2. * Real Audio 1.0 (14.4K)
  3. * Copyright (c) 2003 the ffmpeg project
  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. #include "avcodec.h"
  22. #include "bitstream.h"
  23. #include "ra144.h"
  24. #define NBLOCKS 4 /* number of segments within a block */
  25. #define BLOCKSIZE 40 /* (quarter) block size in 16-bit words (80 bytes) */
  26. #define HALFBLOCK 20 /* BLOCKSIZE/2 */
  27. #define BUFFERSIZE 146 /* for do_output */
  28. /* internal globals */
  29. typedef struct {
  30. unsigned int old_energy; ///< previous frame energy
  31. /* the swapped buffers */
  32. unsigned int lpc_tables[4][10];
  33. unsigned int *lpc_refl; ///< LPC reflection coefficients
  34. unsigned int *lpc_coef; ///< LPC coefficients
  35. unsigned int *lpc_refl_old; ///< previous frame LPC reflection coefs
  36. unsigned int *lpc_coef_old; ///< previous frame LPC coefficients
  37. unsigned int buffer[5];
  38. uint16_t adapt_cb[148]; ///< adaptive codebook
  39. } RA144Context;
  40. static int ra144_decode_init(AVCodecContext * avctx)
  41. {
  42. RA144Context *ractx = avctx->priv_data;
  43. ractx->lpc_refl = ractx->lpc_tables[0];
  44. ractx->lpc_coef = ractx->lpc_tables[1];
  45. ractx->lpc_refl_old = ractx->lpc_tables[2];
  46. ractx->lpc_coef_old = ractx->lpc_tables[3];
  47. return 0;
  48. }
  49. /**
  50. * Evaluate sqrt(x << 24). x must fit in 20 bits. This value is evaluated in an
  51. * odd way to make the output identical to the binary decoder.
  52. */
  53. static int t_sqrt(unsigned int x)
  54. {
  55. int s = 0;
  56. while (x > 0xfff) {
  57. s++;
  58. x = x >> 2;
  59. }
  60. return (ff_sqrt(x << 20) << s) << 2;
  61. }
  62. /**
  63. * Evaluate the LPC filter coefficients from the reflection coefficients.
  64. * Does the inverse of the eq() function.
  65. */
  66. static void do_voice(const int *a1, int *a2)
  67. {
  68. int buffer[10];
  69. int *b1 = buffer;
  70. int *b2 = a2;
  71. int x, y;
  72. for (x=0; x < 10; x++) {
  73. b1[x] = a1[x] << 4;
  74. for (y=0; y < x; y++)
  75. b1[y] = ((a1[x] * b2[x-y-1]) >> 12) + b2[y];
  76. FFSWAP(int *, b1, b2);
  77. }
  78. for (x=0; x < 10; x++)
  79. a2[x] >>= 4;
  80. }
  81. /* rotate block */
  82. static void rotate_block(const int16_t *source, int16_t *target, int offset)
  83. {
  84. int i=0, k=0;
  85. source += BUFFERSIZE - offset;
  86. while (i<BLOCKSIZE) {
  87. target[i++] = source[k++];
  88. if (k == offset)
  89. k = 0;
  90. }
  91. }
  92. /* inverse root mean square */
  93. static int irms(const int16_t *data, int factor)
  94. {
  95. unsigned int i, sum = 0;
  96. for (i=0; i < BLOCKSIZE; i++)
  97. sum += data[i] * data[i];
  98. if (sum == 0)
  99. return 0; /* OOPS - division by zero */
  100. return (0x20000000 / (t_sqrt(sum) >> 8)) * factor;
  101. }
  102. /* multiply/add wavetable */
  103. static void add_wav(int n, int skip_first, int *m, const int16_t *s1,
  104. const int8_t *s2, const int8_t *s3, int16_t *dest)
  105. {
  106. int i;
  107. int v[3];
  108. v[0] = 0;
  109. for (i=!skip_first; i<3; i++)
  110. v[i] = (wavtable1[n][i] * m[i]) >> (wavtable2[n][i] + 1);
  111. for (i=0; i < BLOCKSIZE; i++)
  112. dest[i] = ((*(s1++))*v[0] + (*(s2++))*v[1] + (*(s3++))*v[2]) >> 12;
  113. }
  114. static void final(const int16_t *i1, const int16_t *i2,
  115. void *out, int *statbuf, int len)
  116. {
  117. int x, i;
  118. uint16_t work[50];
  119. int16_t *ptr = work;
  120. memcpy(work, statbuf,20);
  121. memcpy(work + 10, i2, len * 2);
  122. for (i=0; i<len; i++) {
  123. int sum = 0;
  124. int new_val;
  125. for(x=0; x<10; x++)
  126. sum += i1[9-x] * ptr[x];
  127. sum >>= 12;
  128. new_val = ptr[10] - sum;
  129. if (new_val < -32768 || new_val > 32767) {
  130. memset(out, 0, len * 2);
  131. memset(statbuf, 0, 20);
  132. return;
  133. }
  134. ptr[10] = new_val;
  135. ptr++;
  136. }
  137. memcpy(out, work+10, len * 2);
  138. memcpy(statbuf, work + 40, 20);
  139. }
  140. static unsigned int rms(const int *data, int f)
  141. {
  142. int x;
  143. unsigned int res = 0x10000;
  144. int b = 0;
  145. for (x=0; x<10; x++) {
  146. res = (((0x1000000 - (*data) * (*data)) >> 12) * res) >> 12;
  147. if (res == 0)
  148. return 0;
  149. if (res > 0x10000)
  150. return 0; /* We're screwed, might as well go out with a bang. :P */
  151. while (res <= 0x3fff) {
  152. b++;
  153. res <<= 2;
  154. }
  155. data++;
  156. }
  157. if (res > 0)
  158. res = t_sqrt(res);
  159. res >>= (b + 10);
  160. res = (res * f) >> 10;
  161. return res;
  162. }
  163. /* do quarter-block output */
  164. static void do_output_subblock(RA144Context *ractx,
  165. const uint16_t *gsp, unsigned int gval,
  166. int16_t *output_buffer, GetBitContext *gb)
  167. {
  168. uint16_t buffer_a[40];
  169. uint16_t *block;
  170. int cba_idx = get_bits(gb, 7); // index of the adaptive CB, 0 if none
  171. int gain = get_bits(gb, 8);
  172. int cb1_idx = get_bits(gb, 7);
  173. int cb2_idx = get_bits(gb, 7);
  174. int m[3];
  175. if (cba_idx) {
  176. cba_idx += HALFBLOCK - 1;
  177. rotate_block(ractx->adapt_cb, buffer_a, cba_idx);
  178. m[0] = irms(buffer_a, gval) >> 12;
  179. } else {
  180. m[0] = 0;
  181. }
  182. m[1] = ((ftable1[cb1_idx] >> 4) * gval) >> 8;
  183. m[2] = ((ftable2[cb2_idx] >> 4) * gval) >> 8;
  184. memmove(ractx->adapt_cb, ractx->adapt_cb + BLOCKSIZE,
  185. (BUFFERSIZE - BLOCKSIZE) * 2);
  186. block = ractx->adapt_cb + BUFFERSIZE - BLOCKSIZE;
  187. add_wav(gain, cba_idx, m, buffer_a, etable1[cb1_idx], etable2[cb2_idx],
  188. block);
  189. final(gsp, block, output_buffer, ractx->buffer, BLOCKSIZE);
  190. }
  191. static int dec1(int16_t *decsp, const int *data, const int *inp, int f)
  192. {
  193. int i;
  194. for (i=0; i<30; i++)
  195. *(decsp++) = *(inp++);
  196. return rms(data, f);
  197. }
  198. /**
  199. * Evaluate the reflection coefficients from the filter coefficients.
  200. * Does the inverse of the do_voice() function.
  201. *
  202. * @return 1 if one of the reflection coefficients is of magnitude greater than
  203. * 4095, 0 if not.
  204. */
  205. static int eq(const int16_t *in, int *target)
  206. {
  207. int retval = 0;
  208. int b, c, i;
  209. unsigned int u;
  210. int buffer1[10];
  211. int buffer2[10];
  212. int *bp1 = buffer1;
  213. int *bp2 = buffer2;
  214. for (i=0; i < 10; i++)
  215. buffer2[i] = in[i];
  216. u = target[9] = bp2[9];
  217. if (u + 0x1000 > 0x1fff)
  218. return 0; /* We're screwed, might as well go out with a bang. :P */
  219. for (c=8; c >= 0; c--) {
  220. if (u == 0x1000)
  221. u++;
  222. if (u == 0xfffff000)
  223. u--;
  224. b = 0x1000-((u * u) >> 12);
  225. if (b == 0)
  226. b++;
  227. for (u=0; u<=c; u++)
  228. bp1[u] = ((bp2[u] - ((target[c+1] * bp2[c-u]) >> 12)) * (0x1000000 / b)) >> 12;
  229. target[c] = u = bp1[c];
  230. if ((u + 0x1000) > 0x1fff)
  231. retval = 1;
  232. FFSWAP(int *, bp1, bp2);
  233. }
  234. return retval;
  235. }
  236. static int dec2(RA144Context *ractx, int16_t *decsp, int block_num,
  237. int copynew, int f)
  238. {
  239. int work[10];
  240. int a = block_num + 1;
  241. int b = NBLOCKS - a;
  242. int x;
  243. // Interpolate block coefficients from the this frame forth block and
  244. // last frame forth block
  245. for (x=0; x<30; x++)
  246. decsp[x] = (a * ractx->lpc_coef[x] + b * ractx->lpc_coef_old[x])>> 2;
  247. if (eq(decsp, work)) {
  248. // The interpolated coefficients are unstable, copy either new or old
  249. // coefficients
  250. if (copynew)
  251. return dec1(decsp, ractx->lpc_refl, ractx->lpc_coef, f);
  252. else
  253. return dec1(decsp, ractx->lpc_refl_old, ractx->lpc_coef_old, f);
  254. } else {
  255. return rms(work, f);
  256. }
  257. }
  258. /* Uncompress one block (20 bytes -> 160*2 bytes) */
  259. static int ra144_decode_frame(AVCodecContext * avctx,
  260. void *vdata, int *data_size,
  261. const uint8_t * buf, int buf_size)
  262. {
  263. static const uint8_t sizes[10] = {6, 5, 5, 4, 4, 3, 3, 3, 3, 2};
  264. unsigned int refl_rms[4]; // RMS of the reflection coefficients
  265. uint16_t gbuf2[4][30];
  266. int i, c;
  267. int16_t *data = vdata;
  268. unsigned int energy;
  269. RA144Context *ractx = avctx->priv_data;
  270. GetBitContext gb;
  271. if(buf_size < 20) {
  272. av_log(avctx, AV_LOG_ERROR,
  273. "Frame too small (%d bytes). Truncated file?\n", buf_size);
  274. return buf_size;
  275. }
  276. init_get_bits(&gb, buf, 20 * 8);
  277. for (i=0; i<10; i++)
  278. // "<< 1"? Doesn't this make one value out of two of the table useless?
  279. ractx->lpc_refl[i] = decodetable[i][get_bits(&gb, sizes[i]) << 1];
  280. do_voice(ractx->lpc_refl, ractx->lpc_coef);
  281. energy = decodeval[get_bits(&gb, 5) << 1]; // Useless table entries?
  282. refl_rms[0] = dec2(ractx, gbuf2[0], 0, 0, ractx->old_energy);
  283. refl_rms[1] = dec2(ractx, gbuf2[1], 1, energy > ractx->old_energy,
  284. t_sqrt(energy*ractx->old_energy) >> 12);
  285. refl_rms[2] = dec2(ractx, gbuf2[2], 2, 1, energy);
  286. refl_rms[3] = dec1(gbuf2[3], ractx->lpc_refl, ractx->lpc_coef, energy);
  287. /* do output */
  288. for (c=0; c<4; c++) {
  289. do_output_subblock(ractx, gbuf2[c], refl_rms[c], data, &gb);
  290. for (i=0; i<BLOCKSIZE; i++) {
  291. *data = av_clip_int16(*data << 2);
  292. data++;
  293. }
  294. }
  295. ractx->old_energy = energy;
  296. FFSWAP(unsigned int *, ractx->lpc_refl_old, ractx->lpc_refl);
  297. FFSWAP(unsigned int *, ractx->lpc_coef_old, ractx->lpc_coef);
  298. *data_size = 2*160;
  299. return 20;
  300. }
  301. AVCodec ra_144_decoder =
  302. {
  303. "real_144",
  304. CODEC_TYPE_AUDIO,
  305. CODEC_ID_RA_144,
  306. sizeof(RA144Context),
  307. ra144_decode_init,
  308. NULL,
  309. NULL,
  310. ra144_decode_frame,
  311. .long_name = "RealAudio 1.0 (14.4K)",
  312. };