1 /* libFLAC - Free Lossless Audio Codec library
2 * Copyright (C) 2000,2001,2002,2003,2004,2005,2006,2007,2008,2009 Josh Coalson
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * - Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
11 * - Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * - Neither the name of the Xiph.org Foundation nor the names of its
16 * contributors may be used to endorse or promote products derived from
17 * this software without specific prior written permission.
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR
23 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
24 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
25 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
26 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
27 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
28 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
29 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
38 #include "FLAC/assert.h"
39 #include "FLAC/format.h"
40 #include "private/bitmath.h"
41 #include "private/lpc.h"
42 #include "private/macros.h"
43 #if defined DEBUG || defined FLAC__OVERFLOW_DETECT || defined FLAC__OVERFLOW_DETECT_VERBOSE
47 /* OPT: #undef'ing this may improve the speed on some architectures */
48 #define FLAC__LPC_UNROLLED_FILTER_LOOPS
50 #ifndef FLAC__INTEGER_ONLY_LIBRARY
53 /* math.h in VC++ doesn't seem to have this (how Microsoft is that?) */
54 #define M_LN2 0.69314718055994530942
57 #if !defined(HAVE_LROUND)
60 #define copysign _copysign
61 #elif defined(__GNUC__)
62 #define copysign __builtin_copysign
64 static inline long int lround(double x) {
65 return (long)(x + copysign (0.5, x));
67 //If this fails, we are in the precence of a mid 90's compiler..move along...
70 void FLAC__lpc_window_data(const FLAC__int32 in[], const FLAC__real window[], FLAC__real out[], unsigned data_len)
73 for(i = 0; i < data_len; i++)
74 out[i] = in[i] * window[i];
77 void FLAC__lpc_compute_autocorrelation(const FLAC__real data[], unsigned data_len, unsigned lag, FLAC__real autoc[])
79 /* a readable, but slower, version */
84 FLAC__ASSERT(lag > 0);
85 FLAC__ASSERT(lag <= data_len);
88 * Technically we should subtract the mean first like so:
89 * for(i = 0; i < data_len; i++)
91 * but it appears not to make enough of a difference to matter, and
92 * most signals are already closely centered around zero
95 for(i = lag, d = 0.0; i < data_len; i++)
96 d += data[i] * data[i - lag];
102 * this version tends to run faster because of better data locality
103 * ('data_len' is usually much larger than 'lag')
106 unsigned sample, coeff;
107 const unsigned limit = data_len - lag;
109 FLAC__ASSERT(lag > 0);
110 FLAC__ASSERT(lag <= data_len);
112 for(coeff = 0; coeff < lag; coeff++)
114 for(sample = 0; sample <= limit; sample++) {
116 for(coeff = 0; coeff < lag; coeff++)
117 autoc[coeff] += d * data[sample+coeff];
119 for(; sample < data_len; sample++) {
121 for(coeff = 0; coeff < data_len - sample; coeff++)
122 autoc[coeff] += d * data[sample+coeff];
126 void FLAC__lpc_compute_lp_coefficients(const FLAC__real autoc[], unsigned *max_order, FLAC__real lp_coeff[][FLAC__MAX_LPC_ORDER], FLAC__double error[])
129 FLAC__double r, err, lpc[FLAC__MAX_LPC_ORDER];
131 FLAC__ASSERT(0 != max_order);
132 FLAC__ASSERT(0 < *max_order);
133 FLAC__ASSERT(*max_order <= FLAC__MAX_LPC_ORDER);
134 FLAC__ASSERT(autoc[0] != 0.0);
138 for(i = 0; i < *max_order; i++) {
139 /* Sum up this iteration's reflection coefficient. */
141 for(j = 0; j < i; j++)
142 r -= lpc[j] * autoc[i-j];
144 /* Update LPC coefficients and total error. */
146 for(j = 0; j < (i>>1); j++) {
147 FLAC__double tmp = lpc[j];
148 lpc[j] += r * lpc[i-1-j];
149 lpc[i-1-j] += r * tmp;
152 lpc[j] += lpc[j] * r;
154 err *= (1.0 - r * r);
156 /* save this order */
157 for(j = 0; j <= i; j++)
158 lp_coeff[i][j] = (FLAC__real)(-lpc[j]); /* negate FIR filter coeff to get predictor coeff */
161 /* see SF bug #1601812 http://sourceforge.net/tracker/index.php?func=detail&aid=1601812&group_id=13478&atid=113478 */
169 int FLAC__lpc_quantize_coefficients(const FLAC__real lp_coeff[], unsigned order, unsigned precision, FLAC__int32 qlp_coeff[], int *shift)
173 FLAC__int32 qmax, qmin;
175 FLAC__ASSERT(precision > 0);
176 FLAC__ASSERT(precision >= FLAC__MIN_QLP_COEFF_PRECISION);
178 /* drop one bit for the sign; from here on out we consider only |lp_coeff[i]| */
180 qmax = 1 << precision;
184 /* calc cmax = max( |lp_coeff[i]| ) */
186 for(i = 0; i < order; i++) {
187 const FLAC__double d = fabs(lp_coeff[i]);
193 /* => coefficients are all 0, which means our constant-detect didn't work */
197 const int max_shiftlimit = (1 << (FLAC__SUBFRAME_LPC_QLP_SHIFT_LEN-1)) - 1;
198 const int min_shiftlimit = -max_shiftlimit - 1;
201 (void)frexp(cmax, &log2cmax);
203 *shift = (int)precision - log2cmax - 1;
205 if(*shift > max_shiftlimit)
206 *shift = max_shiftlimit;
207 else if(*shift < min_shiftlimit)
212 FLAC__double error = 0.0;
214 for(i = 0; i < order; i++) {
215 error += lp_coeff[i] * (1 << *shift);
218 #ifdef FLAC__OVERFLOW_DETECT
219 if(q > qmax+1) /* we expect q==qmax+1 occasionally due to rounding */
220 fprintf(stderr,"FLAC__lpc_quantize_coefficients: quantizer overflow: q>qmax %d>%d shift=%d cmax=%f precision=%u lpc[%u]=%f\n",q,qmax,*shift,cmax,precision+1,i,lp_coeff[i]);
222 fprintf(stderr,"FLAC__lpc_quantize_coefficients: quantizer overflow: q<qmin %d<%d shift=%d cmax=%f precision=%u lpc[%u]=%f\n",q,qmin,*shift,cmax,precision+1,i,lp_coeff[i]);
232 /* negative shift is very rare but due to design flaw, negative shift is
233 * a NOP in the decoder, so it must be handled specially by scaling down
237 const int nshift = -(*shift);
238 FLAC__double error = 0.0;
241 fprintf(stderr,"FLAC__lpc_quantize_coefficients: negative shift=%d order=%u cmax=%f\n", *shift, order, cmax);
243 for(i = 0; i < order; i++) {
244 error += lp_coeff[i] / (1 << nshift);
246 #ifdef FLAC__OVERFLOW_DETECT
247 if(q > qmax+1) /* we expect q==qmax+1 occasionally due to rounding */
248 fprintf(stderr,"FLAC__lpc_quantize_coefficients: quantizer overflow: q>qmax %d>%d shift=%d cmax=%f precision=%u lpc[%u]=%f\n",q,qmax,*shift,cmax,precision+1,i,lp_coeff[i]);
250 fprintf(stderr,"FLAC__lpc_quantize_coefficients: quantizer overflow: q<qmin %d<%d shift=%d cmax=%f precision=%u lpc[%u]=%f\n",q,qmin,*shift,cmax,precision+1,i,lp_coeff[i]);
265 void FLAC__lpc_compute_residual_from_qlp_coefficients(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[])
266 #if defined(FLAC__OVERFLOW_DETECT) || !defined(FLAC__LPC_UNROLLED_FILTER_LOOPS)
271 const FLAC__int32 *history;
273 #ifdef FLAC__OVERFLOW_DETECT_VERBOSE
274 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization);
276 fprintf(stderr,", q[%u]=%d",i,qlp_coeff[i]);
277 fprintf(stderr,"\n");
279 FLAC__ASSERT(order > 0);
281 for(i = 0; i < data_len; i++) {
285 for(j = 0; j < order; j++) {
286 sum += qlp_coeff[j] * (*(--history));
287 sumo += (FLAC__int64)qlp_coeff[j] * (FLAC__int64)(*history);
288 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients: OVERFLOW, i=%u, j=%u, c=%d, d=%d, sumo=%" PRId64 "\n",i,j,qlp_coeff[j],*history,sumo);
290 *(residual++) = *(data++) - (sum >> lp_quantization);
293 /* Here's a slower but clearer version:
294 for(i = 0; i < data_len; i++) {
296 for(j = 0; j < order; j++)
297 sum += qlp_coeff[j] * data[i-j-1];
298 residual[i] = data[i] - (sum >> lp_quantization);
302 #else /* fully unrolled version for normal use */
307 FLAC__ASSERT(order > 0);
308 FLAC__ASSERT(order <= 32);
311 * We do unique versions up to 12th order since that's the subset limit.
312 * Also they are roughly ordered to match frequency of occurrence to
313 * minimize branching.
319 for(i = 0; i < (int)data_len; i++) {
321 sum += qlp_coeff[11] * data[i-12];
322 sum += qlp_coeff[10] * data[i-11];
323 sum += qlp_coeff[9] * data[i-10];
324 sum += qlp_coeff[8] * data[i-9];
325 sum += qlp_coeff[7] * data[i-8];
326 sum += qlp_coeff[6] * data[i-7];
327 sum += qlp_coeff[5] * data[i-6];
328 sum += qlp_coeff[4] * data[i-5];
329 sum += qlp_coeff[3] * data[i-4];
330 sum += qlp_coeff[2] * data[i-3];
331 sum += qlp_coeff[1] * data[i-2];
332 sum += qlp_coeff[0] * data[i-1];
333 residual[i] = data[i] - (sum >> lp_quantization);
336 else { /* order == 11 */
337 for(i = 0; i < (int)data_len; i++) {
339 sum += qlp_coeff[10] * data[i-11];
340 sum += qlp_coeff[9] * data[i-10];
341 sum += qlp_coeff[8] * data[i-9];
342 sum += qlp_coeff[7] * data[i-8];
343 sum += qlp_coeff[6] * data[i-7];
344 sum += qlp_coeff[5] * data[i-6];
345 sum += qlp_coeff[4] * data[i-5];
346 sum += qlp_coeff[3] * data[i-4];
347 sum += qlp_coeff[2] * data[i-3];
348 sum += qlp_coeff[1] * data[i-2];
349 sum += qlp_coeff[0] * data[i-1];
350 residual[i] = data[i] - (sum >> lp_quantization);
356 for(i = 0; i < (int)data_len; i++) {
358 sum += qlp_coeff[9] * data[i-10];
359 sum += qlp_coeff[8] * data[i-9];
360 sum += qlp_coeff[7] * data[i-8];
361 sum += qlp_coeff[6] * data[i-7];
362 sum += qlp_coeff[5] * data[i-6];
363 sum += qlp_coeff[4] * data[i-5];
364 sum += qlp_coeff[3] * data[i-4];
365 sum += qlp_coeff[2] * data[i-3];
366 sum += qlp_coeff[1] * data[i-2];
367 sum += qlp_coeff[0] * data[i-1];
368 residual[i] = data[i] - (sum >> lp_quantization);
371 else { /* order == 9 */
372 for(i = 0; i < (int)data_len; i++) {
374 sum += qlp_coeff[8] * data[i-9];
375 sum += qlp_coeff[7] * data[i-8];
376 sum += qlp_coeff[6] * data[i-7];
377 sum += qlp_coeff[5] * data[i-6];
378 sum += qlp_coeff[4] * data[i-5];
379 sum += qlp_coeff[3] * data[i-4];
380 sum += qlp_coeff[2] * data[i-3];
381 sum += qlp_coeff[1] * data[i-2];
382 sum += qlp_coeff[0] * data[i-1];
383 residual[i] = data[i] - (sum >> lp_quantization);
391 for(i = 0; i < (int)data_len; i++) {
393 sum += qlp_coeff[7] * data[i-8];
394 sum += qlp_coeff[6] * data[i-7];
395 sum += qlp_coeff[5] * data[i-6];
396 sum += qlp_coeff[4] * data[i-5];
397 sum += qlp_coeff[3] * data[i-4];
398 sum += qlp_coeff[2] * data[i-3];
399 sum += qlp_coeff[1] * data[i-2];
400 sum += qlp_coeff[0] * data[i-1];
401 residual[i] = data[i] - (sum >> lp_quantization);
404 else { /* order == 7 */
405 for(i = 0; i < (int)data_len; i++) {
407 sum += qlp_coeff[6] * data[i-7];
408 sum += qlp_coeff[5] * data[i-6];
409 sum += qlp_coeff[4] * data[i-5];
410 sum += qlp_coeff[3] * data[i-4];
411 sum += qlp_coeff[2] * data[i-3];
412 sum += qlp_coeff[1] * data[i-2];
413 sum += qlp_coeff[0] * data[i-1];
414 residual[i] = data[i] - (sum >> lp_quantization);
420 for(i = 0; i < (int)data_len; i++) {
422 sum += qlp_coeff[5] * data[i-6];
423 sum += qlp_coeff[4] * data[i-5];
424 sum += qlp_coeff[3] * data[i-4];
425 sum += qlp_coeff[2] * data[i-3];
426 sum += qlp_coeff[1] * data[i-2];
427 sum += qlp_coeff[0] * data[i-1];
428 residual[i] = data[i] - (sum >> lp_quantization);
431 else { /* order == 5 */
432 for(i = 0; i < (int)data_len; i++) {
434 sum += qlp_coeff[4] * data[i-5];
435 sum += qlp_coeff[3] * data[i-4];
436 sum += qlp_coeff[2] * data[i-3];
437 sum += qlp_coeff[1] * data[i-2];
438 sum += qlp_coeff[0] * data[i-1];
439 residual[i] = data[i] - (sum >> lp_quantization);
447 for(i = 0; i < (int)data_len; i++) {
449 sum += qlp_coeff[3] * data[i-4];
450 sum += qlp_coeff[2] * data[i-3];
451 sum += qlp_coeff[1] * data[i-2];
452 sum += qlp_coeff[0] * data[i-1];
453 residual[i] = data[i] - (sum >> lp_quantization);
456 else { /* order == 3 */
457 for(i = 0; i < (int)data_len; i++) {
459 sum += qlp_coeff[2] * data[i-3];
460 sum += qlp_coeff[1] * data[i-2];
461 sum += qlp_coeff[0] * data[i-1];
462 residual[i] = data[i] - (sum >> lp_quantization);
468 for(i = 0; i < (int)data_len; i++) {
470 sum += qlp_coeff[1] * data[i-2];
471 sum += qlp_coeff[0] * data[i-1];
472 residual[i] = data[i] - (sum >> lp_quantization);
475 else { /* order == 1 */
476 for(i = 0; i < (int)data_len; i++)
477 residual[i] = data[i] - ((qlp_coeff[0] * data[i-1]) >> lp_quantization);
482 else { /* order > 12 */
483 for(i = 0; i < (int)data_len; i++) {
486 case 32: sum += qlp_coeff[31] * data[i-32];
487 case 31: sum += qlp_coeff[30] * data[i-31];
488 case 30: sum += qlp_coeff[29] * data[i-30];
489 case 29: sum += qlp_coeff[28] * data[i-29];
490 case 28: sum += qlp_coeff[27] * data[i-28];
491 case 27: sum += qlp_coeff[26] * data[i-27];
492 case 26: sum += qlp_coeff[25] * data[i-26];
493 case 25: sum += qlp_coeff[24] * data[i-25];
494 case 24: sum += qlp_coeff[23] * data[i-24];
495 case 23: sum += qlp_coeff[22] * data[i-23];
496 case 22: sum += qlp_coeff[21] * data[i-22];
497 case 21: sum += qlp_coeff[20] * data[i-21];
498 case 20: sum += qlp_coeff[19] * data[i-20];
499 case 19: sum += qlp_coeff[18] * data[i-19];
500 case 18: sum += qlp_coeff[17] * data[i-18];
501 case 17: sum += qlp_coeff[16] * data[i-17];
502 case 16: sum += qlp_coeff[15] * data[i-16];
503 case 15: sum += qlp_coeff[14] * data[i-15];
504 case 14: sum += qlp_coeff[13] * data[i-14];
505 case 13: sum += qlp_coeff[12] * data[i-13];
506 sum += qlp_coeff[11] * data[i-12];
507 sum += qlp_coeff[10] * data[i-11];
508 sum += qlp_coeff[ 9] * data[i-10];
509 sum += qlp_coeff[ 8] * data[i- 9];
510 sum += qlp_coeff[ 7] * data[i- 8];
511 sum += qlp_coeff[ 6] * data[i- 7];
512 sum += qlp_coeff[ 5] * data[i- 6];
513 sum += qlp_coeff[ 4] * data[i- 5];
514 sum += qlp_coeff[ 3] * data[i- 4];
515 sum += qlp_coeff[ 2] * data[i- 3];
516 sum += qlp_coeff[ 1] * data[i- 2];
517 sum += qlp_coeff[ 0] * data[i- 1];
519 residual[i] = data[i] - (sum >> lp_quantization);
525 void FLAC__lpc_compute_residual_from_qlp_coefficients_wide(const FLAC__int32 *data, unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 residual[])
526 #if defined(FLAC__OVERFLOW_DETECT) || !defined(FLAC__LPC_UNROLLED_FILTER_LOOPS)
530 const FLAC__int32 *history;
532 #ifdef FLAC__OVERFLOW_DETECT_VERBOSE
533 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients_wide: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization);
535 fprintf(stderr,", q[%u]=%d",i,qlp_coeff[i]);
536 fprintf(stderr,"\n");
538 FLAC__ASSERT(order > 0);
540 for(i = 0; i < data_len; i++) {
543 for(j = 0; j < order; j++)
544 sum += (FLAC__int64)qlp_coeff[j] * (FLAC__int64)(*(--history));
545 if(FLAC__bitmath_silog2_wide(sum >> lp_quantization) > 32) {
546 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients_wide: OVERFLOW, i=%u, sum=%" PRId64 "\n", i, (sum >> lp_quantization));
549 if(FLAC__bitmath_silog2_wide((FLAC__int64)(*data) - (sum >> lp_quantization)) > 32) {
550 fprintf(stderr,"FLAC__lpc_compute_residual_from_qlp_coefficients_wide: OVERFLOW, i=%u, data=%d, sum=%" PRId64 ", residual=%" PRId64 "\n", i, *data, (long long)(sum >> lp_quantization), ((FLAC__int64)(*data) - (sum >> lp_quantization)));
553 *(residual++) = *(data++) - (FLAC__int32)(sum >> lp_quantization);
556 #else /* fully unrolled version for normal use */
561 FLAC__ASSERT(order > 0);
562 FLAC__ASSERT(order <= 32);
565 * We do unique versions up to 12th order since that's the subset limit.
566 * Also they are roughly ordered to match frequency of occurrence to
567 * minimize branching.
573 for(i = 0; i < (int)data_len; i++) {
575 sum += qlp_coeff[11] * (FLAC__int64)data[i-12];
576 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
577 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
578 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
579 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
580 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
581 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
582 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
583 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
584 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
585 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
586 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
587 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
590 else { /* order == 11 */
591 for(i = 0; i < (int)data_len; i++) {
593 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
594 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
595 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
596 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
597 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
598 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
599 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
600 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
601 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
602 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
603 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
604 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
610 for(i = 0; i < (int)data_len; i++) {
612 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
613 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
614 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
615 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
616 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
617 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
618 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
619 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
620 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
621 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
622 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
625 else { /* order == 9 */
626 for(i = 0; i < (int)data_len; i++) {
628 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
629 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
630 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
631 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
632 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
633 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
634 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
635 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
636 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
637 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
645 for(i = 0; i < (int)data_len; i++) {
647 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
648 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
649 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
650 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
651 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
652 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
653 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
654 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
655 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
658 else { /* order == 7 */
659 for(i = 0; i < (int)data_len; i++) {
661 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
662 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
663 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
664 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
665 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
666 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
667 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
668 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
674 for(i = 0; i < (int)data_len; i++) {
676 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
677 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
678 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
679 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
680 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
681 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
682 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
685 else { /* order == 5 */
686 for(i = 0; i < (int)data_len; i++) {
688 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
689 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
690 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
691 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
692 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
693 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
701 for(i = 0; i < (int)data_len; i++) {
703 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
704 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
705 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
706 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
707 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
710 else { /* order == 3 */
711 for(i = 0; i < (int)data_len; i++) {
713 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
714 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
715 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
716 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
722 for(i = 0; i < (int)data_len; i++) {
724 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
725 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
726 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
729 else { /* order == 1 */
730 for(i = 0; i < (int)data_len; i++)
731 residual[i] = data[i] - (FLAC__int32)((qlp_coeff[0] * (FLAC__int64)data[i-1]) >> lp_quantization);
736 else { /* order > 12 */
737 for(i = 0; i < (int)data_len; i++) {
740 case 32: sum += qlp_coeff[31] * (FLAC__int64)data[i-32];
741 case 31: sum += qlp_coeff[30] * (FLAC__int64)data[i-31];
742 case 30: sum += qlp_coeff[29] * (FLAC__int64)data[i-30];
743 case 29: sum += qlp_coeff[28] * (FLAC__int64)data[i-29];
744 case 28: sum += qlp_coeff[27] * (FLAC__int64)data[i-28];
745 case 27: sum += qlp_coeff[26] * (FLAC__int64)data[i-27];
746 case 26: sum += qlp_coeff[25] * (FLAC__int64)data[i-26];
747 case 25: sum += qlp_coeff[24] * (FLAC__int64)data[i-25];
748 case 24: sum += qlp_coeff[23] * (FLAC__int64)data[i-24];
749 case 23: sum += qlp_coeff[22] * (FLAC__int64)data[i-23];
750 case 22: sum += qlp_coeff[21] * (FLAC__int64)data[i-22];
751 case 21: sum += qlp_coeff[20] * (FLAC__int64)data[i-21];
752 case 20: sum += qlp_coeff[19] * (FLAC__int64)data[i-20];
753 case 19: sum += qlp_coeff[18] * (FLAC__int64)data[i-19];
754 case 18: sum += qlp_coeff[17] * (FLAC__int64)data[i-18];
755 case 17: sum += qlp_coeff[16] * (FLAC__int64)data[i-17];
756 case 16: sum += qlp_coeff[15] * (FLAC__int64)data[i-16];
757 case 15: sum += qlp_coeff[14] * (FLAC__int64)data[i-15];
758 case 14: sum += qlp_coeff[13] * (FLAC__int64)data[i-14];
759 case 13: sum += qlp_coeff[12] * (FLAC__int64)data[i-13];
760 sum += qlp_coeff[11] * (FLAC__int64)data[i-12];
761 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
762 sum += qlp_coeff[ 9] * (FLAC__int64)data[i-10];
763 sum += qlp_coeff[ 8] * (FLAC__int64)data[i- 9];
764 sum += qlp_coeff[ 7] * (FLAC__int64)data[i- 8];
765 sum += qlp_coeff[ 6] * (FLAC__int64)data[i- 7];
766 sum += qlp_coeff[ 5] * (FLAC__int64)data[i- 6];
767 sum += qlp_coeff[ 4] * (FLAC__int64)data[i- 5];
768 sum += qlp_coeff[ 3] * (FLAC__int64)data[i- 4];
769 sum += qlp_coeff[ 2] * (FLAC__int64)data[i- 3];
770 sum += qlp_coeff[ 1] * (FLAC__int64)data[i- 2];
771 sum += qlp_coeff[ 0] * (FLAC__int64)data[i- 1];
773 residual[i] = data[i] - (FLAC__int32)(sum >> lp_quantization);
779 #endif /* !defined FLAC__INTEGER_ONLY_LIBRARY */
781 void FLAC__lpc_restore_signal(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[])
782 #if defined(FLAC__OVERFLOW_DETECT) || !defined(FLAC__LPC_UNROLLED_FILTER_LOOPS)
787 const FLAC__int32 *r = residual, *history;
789 #ifdef FLAC__OVERFLOW_DETECT_VERBOSE
790 fprintf(stderr,"FLAC__lpc_restore_signal: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization);
792 fprintf(stderr,", q[%u]=%d",i,qlp_coeff[i]);
793 fprintf(stderr,"\n");
795 FLAC__ASSERT(order > 0);
797 for(i = 0; i < data_len; i++) {
801 for(j = 0; j < order; j++) {
802 sum += qlp_coeff[j] * (*(--history));
803 sumo += (FLAC__int64)qlp_coeff[j] * (FLAC__int64)(*history);
804 if(sumo > 2147483647ll || sumo < -2147483648ll)
805 fprintf(stderr,"FLAC__lpc_restore_signal: OVERFLOW, i=%u, j=%u, c=%d, d=%d, sumo=%" PRId64 "\n",i,j,qlp_coeff[j],*history,sumo);
807 *(data++) = *(r++) + (sum >> lp_quantization);
810 /* Here's a slower but clearer version:
811 for(i = 0; i < data_len; i++) {
813 for(j = 0; j < order; j++)
814 sum += qlp_coeff[j] * data[i-j-1];
815 data[i] = residual[i] + (sum >> lp_quantization);
819 #else /* fully unrolled version for normal use */
824 FLAC__ASSERT(order > 0);
825 FLAC__ASSERT(order <= 32);
828 * We do unique versions up to 12th order since that's the subset limit.
829 * Also they are roughly ordered to match frequency of occurrence to
830 * minimize branching.
836 for(i = 0; i < (int)data_len; i++) {
838 sum += qlp_coeff[11] * data[i-12];
839 sum += qlp_coeff[10] * data[i-11];
840 sum += qlp_coeff[9] * data[i-10];
841 sum += qlp_coeff[8] * data[i-9];
842 sum += qlp_coeff[7] * data[i-8];
843 sum += qlp_coeff[6] * data[i-7];
844 sum += qlp_coeff[5] * data[i-6];
845 sum += qlp_coeff[4] * data[i-5];
846 sum += qlp_coeff[3] * data[i-4];
847 sum += qlp_coeff[2] * data[i-3];
848 sum += qlp_coeff[1] * data[i-2];
849 sum += qlp_coeff[0] * data[i-1];
850 data[i] = residual[i] + (sum >> lp_quantization);
853 else { /* order == 11 */
854 for(i = 0; i < (int)data_len; i++) {
856 sum += qlp_coeff[10] * data[i-11];
857 sum += qlp_coeff[9] * data[i-10];
858 sum += qlp_coeff[8] * data[i-9];
859 sum += qlp_coeff[7] * data[i-8];
860 sum += qlp_coeff[6] * data[i-7];
861 sum += qlp_coeff[5] * data[i-6];
862 sum += qlp_coeff[4] * data[i-5];
863 sum += qlp_coeff[3] * data[i-4];
864 sum += qlp_coeff[2] * data[i-3];
865 sum += qlp_coeff[1] * data[i-2];
866 sum += qlp_coeff[0] * data[i-1];
867 data[i] = residual[i] + (sum >> lp_quantization);
873 for(i = 0; i < (int)data_len; i++) {
875 sum += qlp_coeff[9] * data[i-10];
876 sum += qlp_coeff[8] * data[i-9];
877 sum += qlp_coeff[7] * data[i-8];
878 sum += qlp_coeff[6] * data[i-7];
879 sum += qlp_coeff[5] * data[i-6];
880 sum += qlp_coeff[4] * data[i-5];
881 sum += qlp_coeff[3] * data[i-4];
882 sum += qlp_coeff[2] * data[i-3];
883 sum += qlp_coeff[1] * data[i-2];
884 sum += qlp_coeff[0] * data[i-1];
885 data[i] = residual[i] + (sum >> lp_quantization);
888 else { /* order == 9 */
889 for(i = 0; i < (int)data_len; i++) {
891 sum += qlp_coeff[8] * data[i-9];
892 sum += qlp_coeff[7] * data[i-8];
893 sum += qlp_coeff[6] * data[i-7];
894 sum += qlp_coeff[5] * data[i-6];
895 sum += qlp_coeff[4] * data[i-5];
896 sum += qlp_coeff[3] * data[i-4];
897 sum += qlp_coeff[2] * data[i-3];
898 sum += qlp_coeff[1] * data[i-2];
899 sum += qlp_coeff[0] * data[i-1];
900 data[i] = residual[i] + (sum >> lp_quantization);
908 for(i = 0; i < (int)data_len; i++) {
910 sum += qlp_coeff[7] * data[i-8];
911 sum += qlp_coeff[6] * data[i-7];
912 sum += qlp_coeff[5] * data[i-6];
913 sum += qlp_coeff[4] * data[i-5];
914 sum += qlp_coeff[3] * data[i-4];
915 sum += qlp_coeff[2] * data[i-3];
916 sum += qlp_coeff[1] * data[i-2];
917 sum += qlp_coeff[0] * data[i-1];
918 data[i] = residual[i] + (sum >> lp_quantization);
921 else { /* order == 7 */
922 for(i = 0; i < (int)data_len; i++) {
924 sum += qlp_coeff[6] * data[i-7];
925 sum += qlp_coeff[5] * data[i-6];
926 sum += qlp_coeff[4] * data[i-5];
927 sum += qlp_coeff[3] * data[i-4];
928 sum += qlp_coeff[2] * data[i-3];
929 sum += qlp_coeff[1] * data[i-2];
930 sum += qlp_coeff[0] * data[i-1];
931 data[i] = residual[i] + (sum >> lp_quantization);
937 for(i = 0; i < (int)data_len; i++) {
939 sum += qlp_coeff[5] * data[i-6];
940 sum += qlp_coeff[4] * data[i-5];
941 sum += qlp_coeff[3] * data[i-4];
942 sum += qlp_coeff[2] * data[i-3];
943 sum += qlp_coeff[1] * data[i-2];
944 sum += qlp_coeff[0] * data[i-1];
945 data[i] = residual[i] + (sum >> lp_quantization);
948 else { /* order == 5 */
949 for(i = 0; i < (int)data_len; i++) {
951 sum += qlp_coeff[4] * data[i-5];
952 sum += qlp_coeff[3] * data[i-4];
953 sum += qlp_coeff[2] * data[i-3];
954 sum += qlp_coeff[1] * data[i-2];
955 sum += qlp_coeff[0] * data[i-1];
956 data[i] = residual[i] + (sum >> lp_quantization);
964 for(i = 0; i < (int)data_len; i++) {
966 sum += qlp_coeff[3] * data[i-4];
967 sum += qlp_coeff[2] * data[i-3];
968 sum += qlp_coeff[1] * data[i-2];
969 sum += qlp_coeff[0] * data[i-1];
970 data[i] = residual[i] + (sum >> lp_quantization);
973 else { /* order == 3 */
974 for(i = 0; i < (int)data_len; i++) {
976 sum += qlp_coeff[2] * data[i-3];
977 sum += qlp_coeff[1] * data[i-2];
978 sum += qlp_coeff[0] * data[i-1];
979 data[i] = residual[i] + (sum >> lp_quantization);
985 for(i = 0; i < (int)data_len; i++) {
987 sum += qlp_coeff[1] * data[i-2];
988 sum += qlp_coeff[0] * data[i-1];
989 data[i] = residual[i] + (sum >> lp_quantization);
992 else { /* order == 1 */
993 for(i = 0; i < (int)data_len; i++)
994 data[i] = residual[i] + ((qlp_coeff[0] * data[i-1]) >> lp_quantization);
999 else { /* order > 12 */
1000 for(i = 0; i < (int)data_len; i++) {
1003 case 32: sum += qlp_coeff[31] * data[i-32];
1004 case 31: sum += qlp_coeff[30] * data[i-31];
1005 case 30: sum += qlp_coeff[29] * data[i-30];
1006 case 29: sum += qlp_coeff[28] * data[i-29];
1007 case 28: sum += qlp_coeff[27] * data[i-28];
1008 case 27: sum += qlp_coeff[26] * data[i-27];
1009 case 26: sum += qlp_coeff[25] * data[i-26];
1010 case 25: sum += qlp_coeff[24] * data[i-25];
1011 case 24: sum += qlp_coeff[23] * data[i-24];
1012 case 23: sum += qlp_coeff[22] * data[i-23];
1013 case 22: sum += qlp_coeff[21] * data[i-22];
1014 case 21: sum += qlp_coeff[20] * data[i-21];
1015 case 20: sum += qlp_coeff[19] * data[i-20];
1016 case 19: sum += qlp_coeff[18] * data[i-19];
1017 case 18: sum += qlp_coeff[17] * data[i-18];
1018 case 17: sum += qlp_coeff[16] * data[i-17];
1019 case 16: sum += qlp_coeff[15] * data[i-16];
1020 case 15: sum += qlp_coeff[14] * data[i-15];
1021 case 14: sum += qlp_coeff[13] * data[i-14];
1022 case 13: sum += qlp_coeff[12] * data[i-13];
1023 sum += qlp_coeff[11] * data[i-12];
1024 sum += qlp_coeff[10] * data[i-11];
1025 sum += qlp_coeff[ 9] * data[i-10];
1026 sum += qlp_coeff[ 8] * data[i- 9];
1027 sum += qlp_coeff[ 7] * data[i- 8];
1028 sum += qlp_coeff[ 6] * data[i- 7];
1029 sum += qlp_coeff[ 5] * data[i- 6];
1030 sum += qlp_coeff[ 4] * data[i- 5];
1031 sum += qlp_coeff[ 3] * data[i- 4];
1032 sum += qlp_coeff[ 2] * data[i- 3];
1033 sum += qlp_coeff[ 1] * data[i- 2];
1034 sum += qlp_coeff[ 0] * data[i- 1];
1036 data[i] = residual[i] + (sum >> lp_quantization);
1042 void FLAC__lpc_restore_signal_wide(const FLAC__int32 residual[], unsigned data_len, const FLAC__int32 qlp_coeff[], unsigned order, int lp_quantization, FLAC__int32 data[])
1043 #if defined(FLAC__OVERFLOW_DETECT) || !defined(FLAC__LPC_UNROLLED_FILTER_LOOPS)
1047 const FLAC__int32 *r = residual, *history;
1049 #ifdef FLAC__OVERFLOW_DETECT_VERBOSE
1050 fprintf(stderr,"FLAC__lpc_restore_signal_wide: data_len=%d, order=%u, lpq=%d",data_len,order,lp_quantization);
1051 for(i=0;i<order;i++)
1052 fprintf(stderr,", q[%u]=%d",i,qlp_coeff[i]);
1053 fprintf(stderr,"\n");
1055 FLAC__ASSERT(order > 0);
1057 for(i = 0; i < data_len; i++) {
1060 for(j = 0; j < order; j++)
1061 sum += (FLAC__int64)qlp_coeff[j] * (FLAC__int64)(*(--history));
1062 if(FLAC__bitmath_silog2_wide(sum >> lp_quantization) > 32) {
1063 fprintf(stderr,"FLAC__lpc_restore_signal_wide: OVERFLOW, i=%u, sum=%" PRId64 "\n", i, (sum >> lp_quantization));
1066 if(FLAC__bitmath_silog2_wide((FLAC__int64)(*r) + (sum >> lp_quantization)) > 32) {
1067 fprintf(stderr,"FLAC__lpc_restore_signal_wide: OVERFLOW, i=%u, residual=%d, sum=%" PRId64 ", data=%" PRId64 "\n", i, *r, (sum >> lp_quantization), ((FLAC__int64)(*r) + (sum >> lp_quantization)));
1070 *(data++) = *(r++) + (FLAC__int32)(sum >> lp_quantization);
1073 #else /* fully unrolled version for normal use */
1078 FLAC__ASSERT(order > 0);
1079 FLAC__ASSERT(order <= 32);
1082 * We do unique versions up to 12th order since that's the subset limit.
1083 * Also they are roughly ordered to match frequency of occurrence to
1084 * minimize branching.
1090 for(i = 0; i < (int)data_len; i++) {
1092 sum += qlp_coeff[11] * (FLAC__int64)data[i-12];
1093 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
1094 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
1095 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
1096 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
1097 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1098 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1099 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1100 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1101 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1102 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1103 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1104 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1107 else { /* order == 11 */
1108 for(i = 0; i < (int)data_len; i++) {
1110 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
1111 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
1112 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
1113 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
1114 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1115 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1116 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1117 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1118 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1119 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1120 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1121 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1127 for(i = 0; i < (int)data_len; i++) {
1129 sum += qlp_coeff[9] * (FLAC__int64)data[i-10];
1130 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
1131 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
1132 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1133 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1134 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1135 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1136 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1137 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1138 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1139 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1142 else { /* order == 9 */
1143 for(i = 0; i < (int)data_len; i++) {
1145 sum += qlp_coeff[8] * (FLAC__int64)data[i-9];
1146 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
1147 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1148 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1149 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1150 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1151 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1152 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1153 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1154 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1159 else if(order > 4) {
1162 for(i = 0; i < (int)data_len; i++) {
1164 sum += qlp_coeff[7] * (FLAC__int64)data[i-8];
1165 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1166 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1167 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1168 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1169 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1170 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1171 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1172 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1175 else { /* order == 7 */
1176 for(i = 0; i < (int)data_len; i++) {
1178 sum += qlp_coeff[6] * (FLAC__int64)data[i-7];
1179 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1180 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1181 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1182 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1183 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1184 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1185 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1191 for(i = 0; i < (int)data_len; i++) {
1193 sum += qlp_coeff[5] * (FLAC__int64)data[i-6];
1194 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1195 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1196 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1197 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1198 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1199 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1202 else { /* order == 5 */
1203 for(i = 0; i < (int)data_len; i++) {
1205 sum += qlp_coeff[4] * (FLAC__int64)data[i-5];
1206 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1207 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1208 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1209 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1210 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1218 for(i = 0; i < (int)data_len; i++) {
1220 sum += qlp_coeff[3] * (FLAC__int64)data[i-4];
1221 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1222 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1223 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1224 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1227 else { /* order == 3 */
1228 for(i = 0; i < (int)data_len; i++) {
1230 sum += qlp_coeff[2] * (FLAC__int64)data[i-3];
1231 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1232 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1233 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1239 for(i = 0; i < (int)data_len; i++) {
1241 sum += qlp_coeff[1] * (FLAC__int64)data[i-2];
1242 sum += qlp_coeff[0] * (FLAC__int64)data[i-1];
1243 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1246 else { /* order == 1 */
1247 for(i = 0; i < (int)data_len; i++)
1248 data[i] = residual[i] + (FLAC__int32)((qlp_coeff[0] * (FLAC__int64)data[i-1]) >> lp_quantization);
1253 else { /* order > 12 */
1254 for(i = 0; i < (int)data_len; i++) {
1257 case 32: sum += qlp_coeff[31] * (FLAC__int64)data[i-32];
1258 case 31: sum += qlp_coeff[30] * (FLAC__int64)data[i-31];
1259 case 30: sum += qlp_coeff[29] * (FLAC__int64)data[i-30];
1260 case 29: sum += qlp_coeff[28] * (FLAC__int64)data[i-29];
1261 case 28: sum += qlp_coeff[27] * (FLAC__int64)data[i-28];
1262 case 27: sum += qlp_coeff[26] * (FLAC__int64)data[i-27];
1263 case 26: sum += qlp_coeff[25] * (FLAC__int64)data[i-26];
1264 case 25: sum += qlp_coeff[24] * (FLAC__int64)data[i-25];
1265 case 24: sum += qlp_coeff[23] * (FLAC__int64)data[i-24];
1266 case 23: sum += qlp_coeff[22] * (FLAC__int64)data[i-23];
1267 case 22: sum += qlp_coeff[21] * (FLAC__int64)data[i-22];
1268 case 21: sum += qlp_coeff[20] * (FLAC__int64)data[i-21];
1269 case 20: sum += qlp_coeff[19] * (FLAC__int64)data[i-20];
1270 case 19: sum += qlp_coeff[18] * (FLAC__int64)data[i-19];
1271 case 18: sum += qlp_coeff[17] * (FLAC__int64)data[i-18];
1272 case 17: sum += qlp_coeff[16] * (FLAC__int64)data[i-17];
1273 case 16: sum += qlp_coeff[15] * (FLAC__int64)data[i-16];
1274 case 15: sum += qlp_coeff[14] * (FLAC__int64)data[i-15];
1275 case 14: sum += qlp_coeff[13] * (FLAC__int64)data[i-14];
1276 case 13: sum += qlp_coeff[12] * (FLAC__int64)data[i-13];
1277 sum += qlp_coeff[11] * (FLAC__int64)data[i-12];
1278 sum += qlp_coeff[10] * (FLAC__int64)data[i-11];
1279 sum += qlp_coeff[ 9] * (FLAC__int64)data[i-10];
1280 sum += qlp_coeff[ 8] * (FLAC__int64)data[i- 9];
1281 sum += qlp_coeff[ 7] * (FLAC__int64)data[i- 8];
1282 sum += qlp_coeff[ 6] * (FLAC__int64)data[i- 7];
1283 sum += qlp_coeff[ 5] * (FLAC__int64)data[i- 6];
1284 sum += qlp_coeff[ 4] * (FLAC__int64)data[i- 5];
1285 sum += qlp_coeff[ 3] * (FLAC__int64)data[i- 4];
1286 sum += qlp_coeff[ 2] * (FLAC__int64)data[i- 3];
1287 sum += qlp_coeff[ 1] * (FLAC__int64)data[i- 2];
1288 sum += qlp_coeff[ 0] * (FLAC__int64)data[i- 1];
1290 data[i] = residual[i] + (FLAC__int32)(sum >> lp_quantization);
1296 #ifndef FLAC__INTEGER_ONLY_LIBRARY
1298 FLAC__double FLAC__lpc_compute_expected_bits_per_residual_sample(FLAC__double lpc_error, unsigned total_samples)
1300 FLAC__double error_scale;
1302 FLAC__ASSERT(total_samples > 0);
1304 error_scale = 0.5 * M_LN2 * M_LN2 / (FLAC__double)total_samples;
1306 return FLAC__lpc_compute_expected_bits_per_residual_sample_with_error_scale(lpc_error, error_scale);
1309 FLAC__double FLAC__lpc_compute_expected_bits_per_residual_sample_with_error_scale(FLAC__double lpc_error, FLAC__double error_scale)
1311 if(lpc_error > 0.0) {
1312 FLAC__double bps = (FLAC__double)0.5 * log(error_scale * lpc_error) / M_LN2;
1318 else if(lpc_error < 0.0) { /* error should not be negative but can happen due to inadequate floating-point resolution */
1326 unsigned FLAC__lpc_compute_best_order(const FLAC__double lpc_error[], unsigned max_order, unsigned total_samples, unsigned overhead_bits_per_order)
1328 unsigned order, index, best_index; /* 'index' the index into lpc_error; index==order-1 since lpc_error[0] is for order==1, lpc_error[1] is for order==2, etc */
1329 FLAC__double bits, best_bits, error_scale;
1331 FLAC__ASSERT(max_order > 0);
1332 FLAC__ASSERT(total_samples > 0);
1334 error_scale = 0.5 * M_LN2 * M_LN2 / (FLAC__double)total_samples;
1337 best_bits = (unsigned)(-1);
1339 for(index = 0, order = 1; index < max_order; index++, order++) {
1340 bits = FLAC__lpc_compute_expected_bits_per_residual_sample_with_error_scale(lpc_error[index], error_scale) * (FLAC__double)(total_samples - order) + (FLAC__double)(order * overhead_bits_per_order);
1341 if(bits < best_bits) {
1347 return best_index+1; /* +1 since index of lpc_error[] is order-1 */
1350 #endif /* !defined FLAC__INTEGER_ONLY_LIBRARY */