Chris@69: /* Copyright (c) 2007-2008 CSIRO
Chris@69:    Copyright (c) 2007-2010 Xiph.Org Foundation
Chris@69:    Copyright (c) 2008 Gregory Maxwell
Chris@69:    Written by Jean-Marc Valin and Gregory Maxwell */
Chris@69: /*
Chris@69:    Redistribution and use in source and binary forms, with or without
Chris@69:    modification, are permitted provided that the following conditions
Chris@69:    are met:
Chris@69: 
Chris@69:    - Redistributions of source code must retain the above copyright
Chris@69:    notice, this list of conditions and the following disclaimer.
Chris@69: 
Chris@69:    - Redistributions in binary form must reproduce the above copyright
Chris@69:    notice, this list of conditions and the following disclaimer in the
Chris@69:    documentation and/or other materials provided with the distribution.
Chris@69: 
Chris@69:    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
Chris@69:    ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
Chris@69:    LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
Chris@69:    A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
Chris@69:    OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
Chris@69:    EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
Chris@69:    PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
Chris@69:    PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
Chris@69:    LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
Chris@69:    NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
Chris@69:    SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
Chris@69: */
Chris@69: 
Chris@69: #ifdef HAVE_CONFIG_H
Chris@69: #include "config.h"
Chris@69: #endif
Chris@69: 
Chris@69: #define CELT_C
Chris@69: 
Chris@69: #include "os_support.h"
Chris@69: #include "mdct.h"
Chris@69: #include <math.h>
Chris@69: #include "celt.h"
Chris@69: #include "pitch.h"
Chris@69: #include "bands.h"
Chris@69: #include "modes.h"
Chris@69: #include "entcode.h"
Chris@69: #include "quant_bands.h"
Chris@69: #include "rate.h"
Chris@69: #include "stack_alloc.h"
Chris@69: #include "mathops.h"
Chris@69: #include "float_cast.h"
Chris@69: #include <stdarg.h>
Chris@69: #include "celt_lpc.h"
Chris@69: #include "vq.h"
Chris@69: 
Chris@69: #ifndef PACKAGE_VERSION
Chris@69: #define PACKAGE_VERSION "unknown"
Chris@69: #endif
Chris@69: 
Chris@69: #if defined(MIPSr1_ASM)
Chris@69: #include "mips/celt_mipsr1.h"
Chris@69: #endif
Chris@69: 
Chris@69: 
Chris@69: int resampling_factor(opus_int32 rate)
Chris@69: {
Chris@69:    int ret;
Chris@69:    switch (rate)
Chris@69:    {
Chris@69:    case 48000:
Chris@69:       ret = 1;
Chris@69:       break;
Chris@69:    case 24000:
Chris@69:       ret = 2;
Chris@69:       break;
Chris@69:    case 16000:
Chris@69:       ret = 3;
Chris@69:       break;
Chris@69:    case 12000:
Chris@69:       ret = 4;
Chris@69:       break;
Chris@69:    case 8000:
Chris@69:       ret = 6;
Chris@69:       break;
Chris@69:    default:
Chris@69: #ifndef CUSTOM_MODES
Chris@69:       celt_assert(0);
Chris@69: #endif
Chris@69:       ret = 0;
Chris@69:       break;
Chris@69:    }
Chris@69:    return ret;
Chris@69: }
Chris@69: 
Chris@69: #if !defined(OVERRIDE_COMB_FILTER_CONST) || defined(NON_STATIC_COMB_FILTER_CONST_C)
Chris@69: /* This version should be faster on ARM */
Chris@69: #ifdef OPUS_ARM_ASM
Chris@69: #ifndef NON_STATIC_COMB_FILTER_CONST_C
Chris@69: static
Chris@69: #endif
Chris@69: void comb_filter_const_c(opus_val32 *y, opus_val32 *x, int T, int N,
Chris@69:       opus_val16 g10, opus_val16 g11, opus_val16 g12)
Chris@69: {
Chris@69:    opus_val32 x0, x1, x2, x3, x4;
Chris@69:    int i;
Chris@69:    x4 = SHL32(x[-T-2], 1);
Chris@69:    x3 = SHL32(x[-T-1], 1);
Chris@69:    x2 = SHL32(x[-T], 1);
Chris@69:    x1 = SHL32(x[-T+1], 1);
Chris@69:    for (i=0;i<N-4;i+=5)
Chris@69:    {
Chris@69:       opus_val32 t;
Chris@69:       x0=SHL32(x[i-T+2],1);
Chris@69:       t = MAC16_32_Q16(x[i], g10, x2);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x1,x3));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x0,x4));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i] = t;
Chris@69:       x4=SHL32(x[i-T+3],1);
Chris@69:       t = MAC16_32_Q16(x[i+1], g10, x1);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x0,x2));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x4,x3));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i+1] = t;
Chris@69:       x3=SHL32(x[i-T+4],1);
Chris@69:       t = MAC16_32_Q16(x[i+2], g10, x0);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x4,x1));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x3,x2));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i+2] = t;
Chris@69:       x2=SHL32(x[i-T+5],1);
Chris@69:       t = MAC16_32_Q16(x[i+3], g10, x4);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x3,x0));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x2,x1));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i+3] = t;
Chris@69:       x1=SHL32(x[i-T+6],1);
Chris@69:       t = MAC16_32_Q16(x[i+4], g10, x3);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x2,x4));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x1,x0));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i+4] = t;
Chris@69:    }
Chris@69: #ifdef CUSTOM_MODES
Chris@69:    for (;i<N;i++)
Chris@69:    {
Chris@69:       opus_val32 t;
Chris@69:       x0=SHL32(x[i-T+2],1);
Chris@69:       t = MAC16_32_Q16(x[i], g10, x2);
Chris@69:       t = MAC16_32_Q16(t, g11, ADD32(x1,x3));
Chris@69:       t = MAC16_32_Q16(t, g12, ADD32(x0,x4));
Chris@69:       t = SATURATE(t, SIG_SAT);
Chris@69:       y[i] = t;
Chris@69:       x4=x3;
Chris@69:       x3=x2;
Chris@69:       x2=x1;
Chris@69:       x1=x0;
Chris@69:    }
Chris@69: #endif
Chris@69: }
Chris@69: #else
Chris@69: #ifndef NON_STATIC_COMB_FILTER_CONST_C
Chris@69: static
Chris@69: #endif
Chris@69: void comb_filter_const_c(opus_val32 *y, opus_val32 *x, int T, int N,
Chris@69:       opus_val16 g10, opus_val16 g11, opus_val16 g12)
Chris@69: {
Chris@69:    opus_val32 x0, x1, x2, x3, x4;
Chris@69:    int i;
Chris@69:    x4 = x[-T-2];
Chris@69:    x3 = x[-T-1];
Chris@69:    x2 = x[-T];
Chris@69:    x1 = x[-T+1];
Chris@69:    for (i=0;i<N;i++)
Chris@69:    {
Chris@69:       x0=x[i-T+2];
Chris@69:       y[i] = x[i]
Chris@69:                + MULT16_32_Q15(g10,x2)
Chris@69:                + MULT16_32_Q15(g11,ADD32(x1,x3))
Chris@69:                + MULT16_32_Q15(g12,ADD32(x0,x4));
Chris@69:       y[i] = SATURATE(y[i], SIG_SAT);
Chris@69:       x4=x3;
Chris@69:       x3=x2;
Chris@69:       x2=x1;
Chris@69:       x1=x0;
Chris@69:    }
Chris@69: 
Chris@69: }
Chris@69: #endif
Chris@69: #endif
Chris@69: 
Chris@69: #ifndef OVERRIDE_comb_filter
Chris@69: void comb_filter(opus_val32 *y, opus_val32 *x, int T0, int T1, int N,
Chris@69:       opus_val16 g0, opus_val16 g1, int tapset0, int tapset1,
Chris@69:       const opus_val16 *window, int overlap, int arch)
Chris@69: {
Chris@69:    int i;
Chris@69:    /* printf ("%d %d %f %f\n", T0, T1, g0, g1); */
Chris@69:    opus_val16 g00, g01, g02, g10, g11, g12;
Chris@69:    opus_val32 x0, x1, x2, x3, x4;
Chris@69:    static const opus_val16 gains[3][3] = {
Chris@69:          {QCONST16(0.3066406250f, 15), QCONST16(0.2170410156f, 15), QCONST16(0.1296386719f, 15)},
Chris@69:          {QCONST16(0.4638671875f, 15), QCONST16(0.2680664062f, 15), QCONST16(0.f, 15)},
Chris@69:          {QCONST16(0.7998046875f, 15), QCONST16(0.1000976562f, 15), QCONST16(0.f, 15)}};
Chris@69: 
Chris@69:    if (g0==0 && g1==0)
Chris@69:    {
Chris@69:       /* OPT: Happens to work without the OPUS_MOVE(), but only because the current encoder already copies x to y */
Chris@69:       if (x!=y)
Chris@69:          OPUS_MOVE(y, x, N);
Chris@69:       return;
Chris@69:    }
Chris@69:    /* When the gain is zero, T0 and/or T1 is set to zero. We need
Chris@69:       to have then be at least 2 to avoid processing garbage data. */
Chris@69:    T0 = IMAX(T0, COMBFILTER_MINPERIOD);
Chris@69:    T1 = IMAX(T1, COMBFILTER_MINPERIOD);
Chris@69:    g00 = MULT16_16_P15(g0, gains[tapset0][0]);
Chris@69:    g01 = MULT16_16_P15(g0, gains[tapset0][1]);
Chris@69:    g02 = MULT16_16_P15(g0, gains[tapset0][2]);
Chris@69:    g10 = MULT16_16_P15(g1, gains[tapset1][0]);
Chris@69:    g11 = MULT16_16_P15(g1, gains[tapset1][1]);
Chris@69:    g12 = MULT16_16_P15(g1, gains[tapset1][2]);
Chris@69:    x1 = x[-T1+1];
Chris@69:    x2 = x[-T1  ];
Chris@69:    x3 = x[-T1-1];
Chris@69:    x4 = x[-T1-2];
Chris@69:    /* If the filter didn't change, we don't need the overlap */
Chris@69:    if (g0==g1 && T0==T1 && tapset0==tapset1)
Chris@69:       overlap=0;
Chris@69:    for (i=0;i<overlap;i++)
Chris@69:    {
Chris@69:       opus_val16 f;
Chris@69:       x0=x[i-T1+2];
Chris@69:       f = MULT16_16_Q15(window[i],window[i]);
Chris@69:       y[i] = x[i]
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g00),x[i-T0])
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g01),ADD32(x[i-T0+1],x[i-T0-1]))
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15((Q15ONE-f),g02),ADD32(x[i-T0+2],x[i-T0-2]))
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15(f,g10),x2)
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15(f,g11),ADD32(x1,x3))
Chris@69:                + MULT16_32_Q15(MULT16_16_Q15(f,g12),ADD32(x0,x4));
Chris@69:       y[i] = SATURATE(y[i], SIG_SAT);
Chris@69:       x4=x3;
Chris@69:       x3=x2;
Chris@69:       x2=x1;
Chris@69:       x1=x0;
Chris@69: 
Chris@69:    }
Chris@69:    if (g1==0)
Chris@69:    {
Chris@69:       /* OPT: Happens to work without the OPUS_MOVE(), but only because the current encoder already copies x to y */
Chris@69:       if (x!=y)
Chris@69:          OPUS_MOVE(y+overlap, x+overlap, N-overlap);
Chris@69:       return;
Chris@69:    }
Chris@69: 
Chris@69:    /* Compute the part with the constant filter. */
Chris@69:    comb_filter_const(y+i, x+i, T1, N-i, g10, g11, g12, arch);
Chris@69: }
Chris@69: #endif /* OVERRIDE_comb_filter */
Chris@69: 
Chris@69: /* TF change table. Positive values mean better frequency resolution (longer
Chris@69:    effective window), whereas negative values mean better time resolution
Chris@69:    (shorter effective window). The second index is computed as:
Chris@69:    4*isTransient + 2*tf_select + per_band_flag */
Chris@69: const signed char tf_select_table[4][8] = {
Chris@69:     /*isTransient=0     isTransient=1 */
Chris@69:       {0, -1, 0, -1,    0,-1, 0,-1}, /* 2.5 ms */
Chris@69:       {0, -1, 0, -2,    1, 0, 1,-1}, /* 5 ms */
Chris@69:       {0, -2, 0, -3,    2, 0, 1,-1}, /* 10 ms */
Chris@69:       {0, -2, 0, -3,    3, 0, 1,-1}, /* 20 ms */
Chris@69: };
Chris@69: 
Chris@69: 
Chris@69: void init_caps(const CELTMode *m,int *cap,int LM,int C)
Chris@69: {
Chris@69:    int i;
Chris@69:    for (i=0;i<m->nbEBands;i++)
Chris@69:    {
Chris@69:       int N;
Chris@69:       N=(m->eBands[i+1]-m->eBands[i])<<LM;
Chris@69:       cap[i] = (m->cache.caps[m->nbEBands*(2*LM+C-1)+i]+64)*C*N>>2;
Chris@69:    }
Chris@69: }
Chris@69: 
Chris@69: 
Chris@69: 
Chris@69: const char *opus_strerror(int error)
Chris@69: {
Chris@69:    static const char * const error_strings[8] = {
Chris@69:       "success",
Chris@69:       "invalid argument",
Chris@69:       "buffer too small",
Chris@69:       "internal error",
Chris@69:       "corrupted stream",
Chris@69:       "request not implemented",
Chris@69:       "invalid state",
Chris@69:       "memory allocation failed"
Chris@69:    };
Chris@69:    if (error > 0 || error < -7)
Chris@69:       return "unknown error";
Chris@69:    else
Chris@69:       return error_strings[-error];
Chris@69: }
Chris@69: 
Chris@69: const char *opus_get_version_string(void)
Chris@69: {
Chris@69:     return "libopus " PACKAGE_VERSION
Chris@69:     /* Applications may rely on the presence of this substring in the version
Chris@69:        string to determine if they have a fixed-point or floating-point build
Chris@69:        at runtime. */
Chris@69: #ifdef FIXED_POINT
Chris@69:           "-fixed"
Chris@69: #endif
Chris@69: #ifdef FUZZING
Chris@69:           "-fuzzing"
Chris@69: #endif
Chris@69:           ;
Chris@69: }