vorbis_enc.c 34 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087
  1. /*
  2. * copyright (c) 2006 Oded Shimon <ods15@ods15.dyndns.org>
  3. *
  4. * This file is part of FFmpeg.
  5. *
  6. * FFmpeg is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU Lesser General Public
  8. * License as published by the Free Software Foundation; either
  9. * version 2.1 of the License, or (at your option) any later version.
  10. *
  11. * FFmpeg is distributed in the hope that it will be useful,
  12. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * Lesser General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU Lesser General Public
  17. * License along with FFmpeg; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
  19. */
  20. /**
  21. * @file vorbis_enc.c
  22. * Native Vorbis encoder.
  23. * @author Oded Shimon <ods15@ods15.dyndns.org>
  24. */
  25. #include <float.h>
  26. #include "avcodec.h"
  27. #include "dsputil.h"
  28. #include "vorbis.h"
  29. #include "vorbis_enc_data.h"
  30. #undef NDEBUG
  31. #include <assert.h>
  32. typedef struct {
  33. int nentries;
  34. uint8_t * lens;
  35. uint32_t * codewords;
  36. int ndimentions;
  37. float min;
  38. float delta;
  39. int seq_p;
  40. int lookup;
  41. int * quantlist;
  42. float * dimentions;
  43. float * pow2;
  44. } codebook_t;
  45. typedef struct {
  46. int dim;
  47. int subclass;
  48. int masterbook;
  49. int * books;
  50. } floor_class_t;
  51. typedef struct {
  52. int partitions;
  53. int * partition_to_class;
  54. int nclasses;
  55. floor_class_t * classes;
  56. int multiplier;
  57. int rangebits;
  58. int values;
  59. floor1_entry_t * list;
  60. } floor_t;
  61. typedef struct {
  62. int type;
  63. int begin;
  64. int end;
  65. int partition_size;
  66. int classifications;
  67. int classbook;
  68. int8_t (*books)[8];
  69. float (*maxes)[2];
  70. } residue_t;
  71. typedef struct {
  72. int submaps;
  73. int * mux;
  74. int * floor;
  75. int * residue;
  76. int coupling_steps;
  77. int * magnitude;
  78. int * angle;
  79. } mapping_t;
  80. typedef struct {
  81. int blockflag;
  82. int mapping;
  83. } vorbis_mode_t;
  84. typedef struct {
  85. int channels;
  86. int sample_rate;
  87. int log2_blocksize[2];
  88. MDCTContext mdct[2];
  89. const float * win[2];
  90. int have_saved;
  91. float * saved;
  92. float * samples;
  93. float * floor; // also used for tmp values for mdct
  94. float * coeffs; // also used for residue after floor
  95. float quality;
  96. int ncodebooks;
  97. codebook_t * codebooks;
  98. int nfloors;
  99. floor_t * floors;
  100. int nresidues;
  101. residue_t * residues;
  102. int nmappings;
  103. mapping_t * mappings;
  104. int nmodes;
  105. vorbis_mode_t * modes;
  106. } venc_context_t;
  107. typedef struct {
  108. int total;
  109. int total_pos;
  110. int pos;
  111. uint8_t * buf_ptr;
  112. } PutBitContext;
  113. static inline void init_put_bits(PutBitContext * pb, uint8_t * buf, int buffer_len) {
  114. pb->total = buffer_len * 8;
  115. pb->total_pos = 0;
  116. pb->pos = 0;
  117. pb->buf_ptr = buf;
  118. }
  119. static void put_bits(PutBitContext * pb, int bits, uint64_t val) {
  120. if ((pb->total_pos += bits) >= pb->total) return;
  121. if (!bits) return;
  122. if (pb->pos) {
  123. if (pb->pos > bits) {
  124. *pb->buf_ptr |= val << (8 - pb->pos);
  125. pb->pos -= bits;
  126. bits = 0;
  127. } else {
  128. *pb->buf_ptr++ |= (val << (8 - pb->pos)) & 0xFF;
  129. val >>= pb->pos;
  130. bits -= pb->pos;
  131. pb->pos = 0;
  132. }
  133. }
  134. for (; bits >= 8; bits -= 8) {
  135. *pb->buf_ptr++ = val & 0xFF;
  136. val >>= 8;
  137. }
  138. if (bits) {
  139. *pb->buf_ptr = val;
  140. pb->pos = 8 - bits;
  141. }
  142. }
  143. static inline void flush_put_bits(PutBitContext * pb) {
  144. }
  145. static inline int put_bits_count(PutBitContext * pb) {
  146. return pb->total_pos;
  147. }
  148. static inline void put_codeword(PutBitContext * pb, codebook_t * cb, int entry) {
  149. assert(entry >= 0);
  150. assert(entry < cb->nentries);
  151. assert(cb->lens[entry]);
  152. put_bits(pb, cb->lens[entry], cb->codewords[entry]);
  153. }
  154. static int cb_lookup_vals(int lookup, int dimentions, int entries) {
  155. if (lookup == 1) return ff_vorbis_nth_root(entries, dimentions);
  156. else if (lookup == 2) return dimentions * entries;
  157. return 0;
  158. }
  159. static void ready_codebook(codebook_t * cb) {
  160. int i;
  161. ff_vorbis_len2vlc(cb->lens, cb->codewords, cb->nentries);
  162. if (!cb->lookup)
  163. cb->pow2 = cb->dimentions = NULL;
  164. else {
  165. int vals = cb_lookup_vals(cb->lookup, cb->ndimentions, cb->nentries);
  166. cb->dimentions = av_malloc(sizeof(float) * cb->nentries * cb->ndimentions);
  167. cb->pow2 = av_mallocz(sizeof(float) * cb->nentries);
  168. for (i = 0; i < cb->nentries; i++) {
  169. float last = 0;
  170. int j;
  171. int div = 1;
  172. for (j = 0; j < cb->ndimentions; j++) {
  173. int off;
  174. if (cb->lookup == 1)
  175. off = (i / div) % vals; // lookup type 1
  176. else
  177. off = i * cb->ndimentions + j; // lookup type 2
  178. cb->dimentions[i * cb->ndimentions + j] = last + cb->min + cb->quantlist[off] * cb->delta;
  179. if (cb->seq_p)
  180. last = cb->dimentions[i * cb->ndimentions + j];
  181. cb->pow2[i] += cb->dimentions[i * cb->ndimentions + j]*cb->dimentions[i * cb->ndimentions + j];
  182. div *= vals;
  183. }
  184. cb->pow2[i] /= 2.;
  185. }
  186. }
  187. }
  188. static void ready_residue(residue_t * rc, venc_context_t * venc) {
  189. int i;
  190. assert(rc->type == 2);
  191. rc->maxes = av_mallocz(sizeof(float[2]) * rc->classifications);
  192. for (i = 0; i < rc->classifications; i++) {
  193. int j;
  194. codebook_t * cb;
  195. for (j = 0; j < 8; j++)
  196. if (rc->books[i][j] != -1) break;
  197. if (j == 8) continue; // zero
  198. cb = &venc->codebooks[rc->books[i][j]];
  199. assert(cb->ndimentions >= 2);
  200. assert(cb->lookup);
  201. for (j = 0; j < cb->nentries; j++) {
  202. float a;
  203. if (!cb->lens[j]) continue;
  204. a = fabs(cb->dimentions[j * cb->ndimentions]);
  205. if (a > rc->maxes[i][0])
  206. rc->maxes[i][0] = a;
  207. a = fabs(cb->dimentions[j * cb->ndimentions + 1]);
  208. if (a > rc->maxes[i][1])
  209. rc->maxes[i][1] = a;
  210. }
  211. }
  212. // small bias
  213. for (i = 0; i < rc->classifications; i++) {
  214. rc->maxes[i][0] += 0.8;
  215. rc->maxes[i][1] += 0.8;
  216. }
  217. }
  218. static void create_vorbis_context(venc_context_t * venc, AVCodecContext * avccontext) {
  219. floor_t * fc;
  220. residue_t * rc;
  221. mapping_t * mc;
  222. int i, book;
  223. venc->channels = avccontext->channels;
  224. venc->sample_rate = avccontext->sample_rate;
  225. venc->log2_blocksize[0] = venc->log2_blocksize[1] = 11;
  226. venc->ncodebooks = sizeof(cvectors)/sizeof(cvectors[0]);
  227. venc->codebooks = av_malloc(sizeof(codebook_t) * venc->ncodebooks);
  228. // codebook 0..14 - floor1 book, values 0..255
  229. // codebook 15 residue masterbook
  230. // codebook 16..29 residue
  231. for (book = 0; book < venc->ncodebooks; book++) {
  232. codebook_t * cb = &venc->codebooks[book];
  233. int vals;
  234. cb->ndimentions = cvectors[book].dim;
  235. cb->nentries = cvectors[book].real_len;
  236. cb->min = cvectors[book].min;
  237. cb->delta = cvectors[book].delta;
  238. cb->lookup = cvectors[book].lookup;
  239. cb->seq_p = 0;
  240. cb->lens = av_malloc(sizeof(uint8_t) * cb->nentries);
  241. cb->codewords = av_malloc(sizeof(uint32_t) * cb->nentries);
  242. memcpy(cb->lens, cvectors[book].clens, cvectors[book].len);
  243. memset(cb->lens + cvectors[book].len, 0, cb->nentries - cvectors[book].len);
  244. if (cb->lookup) {
  245. vals = cb_lookup_vals(cb->lookup, cb->ndimentions, cb->nentries);
  246. cb->quantlist = av_malloc(sizeof(int) * vals);
  247. for (i = 0; i < vals; i++)
  248. cb->quantlist[i] = cvectors[book].quant[i];
  249. } else {
  250. cb->quantlist = NULL;
  251. }
  252. ready_codebook(cb);
  253. }
  254. venc->nfloors = 1;
  255. venc->floors = av_malloc(sizeof(floor_t) * venc->nfloors);
  256. // just 1 floor
  257. fc = &venc->floors[0];
  258. fc->partitions = 8;
  259. fc->partition_to_class = av_malloc(sizeof(int) * fc->partitions);
  260. fc->nclasses = 0;
  261. for (i = 0; i < fc->partitions; i++) {
  262. static const int a[] = {0,1,2,2,3,3,4,4};
  263. fc->partition_to_class[i] = a[i];
  264. fc->nclasses = FFMAX(fc->nclasses, fc->partition_to_class[i]);
  265. }
  266. fc->nclasses++;
  267. fc->classes = av_malloc(sizeof(floor_class_t) * fc->nclasses);
  268. for (i = 0; i < fc->nclasses; i++) {
  269. floor_class_t * c = &fc->classes[i];
  270. int j, books;
  271. c->dim = floor_classes[i].dim;
  272. c->subclass = floor_classes[i].subclass;
  273. c->masterbook = floor_classes[i].masterbook;
  274. books = (1 << c->subclass);
  275. c->books = av_malloc(sizeof(int) * books);
  276. for (j = 0; j < books; j++)
  277. c->books[j] = floor_classes[i].nbooks[j];
  278. }
  279. fc->multiplier = 2;
  280. fc->rangebits = venc->log2_blocksize[0] - 1;
  281. fc->values = 2;
  282. for (i = 0; i < fc->partitions; i++)
  283. fc->values += fc->classes[fc->partition_to_class[i]].dim;
  284. fc->list = av_malloc(sizeof(floor1_entry_t) * fc->values);
  285. fc->list[0].x = 0;
  286. fc->list[1].x = 1 << fc->rangebits;
  287. for (i = 2; i < fc->values; i++) {
  288. static const int a[] = {
  289. 93, 23,372, 6, 46,186,750, 14, 33, 65,
  290. 130,260,556, 3, 10, 18, 28, 39, 55, 79,
  291. 111,158,220,312,464,650,850
  292. };
  293. fc->list[i].x = a[i - 2];
  294. }
  295. ff_vorbis_ready_floor1_list(fc->list, fc->values);
  296. venc->nresidues = 1;
  297. venc->residues = av_malloc(sizeof(residue_t) * venc->nresidues);
  298. // single residue
  299. rc = &venc->residues[0];
  300. rc->type = 2;
  301. rc->begin = 0;
  302. rc->end = 1600;
  303. rc->partition_size = 32;
  304. rc->classifications = 10;
  305. rc->classbook = 15;
  306. rc->books = av_malloc(sizeof(*rc->books) * rc->classifications);
  307. {
  308. static const int8_t a[10][8] = {
  309. { -1, -1, -1, -1, -1, -1, -1, -1, },
  310. { -1, -1, 16, -1, -1, -1, -1, -1, },
  311. { -1, -1, 17, -1, -1, -1, -1, -1, },
  312. { -1, -1, 18, -1, -1, -1, -1, -1, },
  313. { -1, -1, 19, -1, -1, -1, -1, -1, },
  314. { -1, -1, 20, -1, -1, -1, -1, -1, },
  315. { -1, -1, 21, -1, -1, -1, -1, -1, },
  316. { 22, 23, -1, -1, -1, -1, -1, -1, },
  317. { 24, 25, -1, -1, -1, -1, -1, -1, },
  318. { 26, 27, 28, -1, -1, -1, -1, -1, },
  319. };
  320. memcpy(rc->books, a, sizeof a);
  321. }
  322. ready_residue(rc, venc);
  323. venc->nmappings = 1;
  324. venc->mappings = av_malloc(sizeof(mapping_t) * venc->nmappings);
  325. // single mapping
  326. mc = &venc->mappings[0];
  327. mc->submaps = 1;
  328. mc->mux = av_malloc(sizeof(int) * venc->channels);
  329. for (i = 0; i < venc->channels; i++)
  330. mc->mux[i] = 0;
  331. mc->floor = av_malloc(sizeof(int) * mc->submaps);
  332. mc->residue = av_malloc(sizeof(int) * mc->submaps);
  333. for (i = 0; i < mc->submaps; i++) {
  334. mc->floor[i] = 0;
  335. mc->residue[i] = 0;
  336. }
  337. mc->coupling_steps = venc->channels == 2 ? 1 : 0;
  338. mc->magnitude = av_malloc(sizeof(int) * mc->coupling_steps);
  339. mc->angle = av_malloc(sizeof(int) * mc->coupling_steps);
  340. if (mc->coupling_steps) {
  341. mc->magnitude[0] = 0;
  342. mc->angle[0] = 1;
  343. }
  344. venc->nmodes = 1;
  345. venc->modes = av_malloc(sizeof(vorbis_mode_t) * venc->nmodes);
  346. // single mode
  347. venc->modes[0].blockflag = 0;
  348. venc->modes[0].mapping = 0;
  349. venc->have_saved = 0;
  350. venc->saved = av_malloc(sizeof(float) * venc->channels * (1 << venc->log2_blocksize[1]) / 2);
  351. venc->samples = av_malloc(sizeof(float) * venc->channels * (1 << venc->log2_blocksize[1]));
  352. venc->floor = av_malloc(sizeof(float) * venc->channels * (1 << venc->log2_blocksize[1]) / 2);
  353. venc->coeffs = av_malloc(sizeof(float) * venc->channels * (1 << venc->log2_blocksize[1]) / 2);
  354. venc->win[0] = ff_vorbis_vwin[venc->log2_blocksize[0] - 6];
  355. venc->win[1] = ff_vorbis_vwin[venc->log2_blocksize[1] - 6];
  356. ff_mdct_init(&venc->mdct[0], venc->log2_blocksize[0], 0);
  357. ff_mdct_init(&venc->mdct[1], venc->log2_blocksize[1], 0);
  358. }
  359. static void put_float(PutBitContext * pb, float f) {
  360. int exp, mant;
  361. uint32_t res = 0;
  362. mant = (int)ldexp(frexp(f, &exp), 20);
  363. exp += 788 - 20;
  364. if (mant < 0) { res |= (1 << 31); mant = -mant; }
  365. res |= mant | (exp << 21);
  366. put_bits(pb, 32, res);
  367. }
  368. static void put_codebook_header(PutBitContext * pb, codebook_t * cb) {
  369. int i;
  370. int ordered = 0;
  371. put_bits(pb, 24, 0x564342); //magic
  372. put_bits(pb, 16, cb->ndimentions);
  373. put_bits(pb, 24, cb->nentries);
  374. for (i = 1; i < cb->nentries; i++)
  375. if (cb->lens[i] < cb->lens[i-1]) break;
  376. if (i == cb->nentries)
  377. ordered = 1;
  378. put_bits(pb, 1, ordered);
  379. if (ordered) {
  380. int len = cb->lens[0];
  381. put_bits(pb, 5, len - 1);
  382. i = 0;
  383. while (i < cb->nentries) {
  384. int j;
  385. for (j = 0; j+i < cb->nentries; j++)
  386. if (cb->lens[j+i] != len) break;
  387. put_bits(pb, ilog(cb->nentries - i), j);
  388. i += j;
  389. len++;
  390. }
  391. } else {
  392. int sparse = 0;
  393. for (i = 0; i < cb->nentries; i++)
  394. if (!cb->lens[i]) break;
  395. if (i != cb->nentries)
  396. sparse = 1;
  397. put_bits(pb, 1, sparse);
  398. for (i = 0; i < cb->nentries; i++) {
  399. if (sparse) put_bits(pb, 1, !!cb->lens[i]);
  400. if (cb->lens[i]) put_bits(pb, 5, cb->lens[i] - 1);
  401. }
  402. }
  403. put_bits(pb, 4, cb->lookup);
  404. if (cb->lookup) {
  405. int tmp = cb_lookup_vals(cb->lookup, cb->ndimentions, cb->nentries);
  406. int bits = ilog(cb->quantlist[0]);
  407. for (i = 1; i < tmp; i++)
  408. bits = FFMAX(bits, ilog(cb->quantlist[i]));
  409. put_float(pb, cb->min);
  410. put_float(pb, cb->delta);
  411. put_bits(pb, 4, bits - 1);
  412. put_bits(pb, 1, cb->seq_p);
  413. for (i = 0; i < tmp; i++)
  414. put_bits(pb, bits, cb->quantlist[i]);
  415. }
  416. }
  417. static void put_floor_header(PutBitContext * pb, floor_t * fc) {
  418. int i;
  419. put_bits(pb, 16, 1); // type, only floor1 is supported
  420. put_bits(pb, 5, fc->partitions);
  421. for (i = 0; i < fc->partitions; i++)
  422. put_bits(pb, 4, fc->partition_to_class[i]);
  423. for (i = 0; i < fc->nclasses; i++) {
  424. int j, books;
  425. put_bits(pb, 3, fc->classes[i].dim - 1);
  426. put_bits(pb, 2, fc->classes[i].subclass);
  427. if (fc->classes[i].subclass)
  428. put_bits(pb, 8, fc->classes[i].masterbook);
  429. books = (1 << fc->classes[i].subclass);
  430. for (j = 0; j < books; j++)
  431. put_bits(pb, 8, fc->classes[i].books[j] + 1);
  432. }
  433. put_bits(pb, 2, fc->multiplier - 1);
  434. put_bits(pb, 4, fc->rangebits);
  435. for (i = 2; i < fc->values; i++)
  436. put_bits(pb, fc->rangebits, fc->list[i].x);
  437. }
  438. static void put_residue_header(PutBitContext * pb, residue_t * rc) {
  439. int i;
  440. put_bits(pb, 16, rc->type);
  441. put_bits(pb, 24, rc->begin);
  442. put_bits(pb, 24, rc->end);
  443. put_bits(pb, 24, rc->partition_size - 1);
  444. put_bits(pb, 6, rc->classifications - 1);
  445. put_bits(pb, 8, rc->classbook);
  446. for (i = 0; i < rc->classifications; i++) {
  447. int j, tmp = 0;
  448. for (j = 0; j < 8; j++)
  449. tmp |= (rc->books[i][j] != -1) << j;
  450. put_bits(pb, 3, tmp & 7);
  451. put_bits(pb, 1, tmp > 7);
  452. if (tmp > 7)
  453. put_bits(pb, 5, tmp >> 3);
  454. }
  455. for (i = 0; i < rc->classifications; i++) {
  456. int j;
  457. for (j = 0; j < 8; j++)
  458. if (rc->books[i][j] != -1)
  459. put_bits(pb, 8, rc->books[i][j]);
  460. }
  461. }
  462. static int put_main_header(venc_context_t * venc, uint8_t ** out) {
  463. int i;
  464. PutBitContext pb;
  465. uint8_t buffer[50000] = {0}, * p = buffer;
  466. int buffer_len = sizeof buffer;
  467. int len, hlens[3];
  468. // identification header
  469. init_put_bits(&pb, p, buffer_len);
  470. put_bits(&pb, 8, 1); //magic
  471. for (i = 0; "vorbis"[i]; i++)
  472. put_bits(&pb, 8, "vorbis"[i]);
  473. put_bits(&pb, 32, 0); // version
  474. put_bits(&pb, 8, venc->channels);
  475. put_bits(&pb, 32, venc->sample_rate);
  476. put_bits(&pb, 32, 0); // bitrate
  477. put_bits(&pb, 32, 0); // bitrate
  478. put_bits(&pb, 32, 0); // bitrate
  479. put_bits(&pb, 4, venc->log2_blocksize[0]);
  480. put_bits(&pb, 4, venc->log2_blocksize[1]);
  481. put_bits(&pb, 1, 1); // framing
  482. flush_put_bits(&pb);
  483. hlens[0] = (put_bits_count(&pb) + 7) / 8;
  484. buffer_len -= hlens[0];
  485. p += hlens[0];
  486. // comment header
  487. init_put_bits(&pb, p, buffer_len);
  488. put_bits(&pb, 8, 3); //magic
  489. for (i = 0; "vorbis"[i]; i++)
  490. put_bits(&pb, 8, "vorbis"[i]);
  491. put_bits(&pb, 32, 0); // vendor length TODO
  492. put_bits(&pb, 32, 0); // amount of comments
  493. put_bits(&pb, 1, 1); // framing
  494. flush_put_bits(&pb);
  495. hlens[1] = (put_bits_count(&pb) + 7) / 8;
  496. buffer_len -= hlens[1];
  497. p += hlens[1];
  498. // setup header
  499. init_put_bits(&pb, p, buffer_len);
  500. put_bits(&pb, 8, 5); //magic
  501. for (i = 0; "vorbis"[i]; i++)
  502. put_bits(&pb, 8, "vorbis"[i]);
  503. // codebooks
  504. put_bits(&pb, 8, venc->ncodebooks - 1);
  505. for (i = 0; i < venc->ncodebooks; i++)
  506. put_codebook_header(&pb, &venc->codebooks[i]);
  507. // time domain, reserved, zero
  508. put_bits(&pb, 6, 0);
  509. put_bits(&pb, 16, 0);
  510. // floors
  511. put_bits(&pb, 6, venc->nfloors - 1);
  512. for (i = 0; i < venc->nfloors; i++)
  513. put_floor_header(&pb, &venc->floors[i]);
  514. // residues
  515. put_bits(&pb, 6, venc->nresidues - 1);
  516. for (i = 0; i < venc->nresidues; i++)
  517. put_residue_header(&pb, &venc->residues[i]);
  518. // mappings
  519. put_bits(&pb, 6, venc->nmappings - 1);
  520. for (i = 0; i < venc->nmappings; i++) {
  521. mapping_t * mc = &venc->mappings[i];
  522. int j;
  523. put_bits(&pb, 16, 0); // mapping type
  524. put_bits(&pb, 1, mc->submaps > 1);
  525. if (mc->submaps > 1)
  526. put_bits(&pb, 4, mc->submaps - 1);
  527. put_bits(&pb, 1, !!mc->coupling_steps);
  528. if (mc->coupling_steps) {
  529. put_bits(&pb, 8, mc->coupling_steps - 1);
  530. for (j = 0; j < mc->coupling_steps; j++) {
  531. put_bits(&pb, ilog(venc->channels - 1), mc->magnitude[j]);
  532. put_bits(&pb, ilog(venc->channels - 1), mc->angle[j]);
  533. }
  534. }
  535. put_bits(&pb, 2, 0); // reserved
  536. if (mc->submaps > 1)
  537. for (j = 0; j < venc->channels; j++)
  538. put_bits(&pb, 4, mc->mux[j]);
  539. for (j = 0; j < mc->submaps; j++) {
  540. put_bits(&pb, 8, 0); // reserved time configuration
  541. put_bits(&pb, 8, mc->floor[j]);
  542. put_bits(&pb, 8, mc->residue[j]);
  543. }
  544. }
  545. // modes
  546. put_bits(&pb, 6, venc->nmodes - 1);
  547. for (i = 0; i < venc->nmodes; i++) {
  548. put_bits(&pb, 1, venc->modes[i].blockflag);
  549. put_bits(&pb, 16, 0); // reserved window type
  550. put_bits(&pb, 16, 0); // reserved transform type
  551. put_bits(&pb, 8, venc->modes[i].mapping);
  552. }
  553. put_bits(&pb, 1, 1); // framing
  554. flush_put_bits(&pb);
  555. hlens[2] = (put_bits_count(&pb) + 7) / 8;
  556. len = hlens[0] + hlens[1] + hlens[2];
  557. p = *out = av_mallocz(64 + len + len/255);
  558. *p++ = 2;
  559. p += av_xiphlacing(p, hlens[0]);
  560. p += av_xiphlacing(p, hlens[1]);
  561. buffer_len = 0;
  562. for (i = 0; i < 3; i++) {
  563. memcpy(p, buffer + buffer_len, hlens[i]);
  564. p += hlens[i];
  565. buffer_len += hlens[i];
  566. }
  567. return p - *out;
  568. }
  569. static float get_floor_average(floor_t * fc, float * coeffs, int i) {
  570. int begin = fc->list[fc->list[FFMAX(i-1, 0)].sort].x;
  571. int end = fc->list[fc->list[FFMIN(i+1, fc->values - 1)].sort].x;
  572. int j;
  573. float average = 0;
  574. for (j = begin; j < end; j++)
  575. average += fabs(coeffs[j]);
  576. return average / (end - begin);
  577. }
  578. static void floor_fit(venc_context_t * venc, floor_t * fc, float * coeffs, uint_fast16_t * posts, int samples) {
  579. int range = 255 / fc->multiplier + 1;
  580. int i;
  581. float tot_average = 0.;
  582. float averages[fc->values];
  583. for (i = 0; i < fc->values; i++){
  584. averages[i] = get_floor_average(fc, coeffs, i);
  585. tot_average += averages[i];
  586. }
  587. tot_average /= fc->values;
  588. tot_average /= venc->quality;
  589. for (i = 0; i < fc->values; i++) {
  590. int position = fc->list[fc->list[i].sort].x;
  591. float average = averages[i];
  592. int j;
  593. average *= pow(tot_average / average, 0.5) * pow(1.25, position/200.); // MAGIC!
  594. for (j = 0; j < range - 1; j++)
  595. if (ff_vorbis_floor1_inverse_db_table[j * fc->multiplier] > average) break;
  596. posts[fc->list[i].sort] = j;
  597. }
  598. }
  599. static int render_point(int x0, int y0, int x1, int y1, int x) {
  600. return y0 + (x - x0) * (y1 - y0) / (x1 - x0);
  601. }
  602. static void floor_encode(venc_context_t * venc, floor_t * fc, PutBitContext * pb, uint_fast16_t * posts, float * floor, int samples) {
  603. int range = 255 / fc->multiplier + 1;
  604. int coded[fc->values]; // first 2 values are unused
  605. int i, counter;
  606. put_bits(pb, 1, 1); // non zero
  607. put_bits(pb, ilog(range - 1), posts[0]);
  608. put_bits(pb, ilog(range - 1), posts[1]);
  609. coded[0] = coded[1] = 1;
  610. for (i = 2; i < fc->values; i++) {
  611. int predicted = render_point(fc->list[fc->list[i].low].x,
  612. posts[fc->list[i].low],
  613. fc->list[fc->list[i].high].x,
  614. posts[fc->list[i].high],
  615. fc->list[i].x);
  616. int highroom = range - predicted;
  617. int lowroom = predicted;
  618. int room = FFMIN(highroom, lowroom);
  619. if (predicted == posts[i]) {
  620. coded[i] = 0; // must be used later as flag!
  621. continue;
  622. } else {
  623. if (!coded[fc->list[i].low ]) coded[fc->list[i].low ] = -1;
  624. if (!coded[fc->list[i].high]) coded[fc->list[i].high] = -1;
  625. }
  626. if (posts[i] > predicted) {
  627. if (posts[i] - predicted > room)
  628. coded[i] = posts[i] - predicted + lowroom;
  629. else
  630. coded[i] = (posts[i] - predicted) << 1;
  631. } else {
  632. if (predicted - posts[i] > room)
  633. coded[i] = predicted - posts[i] + highroom - 1;
  634. else
  635. coded[i] = ((predicted - posts[i]) << 1) - 1;
  636. }
  637. }
  638. counter = 2;
  639. for (i = 0; i < fc->partitions; i++) {
  640. floor_class_t * c = &fc->classes[fc->partition_to_class[i]];
  641. int k, cval = 0, csub = 1<<c->subclass;
  642. if (c->subclass) {
  643. codebook_t * book = &venc->codebooks[c->masterbook];
  644. int cshift = 0;
  645. for (k = 0; k < c->dim; k++) {
  646. int l;
  647. for (l = 0; l < csub; l++) {
  648. int maxval = 1;
  649. if (c->books[l] != -1)
  650. maxval = venc->codebooks[c->books[l]].nentries;
  651. // coded could be -1, but this still works, cause thats 0
  652. if (coded[counter + k] < maxval) break;
  653. }
  654. assert(l != csub);
  655. cval |= l << cshift;
  656. cshift += c->subclass;
  657. }
  658. put_codeword(pb, book, cval);
  659. }
  660. for (k = 0; k < c->dim; k++) {
  661. int book = c->books[cval & (csub-1)];
  662. int entry = coded[counter++];
  663. cval >>= c->subclass;
  664. if (book == -1) continue;
  665. if (entry == -1) entry = 0;
  666. put_codeword(pb, &venc->codebooks[book], entry);
  667. }
  668. }
  669. ff_vorbis_floor1_render_list(fc->list, fc->values, posts, coded, fc->multiplier, floor, samples);
  670. }
  671. static float * put_vector(codebook_t * book, PutBitContext * pb, float * num) {
  672. int i, entry = -1;
  673. float distance = FLT_MAX;
  674. assert(book->dimentions);
  675. for (i = 0; i < book->nentries; i++) {
  676. float * vec = book->dimentions + i * book->ndimentions, d = book->pow2[i];
  677. int j;
  678. if (!book->lens[i]) continue;
  679. for (j = 0; j < book->ndimentions; j++)
  680. d -= vec[j] * num[j];
  681. if (distance > d) {
  682. entry = i;
  683. distance = d;
  684. }
  685. }
  686. put_codeword(pb, book, entry);
  687. return &book->dimentions[entry * book->ndimentions];
  688. }
  689. static void residue_encode(venc_context_t * venc, residue_t * rc, PutBitContext * pb, float * coeffs, int samples, int real_ch) {
  690. int pass, i, j, p, k;
  691. int psize = rc->partition_size;
  692. int partitions = (rc->end - rc->begin) / psize;
  693. int channels = (rc->type == 2) ? 1 : real_ch;
  694. int classes[channels][partitions];
  695. int classwords = venc->codebooks[rc->classbook].ndimentions;
  696. assert(rc->type == 2);
  697. assert(real_ch == 2);
  698. for (p = 0; p < partitions; p++) {
  699. float max1 = 0., max2 = 0.;
  700. int s = rc->begin + p * psize;
  701. for (k = s; k < s + psize; k += 2) {
  702. max1 = FFMAX(max1, fabs(coeffs[ k / real_ch]));
  703. max2 = FFMAX(max2, fabs(coeffs[samples + k / real_ch]));
  704. }
  705. for (i = 0; i < rc->classifications - 1; i++) {
  706. if (max1 < rc->maxes[i][0] && max2 < rc->maxes[i][1]) break;
  707. }
  708. classes[0][p] = i;
  709. }
  710. for (pass = 0; pass < 8; pass++) {
  711. p = 0;
  712. while (p < partitions) {
  713. if (pass == 0)
  714. for (j = 0; j < channels; j++) {
  715. codebook_t * book = &venc->codebooks[rc->classbook];
  716. int entry = 0;
  717. for (i = 0; i < classwords; i++) {
  718. entry *= rc->classifications;
  719. entry += classes[j][p + i];
  720. }
  721. put_codeword(pb, book, entry);
  722. }
  723. for (i = 0; i < classwords && p < partitions; i++, p++) {
  724. for (j = 0; j < channels; j++) {
  725. int nbook = rc->books[classes[j][p]][pass];
  726. codebook_t * book = &venc->codebooks[nbook];
  727. float * buf = coeffs + samples*j + rc->begin + p*psize;
  728. if (nbook == -1) continue;
  729. assert(rc->type == 0 || rc->type == 2);
  730. assert(!(psize % book->ndimentions));
  731. if (rc->type == 0) {
  732. for (k = 0; k < psize; k += book->ndimentions) {
  733. float * a = put_vector(book, pb, &buf[k]);
  734. int l;
  735. for (l = 0; l < book->ndimentions; l++)
  736. buf[k + l] -= a[l];
  737. }
  738. } else {
  739. int s = rc->begin + p * psize, a1, b1;
  740. a1 = (s % real_ch) * samples;
  741. b1 = s / real_ch;
  742. s = real_ch * samples;
  743. for (k = 0; k < psize; k += book->ndimentions) {
  744. int dim, a2 = a1, b2 = b1;
  745. float vec[book->ndimentions], * pv = vec;
  746. for (dim = book->ndimentions; dim--; ) {
  747. *pv++ = coeffs[a2 + b2];
  748. if ((a2 += samples) == s) {
  749. a2=0;
  750. b2++;
  751. }
  752. }
  753. pv = put_vector(book, pb, vec);
  754. for (dim = book->ndimentions; dim--; ) {
  755. coeffs[a1 + b1] -= *pv++;
  756. if ((a1 += samples) == s) {
  757. a1=0;
  758. b1++;
  759. }
  760. }
  761. }
  762. }
  763. }
  764. }
  765. }
  766. }
  767. }
  768. static int apply_window_and_mdct(venc_context_t * venc, signed short * audio, int samples) {
  769. int i, j, channel;
  770. const float * win = venc->win[0];
  771. int window_len = 1 << (venc->log2_blocksize[0] - 1);
  772. float n = (float)(1 << venc->log2_blocksize[0]) / 4.;
  773. // FIXME use dsp
  774. if (!venc->have_saved && !samples) return 0;
  775. if (venc->have_saved) {
  776. for (channel = 0; channel < venc->channels; channel++) {
  777. memcpy(venc->samples + channel*window_len*2, venc->saved + channel*window_len, sizeof(float)*window_len);
  778. }
  779. } else {
  780. for (channel = 0; channel < venc->channels; channel++) {
  781. memset(venc->samples + channel*window_len*2, 0, sizeof(float)*window_len);
  782. }
  783. }
  784. if (samples) {
  785. for (channel = 0; channel < venc->channels; channel++) {
  786. float * offset = venc->samples + channel*window_len*2 + window_len;
  787. j = channel;
  788. for (i = 0; i < samples; i++, j += venc->channels)
  789. offset[i] = -audio[j] / 32768. / n * win[window_len - i - 1]; //FIXME find out why the sign has to be fliped
  790. }
  791. } else {
  792. for (channel = 0; channel < venc->channels; channel++) {
  793. memset(venc->samples + channel*window_len*2 + window_len, 0, sizeof(float)*window_len);
  794. }
  795. }
  796. for (channel = 0; channel < venc->channels; channel++) {
  797. ff_mdct_calc(&venc->mdct[0], venc->coeffs + channel*window_len, venc->samples + channel*window_len*2, venc->floor/*tmp*/);
  798. }
  799. if (samples) {
  800. for (channel = 0; channel < venc->channels; channel++) {
  801. float * offset = venc->saved + channel*window_len;
  802. j = channel;
  803. for (i = 0; i < samples; i++, j += venc->channels)
  804. offset[i] = -audio[j] / 32768. / n * win[i]; //FIXME find out why the sign has to be fliped
  805. }
  806. venc->have_saved = 1;
  807. } else {
  808. venc->have_saved = 0;
  809. }
  810. return 1;
  811. }
  812. static int vorbis_encode_init(AVCodecContext * avccontext)
  813. {
  814. venc_context_t * venc = avccontext->priv_data;
  815. if (avccontext->channels != 2) {
  816. av_log(avccontext, AV_LOG_ERROR, "Current FFmpeg Vorbis encoder only supports 2 channels.\n");
  817. return -1;
  818. }
  819. create_vorbis_context(venc, avccontext);
  820. if (avccontext->flags & CODEC_FLAG_QSCALE)
  821. venc->quality = avccontext->global_quality / (float)FF_QP2LAMBDA / 10.;
  822. else
  823. venc->quality = 1.;
  824. venc->quality *= venc->quality;
  825. avccontext->extradata_size = put_main_header(venc, (uint8_t**)&avccontext->extradata);
  826. avccontext->frame_size = 1 << (venc->log2_blocksize[0] - 1);
  827. avccontext->coded_frame = avcodec_alloc_frame();
  828. avccontext->coded_frame->key_frame = 1;
  829. return 0;
  830. }
  831. static int vorbis_encode_frame(AVCodecContext * avccontext, unsigned char * packets, int buf_size, void *data)
  832. {
  833. venc_context_t * venc = avccontext->priv_data;
  834. signed short * audio = data;
  835. int samples = data ? avccontext->frame_size : 0;
  836. vorbis_mode_t * mode;
  837. mapping_t * mapping;
  838. PutBitContext pb;
  839. int i;
  840. if (!apply_window_and_mdct(venc, audio, samples)) return 0;
  841. samples = 1 << (venc->log2_blocksize[0] - 1);
  842. init_put_bits(&pb, packets, buf_size);
  843. put_bits(&pb, 1, 0); // magic bit
  844. put_bits(&pb, ilog(venc->nmodes - 1), 0); // 0 bits, the mode
  845. mode = &venc->modes[0];
  846. mapping = &venc->mappings[mode->mapping];
  847. if (mode->blockflag) {
  848. put_bits(&pb, 1, 0);
  849. put_bits(&pb, 1, 0);
  850. }
  851. for (i = 0; i < venc->channels; i++) {
  852. floor_t * fc = &venc->floors[mapping->floor[mapping->mux[i]]];
  853. uint_fast16_t posts[fc->values];
  854. floor_fit(venc, fc, &venc->coeffs[i * samples], posts, samples);
  855. floor_encode(venc, fc, &pb, posts, &venc->floor[i * samples], samples);
  856. }
  857. for (i = 0; i < venc->channels * samples; i++) {
  858. venc->coeffs[i] /= venc->floor[i];
  859. }
  860. for (i = 0; i < mapping->coupling_steps; i++) {
  861. float * mag = venc->coeffs + mapping->magnitude[i] * samples;
  862. float * ang = venc->coeffs + mapping->angle[i] * samples;
  863. int j;
  864. for (j = 0; j < samples; j++) {
  865. float a = ang[j];
  866. ang[j] -= mag[j];
  867. if (mag[j] > 0) ang[j] = -ang[j];
  868. if (ang[j] < 0) mag[j] = a;
  869. }
  870. }
  871. residue_encode(venc, &venc->residues[mapping->residue[mapping->mux[0]]], &pb, venc->coeffs, samples, venc->channels);
  872. flush_put_bits(&pb);
  873. return (put_bits_count(&pb) + 7) / 8;
  874. }
  875. static int vorbis_encode_close(AVCodecContext * avccontext)
  876. {
  877. venc_context_t * venc = avccontext->priv_data;
  878. int i;
  879. if (venc->codebooks)
  880. for (i = 0; i < venc->ncodebooks; i++) {
  881. av_freep(&venc->codebooks[i].lens);
  882. av_freep(&venc->codebooks[i].codewords);
  883. av_freep(&venc->codebooks[i].quantlist);
  884. av_freep(&venc->codebooks[i].dimentions);
  885. av_freep(&venc->codebooks[i].pow2);
  886. }
  887. av_freep(&venc->codebooks);
  888. if (venc->floors)
  889. for (i = 0; i < venc->nfloors; i++) {
  890. int j;
  891. if (venc->floors[i].classes)
  892. for (j = 0; j < venc->floors[i].nclasses; j++)
  893. av_freep(&venc->floors[i].classes[j].books);
  894. av_freep(&venc->floors[i].classes);
  895. av_freep(&venc->floors[i].partition_to_class);
  896. av_freep(&venc->floors[i].list);
  897. }
  898. av_freep(&venc->floors);
  899. if (venc->residues)
  900. for (i = 0; i < venc->nresidues; i++) {
  901. av_freep(&venc->residues[i].books);
  902. av_freep(&venc->residues[i].maxes);
  903. }
  904. av_freep(&venc->residues);
  905. if (venc->mappings)
  906. for (i = 0; i < venc->nmappings; i++) {
  907. av_freep(&venc->mappings[i].mux);
  908. av_freep(&venc->mappings[i].floor);
  909. av_freep(&venc->mappings[i].residue);
  910. av_freep(&venc->mappings[i].magnitude);
  911. av_freep(&venc->mappings[i].angle);
  912. }
  913. av_freep(&venc->mappings);
  914. av_freep(&venc->modes);
  915. av_freep(&venc->saved);
  916. av_freep(&venc->samples);
  917. av_freep(&venc->floor);
  918. av_freep(&venc->coeffs);
  919. ff_mdct_end(&venc->mdct[0]);
  920. ff_mdct_end(&venc->mdct[1]);
  921. av_freep(&avccontext->coded_frame);
  922. av_freep(&avccontext->extradata);
  923. return 0 ;
  924. }
  925. AVCodec vorbis_encoder = {
  926. "vorbis",
  927. CODEC_TYPE_AUDIO,
  928. CODEC_ID_VORBIS,
  929. sizeof(venc_context_t),
  930. vorbis_encode_init,
  931. vorbis_encode_frame,
  932. vorbis_encode_close,
  933. .capabilities= CODEC_CAP_DELAY,
  934. };