69 uint8_t **streaminfo_start)
139 assert(s->max_blocksize);
141 for (i = 0; i < s->channels; i++) {
143 sizeof(int32_t)*s->max_blocksize);
154 s->max_blocksize =
get_bits(&gb, 16);
158 s->max_blocksize = 16;
182 int *last,
int *type,
int *
size)
184 int tmp = bytestream_get_byte(&block_header);
190 *size = bytestream_get_be24(&block_header);
202 int metadata_type, metadata_size;
228 int metadata_last, metadata_size;
229 const uint8_t *buf_end = buf + buf_size;
233 if (buf_end - buf < 4)
237 if (buf_end - buf < metadata_size) {
241 buf += metadata_size;
242 }
while (!metadata_last);
244 return buf_size - (buf_end - buf);
249 int i, tmp, partition, method_type, rice_order;
253 if (method_type > 1) {
270 for (partition = 0; partition < (1 << rice_order); partition++) {
271 tmp =
get_bits(&s->
gb, method_type == 0 ? 4 : 5);
272 if (tmp == (method_type == 0 ? 15 : 31)) {
274 for (; i <
samples; i++, sample++)
277 for (; i <
samples; i++, sample++) {
290 int32_t *decoded = s->
decoded[channel];
294 for (i = 0; i < pred_order; i++) {
302 a = decoded[pred_order-1];
304 b = a - decoded[pred_order-2];
306 c =
b - decoded[pred_order-2] + decoded[pred_order-3];
308 d = c - decoded[pred_order-2] + 2*decoded[pred_order-3] - decoded[pred_order-4];
310 switch (pred_order) {
314 for (i = pred_order; i < blocksize; i++)
315 decoded[i] = a += decoded[i];
318 for (i = pred_order; i < blocksize; i++)
319 decoded[i] = a +=
b += decoded[i];
322 for (i = pred_order; i < blocksize; i++)
323 decoded[i] = a +=
b += c += decoded[i];
326 for (i = pred_order; i < blocksize; i++)
327 decoded[i] = a +=
b += c += d += decoded[i];
340 int coeff_prec, qlevel;
342 int32_t *decoded = s->
decoded[channel];
345 for (i = 0; i < pred_order; i++) {
350 if (coeff_prec == 16) {
361 for (i = 0; i < pred_order; i++) {
370 for (i = pred_order; i < s->
blocksize; i++) {
372 for (j = 0; j < pred_order; j++)
373 sum += (int64_t)coeffs[j] * decoded[i-j-1];
374 decoded[i] += sum >> qlevel;
377 for (i = pred_order; i < s->
blocksize-1; i += 2) {
379 int d = decoded[i-pred_order];
381 for (j = pred_order-1; j > 0; j--) {
389 d = decoded[i] += s0 >> qlevel;
391 decoded[i+1] +=
s1 >> qlevel;
393 if (i < s->blocksize) {
395 for (j = 0; j < pred_order; j++)
396 sum += coeffs[j] * decoded[i-j-1];
397 decoded[i] += sum >> qlevel;
406 int type, wasted = 0;
431 "Invalid number of wasted bits > available bits (%d) - left=%d\n",
449 }
else if (type == 1) {
452 }
else if ((type >= 8) && (type <= 12)) {
455 }
else if (type >= 32) {
466 s->
decoded[channel][i] <<= wasted;
483 if (s->channels && fi.channels != s->channels) {
485 "is not supported\n");
491 if (!s->bps && !fi.bps) {
497 }
else if (s->bps && fi.bps != s->bps) {
514 if (!s->max_blocksize)
523 if (!s->samplerate && !fi.samplerate) {
525 " or frame header\n");
528 if (fi.samplerate == 0) {
529 fi.samplerate = s->samplerate;
530 }
else if (s->samplerate && fi.samplerate != s->samplerate) {
532 s->samplerate, fi.samplerate);
545 for (i = 0; i < s->channels; i++) {
559 int *got_frame_ptr,
AVPacket *avpkt)
561 const uint8_t *buf = avpkt->
data;
562 int buf_size = avpkt->
size;
564 int i, j = 0, bytes_read = 0;
571 if (s->max_framesize == 0) {
606 samples_16 = (int16_t *)s->
frame.
data[0];
607 samples_32 = (int32_t *)s->
frame.
data[0];
609 #define DECORRELATE(left, right)\
610 assert(s->channels == 2);\
611 for (i = 0; i < s->blocksize; i++) {\
612 int a= s->decoded[0][i];\
613 int b= s->decoded[1][i];\
615 *samples_32++ = (left) << s->sample_shift;\
616 *samples_32++ = (right) << s->sample_shift;\
618 *samples_16++ = (left) << s->sample_shift;\
619 *samples_16++ = (right) << s->sample_shift;\
627 for (i = 0; i < s->channels; i++) {
643 if (bytes_read > buf_size) {
647 if (bytes_read < buf_size) {
649 buf_size - bytes_read, buf_size);
663 for (i = 0; i < s->channels; i++) {