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.

404 lines
13KB

  1. /*
  2. * WMA compatible codec
  3. * Copyright (c) 2002-2007 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 "wma.h"
  23. #include "wmadata.h"
  24. #undef NDEBUG
  25. #include <assert.h>
  26. /* XXX: use same run/length optimization as mpeg decoders */
  27. //FIXME maybe split decode / encode or pass flag
  28. static void init_coef_vlc(VLC *vlc, uint16_t **prun_table,
  29. uint16_t **plevel_table, uint16_t **pint_table,
  30. const CoefVLCTable *vlc_table)
  31. {
  32. int n = vlc_table->n;
  33. const uint8_t *table_bits = vlc_table->huffbits;
  34. const uint32_t *table_codes = vlc_table->huffcodes;
  35. const uint16_t *levels_table = vlc_table->levels;
  36. uint16_t *run_table, *level_table, *int_table;
  37. int i, l, j, k, level;
  38. init_vlc(vlc, VLCBITS, n, table_bits, 1, 1, table_codes, 4, 4, 0);
  39. run_table = av_malloc(n * sizeof(uint16_t));
  40. level_table = av_malloc(n * sizeof(uint16_t));
  41. int_table = av_malloc(n * sizeof(uint16_t));
  42. i = 2;
  43. level = 1;
  44. k = 0;
  45. while (i < n) {
  46. int_table[k] = i;
  47. l = levels_table[k++];
  48. for (j = 0; j < l; j++) {
  49. run_table[i] = j;
  50. level_table[i] = level;
  51. i++;
  52. }
  53. level++;
  54. }
  55. *prun_table = run_table;
  56. *plevel_table = level_table;
  57. *pint_table = int_table;
  58. }
  59. /**
  60. *@brief Get the samples per frame for this stream.
  61. *@param sample_rate output sample_rate
  62. *@param version wma version
  63. *@param decode_flags codec compression features
  64. *@return log2 of the number of output samples per frame
  65. */
  66. int av_cold ff_wma_get_frame_len_bits(int sample_rate, int version,
  67. unsigned int decode_flags)
  68. {
  69. int frame_len_bits;
  70. if (sample_rate <= 16000)
  71. frame_len_bits = 9;
  72. else if (sample_rate <= 22050 ||
  73. (sample_rate <= 32000 && version == 1))
  74. frame_len_bits = 10;
  75. else
  76. frame_len_bits = 11;
  77. return frame_len_bits;
  78. }
  79. int ff_wma_init(AVCodecContext *avctx, int flags2)
  80. {
  81. WMACodecContext *s = avctx->priv_data;
  82. int i;
  83. float bps1, high_freq;
  84. volatile float bps;
  85. int sample_rate1;
  86. int coef_vlc_table;
  87. if ( avctx->sample_rate <= 0 || avctx->sample_rate > 50000
  88. || avctx->channels <= 0 || avctx->channels > 8
  89. || avctx->bit_rate <= 0)
  90. return -1;
  91. s->sample_rate = avctx->sample_rate;
  92. s->nb_channels = avctx->channels;
  93. s->bit_rate = avctx->bit_rate;
  94. s->block_align = avctx->block_align;
  95. dsputil_init(&s->dsp, avctx);
  96. if (avctx->codec->id == CODEC_ID_WMAV1) {
  97. s->version = 1;
  98. } else {
  99. s->version = 2;
  100. }
  101. /* compute MDCT block size */
  102. s->frame_len_bits = ff_wma_get_frame_len_bits(s->sample_rate, s->version, 0);
  103. s->frame_len = 1 << s->frame_len_bits;
  104. if (s->use_variable_block_len) {
  105. int nb_max, nb;
  106. nb = ((flags2 >> 3) & 3) + 1;
  107. if ((s->bit_rate / s->nb_channels) >= 32000)
  108. nb += 2;
  109. nb_max = s->frame_len_bits - BLOCK_MIN_BITS;
  110. if (nb > nb_max)
  111. nb = nb_max;
  112. s->nb_block_sizes = nb + 1;
  113. } else {
  114. s->nb_block_sizes = 1;
  115. }
  116. /* init rate dependent parameters */
  117. s->use_noise_coding = 1;
  118. high_freq = s->sample_rate * 0.5;
  119. /* if version 2, then the rates are normalized */
  120. sample_rate1 = s->sample_rate;
  121. if (s->version == 2) {
  122. if (sample_rate1 >= 44100)
  123. sample_rate1 = 44100;
  124. else if (sample_rate1 >= 22050)
  125. sample_rate1 = 22050;
  126. else if (sample_rate1 >= 16000)
  127. sample_rate1 = 16000;
  128. else if (sample_rate1 >= 11025)
  129. sample_rate1 = 11025;
  130. else if (sample_rate1 >= 8000)
  131. sample_rate1 = 8000;
  132. }
  133. bps = (float)s->bit_rate / (float)(s->nb_channels * s->sample_rate);
  134. s->byte_offset_bits = av_log2((int)(bps * s->frame_len / 8.0 + 0.5)) + 2;
  135. /* compute high frequency value and choose if noise coding should
  136. be activated */
  137. bps1 = bps;
  138. if (s->nb_channels == 2)
  139. bps1 = bps * 1.6;
  140. if (sample_rate1 == 44100) {
  141. if (bps1 >= 0.61)
  142. s->use_noise_coding = 0;
  143. else
  144. high_freq = high_freq * 0.4;
  145. } else if (sample_rate1 == 22050) {
  146. if (bps1 >= 1.16)
  147. s->use_noise_coding = 0;
  148. else if (bps1 >= 0.72)
  149. high_freq = high_freq * 0.7;
  150. else
  151. high_freq = high_freq * 0.6;
  152. } else if (sample_rate1 == 16000) {
  153. if (bps > 0.5)
  154. high_freq = high_freq * 0.5;
  155. else
  156. high_freq = high_freq * 0.3;
  157. } else if (sample_rate1 == 11025) {
  158. high_freq = high_freq * 0.7;
  159. } else if (sample_rate1 == 8000) {
  160. if (bps <= 0.625) {
  161. high_freq = high_freq * 0.5;
  162. } else if (bps > 0.75) {
  163. s->use_noise_coding = 0;
  164. } else {
  165. high_freq = high_freq * 0.65;
  166. }
  167. } else {
  168. if (bps >= 0.8) {
  169. high_freq = high_freq * 0.75;
  170. } else if (bps >= 0.6) {
  171. high_freq = high_freq * 0.6;
  172. } else {
  173. high_freq = high_freq * 0.5;
  174. }
  175. }
  176. dprintf(s->avctx, "flags2=0x%x\n", flags2);
  177. dprintf(s->avctx, "version=%d channels=%d sample_rate=%d bitrate=%d block_align=%d\n",
  178. s->version, s->nb_channels, s->sample_rate, s->bit_rate,
  179. s->block_align);
  180. dprintf(s->avctx, "bps=%f bps1=%f high_freq=%f bitoffset=%d\n",
  181. bps, bps1, high_freq, s->byte_offset_bits);
  182. dprintf(s->avctx, "use_noise_coding=%d use_exp_vlc=%d nb_block_sizes=%d\n",
  183. s->use_noise_coding, s->use_exp_vlc, s->nb_block_sizes);
  184. /* compute the scale factor band sizes for each MDCT block size */
  185. {
  186. int a, b, pos, lpos, k, block_len, i, j, n;
  187. const uint8_t *table;
  188. if (s->version == 1) {
  189. s->coefs_start = 3;
  190. } else {
  191. s->coefs_start = 0;
  192. }
  193. for (k = 0; k < s->nb_block_sizes; k++) {
  194. block_len = s->frame_len >> k;
  195. if (s->version == 1) {
  196. lpos = 0;
  197. for (i = 0; i < 25; i++) {
  198. a = wma_critical_freqs[i];
  199. b = s->sample_rate;
  200. pos = ((block_len * 2 * a) + (b >> 1)) / b;
  201. if (pos > block_len)
  202. pos = block_len;
  203. s->exponent_bands[0][i] = pos - lpos;
  204. if (pos >= block_len) {
  205. i++;
  206. break;
  207. }
  208. lpos = pos;
  209. }
  210. s->exponent_sizes[0] = i;
  211. } else {
  212. /* hardcoded tables */
  213. table = NULL;
  214. a = s->frame_len_bits - BLOCK_MIN_BITS - k;
  215. if (a < 3) {
  216. if (s->sample_rate >= 44100)
  217. table = exponent_band_44100[a];
  218. else if (s->sample_rate >= 32000)
  219. table = exponent_band_32000[a];
  220. else if (s->sample_rate >= 22050)
  221. table = exponent_band_22050[a];
  222. }
  223. if (table) {
  224. n = *table++;
  225. for (i = 0; i < n; i++)
  226. s->exponent_bands[k][i] = table[i];
  227. s->exponent_sizes[k] = n;
  228. } else {
  229. j = 0;
  230. lpos = 0;
  231. for (i = 0; i < 25; i++) {
  232. a = wma_critical_freqs[i];
  233. b = s->sample_rate;
  234. pos = ((block_len * 2 * a) + (b << 1)) / (4 * b);
  235. pos <<= 2;
  236. if (pos > block_len)
  237. pos = block_len;
  238. if (pos > lpos)
  239. s->exponent_bands[k][j++] = pos - lpos;
  240. if (pos >= block_len)
  241. break;
  242. lpos = pos;
  243. }
  244. s->exponent_sizes[k] = j;
  245. }
  246. }
  247. /* max number of coefs */
  248. s->coefs_end[k] = (s->frame_len - ((s->frame_len * 9) / 100)) >> k;
  249. /* high freq computation */
  250. s->high_band_start[k] = (int)((block_len * 2 * high_freq) /
  251. s->sample_rate + 0.5);
  252. n = s->exponent_sizes[k];
  253. j = 0;
  254. pos = 0;
  255. for (i = 0; i < n; i++) {
  256. int start, end;
  257. start = pos;
  258. pos += s->exponent_bands[k][i];
  259. end = pos;
  260. if (start < s->high_band_start[k])
  261. start = s->high_band_start[k];
  262. if (end > s->coefs_end[k])
  263. end = s->coefs_end[k];
  264. if (end > start)
  265. s->exponent_high_bands[k][j++] = end - start;
  266. }
  267. s->exponent_high_sizes[k] = j;
  268. #if 0
  269. tprintf(s->avctx, "%5d: coefs_end=%d high_band_start=%d nb_high_bands=%d: ",
  270. s->frame_len >> k,
  271. s->coefs_end[k],
  272. s->high_band_start[k],
  273. s->exponent_high_sizes[k]);
  274. for (j = 0; j < s->exponent_high_sizes[k]; j++)
  275. tprintf(s->avctx, " %d", s->exponent_high_bands[k][j]);
  276. tprintf(s->avctx, "\n");
  277. #endif
  278. }
  279. }
  280. #ifdef TRACE
  281. {
  282. int i, j;
  283. for (i = 0; i < s->nb_block_sizes; i++) {
  284. tprintf(s->avctx, "%5d: n=%2d:",
  285. s->frame_len >> i,
  286. s->exponent_sizes[i]);
  287. for (j = 0; j < s->exponent_sizes[i]; j++)
  288. tprintf(s->avctx, " %d", s->exponent_bands[i][j]);
  289. tprintf(s->avctx, "\n");
  290. }
  291. }
  292. #endif
  293. /* init MDCT windows : simple sinus window */
  294. for (i = 0; i < s->nb_block_sizes; i++) {
  295. int n;
  296. n = 1 << (s->frame_len_bits - i);
  297. ff_sine_window_init(ff_sine_windows[s->frame_len_bits - i - 7], n);
  298. s->windows[i] = ff_sine_windows[s->frame_len_bits - i - 7];
  299. }
  300. s->reset_block_lengths = 1;
  301. if (s->use_noise_coding) {
  302. /* init the noise generator */
  303. if (s->use_exp_vlc)
  304. s->noise_mult = 0.02;
  305. else
  306. s->noise_mult = 0.04;
  307. #ifdef TRACE
  308. for (i = 0; i < NOISE_TAB_SIZE; i++)
  309. s->noise_table[i] = 1.0 * s->noise_mult;
  310. #else
  311. {
  312. unsigned int seed;
  313. float norm;
  314. seed = 1;
  315. norm = (1.0 / (float)(1LL << 31)) * sqrt(3) * s->noise_mult;
  316. for (i = 0; i < NOISE_TAB_SIZE; i++) {
  317. seed = seed * 314159 + 1;
  318. s->noise_table[i] = (float)((int)seed) * norm;
  319. }
  320. }
  321. #endif
  322. }
  323. /* choose the VLC tables for the coefficients */
  324. coef_vlc_table = 2;
  325. if (s->sample_rate >= 32000) {
  326. if (bps1 < 0.72)
  327. coef_vlc_table = 0;
  328. else if (bps1 < 1.16)
  329. coef_vlc_table = 1;
  330. }
  331. s->coef_vlcs[0]= &coef_vlcs[coef_vlc_table * 2 ];
  332. s->coef_vlcs[1]= &coef_vlcs[coef_vlc_table * 2 + 1];
  333. init_coef_vlc(&s->coef_vlc[0], &s->run_table[0], &s->level_table[0], &s->int_table[0],
  334. s->coef_vlcs[0]);
  335. init_coef_vlc(&s->coef_vlc[1], &s->run_table[1], &s->level_table[1], &s->int_table[1],
  336. s->coef_vlcs[1]);
  337. return 0;
  338. }
  339. int ff_wma_total_gain_to_bits(int total_gain)
  340. {
  341. if (total_gain < 15) return 13;
  342. else if (total_gain < 32) return 12;
  343. else if (total_gain < 40) return 11;
  344. else if (total_gain < 45) return 10;
  345. else return 9;
  346. }
  347. int ff_wma_end(AVCodecContext *avctx)
  348. {
  349. WMACodecContext *s = avctx->priv_data;
  350. int i;
  351. for (i = 0; i < s->nb_block_sizes; i++)
  352. ff_mdct_end(&s->mdct_ctx[i]);
  353. if (s->use_exp_vlc) {
  354. free_vlc(&s->exp_vlc);
  355. }
  356. if (s->use_noise_coding) {
  357. free_vlc(&s->hgain_vlc);
  358. }
  359. for (i = 0; i < 2; i++) {
  360. free_vlc(&s->coef_vlc[i]);
  361. av_free(s->run_table[i]);
  362. av_free(s->level_table[i]);
  363. av_free(s->int_table[i]);
  364. }
  365. return 0;
  366. }