1 /**
2 * @file
3 * Vorbis I decoder
4 * @author Denes Balatoni ( dbalatoni programozo hu )
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
23 /**
24 * @file
25 * Vorbis I decoder
26 * @author Denes Balatoni ( dbalatoni programozo hu )
27 */
28
29 #include <inttypes.h>
30 #include <math.h>
31
32 #define BITSTREAM_READER_LE
39
43
46 #define V_MAX_VLCS (1 << 16)
47 #define V_MAX_PARTITIONS (1 << 20)
48
57
61 struct vorbis_context_s;
62 typedef
94
107
117
124
125 typedef struct vorbis_context_s {
130
139 uint32_t blocksize[2];
156
157 /* Helper functions */
158
160 (13.1f * atan(0.00074f * (x)) + 2.24f * atan(1.85e-8f * (x) * (x)) + 1e-4f * (x))
161
162 static const char idx_err_str[] =
"Index value %d out of range (0 - %d) for %s at %s:%i\n";
163 #define VALIDATE_INDEX(idx, limit) \
164 if (idx >= limit) {\
165 av_log(vc->avctx, AV_LOG_ERROR,\
166 idx_err_str,\
167 (int)(idx), (int)(limit - 1), #idx, __FILE__, __LINE__);\
168 return AVERROR_INVALIDDATA;\
169 }
170 #define GET_VALIDATED_INDEX(idx, bits, limit) \
171 {\
172 idx = get_bits(gb, bits);\
173 VALIDATE_INDEX(idx, limit)\
174 }
175
177 {
178 double mant = val & 0x1fffff;
179 long exp = (val & 0x7fe00000
L) >> 21;
180 if (val & 0x80000000)
181 mant = -mant;
182 return ldexp(mant, exp - 20 - 768);
183 }
184
185
186 // Free all allocated memory -----------------------------------------
187
189 {
190 int i;
191
195
201
204
209 }
211
219 } else {
221 }
222 }
224
230 }
232 }
233
234 // Parse setup header -------------------------------------------------
235
236 // Process codebooks part
237
239 {
242 uint32_t *tmp_vlc_codes =
NULL;
244 uint16_t *codebook_multiplicands =
NULL;
246
248
250
256 !tmp_vlc_bits || !tmp_vlc_codes || !codebook_multiplicands) {
258 goto error;
259 }
260
263 unsigned ordered, t, entries, used_entries = 0;
264
266
269 " %u. Codebook setup data corrupt.\n", cb);
271 goto error;
272 }
273
277 " %u. Codebook's dimension is invalid (%d).\n",
280 goto error;
281 }
285 " %u. Codebook has too many entries (%u).\n",
286 cb, entries);
288 goto error;
289 }
290
292
293 av_dlog(
NULL,
" codebook_dimensions %d, codebook_entries %u\n",
295
296 if (!ordered) {
297 unsigned ce, flag;
299
301
302 if (sparse) {
304
305 used_entries = 0;
306 for (ce = 0; ce < entries; ++ce) {
308 if (flag) {
309 tmp_vlc_bits[ce] =
get_bits(gb, 5) + 1;
310 ++used_entries;
311 } else
312 tmp_vlc_bits[ce] = 0;
313 }
314 } else {
316
317 used_entries = entries;
318 for (ce = 0; ce < entries; ++ce)
319 tmp_vlc_bits[ce] =
get_bits(gb, 5) + 1;
320 }
321 } else {
322 unsigned current_entry = 0;
323 unsigned current_length =
get_bits(gb, 5) + 1;
324
325 av_dlog(
NULL,
" ordered, current length: %u\n", current_length);
//FIXME
326
327 used_entries = entries;
328 for (; current_entry < used_entries && current_length <= 32; ++current_length) {
329 unsigned i, number;
330
332
334
336
337 for (i = current_entry; i < number+current_entry; ++i)
338 if (i < used_entries)
339 tmp_vlc_bits[i] = current_length;
340
341 current_entry+=number;
342 }
343 if (current_entry>used_entries) {
346 goto error;
347 }
348 }
349
351
354
355 // If the codebook is used for (inverse) VQ, calculate codevectors.
356
358 unsigned i, j, k;
360
363 unsigned codebook_value_bits =
get_bits(gb, 4) + 1;
364 unsigned codebook_sequence_p =
get_bits1(gb);
365
366 av_dlog(
NULL,
" We expect %d numbers for building the codevectors. \n",
367 codebook_lookup_values);
369 codebook_delta_value, codebook_minimum_value);
370
371 for (i = 0; i < codebook_lookup_values; ++i) {
372 codebook_multiplicands[i] =
get_bits(gb, codebook_value_bits);
373
374 av_dlog(
NULL,
" multiplicands*delta+minmum : %e \n",
375 (float)codebook_multiplicands[i] * codebook_delta_value + codebook_minimum_value);
376 av_dlog(
NULL,
" multiplicand %u\n", codebook_multiplicands[i]);
377 }
378
379 // Weed out unused vlcs and build codevector vector
380 if (used_entries) {
386 goto error;
387 }
388 } else
390
391 for (j = 0, i = 0; i < entries; ++i) {
393
394 if (tmp_vlc_bits[i]) {
395 float last = 0.0;
396 unsigned lookup_offset = i;
397
399
400 for (k = 0; k <
dim; ++k) {
401 unsigned multiplicand_offset = lookup_offset % codebook_lookup_values;
402 codebook_setup->
codevectors[j * dim + k] = codebook_multiplicands[multiplicand_offset] * codebook_delta_value + codebook_minimum_value + last;
403 if (codebook_sequence_p)
405 lookup_offset/=codebook_lookup_values;
406 }
407 tmp_vlc_bits[j] = tmp_vlc_bits[i];
408
409 av_dlog(vc->
avctx,
"real lookup offset %u, vector: ", j);
410 for (k = 0; k <
dim; ++k)
414
415 ++j;
416 }
417 }
418 if (j != used_entries) {
421 goto error;
422 }
423 entries = used_entries;
427 goto error;
428 }
429
430 // Initialize VLC table
434 goto error;
435 }
437 for (t = 0; t < entries; ++t)
438 if (tmp_vlc_bits[t] >= codebook_setup->
maxdepth)
439 codebook_setup->
maxdepth = tmp_vlc_bits[t];
440
443 else
445
447
449 entries, tmp_vlc_bits, sizeof(*tmp_vlc_bits),
450 sizeof(*tmp_vlc_bits), tmp_vlc_codes,
451 sizeof(*tmp_vlc_codes), sizeof(*tmp_vlc_codes),
454 goto error;
455 }
456 }
457
460 av_free(codebook_multiplicands);
461 return 0;
462
463 // Error:
464 error:
467 av_free(codebook_multiplicands);
469 }
470
471 // Process time domain transforms part (unused in Vorbis I)
472
474 {
476 unsigned i, vorbis_time_count =
get_bits(gb, 6) + 1;
477
478 for (i = 0; i < vorbis_time_count; ++i) {
479 unsigned vorbis_tdtransform =
get_bits(gb, 16);
480
481 av_dlog(
NULL,
" Vorbis time domain transform %u: %u\n",
482 vorbis_time_count, vorbis_tdtransform);
483
484 if (vorbis_tdtransform) {
487 }
488 }
489 return 0;
490 }
491
492 // Process floors part
493
500 {
503
505
509
512
514
516
518 int maximum_class = -1;
519 unsigned rangebits, rangemax, floor1_values = 2;
520
522
524
527
532
533 av_dlog(
NULL,
" %d. floor %d partition class %d \n",
535
536 }
537
538 av_dlog(
NULL,
" maximum class %d \n", maximum_class);
539
540 for (j = 0; j <= maximum_class; ++j) {
543
544 av_dlog(
NULL,
" %d floor %d class dim: %d subclasses %d \n", i, j,
547
550
552 }
553
556 if (bits != -1)
559
561 }
562 }
563
566
569
574
576 rangemax = (1 << rangebits);
579 "Floor value is too large for blocksize: %u (%"PRIu32")\n",
582 }
585
589
590 av_dlog(
NULL,
" %u. floor1 Y coord. %d\n", floor1_values,
592 }
593 }
594
595 // Precalculate order of x coordinates - needed for decode
600 }
602 unsigned max_codebook_dim = 0;
603
605
610 }
615 }
619 "Floor 0 bark map size is 0.\n");
621 }
625
626 /* allocate mem for booklist */
631 /* read book indexes */
632 {
633 int idx;
634 unsigned book_idx;
640 }
641 }
642
645
646 /* codebook dim is for padding if codebook dim doesn't *
647 * divide order+1 then we need to read more data */
653
654 /* debug output parsed headers */
667 {
668 int idx;
672 }
673 }
674 } else {
677 }
678 }
679 return 0;
680 }
681
682 // Process residues part
683
685 {
687 unsigned i, j, k;
688
693
695
699 unsigned high_bits, low_bits;
700
702
704
708 /* Validations to prevent a buffer overflow later. */
709 if (res_setup->
begin>res_setup->
end ||
712 "partition out of bounds: type, begin, end, size, blocksize: %"PRIu16", %"PRIu32", %"PRIu32", %u, %"PRIu32"\n",
716 }
717
720
728
729 av_dlog(
NULL,
" begin %d end %d part.size %d classif.s %d classbook %d \n",
732
734 high_bits = 0;
738 cascade[j] = (high_bits << 3) + low_bits;
739
741 }
742
745 for (k = 0; k < 8; ++k) {
746 if (cascade[j]&(1 << k)) {
748
749 av_dlog(
NULL,
" %u class cascade depth %u book: %d\n",
750 j, k, res_setup->
books[j][k]);
751
754 } else {
755 res_setup->
books[j][k] = -1;
756 }
757 }
758 }
759 }
760 return 0;
761 }
762
763 // Process mappings part
764
766 {
768 unsigned i, j;
769
774
776
779
781 av_log(vc->
avctx,
AV_LOG_ERROR,
"Other mappings than type 0 are not compliant with the Vorbis I specification. \n");
783 }
786 } else {
788 }
789
795 sizeof(*mapping_setup->
angle));
798
802 }
803 } else {
805 }
806
809
813 }
814
815 if (mapping_setup->
submaps>1) {
817 sizeof(*mapping_setup->
mux));
818 if (!mapping_setup->
mux)
820
823 }
824
825 for (j = 0; j < mapping_setup->
submaps; ++j) {
829
830 av_dlog(
NULL,
" %u mapping %u submap : floor %d, residue %d\n", i, j,
833 }
834 }
835 return 0;
836 }
837
838 // Process modes part
839
841 {
844 int idx;
847
848 for (blockflag = 0; blockflag < 2; ++blockflag) {
850 floors[floor_number].
data.
t0.
map[blockflag] =
852 if (!floors[floor_number].
data.t0.map[blockflag])
854
855 map = floors[floor_number].
data.
t0.
map[blockflag];
856 vf = &floors[floor_number].
data.
t0;
857
858 for (idx = 0; idx <
n; ++idx) {
859 map[idx] = floor(
BARK((vf->rate * idx) / (2.0f * n)) *
860 (vf->bark_map_size /
BARK(vf->rate / 2.0f)));
861 if (vf->bark_map_size-1 < map[idx])
862 map[idx] = vf->bark_map_size - 1;
863 }
865 vf->map_size[blockflag] =
n;
866 }
867
868 for (idx = 0; idx <=
n; ++idx) {
869 av_dlog(
NULL,
"floor0 map: map at pos %d is %d\n", idx, map[idx]);
870 }
871
872 return 0;
873 }
874
876 {
878 unsigned i;
879
884
886
889
894
895 av_dlog(
NULL,
" %u mode: blockflag %d, windowtype %d, transformtype %d, mapping %d\n",
898 }
899 return 0;
900 }
901
902 // Process the whole setup header using the functions above
903
905 {
908
914 }
915
919 }
923 }
927 }
931 }
935 }
939 }
943 }
944
945 return 0;
946 }
947
948 // Process the identification header
949
951 {
953 unsigned bl0, bl1;
954
960 }
961
967 }
972 }
978 if (bl0 > 13 || bl0 < 6 || bl1 > 13 || bl1 < 6 || bl1 < bl0) {
981 }
986
990 }
991
996
998
1004
1005 av_dlog(
NULL,
" vorbis version %d \n audio_channels %d \n audio_samplerate %d \n bitrate_max %d \n bitrate_nom %d \n bitrate_min %d \n blk_0 %d blk_1 %d \n ",
1007
1008 /*
1009 BLK = vc->blocksize[0];
1010 for (i = 0; i < BLK / 2; ++i) {
1011 vc->win[0][i] = sin(0.5*3.14159265358*(sin(((float)i + 0.5) / (float)BLK*3.14159265358))*(sin(((float)i + 0.5) / (float)BLK*3.14159265358)));
1012 }
1013 */
1014
1015 return 0;
1016 }
1017
1018 // Process the extradata using the functions above (identification header, setup header)
1019
1021 {
1025 const uint8_t *header_start[3];
1026 int header_len[3];
1029
1032
1034
1035 if (!headers_len) {
1038 }
1039
1043 }
1044
1047 if (hdr_type != 1) {
1050 }
1055 }
1056
1059 if (hdr_type != 5) {
1063 }
1068 }
1069
1072 else
1074
1077
1078 return 0;
1079 }
1080
1081 // Decode audiopackets -------------------------------------------------
1082
1083 // Read and decode floor
1084
1087 {
1089 float *lsp = vf->lsp;
1090 unsigned amplitude, book_idx;
1092
1093 if (!vf->amplitude_bits)
1094 return 1;
1095
1096 amplitude =
get_bits(&vc->
gb, vf->amplitude_bits);
1097 if (amplitude > 0) {
1098 float last = 0;
1099 unsigned idx, lsp_len = 0;
1101
1103 if (book_idx >= vf->num_books) {
1105 book_idx = 0;
1106 }
1107 av_dlog(
NULL,
"floor0 dec: booknumber: %u\n", book_idx);
1108 codebook = vc->
codebooks[vf->book_list[book_idx]];
1109 /* Invalid codebook! */
1112
1113 while (lsp_len<vf->order) {
1114 int vec_off;
1115
1118 /* read temp vector */
1122 av_dlog(
NULL,
"floor0 dec: vector offset: %d\n", vec_off);
1123 /* copy each vector component and add last to it */
1124 for (idx = 0; idx < codebook.
dimensions; ++idx)
1125 lsp[lsp_len+idx] = codebook.
codevectors[vec_off+idx] + last;
1126 last = lsp[lsp_len+idx-1]; /* set last to last vector component */
1127
1129 }
1130 /* DEBUG: output lsp coeffs */
1131 {
1132 int idx;
1133 for (idx = 0; idx < lsp_len; ++idx)
1134 av_dlog(
NULL,
"floor0 dec: coeff at %d is %f\n", idx, lsp[idx]);
1135 }
1136
1137 /* synthesize floor output vector */
1138 {
1139 int i;
1140 int order = vf->order;
1141 float wstep =
M_PI / vf->bark_map_size;
1142
1143 for (i = 0; i < order; i++)
1144 lsp[i] = 2.0f * cos(lsp[i]);
1145
1146 av_dlog(
NULL,
"floor0 synth: map_size = %"PRIu32
"; m = %d; wstep = %f\n",
1147 vf->map_size[blockflag], order, wstep);
1148
1149 i = 0;
1150 while (i < vf->map_size[blockflag]) {
1151 int j, iter_cond = vf->map[blockflag][i];
1152 float p = 0.5f;
1153 float q = 0.5f;
1154 float two_cos_w = 2.0f * cos(wstep * iter_cond); // needed all times
1155
1156 /* similar part for the q and p products */
1157 for (j = 0; j + 1 < order; j += 2) {
1158 q *= lsp[j] - two_cos_w;
1159 p *= lsp[j + 1] - two_cos_w;
1160 }
1161 if (j == order) { // even order
1162 p *= p * (2.0f - two_cos_w);
1163 q *= q * (2.0f + two_cos_w);
1164 } else { // odd order
1165 q *= two_cos_w-lsp[j]; // one more time for q
1166
1167 /* final step and square */
1168 p *= p * (4.f - two_cos_w * two_cos_w);
1169 q *= q;
1170 }
1171
1172 /* calculate linear floor value */
1173 q = exp((((amplitude*vf->amplitude_offset) /
1174 (((1 << vf->amplitude_bits) - 1) * sqrt(p + q)))
1175 - vf->amplitude_offset) * .11512925f);
1176
1177 /* fill vector */
1178 do {
1179 vec[i] = q; ++i;
1180 } while (vf->map[blockflag][i] == iter_cond);
1181 }
1182 }
1183 } else {
1184 /* this channel is unused */
1185 return 1;
1186 }
1187
1189
1190 return 0;
1191 }
1192
1195 {
1198 uint16_t range_v[4] = { 256, 128, 86, 64 };
1199 unsigned range = range_v[vf->multiplier - 1];
1200 uint16_t floor1_Y[258];
1201 uint16_t floor1_Y_final[258];
1202 int floor1_flag[258];
1203 unsigned partition_class, cdim, cbits, csub, cval,
offset, i, j;
1204 int book, adx, ady, dy, off, predicted, err;
1205
1206
1208 return 1;
1209
1210 // Read values (or differences) for the floor's points
1211
1214
1215 av_dlog(
NULL,
"floor 0 Y %d floor 1 Y %d \n", floor1_Y[0], floor1_Y[1]);
1216
1217 offset = 2;
1218 for (i = 0; i < vf->partitions; ++i) {
1219 partition_class = vf->partition_class[i];
1220 cdim = vf->class_dimensions[partition_class];
1221 cbits = vf->class_subclasses[partition_class];
1222 csub = (1 << cbits) - 1;
1223 cval = 0;
1224
1226
1227 if (cbits) // this reads all subclasses for this partition's class
1230
1231 for (j = 0; j < cdim; ++j) {
1232 book = vf->subclass_books[partition_class][cval & csub];
1233
1234 av_dlog(
NULL,
"book %d Cbits %u cval %u bits:%d\n",
1236
1237 cval = cval >> cbits;
1238 if (book > -1) {
1241 if (v < 0)
1243 floor1_Y[offset+j] =
v;
1244 } else {
1245 floor1_Y[offset+j] = 0;
1246 }
1247
1249 vf->list[offset+j].x, floor1_Y[offset+j]);
1250 }
1251 offset+=cdim;
1252 }
1253
1254 // Amplitude calculation from the differences
1255
1256 floor1_flag[0] = 1;
1257 floor1_flag[1] = 1;
1258 floor1_Y_final[0] = floor1_Y[0];
1259 floor1_Y_final[1] = floor1_Y[1];
1260
1261 for (i = 2; i < vf->x_list_dim; ++i) {
1262 unsigned val, highroom, lowroom, room, high_neigh_offs, low_neigh_offs;
1263
1264 low_neigh_offs = vf->list[i].low;
1265 high_neigh_offs = vf->list[i].high;
1266 dy = floor1_Y_final[high_neigh_offs] - floor1_Y_final[low_neigh_offs]; // render_point begin
1267 adx = vf->list[high_neigh_offs].x - vf->list[low_neigh_offs].x;
1269 err = ady * (vf->list[i].x - vf->list[low_neigh_offs].x);
1270 off = err / adx;
1271 if (dy < 0) {
1272 predicted = floor1_Y_final[low_neigh_offs] - off;
1273 } else {
1274 predicted = floor1_Y_final[low_neigh_offs] + off;
1275 } // render_point end
1276
1277 val = floor1_Y[i];
1278 highroom = range-predicted;
1279 lowroom = predicted;
1280 if (highroom < lowroom) {
1281 room = highroom * 2;
1282 } else {
1283 room = lowroom * 2; // SPEC misspelling
1284 }
1285 if (val) {
1286 floor1_flag[low_neigh_offs] = 1;
1287 floor1_flag[high_neigh_offs] = 1;
1288 floor1_flag[i] = 1;
1289 if (val >= room) {
1290 if (highroom > lowroom) {
1291 floor1_Y_final[i] = av_clip_uint16(val - lowroom + predicted);
1292 } else {
1293 floor1_Y_final[i] = av_clip_uint16(predicted - val + highroom - 1);
1294 }
1295 } else {
1296 if (val & 1) {
1297 floor1_Y_final[i] = av_clip_uint16(predicted - (val + 1) / 2);
1298 } else {
1299 floor1_Y_final[i] = av_clip_uint16(predicted + val / 2);
1300 }
1301 }
1302 } else {
1303 floor1_flag[i] = 0;
1304 floor1_Y_final[i] = av_clip_uint16(predicted);
1305 }
1306
1307 av_dlog(
NULL,
" Decoded floor(%d) = %u / val %u\n",
1308 vf->list[i].x, floor1_Y_final[i], val);
1309 }
1310
1311 // Curve synth - connect the calculated dots and convert from dB scale FIXME optimize ?
1312
1314
1316
1317 return 0;
1318 }
1319
1323 unsigned ch_used,
1324 int partition_count,
1325 int ptns_to_read
1326 )
1327 {
1328 int p, j, i;
1331 unsigned temp, temp2;
1332 for (p = 0, j = 0; j < ch_used; ++j) {
1333 if (!do_not_decode[j]) {
1336
1338
1339 if ((int)temp < 0)
1341
1343
1344 if (temp <= 65536) {
1345 for (i = partition_count + c_p_c - 1; i >= partition_count; i--) {
1346 temp2 = (((uint64_t)temp) * inverse_class) >> 32;
1347
1348 if (i < ptns_to_read)
1350 temp = temp2;
1351 }
1352 } else {
1353 for (i = partition_count + c_p_c - 1; i >= partition_count; i--) {
1355
1356 if (i < ptns_to_read)
1358 temp = temp2;
1359 }
1360 }
1361 }
1362 p += ptns_to_read;
1363 }
1364 return 0;
1365 }
1366 // Read and decode residue
1367
1370 unsigned ch,
1372 float *vec,
1373 unsigned vlen,
1374 unsigned ch_left,
1375 int vr_type)
1376 {
1380 unsigned pass, ch_used, i, j, k, l;
1381 unsigned max_output = (ch - 1) * vlen;
1383 int libvorbis_bug = 0;
1384
1385 if (vr_type == 2) {
1386 for (j = 1; j < ch; ++j)
1387 do_not_decode[0] &= do_not_decode[j]; // FIXME - clobbering input
1388 if (do_not_decode[0])
1389 return 0;
1390 ch_used = 1;
1391 max_output += vr->
end / ch;
1392 } else {
1393 ch_used = ch;
1394 max_output += vr->
end;
1395 }
1396
1397 if (max_output > ch_left * vlen) {
1398 if (max_output <= ch_left * vlen + vr->partition_size*ch_used/ch) {
1399 ptns_to_read--;
1400 libvorbis_bug = 1;
1401 } else {
1404 }
1405 }
1406
1407 av_dlog(
NULL,
" residue type 0/1/2 decode begin, ch: %d cpc %d \n", ch, c_p_c);
1408
1409 for (pass = 0; pass <= vr->
maxpass; ++
pass) {
// FIXME OPTIMIZE?
1410 int voffset, partition_count, j_times_ptns_to_read;
1411
1412 voffset = vr->
begin;
1413 for (partition_count = 0; partition_count < ptns_to_read;) { // SPEC error
1414 if (!pass) {
1416 if ((ret =
setup_classifs(vc, vr, do_not_decode, ch_used, partition_count, ptns_to_read)) < 0)
1418 }
1419 for (i = 0; (i < c_p_c) && (partition_count < ptns_to_read); ++i) {
1420 for (j_times_ptns_to_read = 0, j = 0; j < ch_used; ++j) {
1421 unsigned voffs;
1422
1423 if (!do_not_decode[j]) {
1424 unsigned vqclass = classifs[j_times_ptns_to_read + partition_count];
1426
1428 unsigned coffs;
1432
1433 if (vr_type == 0) {
1434
1435 voffs = voffset+j*vlen;
1436 for (k = 0; k < step; ++k) {
1438 for (l = 0; l <
dim; ++l)
1439 vec[voffs + k + l * step] += codebook.
codevectors[coffs + l];
1440 }
1441 } else if (vr_type == 1) {
1442 voffs = voffset + j * vlen;
1443 for (k = 0; k < step; ++k) {
1445 for (l = 0; l <
dim; ++l, ++voffs) {
1447
1448 av_dlog(
NULL,
" pass %d offs: %d curr: %f change: %f cv offs.: %d \n",
1449 pass, voffs, vec[voffs], codebook.
codevectors[coffs+l], coffs);
1450 }
1451 }
1452 } else if (vr_type == 2 && ch == 2 && (voffset & 1) == 0 && (dim & 1) == 0) { // most frequent case optimized
1453 voffs = voffset >> 1;
1454
1455 if (dim == 2) {
1456 for (k = 0; k < step; ++k) {
1459 vec[voffs + k + vlen] += codebook.
codevectors[coffs + 1];
1460 }
1461 } else if (dim == 4) {
1462 for (k = 0; k < step; ++k, voffs += 2) {
1465 vec[voffs + 1 ] += codebook.
codevectors[coffs + 2];
1466 vec[voffs + vlen ] += codebook.
codevectors[coffs + 1];
1467 vec[voffs + vlen + 1] += codebook.
codevectors[coffs + 3];
1468 }
1469 } else
1470 for (k = 0; k < step; ++k) {
1472 for (l = 0; l <
dim; l += 2, voffs++) {
1474 vec[voffs + vlen] += codebook.
codevectors[coffs + l + 1];
1475
1476 av_dlog(
NULL,
" pass %d offs: %d curr: %f change: %f cv offs.: %d+%d \n",
1477 pass, voffset / ch + (voffs % ch) * vlen,
1478 vec[voffset / ch + (voffs % ch) * vlen],
1480 }
1481 }
1482
1483 } else if (vr_type == 2) {
1484 unsigned voffs_div =
FASTDIV(voffset << 1, ch <<1);
1485 unsigned voffs_mod = voffset - voffs_div * ch;
1486
1487 for (k = 0; k < step; ++k) {
1489 for (l = 0; l <
dim; ++l) {
1490 vec[voffs_div + voffs_mod * vlen] +=
1492
1493 av_dlog(
NULL,
" pass %d offs: %d curr: %f change: %f cv offs.: %d+%d \n",
1494 pass, voffs_div + voffs_mod * vlen,
1495 vec[voffs_div + voffs_mod * vlen],
1497
1498 if (++voffs_mod == ch) {
1499 voffs_div++;
1500 voffs_mod = 0;
1501 }
1502 }
1503 }
1504 }
1505 }
1506 }
1507 j_times_ptns_to_read += ptns_to_read;
1508 }
1509 ++partition_count;
1511 }
1512 }
1513 if (libvorbis_bug && !pass) {
1514 for (j = 0; j < ch_used; ++j) {
1515 if (!do_not_decode[j]) {
1518 }
1519 }
1520 }
1521 }
1522 return 0;
1523 }
1524
1526 unsigned ch,
1528 float *vec, unsigned vlen,
1529 unsigned ch_left)
1530 {
1533 else if (vr->
type == 1)
1535 else if (vr->
type == 0)
1537 else {
1540 }
1541 }
1542
1544 {
1545 int i;
1546 for (i = 0; i < blocksize; i++) {
1547 if (mag[i] > 0.0) {
1548 if (ang[i] > 0.0) {
1549 ang[i] = mag[i] - ang[i];
1550 } else {
1551 float temp = ang[i];
1552 ang[i] = mag[i];
1554 }
1555 } else {
1556 if (ang[i] > 0.0) {
1557 ang[i] += mag[i];
1558 } else {
1559 float temp = ang[i];
1560 ang[i] = mag[i];
1562 }
1563 }
1564 }
1565 }
1566
1567 // Decode the audio packet using the functions above
1568
1570 {
1574 unsigned mode_number, blockflag, blocksize;
1575 int i, j;
1581 unsigned res_num = 0;
1582 int retlen = 0;
1584 unsigned vlen;
1585
1589 }
1590
1592 mode_number = 0;
1593 } else {
1595 }
1598
1599 av_dlog(
NULL,
" Mode number: %u , mapping: %d , blocktype %d\n", mode_number,
1601
1604 vlen = blocksize / 2;
1605 if (blockflag) {
1607 if (previous_window < 0)
1608 previous_window = code>>1;
1609 } else if (previous_window < 0)
1610 previous_window = 0;
1611
1612 memset(ch_res_ptr, 0,
sizeof(
float) * vc->
audio_channels * vlen);
//FIXME can this be removed ?
1614 memset(floor_ptr[i], 0, vlen * sizeof(floor_ptr[0][0])); //FIXME can this be removed ?
1615
1616 // Decode floor
1617
1623 } else {
1625 }
1626
1627 ret = floor->
decode(vc, &floor->
data, floor_ptr[i]);
1628
1629 if (ret < 0) {
1632 }
1633 no_residue[i] =
ret;
1634 }
1635
1636 // Nonzero vector propagate
1637
1639 if (!(no_residue[mapping->
magnitude[i]] & no_residue[mapping->
angle[i]])) {
1641 no_residue[mapping->
angle[i]] = 0;
1642 }
1643 }
1644
1645 // Decode residue
1646
1647 for (i = 0; i < mapping->
submaps; ++i) {
1649 unsigned ch = 0;
1651
1653 if ((mapping->
submaps == 1) || (i == mapping->
mux[j])) {
1654 res_chan[j] = res_num;
1655 if (no_residue[j]) {
1656 do_not_decode[ch] = 1;
1657 } else {
1658 do_not_decode[ch] = 0;
1659 }
1660 ++ch;
1661 ++res_num;
1662 }
1663 }
1665 if (ch_left < ch) {
1668 }
1669 if (ch) {
1671 if (ret < 0)
1673 }
1674
1675 ch_res_ptr += ch * vlen;
1676 ch_left -= ch;
1677 }
1678
1679 if (ch_left > 0)
1681
1682 // Inverse coupling
1683
1684 for (i = mapping->
coupling_steps - 1; i >= 0; --i) {
//warning: i has to be signed
1685 float *mag, *ang;
1686
1690 }
1691
1692 // Dotproduct, MDCT
1693
1694 mdct = &vc->
mdct[blockflag];
1695
1698 vc->
fdsp->
vector_fmul(floor_ptr[j], floor_ptr[j], ch_res_ptr, blocksize / 2);
1699 mdct->
imdct_half(mdct, ch_res_ptr, floor_ptr[j]);
1700 }
1701
1702 // Overlap/add, save data for next overlapping
1703
1704 retlen = (blocksize + vc->
blocksize[previous_window]) / 4;
1709 float *saved = vc->
saved + j * bs1 / 4;
1710 float *
ret = floor_ptr[j];
1711 float *
buf = residue;
1712 const float *win = vc->
win[blockflag & previous_window];
1713
1714 if (blockflag == previous_window) {
1716 } else if (blockflag > previous_window) {
1718 memcpy(ret+bs0/2, buf+bs0/4, ((bs1-bs0)/4) * sizeof(float));
1719 } else {
1720 memcpy(ret, saved, ((bs1 - bs0) / 4) * sizeof(float));
1722 }
1723 memcpy(saved, buf + blocksize / 4, blocksize / 4 * sizeof(float));
1724 }
1725
1727 return retlen;
1728 }
1729
1730 // Return the decoded audio packet through the standard api
1731
1733 int *got_frame_ptr,
AVPacket *avpkt)
1734 {
1736 int buf_size = avpkt->
size;
1740 float *channel_ptrs[255];
1742
1744
1745 if (*buf == 1 && buf_size > 7) {
1752 }
1753
1756 else
1758
1761 return buf_size;
1762 }
1763
1764 if (*buf == 3 && buf_size > 7) {
1766 return buf_size;
1767 }
1768
1775 }
1776 return buf_size;
1777 }
1778
1782 }
1783
1784 /* get output buffer */
1788
1792 } else {
1796 }
1797 }
1798
1800
1803
1806 *got_frame_ptr = 0;
1808 return buf_size;
1809 }
1810
1811 av_dlog(
NULL,
"parsed %d bytes %d bits, returned %d samples (*ch*bits) \n",
1813
1815 *got_frame_ptr = 1;
1816
1817 return buf_size;
1818 }
1819
1820 // Close decoder
1821
1823 {
1825
1827
1828 return 0;
1829 }
1830
1832 {
1834
1837 sizeof(*vc->
saved));
1838 }
1841 }
1842
1857 };