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.

406 lines
15KB

  1. /*
  2. * Copyright (c) CMU 1993 Computer Science, Speech Group
  3. * Chengxiang Lu and Alex Hauptmann
  4. * Copyright (c) 2005 Steve Underwood <steveu at coppice.org>
  5. * Copyright (c) 2009 Kenan Gillet
  6. * Copyright (c) 2010 Martin Storsjo
  7. *
  8. * This file is part of Libav.
  9. *
  10. * Libav is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU Lesser General Public
  12. * License as published by the Free Software Foundation; either
  13. * version 2.1 of the License, or (at your option) any later version.
  14. *
  15. * Libav is distributed in the hope that it will be useful,
  16. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  17. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  18. * Lesser General Public License for more details.
  19. *
  20. * You should have received a copy of the GNU Lesser General Public
  21. * License along with Libav; if not, write to the Free Software
  22. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  23. */
  24. /**
  25. * @file
  26. * G.722 ADPCM audio encoder
  27. */
  28. #include "avcodec.h"
  29. #include "internal.h"
  30. #include "g722.h"
  31. #define FREEZE_INTERVAL 128
  32. /* This is an arbitrary value. Allowing insanely large values leads to strange
  33. problems, so we limit it to a reasonable value */
  34. #define MAX_FRAME_SIZE 32768
  35. /* We clip the value of avctx->trellis to prevent data type overflows and
  36. undefined behavior. Using larger values is insanely slow anyway. */
  37. #define MIN_TRELLIS 0
  38. #define MAX_TRELLIS 16
  39. static av_cold int g722_encode_close(AVCodecContext *avctx)
  40. {
  41. G722Context *c = avctx->priv_data;
  42. int i;
  43. for (i = 0; i < 2; i++) {
  44. av_freep(&c->paths[i]);
  45. av_freep(&c->node_buf[i]);
  46. av_freep(&c->nodep_buf[i]);
  47. }
  48. #if FF_API_OLD_ENCODE_AUDIO
  49. av_freep(&avctx->coded_frame);
  50. #endif
  51. return 0;
  52. }
  53. static av_cold int g722_encode_init(AVCodecContext * avctx)
  54. {
  55. G722Context *c = avctx->priv_data;
  56. int ret;
  57. if (avctx->channels != 1) {
  58. av_log(avctx, AV_LOG_ERROR, "Only mono tracks are allowed.\n");
  59. return AVERROR_INVALIDDATA;
  60. }
  61. c->band[0].scale_factor = 8;
  62. c->band[1].scale_factor = 2;
  63. c->prev_samples_pos = 22;
  64. if (avctx->trellis) {
  65. int frontier = 1 << avctx->trellis;
  66. int max_paths = frontier * FREEZE_INTERVAL;
  67. int i;
  68. for (i = 0; i < 2; i++) {
  69. c->paths[i] = av_mallocz(max_paths * sizeof(**c->paths));
  70. c->node_buf[i] = av_mallocz(2 * frontier * sizeof(**c->node_buf));
  71. c->nodep_buf[i] = av_mallocz(2 * frontier * sizeof(**c->nodep_buf));
  72. if (!c->paths[i] || !c->node_buf[i] || !c->nodep_buf[i]) {
  73. ret = AVERROR(ENOMEM);
  74. goto error;
  75. }
  76. }
  77. }
  78. if (avctx->frame_size) {
  79. /* validate frame size */
  80. if (avctx->frame_size & 1 || avctx->frame_size > MAX_FRAME_SIZE) {
  81. int new_frame_size;
  82. if (avctx->frame_size == 1)
  83. new_frame_size = 2;
  84. else if (avctx->frame_size > MAX_FRAME_SIZE)
  85. new_frame_size = MAX_FRAME_SIZE;
  86. else
  87. new_frame_size = avctx->frame_size - 1;
  88. av_log(avctx, AV_LOG_WARNING, "Requested frame size is not "
  89. "allowed. Using %d instead of %d\n", new_frame_size,
  90. avctx->frame_size);
  91. avctx->frame_size = new_frame_size;
  92. }
  93. } else {
  94. /* This is arbitrary. We use 320 because it's 20ms @ 16kHz, which is
  95. a common packet size for VoIP applications */
  96. avctx->frame_size = 320;
  97. }
  98. avctx->delay = 22;
  99. if (avctx->trellis) {
  100. /* validate trellis */
  101. if (avctx->trellis < MIN_TRELLIS || avctx->trellis > MAX_TRELLIS) {
  102. int new_trellis = av_clip(avctx->trellis, MIN_TRELLIS, MAX_TRELLIS);
  103. av_log(avctx, AV_LOG_WARNING, "Requested trellis value is not "
  104. "allowed. Using %d instead of %d\n", new_trellis,
  105. avctx->trellis);
  106. avctx->trellis = new_trellis;
  107. }
  108. }
  109. #if FF_API_OLD_ENCODE_AUDIO
  110. avctx->coded_frame = avcodec_alloc_frame();
  111. if (!avctx->coded_frame) {
  112. ret = AVERROR(ENOMEM);
  113. goto error;
  114. }
  115. #endif
  116. return 0;
  117. error:
  118. g722_encode_close(avctx);
  119. return ret;
  120. }
  121. static const int16_t low_quant[33] = {
  122. 35, 72, 110, 150, 190, 233, 276, 323,
  123. 370, 422, 473, 530, 587, 650, 714, 786,
  124. 858, 940, 1023, 1121, 1219, 1339, 1458, 1612,
  125. 1765, 1980, 2195, 2557, 2919
  126. };
  127. static inline void filter_samples(G722Context *c, const int16_t *samples,
  128. int *xlow, int *xhigh)
  129. {
  130. int xout1, xout2;
  131. c->prev_samples[c->prev_samples_pos++] = samples[0];
  132. c->prev_samples[c->prev_samples_pos++] = samples[1];
  133. ff_g722_apply_qmf(c->prev_samples + c->prev_samples_pos - 24, &xout1, &xout2);
  134. *xlow = xout1 + xout2 >> 14;
  135. *xhigh = xout1 - xout2 >> 14;
  136. if (c->prev_samples_pos >= PREV_SAMPLES_BUF_SIZE) {
  137. memmove(c->prev_samples,
  138. c->prev_samples + c->prev_samples_pos - 22,
  139. 22 * sizeof(c->prev_samples[0]));
  140. c->prev_samples_pos = 22;
  141. }
  142. }
  143. static inline int encode_high(const struct G722Band *state, int xhigh)
  144. {
  145. int diff = av_clip_int16(xhigh - state->s_predictor);
  146. int pred = 141 * state->scale_factor >> 8;
  147. /* = diff >= 0 ? (diff < pred) + 2 : diff >= -pred */
  148. return ((diff ^ (diff >> (sizeof(diff)*8-1))) < pred) + 2*(diff >= 0);
  149. }
  150. static inline int encode_low(const struct G722Band* state, int xlow)
  151. {
  152. int diff = av_clip_int16(xlow - state->s_predictor);
  153. /* = diff >= 0 ? diff : -(diff + 1) */
  154. int limit = diff ^ (diff >> (sizeof(diff)*8-1));
  155. int i = 0;
  156. limit = limit + 1 << 10;
  157. if (limit > low_quant[8] * state->scale_factor)
  158. i = 9;
  159. while (i < 29 && limit > low_quant[i] * state->scale_factor)
  160. i++;
  161. return (diff < 0 ? (i < 2 ? 63 : 33) : 61) - i;
  162. }
  163. static void g722_encode_trellis(G722Context *c, int trellis,
  164. uint8_t *dst, int nb_samples,
  165. const int16_t *samples)
  166. {
  167. int i, j, k;
  168. int frontier = 1 << trellis;
  169. struct TrellisNode **nodes[2];
  170. struct TrellisNode **nodes_next[2];
  171. int pathn[2] = {0, 0}, froze = -1;
  172. struct TrellisPath *p[2];
  173. for (i = 0; i < 2; i++) {
  174. nodes[i] = c->nodep_buf[i];
  175. nodes_next[i] = c->nodep_buf[i] + frontier;
  176. memset(c->nodep_buf[i], 0, 2 * frontier * sizeof(*c->nodep_buf));
  177. nodes[i][0] = c->node_buf[i] + frontier;
  178. nodes[i][0]->ssd = 0;
  179. nodes[i][0]->path = 0;
  180. nodes[i][0]->state = c->band[i];
  181. }
  182. for (i = 0; i < nb_samples >> 1; i++) {
  183. int xlow, xhigh;
  184. struct TrellisNode *next[2];
  185. int heap_pos[2] = {0, 0};
  186. for (j = 0; j < 2; j++) {
  187. next[j] = c->node_buf[j] + frontier*(i & 1);
  188. memset(nodes_next[j], 0, frontier * sizeof(**nodes_next));
  189. }
  190. filter_samples(c, &samples[2*i], &xlow, &xhigh);
  191. for (j = 0; j < frontier && nodes[0][j]; j++) {
  192. /* Only k >> 2 affects the future adaptive state, therefore testing
  193. * small steps that don't change k >> 2 is useless, the original
  194. * value from encode_low is better than them. Since we step k
  195. * in steps of 4, make sure range is a multiple of 4, so that
  196. * we don't miss the original value from encode_low. */
  197. int range = j < frontier/2 ? 4 : 0;
  198. struct TrellisNode *cur_node = nodes[0][j];
  199. int ilow = encode_low(&cur_node->state, xlow);
  200. for (k = ilow - range; k <= ilow + range && k <= 63; k += 4) {
  201. int decoded, dec_diff, pos;
  202. uint32_t ssd;
  203. struct TrellisNode* node;
  204. if (k < 0)
  205. continue;
  206. decoded = av_clip((cur_node->state.scale_factor *
  207. ff_g722_low_inv_quant6[k] >> 10)
  208. + cur_node->state.s_predictor, -16384, 16383);
  209. dec_diff = xlow - decoded;
  210. #define STORE_NODE(index, UPDATE, VALUE)\
  211. ssd = cur_node->ssd + dec_diff*dec_diff;\
  212. /* Check for wraparound. Using 64 bit ssd counters would \
  213. * be simpler, but is slower on x86 32 bit. */\
  214. if (ssd < cur_node->ssd)\
  215. continue;\
  216. if (heap_pos[index] < frontier) {\
  217. pos = heap_pos[index]++;\
  218. assert(pathn[index] < FREEZE_INTERVAL * frontier);\
  219. node = nodes_next[index][pos] = next[index]++;\
  220. node->path = pathn[index]++;\
  221. } else {\
  222. /* Try to replace one of the leaf nodes with the new \
  223. * one, but not always testing the same leaf position */\
  224. pos = (frontier>>1) + (heap_pos[index] & ((frontier>>1) - 1));\
  225. if (ssd >= nodes_next[index][pos]->ssd)\
  226. continue;\
  227. heap_pos[index]++;\
  228. node = nodes_next[index][pos];\
  229. }\
  230. node->ssd = ssd;\
  231. node->state = cur_node->state;\
  232. UPDATE;\
  233. c->paths[index][node->path].value = VALUE;\
  234. c->paths[index][node->path].prev = cur_node->path;\
  235. /* Sift the newly inserted node up in the heap to restore \
  236. * the heap property */\
  237. while (pos > 0) {\
  238. int parent = (pos - 1) >> 1;\
  239. if (nodes_next[index][parent]->ssd <= ssd)\
  240. break;\
  241. FFSWAP(struct TrellisNode*, nodes_next[index][parent],\
  242. nodes_next[index][pos]);\
  243. pos = parent;\
  244. }
  245. STORE_NODE(0, ff_g722_update_low_predictor(&node->state, k >> 2), k);
  246. }
  247. }
  248. for (j = 0; j < frontier && nodes[1][j]; j++) {
  249. int ihigh;
  250. struct TrellisNode *cur_node = nodes[1][j];
  251. /* We don't try to get any initial guess for ihigh via
  252. * encode_high - since there's only 4 possible values, test
  253. * them all. Testing all of these gives a much, much larger
  254. * gain than testing a larger range around ilow. */
  255. for (ihigh = 0; ihigh < 4; ihigh++) {
  256. int dhigh, decoded, dec_diff, pos;
  257. uint32_t ssd;
  258. struct TrellisNode* node;
  259. dhigh = cur_node->state.scale_factor *
  260. ff_g722_high_inv_quant[ihigh] >> 10;
  261. decoded = av_clip(dhigh + cur_node->state.s_predictor,
  262. -16384, 16383);
  263. dec_diff = xhigh - decoded;
  264. STORE_NODE(1, ff_g722_update_high_predictor(&node->state, dhigh, ihigh), ihigh);
  265. }
  266. }
  267. for (j = 0; j < 2; j++) {
  268. FFSWAP(struct TrellisNode**, nodes[j], nodes_next[j]);
  269. if (nodes[j][0]->ssd > (1 << 16)) {
  270. for (k = 1; k < frontier && nodes[j][k]; k++)
  271. nodes[j][k]->ssd -= nodes[j][0]->ssd;
  272. nodes[j][0]->ssd = 0;
  273. }
  274. }
  275. if (i == froze + FREEZE_INTERVAL) {
  276. p[0] = &c->paths[0][nodes[0][0]->path];
  277. p[1] = &c->paths[1][nodes[1][0]->path];
  278. for (j = i; j > froze; j--) {
  279. dst[j] = p[1]->value << 6 | p[0]->value;
  280. p[0] = &c->paths[0][p[0]->prev];
  281. p[1] = &c->paths[1][p[1]->prev];
  282. }
  283. froze = i;
  284. pathn[0] = pathn[1] = 0;
  285. memset(nodes[0] + 1, 0, (frontier - 1)*sizeof(**nodes));
  286. memset(nodes[1] + 1, 0, (frontier - 1)*sizeof(**nodes));
  287. }
  288. }
  289. p[0] = &c->paths[0][nodes[0][0]->path];
  290. p[1] = &c->paths[1][nodes[1][0]->path];
  291. for (j = i; j > froze; j--) {
  292. dst[j] = p[1]->value << 6 | p[0]->value;
  293. p[0] = &c->paths[0][p[0]->prev];
  294. p[1] = &c->paths[1][p[1]->prev];
  295. }
  296. c->band[0] = nodes[0][0]->state;
  297. c->band[1] = nodes[1][0]->state;
  298. }
  299. static av_always_inline void encode_byte(G722Context *c, uint8_t *dst,
  300. const int16_t *samples)
  301. {
  302. int xlow, xhigh, ilow, ihigh;
  303. filter_samples(c, samples, &xlow, &xhigh);
  304. ihigh = encode_high(&c->band[1], xhigh);
  305. ilow = encode_low (&c->band[0], xlow);
  306. ff_g722_update_high_predictor(&c->band[1], c->band[1].scale_factor *
  307. ff_g722_high_inv_quant[ihigh] >> 10, ihigh);
  308. ff_g722_update_low_predictor(&c->band[0], ilow >> 2);
  309. *dst = ihigh << 6 | ilow;
  310. }
  311. static void g722_encode_no_trellis(G722Context *c,
  312. uint8_t *dst, int nb_samples,
  313. const int16_t *samples)
  314. {
  315. int i;
  316. for (i = 0; i < nb_samples; i += 2)
  317. encode_byte(c, dst++, &samples[i]);
  318. }
  319. static int g722_encode_frame(AVCodecContext *avctx, AVPacket *avpkt,
  320. const AVFrame *frame, int *got_packet_ptr)
  321. {
  322. G722Context *c = avctx->priv_data;
  323. const int16_t *samples = (const int16_t *)frame->data[0];
  324. int nb_samples, out_size, ret;
  325. out_size = (frame->nb_samples + 1) / 2;
  326. if ((ret = ff_alloc_packet(avpkt, out_size))) {
  327. av_log(avctx, AV_LOG_ERROR, "Error getting output packet\n");
  328. return ret;
  329. }
  330. nb_samples = frame->nb_samples - (frame->nb_samples & 1);
  331. if (avctx->trellis)
  332. g722_encode_trellis(c, avctx->trellis, avpkt->data, nb_samples, samples);
  333. else
  334. g722_encode_no_trellis(c, avpkt->data, nb_samples, samples);
  335. /* handle last frame with odd frame_size */
  336. if (nb_samples < frame->nb_samples) {
  337. int16_t last_samples[2] = { samples[nb_samples], samples[nb_samples] };
  338. encode_byte(c, &avpkt->data[nb_samples >> 1], last_samples);
  339. }
  340. if (frame->pts != AV_NOPTS_VALUE)
  341. avpkt->pts = frame->pts - ff_samples_to_time_base(avctx, avctx->delay);
  342. *got_packet_ptr = 1;
  343. return 0;
  344. }
  345. AVCodec ff_adpcm_g722_encoder = {
  346. .name = "g722",
  347. .type = AVMEDIA_TYPE_AUDIO,
  348. .id = CODEC_ID_ADPCM_G722,
  349. .priv_data_size = sizeof(G722Context),
  350. .init = g722_encode_init,
  351. .close = g722_encode_close,
  352. .encode2 = g722_encode_frame,
  353. .capabilities = CODEC_CAP_SMALL_LAST_FRAME,
  354. .long_name = NULL_IF_CONFIG_SMALL("G.722 ADPCM"),
  355. .sample_fmts = (const enum AVSampleFormat[]){ AV_SAMPLE_FMT_S16,
  356. AV_SAMPLE_FMT_NONE },
  357. };